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.r158-smll-171636266300172.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is EisenbergMcGuire-PT-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636266300172
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 27K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 12 16:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 16:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 16:01 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 753K 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-06-LTLFireability-00
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-01
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-02
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-03
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-04
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-05
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-06
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-07
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-08
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-09
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-10
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-11
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-12
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-13
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-14
FORMULA_NAME EisenbergMcGuire-PT-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716523780063

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-24 04:09:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 04:09:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 04:09:43] [INFO ] Load time of PNML (sax parser for PT used): 475 ms
[2024-05-24 04:09:43] [INFO ] Transformed 414 places.
[2024-05-24 04:09:43] [INFO ] Transformed 1296 transitions.
[2024-05-24 04:09:43] [INFO ] Found NUPN structural information;
[2024-05-24 04:09:43] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 727 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-06-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 414 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 390 transition count 1152
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 390 transition count 1152
Applied a total of 48 rules in 190 ms. Remains 390 /414 variables (removed 24) and now considering 1152/1296 (removed 144) transitions.
[2024-05-24 04:09:43] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
// Phase 1: matrix 558 rows 390 cols
[2024-05-24 04:09:44] [INFO ] Computed 19 invariants in 45 ms
[2024-05-24 04:09:44] [INFO ] Implicit Places using invariants in 877 ms returned []
[2024-05-24 04:09:44] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
[2024-05-24 04:09:44] [INFO ] Invariant cache hit.
[2024-05-24 04:09:45] [INFO ] State equation strengthened by 194 read => feed constraints.
[2024-05-24 04:09:46] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2879 ms to find 0 implicit places.
Running 1146 sub problems to find dead transitions.
[2024-05-24 04:09:46] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
[2024-05-24 04:09:46] [INFO ] Invariant cache hit.
[2024-05-24 04:09:46] [INFO ] State equation strengthened by 194 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/390 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/390 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-05-24 04:10:04] [INFO ] Deduced a trap composed of 34 places in 379 ms of which 43 ms to minimize.
[2024-05-24 04:10:04] [INFO ] Deduced a trap composed of 38 places in 322 ms of which 5 ms to minimize.
[2024-05-24 04:10:05] [INFO ] Deduced a trap composed of 36 places in 419 ms of which 6 ms to minimize.
[2024-05-24 04:10:05] [INFO ] Deduced a trap composed of 32 places in 350 ms of which 6 ms to minimize.
[2024-05-24 04:10:05] [INFO ] Deduced a trap composed of 20 places in 365 ms of which 6 ms to minimize.
[2024-05-24 04:10:06] [INFO ] Deduced a trap composed of 77 places in 457 ms of which 6 ms to minimize.
[2024-05-24 04:10:06] [INFO ] Deduced a trap composed of 65 places in 272 ms of which 3 ms to minimize.
[2024-05-24 04:10:06] [INFO ] Deduced a trap composed of 59 places in 214 ms of which 4 ms to minimize.
[2024-05-24 04:10:07] [INFO ] Deduced a trap composed of 59 places in 228 ms of which 4 ms to minimize.
[2024-05-24 04:10:07] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 4 ms to minimize.
[2024-05-24 04:10:07] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:10:09] [INFO ] Deduced a trap composed of 52 places in 480 ms of which 6 ms to minimize.
[2024-05-24 04:10:10] [INFO ] Deduced a trap composed of 78 places in 402 ms of which 6 ms to minimize.
[2024-05-24 04:10:10] [INFO ] Deduced a trap composed of 86 places in 430 ms of which 6 ms to minimize.
[2024-05-24 04:10:11] [INFO ] Deduced a trap composed of 110 places in 446 ms of which 6 ms to minimize.
[2024-05-24 04:10:11] [INFO ] Deduced a trap composed of 93 places in 388 ms of which 6 ms to minimize.
[2024-05-24 04:10:11] [INFO ] Deduced a trap composed of 79 places in 431 ms of which 6 ms to minimize.
[2024-05-24 04:10:12] [INFO ] Deduced a trap composed of 63 places in 395 ms of which 6 ms to minimize.
[2024-05-24 04:10:12] [INFO ] Deduced a trap composed of 56 places in 389 ms of which 5 ms to minimize.
[2024-05-24 04:10:13] [INFO ] Deduced a trap composed of 102 places in 394 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/390 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1146 unsolved
[2024-05-24 04:10:13] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2024-05-24 04:10:14] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-24 04:10:14] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-05-24 04:10:14] [INFO ] Deduced a trap composed of 26 places in 140 ms of which 3 ms to minimize.
[2024-05-24 04:10:14] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-05-24 04:10:16] [INFO ] Deduced a trap composed of 41 places in 405 ms of which 6 ms to minimize.
[2024-05-24 04:10:16] [INFO ] Deduced a trap composed of 111 places in 400 ms of which 5 ms to minimize.
[2024-05-24 04:10:17] [INFO ] Deduced a trap composed of 77 places in 370 ms of which 5 ms to minimize.
[2024-05-24 04:10:17] [INFO ] Deduced a trap composed of 68 places in 372 ms of which 5 ms to minimize.
[2024-05-24 04:10:17] [INFO ] Deduced a trap composed of 68 places in 362 ms of which 6 ms to minimize.
[2024-05-24 04:10:18] [INFO ] Deduced a trap composed of 83 places in 433 ms of which 5 ms to minimize.
SMT process timed out in 31546ms, After SMT, problems are : Problem set: 0 solved, 1146 unsolved
Search for dead transitions found 0 dead transitions in 31619ms
Starting structural reductions in LTL mode, iteration 1 : 390/414 places, 1152/1296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34750 ms. Remains : 390/414 places, 1152/1296 transitions.
Support contains 52 out of 390 places after structural reductions.
[2024-05-24 04:10:19] [INFO ] Flatten gal took : 222 ms
[2024-05-24 04:10:19] [INFO ] Flatten gal took : 152 ms
[2024-05-24 04:10:19] [INFO ] Input system was already deterministic with 1152 transitions.
RANDOM walk for 40000 steps (8 resets) in 2689 ms. (14 steps per ms) remains 24/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 24/24 properties
[2024-05-24 04:10:20] [INFO ] Flow matrix only has 558 transitions (discarded 594 similar events)
[2024-05-24 04:10:20] [INFO ] Invariant cache hit.
[2024-05-24 04:10:20] [INFO ] State equation strengthened by 194 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 345/388 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 2/390 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/390 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 558/948 variables, 390/409 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/948 variables, 194/603 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/948 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/948 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 948/948 variables, and 603 constraints, problems are : Problem set: 0 solved, 24 unsolved in 2781 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 390/390 constraints, ReadFeed: 194/194 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/43 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/43 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 2 (OVERLAPS) 345/388 variables, 12/13 constraints. Problems are: Problem set: 2 solved, 22 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 4/17 constraints. Problems are: Problem set: 2 solved, 22 unsolved
[2024-05-24 04:10:24] [INFO ] Deduced a trap composed of 26 places in 391 ms of which 6 ms to minimize.
[2024-05-24 04:10:24] [INFO ] Deduced a trap composed of 3 places in 245 ms of which 3 ms to minimize.
[2024-05-24 04:10:24] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-24 04:10:25] [INFO ] Deduced a trap composed of 23 places in 309 ms of which 5 ms to minimize.
[2024-05-24 04:10:25] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:10:25] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 4 ms to minimize.
[2024-05-24 04:10:25] [INFO ] Deduced a trap composed of 70 places in 352 ms of which 5 ms to minimize.
[2024-05-24 04:10:26] [INFO ] Deduced a trap composed of 83 places in 295 ms of which 5 ms to minimize.
[2024-05-24 04:10:26] [INFO ] Deduced a trap composed of 57 places in 327 ms of which 6 ms to minimize.
[2024-05-24 04:10:26] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:10:27] [INFO ] Deduced a trap composed of 35 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:10:27] [INFO ] Deduced a trap composed of 61 places in 398 ms of which 5 ms to minimize.
[2024-05-24 04:10:27] [INFO ] Deduced a trap composed of 32 places in 141 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 13/30 constraints. Problems are: Problem set: 2 solved, 22 unsolved
[2024-05-24 04:10:28] [INFO ] Deduced a trap composed of 85 places in 371 ms of which 6 ms to minimize.
[2024-05-24 04:10:29] [INFO ] Deduced a trap composed of 92 places in 469 ms of which 6 ms to minimize.
SMT process timed out in 8263ms, After SMT, problems are : Problem set: 2 solved, 22 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 390 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 390 transition count 1148
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 386 transition count 1148
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 8 place count 386 transition count 1036
Deduced a syphon composed of 112 places in 3 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 232 place count 274 transition count 1036
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 236 place count 270 transition count 1012
Iterating global reduction 2 with 4 rules applied. Total rules applied 240 place count 270 transition count 1012
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 240 transition count 982
Applied a total of 300 rules in 288 ms. Remains 240 /390 variables (removed 150) and now considering 982/1152 (removed 170) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 289 ms. Remains : 240/390 places, 982/1152 transitions.
RANDOM walk for 40000 steps (8 resets) in 1128 ms. (35 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 22/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/22 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
Interrupted probabilistic random walk after 156002 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :1 out of 21
Probabilistic random walk after 156002 steps, saw 56756 distinct states, run finished after 3010 ms. (steps per millisecond=51 ) properties seen :1
[2024-05-24 04:10:32] [INFO ] Flow matrix only has 388 transitions (discarded 594 similar events)
// Phase 1: matrix 388 rows 240 cols
[2024-05-24 04:10:32] [INFO ] Computed 19 invariants in 5 ms
[2024-05-24 04:10:32] [INFO ] State equation strengthened by 174 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 201/238 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 2/240 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 388/628 variables, 240/259 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/628 variables, 174/433 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/628 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/628 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 628/628 variables, and 433 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 240/240 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 201/238 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:35] [INFO ] Deduced a trap composed of 20 places in 319 ms of which 5 ms to minimize.
[2024-05-24 04:10:35] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 2 ms to minimize.
[2024-05-24 04:10:35] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:10:35] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:10:35] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 4 ms to minimize.
[2024-05-24 04:10:36] [INFO ] Deduced a trap composed of 15 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:10:36] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/238 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/240 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:36] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:10:36] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-24 04:10:37] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-24 04:10:37] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 7 ms to minimize.
[2024-05-24 04:10:37] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 2 ms to minimize.
[2024-05-24 04:10:37] [INFO ] Deduced a trap composed of 56 places in 256 ms of which 4 ms to minimize.
[2024-05-24 04:10:37] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-24 04:10:38] [INFO ] Deduced a trap composed of 39 places in 247 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 8/34 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:38] [INFO ] Deduced a trap composed of 69 places in 290 ms of which 4 ms to minimize.
[2024-05-24 04:10:38] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 4 ms to minimize.
[2024-05-24 04:10:39] [INFO ] Deduced a trap composed of 56 places in 250 ms of which 4 ms to minimize.
[2024-05-24 04:10:39] [INFO ] Deduced a trap composed of 53 places in 294 ms of which 3 ms to minimize.
[2024-05-24 04:10:39] [INFO ] Deduced a trap composed of 21 places in 310 ms of which 4 ms to minimize.
[2024-05-24 04:10:40] [INFO ] Deduced a trap composed of 22 places in 329 ms of which 4 ms to minimize.
[2024-05-24 04:10:40] [INFO ] Deduced a trap composed of 16 places in 321 ms of which 4 ms to minimize.
[2024-05-24 04:10:40] [INFO ] Deduced a trap composed of 60 places in 306 ms of which 4 ms to minimize.
[2024-05-24 04:10:41] [INFO ] Deduced a trap composed of 57 places in 310 ms of which 4 ms to minimize.
[2024-05-24 04:10:41] [INFO ] Deduced a trap composed of 51 places in 309 ms of which 4 ms to minimize.
[2024-05-24 04:10:41] [INFO ] Deduced a trap composed of 71 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:10:41] [INFO ] Deduced a trap composed of 63 places in 278 ms of which 4 ms to minimize.
[2024-05-24 04:10:42] [INFO ] Deduced a trap composed of 67 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:10:42] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 4 ms to minimize.
[2024-05-24 04:10:42] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:10:43] [INFO ] Deduced a trap composed of 46 places in 276 ms of which 3 ms to minimize.
[2024-05-24 04:10:43] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:10:43] [INFO ] Deduced a trap composed of 43 places in 285 ms of which 3 ms to minimize.
[2024-05-24 04:10:43] [INFO ] Deduced a trap composed of 38 places in 91 ms of which 2 ms to minimize.
[2024-05-24 04:10:43] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 20/54 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:44] [INFO ] Deduced a trap composed of 36 places in 266 ms of which 3 ms to minimize.
[2024-05-24 04:10:44] [INFO ] Deduced a trap composed of 37 places in 271 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/240 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:45] [INFO ] Deduced a trap composed of 102 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:10:45] [INFO ] Deduced a trap composed of 61 places in 317 ms of which 4 ms to minimize.
[2024-05-24 04:10:45] [INFO ] Deduced a trap composed of 3 places in 288 ms of which 4 ms to minimize.
[2024-05-24 04:10:46] [INFO ] Deduced a trap composed of 46 places in 242 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/240 variables, 4/60 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:46] [INFO ] Deduced a trap composed of 62 places in 289 ms of which 4 ms to minimize.
[2024-05-24 04:10:46] [INFO ] Deduced a trap composed of 77 places in 272 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/240 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:47] [INFO ] Deduced a trap composed of 46 places in 323 ms of which 4 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/240 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/240 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 388/628 variables, 240/303 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/628 variables, 174/477 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/628 variables, 20/497 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:49] [INFO ] Deduced a trap composed of 36 places in 260 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/628 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:51] [INFO ] Deduced a trap composed of 17 places in 240 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/628 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:51] [INFO ] Deduced a trap composed of 42 places in 273 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/628 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-05-24 04:10:52] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/628 variables, 1/501 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/628 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (OVERLAPS) 0/628 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 628/628 variables, and 501 constraints, problems are : Problem set: 0 solved, 20 unsolved in 21320 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 240/240 constraints, ReadFeed: 174/174 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 48/48 constraints]
After SMT, in 23051ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 1 properties in 2619 ms.
Support contains 35 out of 240 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 240/240 places, 982/982 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 240 transition count 981
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 239 transition count 981
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 238 transition count 975
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 238 transition count 975
Applied a total of 4 rules in 70 ms. Remains 238 /240 variables (removed 2) and now considering 975/982 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 238/240 places, 975/982 transitions.
RANDOM walk for 40000 steps (8 resets) in 395 ms. (101 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 197162 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 19
Probabilistic random walk after 197162 steps, saw 67533 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-24 04:11:02] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
// Phase 1: matrix 381 rows 238 cols
[2024-05-24 04:11:02] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 04:11:02] [INFO ] State equation strengthened by 169 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 200/235 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 3/238 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/238 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 381/619 variables, 238/257 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/619 variables, 169/426 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/619 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/619 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 619/619 variables, and 426 constraints, problems are : Problem set: 0 solved, 19 unsolved in 1707 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 238/238 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 200/235 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 04:11:04] [INFO ] Deduced a trap composed of 3 places in 92 ms of which 2 ms to minimize.
[2024-05-24 04:11:04] [INFO ] Deduced a trap composed of 3 places in 259 ms of which 3 ms to minimize.
[2024-05-24 04:11:04] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 04:11:05] [INFO ] Deduced a trap composed of 37 places in 262 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/235 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/235 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 3/238 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 04:11:05] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:11:06] [INFO ] Deduced a trap composed of 11 places in 178 ms of which 3 ms to minimize.
[2024-05-24 04:11:06] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:11:06] [INFO ] Deduced a trap composed of 13 places in 262 ms of which 4 ms to minimize.
[2024-05-24 04:11:06] [INFO ] Deduced a trap composed of 17 places in 180 ms of which 3 ms to minimize.
[2024-05-24 04:11:06] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 2 ms to minimize.
[2024-05-24 04:11:06] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-24 04:11:07] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 2 ms to minimize.
[2024-05-24 04:11:07] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
[2024-05-24 04:11:07] [INFO ] Deduced a trap composed of 44 places in 287 ms of which 3 ms to minimize.
[2024-05-24 04:11:07] [INFO ] Deduced a trap composed of 35 places in 297 ms of which 4 ms to minimize.
[2024-05-24 04:11:08] [INFO ] Deduced a trap composed of 54 places in 287 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/238 variables, 12/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 04:11:08] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:11:08] [INFO ] Deduced a trap composed of 53 places in 303 ms of which 4 ms to minimize.
[2024-05-24 04:11:08] [INFO ] Deduced a trap composed of 16 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:11:09] [INFO ] Deduced a trap composed of 42 places in 233 ms of which 4 ms to minimize.
[2024-05-24 04:11:09] [INFO ] Deduced a trap composed of 52 places in 293 ms of which 4 ms to minimize.
[2024-05-24 04:11:09] [INFO ] Deduced a trap composed of 61 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:11:10] [INFO ] Deduced a trap composed of 57 places in 280 ms of which 4 ms to minimize.
[2024-05-24 04:11:10] [INFO ] Deduced a trap composed of 45 places in 281 ms of which 5 ms to minimize.
[2024-05-24 04:11:10] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/238 variables, 9/44 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 04:11:10] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 3 ms to minimize.
[2024-05-24 04:11:11] [INFO ] Deduced a trap composed of 68 places in 259 ms of which 3 ms to minimize.
[2024-05-24 04:11:11] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 4 ms to minimize.
[2024-05-24 04:11:11] [INFO ] Deduced a trap composed of 46 places in 264 ms of which 4 ms to minimize.
[2024-05-24 04:11:11] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 2 ms to minimize.
[2024-05-24 04:11:12] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-24 04:11:12] [INFO ] Deduced a trap composed of 15 places in 295 ms of which 3 ms to minimize.
[2024-05-24 04:11:12] [INFO ] Deduced a trap composed of 21 places in 271 ms of which 4 ms to minimize.
[2024-05-24 04:11:12] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 4 ms to minimize.
[2024-05-24 04:11:13] [INFO ] Deduced a trap composed of 36 places in 252 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/238 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 19 unsolved
[2024-05-24 04:11:13] [INFO ] Deduced a trap composed of 63 places in 320 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/238 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/238 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 13 (OVERLAPS) 381/619 variables, 238/293 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/619 variables, 169/462 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/619 variables, 19/481 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/619 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 17 (OVERLAPS) 0/619 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 619/619 variables, and 481 constraints, problems are : Problem set: 0 solved, 19 unsolved in 13112 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 238/238 constraints, ReadFeed: 169/169 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 36/36 constraints]
After SMT, in 14899ms problems are : Problem set: 0 solved, 19 unsolved
Fused 19 Parikh solutions to 16 different solutions.
Parikh walk visited 0 properties in 2536 ms.
Support contains 35 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 975/975 transitions.
Applied a total of 0 rules in 47 ms. Remains 238 /238 variables (removed 0) and now considering 975/975 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 238/238 places, 975/975 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 975/975 transitions.
Applied a total of 0 rules in 34 ms. Remains 238 /238 variables (removed 0) and now considering 975/975 (removed 0) transitions.
[2024-05-24 04:11:19] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
[2024-05-24 04:11:19] [INFO ] Invariant cache hit.
[2024-05-24 04:11:19] [INFO ] Implicit Places using invariants in 322 ms returned []
[2024-05-24 04:11:19] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
[2024-05-24 04:11:19] [INFO ] Invariant cache hit.
[2024-05-24 04:11:20] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 04:11:21] [INFO ] Implicit Places using invariants and state equation in 1174 ms returned []
Implicit Place search using SMT with State Equation took 1498 ms to find 0 implicit places.
[2024-05-24 04:11:21] [INFO ] Redundant transitions in 112 ms returned []
Running 969 sub problems to find dead transitions.
[2024-05-24 04:11:21] [INFO ] Flow matrix only has 381 transitions (discarded 594 similar events)
[2024-05-24 04:11:21] [INFO ] Invariant cache hit.
[2024-05-24 04:11:21] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 969 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-05-24 04:11:31] [INFO ] Deduced a trap composed of 3 places in 112 ms of which 2 ms to minimize.
[2024-05-24 04:11:31] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2024-05-24 04:11:31] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:11:31] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2024-05-24 04:11:32] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:11:32] [INFO ] Deduced a trap composed of 35 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:11:33] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 4 ms to minimize.
[2024-05-24 04:11:33] [INFO ] Deduced a trap composed of 34 places in 242 ms of which 3 ms to minimize.
[2024-05-24 04:11:33] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:11:34] [INFO ] Deduced a trap composed of 56 places in 278 ms of which 3 ms to minimize.
[2024-05-24 04:11:34] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 4 ms to minimize.
[2024-05-24 04:11:35] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 4 ms to minimize.
[2024-05-24 04:11:35] [INFO ] Deduced a trap composed of 33 places in 242 ms of which 5 ms to minimize.
[2024-05-24 04:11:35] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:11:35] [INFO ] Deduced a trap composed of 54 places in 231 ms of which 4 ms to minimize.
[2024-05-24 04:11:36] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:11:36] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-24 04:11:36] [INFO ] Deduced a trap composed of 15 places in 237 ms of which 3 ms to minimize.
[2024-05-24 04:11:36] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:11:36] [INFO ] Deduced a trap composed of 33 places in 261 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-05-24 04:11:39] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 4 ms to minimize.
[2024-05-24 04:11:40] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:11:41] [INFO ] Deduced a trap composed of 59 places in 235 ms of which 4 ms to minimize.
[2024-05-24 04:11:41] [INFO ] Deduced a trap composed of 70 places in 294 ms of which 4 ms to minimize.
[2024-05-24 04:11:41] [INFO ] Deduced a trap composed of 47 places in 360 ms of which 4 ms to minimize.
[2024-05-24 04:11:42] [INFO ] Deduced a trap composed of 48 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:11:42] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2024-05-24 04:11:42] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-05-24 04:11:42] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:11:42] [INFO ] Deduced a trap composed of 16 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:11:43] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 2 ms to minimize.
[2024-05-24 04:11:43] [INFO ] Deduced a trap composed of 39 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:11:44] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:11:44] [INFO ] Deduced a trap composed of 50 places in 273 ms of which 4 ms to minimize.
[2024-05-24 04:11:45] [INFO ] Deduced a trap composed of 41 places in 333 ms of which 3 ms to minimize.
[2024-05-24 04:11:45] [INFO ] Deduced a trap composed of 33 places in 341 ms of which 4 ms to minimize.
[2024-05-24 04:11:45] [INFO ] Deduced a trap composed of 44 places in 259 ms of which 3 ms to minimize.
[2024-05-24 04:11:46] [INFO ] Deduced a trap composed of 53 places in 266 ms of which 3 ms to minimize.
[2024-05-24 04:11:46] [INFO ] Deduced a trap composed of 45 places in 314 ms of which 3 ms to minimize.
[2024-05-24 04:11:46] [INFO ] Deduced a trap composed of 40 places in 264 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 969 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 238/619 variables, and 59 constraints, problems are : Problem set: 0 solved, 969 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/238 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 969/969 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 969 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 969 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 969 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-05-24 04:11:58] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2024-05-24 04:12:00] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 2 ms to minimize.
[2024-05-24 04:12:02] [INFO ] Deduced a trap composed of 20 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:12:02] [INFO ] Deduced a trap composed of 19 places in 285 ms of which 4 ms to minimize.
[2024-05-24 04:12:02] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 3 ms to minimize.
[2024-05-24 04:12:02] [INFO ] Deduced a trap composed of 30 places in 104 ms of which 1 ms to minimize.
[2024-05-24 04:12:03] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
[2024-05-24 04:12:03] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
[2024-05-24 04:12:03] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:12:04] [INFO ] Deduced a trap composed of 33 places in 264 ms of which 4 ms to minimize.
[2024-05-24 04:12:04] [INFO ] Deduced a trap composed of 48 places in 316 ms of which 4 ms to minimize.
[2024-05-24 04:12:04] [INFO ] Deduced a trap composed of 49 places in 300 ms of which 4 ms to minimize.
[2024-05-24 04:12:05] [INFO ] Deduced a trap composed of 49 places in 275 ms of which 4 ms to minimize.
[2024-05-24 04:12:05] [INFO ] Deduced a trap composed of 60 places in 328 ms of which 4 ms to minimize.
[2024-05-24 04:12:05] [INFO ] Deduced a trap composed of 62 places in 326 ms of which 4 ms to minimize.
[2024-05-24 04:12:06] [INFO ] Deduced a trap composed of 61 places in 337 ms of which 5 ms to minimize.
[2024-05-24 04:12:06] [INFO ] Deduced a trap composed of 54 places in 331 ms of which 4 ms to minimize.
[2024-05-24 04:12:06] [INFO ] Deduced a trap composed of 72 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:12:07] [INFO ] Deduced a trap composed of 55 places in 312 ms of which 4 ms to minimize.
[2024-05-24 04:12:07] [INFO ] Deduced a trap composed of 45 places in 314 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/238 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 969 unsolved
[2024-05-24 04:12:17] [INFO ] Deduced a trap composed of 56 places in 316 ms of which 4 ms to minimize.
[2024-05-24 04:12:17] [INFO ] Deduced a trap composed of 63 places in 337 ms of which 4 ms to minimize.
[2024-05-24 04:12:17] [INFO ] Deduced a trap composed of 70 places in 325 ms of which 4 ms to minimize.
[2024-05-24 04:12:18] [INFO ] Deduced a trap composed of 69 places in 328 ms of which 4 ms to minimize.
[2024-05-24 04:12:18] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2024-05-24 04:12:18] [INFO ] Deduced a trap composed of 44 places in 223 ms of which 4 ms to minimize.
[2024-05-24 04:12:19] [INFO ] Deduced a trap composed of 54 places in 310 ms of which 4 ms to minimize.
[2024-05-24 04:12:19] [INFO ] Deduced a trap composed of 68 places in 255 ms of which 3 ms to minimize.
[2024-05-24 04:12:19] [INFO ] Deduced a trap composed of 15 places in 252 ms of which 3 ms to minimize.
[2024-05-24 04:12:20] [INFO ] Deduced a trap composed of 56 places in 235 ms of which 4 ms to minimize.
[2024-05-24 04:12:20] [INFO ] Deduced a trap composed of 52 places in 266 ms of which 4 ms to minimize.
[2024-05-24 04:12:21] [INFO ] Deduced a trap composed of 51 places in 325 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 238/619 variables, and 91 constraints, problems are : Problem set: 0 solved, 969 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/238 constraints, ReadFeed: 0/169 constraints, PredecessorRefiner: 0/969 constraints, Known Traps: 72/72 constraints]
After SMT, in 60810ms problems are : Problem set: 0 solved, 969 unsolved
Search for dead transitions found 0 dead transitions in 60832ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62491 ms. Remains : 238/238 places, 975/975 transitions.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p1)))'
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 385 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 385 transition count 1122
Applied a total of 10 rules in 23 ms. Remains 385 /390 variables (removed 5) and now considering 1122/1152 (removed 30) transitions.
[2024-05-24 04:12:22] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-05-24 04:12:22] [INFO ] Computed 19 invariants in 7 ms
[2024-05-24 04:12:23] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-05-24 04:12:23] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 04:12:23] [INFO ] Invariant cache hit.
[2024-05-24 04:12:23] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 04:12:24] [INFO ] Implicit Places using invariants and state equation in 1906 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-24 04:12:25] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 04:12:25] [INFO ] Invariant cache hit.
[2024-05-24 04:12:25] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 04:12:40] [INFO ] Deduced a trap composed of 34 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:12:40] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-05-24 04:12:40] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:12:41] [INFO ] Deduced a trap composed of 23 places in 399 ms of which 6 ms to minimize.
[2024-05-24 04:12:41] [INFO ] Deduced a trap composed of 63 places in 386 ms of which 6 ms to minimize.
[2024-05-24 04:12:42] [INFO ] Deduced a trap composed of 58 places in 344 ms of which 5 ms to minimize.
[2024-05-24 04:12:42] [INFO ] Deduced a trap composed of 58 places in 329 ms of which 4 ms to minimize.
[2024-05-24 04:12:42] [INFO ] Deduced a trap composed of 64 places in 343 ms of which 5 ms to minimize.
[2024-05-24 04:12:43] [INFO ] Deduced a trap composed of 58 places in 346 ms of which 5 ms to minimize.
[2024-05-24 04:12:43] [INFO ] Deduced a trap composed of 58 places in 326 ms of which 5 ms to minimize.
[2024-05-24 04:12:43] [INFO ] Deduced a trap composed of 58 places in 301 ms of which 5 ms to minimize.
[2024-05-24 04:12:44] [INFO ] Deduced a trap composed of 27 places in 328 ms of which 5 ms to minimize.
[2024-05-24 04:12:44] [INFO ] Deduced a trap composed of 88 places in 327 ms of which 5 ms to minimize.
[2024-05-24 04:12:44] [INFO ] Deduced a trap composed of 29 places in 91 ms of which 2 ms to minimize.
[2024-05-24 04:12:45] [INFO ] Deduced a trap composed of 29 places in 179 ms of which 3 ms to minimize.
[2024-05-24 04:12:46] [INFO ] Deduced a trap composed of 73 places in 426 ms of which 6 ms to minimize.
[2024-05-24 04:12:46] [INFO ] Deduced a trap composed of 20 places in 188 ms of which 3 ms to minimize.
[2024-05-24 04:12:47] [INFO ] Deduced a trap composed of 104 places in 413 ms of which 6 ms to minimize.
[2024-05-24 04:12:47] [INFO ] Deduced a trap composed of 57 places in 397 ms of which 5 ms to minimize.
[2024-05-24 04:12:48] [INFO ] Deduced a trap composed of 75 places in 316 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 04:12:48] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-05-24 04:12:49] [INFO ] Deduced a trap composed of 74 places in 144 ms of which 3 ms to minimize.
[2024-05-24 04:12:49] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-24 04:12:50] [INFO ] Deduced a trap composed of 51 places in 464 ms of which 7 ms to minimize.
[2024-05-24 04:12:51] [INFO ] Deduced a trap composed of 81 places in 383 ms of which 5 ms to minimize.
[2024-05-24 04:12:51] [INFO ] Deduced a trap composed of 57 places in 341 ms of which 5 ms to minimize.
[2024-05-24 04:12:51] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 100 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:12:52] [INFO ] Deduced a trap composed of 79 places in 363 ms of which 5 ms to minimize.
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 62 places in 403 ms of which 6 ms to minimize.
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
[2024-05-24 04:12:53] [INFO ] Deduced a trap composed of 24 places in 334 ms of which 5 ms to minimize.
[2024-05-24 04:12:54] [INFO ] Deduced a trap composed of 24 places in 368 ms of which 5 ms to minimize.
[2024-05-24 04:12:54] [INFO ] Deduced a trap composed of 53 places in 394 ms of which 5 ms to minimize.
[2024-05-24 04:12:54] [INFO ] Deduced a trap composed of 39 places in 391 ms of which 5 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 18 places in 411 ms of which 6 ms to minimize.
[2024-05-24 04:12:55] [INFO ] Deduced a trap composed of 14 places in 375 ms of which 6 ms to minimize.
SMT process timed out in 30971ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 30994ms
Starting structural reductions in LTL mode, iteration 1 : 385/390 places, 1122/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33599 ms. Remains : 385/390 places, 1122/1152 transitions.
Stuttering acceptance computed with spot in 460 ms :[(NOT p0), true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 672 ms.
Stack based approach found an accepted trace after 134 steps with 0 reset with depth 135 and stack size 135 in 3 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-00 finished in 34859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||(X(X(p0))&&X(p0)))))'
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 37 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 04:12:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 04:12:57] [INFO ] Computed 19 invariants in 5 ms
[2024-05-24 04:12:57] [INFO ] Implicit Places using invariants in 722 ms returned []
[2024-05-24 04:12:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:12:57] [INFO ] Invariant cache hit.
[2024-05-24 04:12:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:12:59] [INFO ] Implicit Places using invariants and state equation in 2016 ms returned []
Implicit Place search using SMT with State Equation took 2747 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:12:59] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:12:59] [INFO ] Invariant cache hit.
[2024-05-24 04:12:59] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:13:14] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:13:15] [INFO ] Deduced a trap composed of 34 places in 295 ms of which 4 ms to minimize.
[2024-05-24 04:13:15] [INFO ] Deduced a trap composed of 29 places in 308 ms of which 5 ms to minimize.
[2024-05-24 04:13:15] [INFO ] Deduced a trap composed of 32 places in 333 ms of which 5 ms to minimize.
[2024-05-24 04:13:16] [INFO ] Deduced a trap composed of 26 places in 187 ms of which 3 ms to minimize.
[2024-05-24 04:13:16] [INFO ] Deduced a trap composed of 21 places in 214 ms of which 4 ms to minimize.
[2024-05-24 04:13:16] [INFO ] Deduced a trap composed of 35 places in 196 ms of which 3 ms to minimize.
[2024-05-24 04:13:16] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 23 places in 387 ms of which 5 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 38 places in 145 ms of which 3 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 3 ms to minimize.
[2024-05-24 04:13:17] [INFO ] Deduced a trap composed of 96 places in 282 ms of which 5 ms to minimize.
[2024-05-24 04:13:18] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 5 ms to minimize.
[2024-05-24 04:13:18] [INFO ] Deduced a trap composed of 58 places in 297 ms of which 5 ms to minimize.
[2024-05-24 04:13:20] [INFO ] Deduced a trap composed of 54 places in 444 ms of which 6 ms to minimize.
[2024-05-24 04:13:20] [INFO ] Deduced a trap composed of 80 places in 416 ms of which 7 ms to minimize.
[2024-05-24 04:13:21] [INFO ] Deduced a trap composed of 72 places in 415 ms of which 9 ms to minimize.
[2024-05-24 04:13:21] [INFO ] Deduced a trap composed of 78 places in 439 ms of which 6 ms to minimize.
[2024-05-24 04:13:22] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 5 ms to minimize.
[2024-05-24 04:13:22] [INFO ] Deduced a trap composed of 50 places in 307 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:13:23] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:13:23] [INFO ] Deduced a trap composed of 74 places in 284 ms of which 5 ms to minimize.
[2024-05-24 04:13:25] [INFO ] Deduced a trap composed of 89 places in 399 ms of which 6 ms to minimize.
[2024-05-24 04:13:25] [INFO ] Deduced a trap composed of 76 places in 397 ms of which 6 ms to minimize.
[2024-05-24 04:13:26] [INFO ] Deduced a trap composed of 86 places in 383 ms of which 5 ms to minimize.
[2024-05-24 04:13:26] [INFO ] Deduced a trap composed of 75 places in 386 ms of which 5 ms to minimize.
[2024-05-24 04:13:27] [INFO ] Deduced a trap composed of 76 places in 375 ms of which 5 ms to minimize.
[2024-05-24 04:13:27] [INFO ] Deduced a trap composed of 4 places in 471 ms of which 5 ms to minimize.
[2024-05-24 04:13:27] [INFO ] Deduced a trap composed of 3 places in 424 ms of which 6 ms to minimize.
[2024-05-24 04:13:28] [INFO ] Deduced a trap composed of 86 places in 406 ms of which 5 ms to minimize.
[2024-05-24 04:13:28] [INFO ] Deduced a trap composed of 26 places in 129 ms of which 3 ms to minimize.
[2024-05-24 04:13:28] [INFO ] Deduced a trap composed of 86 places in 388 ms of which 5 ms to minimize.
[2024-05-24 04:13:29] [INFO ] Deduced a trap composed of 86 places in 281 ms of which 5 ms to minimize.
[2024-05-24 04:13:29] [INFO ] Deduced a trap composed of 102 places in 417 ms of which 6 ms to minimize.
[2024-05-24 04:13:30] [INFO ] Deduced a trap composed of 72 places in 407 ms of which 6 ms to minimize.
[2024-05-24 04:13:30] [INFO ] Deduced a trap composed of 20 places in 421 ms of which 6 ms to minimize.
[2024-05-24 04:13:31] [INFO ] Deduced a trap composed of 105 places in 389 ms of which 5 ms to minimize.
SMT process timed out in 31100ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 31123ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33917 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 426 ms.
Product exploration explored 100000 steps with 0 reset in 676 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 177 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 583 ms. (68 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 552 ms. (72 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 133910 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 6
Probabilistic random walk after 133910 steps, saw 86560 distinct states, run finished after 3005 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-24 04:13:36] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:13:36] [INFO ] Invariant cache hit.
[2024-05-24 04:13:36] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:13:36] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 19/195 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 13/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 201/906 variables, 165/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 103/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 568 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1256 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:13:38] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/195 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 291/486 variables, 195/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 48/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 54/540 variables, 24/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 13/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 159/699 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/705 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:13:39] [INFO ] Deduced a trap composed of 7 places in 389 ms of which 6 ms to minimize.
[2024-05-24 04:13:39] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2024-05-24 04:13:39] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 5 ms to minimize.
[2024-05-24 04:13:40] [INFO ] Deduced a trap composed of 18 places in 244 ms of which 4 ms to minimize.
[2024-05-24 04:13:40] [INFO ] Deduced a trap composed of 14 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:13:40] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 4 ms to minimize.
[2024-05-24 04:13:40] [INFO ] Deduced a trap composed of 20 places in 140 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/705 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/705 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 201/906 variables, 165/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 103/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/906 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/906 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 582 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4067 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 5351ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1317 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 75 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 234/384 places, 966/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 686 ms. (58 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 244972 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :0 out of 6
Probabilistic random walk after 244972 steps, saw 75396 distinct states, run finished after 3003 ms. (steps per millisecond=81 ) properties seen :0
[2024-05-24 04:13:46] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 04:13:46] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 04:13:46] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/120 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 216/336 variables, 120/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 48/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 54/390 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 84/474 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/480 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 126/606 variables, 90/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 101/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 417 constraints, problems are : Problem set: 0 solved, 6 unsolved in 682 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:13:47] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:13:48] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 84/474 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/474 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/480 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:13:48] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 2 ms to minimize.
[2024-05-24 04:13:48] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 126/606 variables, 90/326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 101/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 427 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1970 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 2686ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1176 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 37 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 38 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 04:13:50] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:13:50] [INFO ] Invariant cache hit.
[2024-05-24 04:13:51] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-24 04:13:51] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:13:51] [INFO ] Invariant cache hit.
[2024-05-24 04:13:51] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:13:52] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 2030 ms to find 0 implicit places.
[2024-05-24 04:13:52] [INFO ] Redundant transitions in 69 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-24 04:13:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:13:53] [INFO ] Invariant cache hit.
[2024-05-24 04:13:53] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:14:02] [INFO ] Deduced a trap composed of 3 places in 281 ms of which 4 ms to minimize.
[2024-05-24 04:14:02] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-05-24 04:14:02] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 2 ms to minimize.
[2024-05-24 04:14:02] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:14:03] [INFO ] Deduced a trap composed of 33 places in 183 ms of which 3 ms to minimize.
[2024-05-24 04:14:04] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:14:04] [INFO ] Deduced a trap composed of 67 places in 222 ms of which 4 ms to minimize.
[2024-05-24 04:14:04] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:14:04] [INFO ] Deduced a trap composed of 28 places in 256 ms of which 3 ms to minimize.
[2024-05-24 04:14:05] [INFO ] Deduced a trap composed of 60 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:14:05] [INFO ] Deduced a trap composed of 37 places in 238 ms of which 4 ms to minimize.
[2024-05-24 04:14:05] [INFO ] Deduced a trap composed of 52 places in 320 ms of which 9 ms to minimize.
[2024-05-24 04:14:05] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:14:06] [INFO ] Deduced a trap composed of 17 places in 268 ms of which 4 ms to minimize.
[2024-05-24 04:14:06] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 4 ms to minimize.
[2024-05-24 04:14:06] [INFO ] Deduced a trap composed of 11 places in 248 ms of which 4 ms to minimize.
[2024-05-24 04:14:07] [INFO ] Deduced a trap composed of 15 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:14:07] [INFO ] Deduced a trap composed of 59 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:14:08] [INFO ] Deduced a trap composed of 60 places in 263 ms of which 3 ms to minimize.
[2024-05-24 04:14:08] [INFO ] Deduced a trap composed of 73 places in 345 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:14:10] [INFO ] Deduced a trap composed of 34 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:14:10] [INFO ] Deduced a trap composed of 38 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:14:11] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:14:12] [INFO ] Deduced a trap composed of 13 places in 168 ms of which 2 ms to minimize.
[2024-05-24 04:14:12] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2024-05-24 04:14:14] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 2 ms to minimize.
[2024-05-24 04:14:15] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-24 04:14:16] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:14:16] [INFO ] Deduced a trap composed of 46 places in 310 ms of which 4 ms to minimize.
[2024-05-24 04:14:16] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 3 ms to minimize.
[2024-05-24 04:14:17] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 3 ms to minimize.
[2024-05-24 04:14:18] [INFO ] Deduced a trap composed of 17 places in 309 ms of which 4 ms to minimize.
[2024-05-24 04:14:18] [INFO ] Deduced a trap composed of 19 places in 304 ms of which 3 ms to minimize.
[2024-05-24 04:14:19] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:14:19] [INFO ] Deduced a trap composed of 46 places in 306 ms of which 4 ms to minimize.
[2024-05-24 04:14:20] [INFO ] Deduced a trap composed of 50 places in 280 ms of which 3 ms to minimize.
[2024-05-24 04:14:20] [INFO ] Deduced a trap composed of 44 places in 315 ms of which 4 ms to minimize.
[2024-05-24 04:14:20] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:14:21] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2024-05-24 04:14:21] [INFO ] Deduced a trap composed of 23 places in 283 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:14:26] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2024-05-24 04:14:27] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 2 ms to minimize.
[2024-05-24 04:14:29] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:14:30] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 4 ms to minimize.
[2024-05-24 04:14:30] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:14:30] [INFO ] Deduced a trap composed of 66 places in 279 ms of which 4 ms to minimize.
[2024-05-24 04:14:31] [INFO ] Deduced a trap composed of 60 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:14:31] [INFO ] Deduced a trap composed of 55 places in 258 ms of which 3 ms to minimize.
[2024-05-24 04:14:31] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 4 ms to minimize.
[2024-05-24 04:14:32] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 3 ms to minimize.
[2024-05-24 04:14:33] [INFO ] Deduced a trap composed of 51 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:14:33] [INFO ] Deduced a trap composed of 53 places in 304 ms of which 4 ms to minimize.
[2024-05-24 04:14:34] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:14:34] [INFO ] Deduced a trap composed of 51 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:14:34] [INFO ] Deduced a trap composed of 46 places in 257 ms of which 4 ms to minimize.
[2024-05-24 04:14:34] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-05-24 04:14:35] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 4 ms to minimize.
[2024-05-24 04:14:35] [INFO ] Deduced a trap composed of 51 places in 250 ms of which 3 ms to minimize.
[2024-05-24 04:14:36] [INFO ] Deduced a trap composed of 45 places in 302 ms of which 3 ms to minimize.
[2024-05-24 04:14:36] [INFO ] Deduced a trap composed of 40 places in 288 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:14:38] [INFO ] Deduced a trap composed of 56 places in 186 ms of which 3 ms to minimize.
[2024-05-24 04:14:38] [INFO ] Deduced a trap composed of 40 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:14:41] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 4 ms to minimize.
[2024-05-24 04:14:42] [INFO ] Deduced a trap composed of 53 places in 226 ms of which 4 ms to minimize.
[2024-05-24 04:14:42] [INFO ] Deduced a trap composed of 45 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:14:43] [INFO ] Deduced a trap composed of 42 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:14:44] [INFO ] Deduced a trap composed of 55 places in 280 ms of which 3 ms to minimize.
[2024-05-24 04:14:44] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 3 ms to minimize.
[2024-05-24 04:14:45] [INFO ] Deduced a trap composed of 21 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:14:46] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-24 04:14:46] [INFO ] Deduced a trap composed of 25 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:14:47] [INFO ] Deduced a trap composed of 40 places in 281 ms of which 3 ms to minimize.
[2024-05-24 04:14:47] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:14:47] [INFO ] Deduced a trap composed of 40 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:14:48] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 4 ms to minimize.
[2024-05-24 04:14:48] [INFO ] Deduced a trap composed of 37 places in 192 ms of which 3 ms to minimize.
[2024-05-24 04:14:48] [INFO ] Deduced a trap composed of 37 places in 137 ms of which 2 ms to minimize.
[2024-05-24 04:14:48] [INFO ] Deduced a trap composed of 40 places in 137 ms of which 2 ms to minimize.
[2024-05-24 04:14:48] [INFO ] Deduced a trap composed of 38 places in 201 ms of which 3 ms to minimize.
[2024-05-24 04:14:49] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 99 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 80/80 constraints]
After SMT, in 60747ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60767ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62916 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 6 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 75 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-05-24 04:14:53] [INFO ] Computed 13 invariants in 16 ms
[2024-05-24 04:14:53] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 04:14:54] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:14:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 04:14:54] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:14:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 04:14:54] [INFO ] After 67ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-24 04:14:54] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
[2024-05-24 04:14:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-24 04:14:54] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:14:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
TRAPS : Iteration 1
[2024-05-24 04:14:54] [INFO ] After 313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-24 04:14:54] [INFO ] After 569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 841 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 206 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 13 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 04:14:55] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 04:14:55] [INFO ] Computed 19 invariants in 5 ms
[2024-05-24 04:14:55] [INFO ] Implicit Places using invariants in 346 ms returned []
[2024-05-24 04:14:55] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:14:55] [INFO ] Invariant cache hit.
[2024-05-24 04:14:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:14:57] [INFO ] Implicit Places using invariants and state equation in 1911 ms returned []
Implicit Place search using SMT with State Equation took 2261 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:14:57] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:14:57] [INFO ] Invariant cache hit.
[2024-05-24 04:14:57] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:15:13] [INFO ] Deduced a trap composed of 44 places in 228 ms of which 4 ms to minimize.
[2024-05-24 04:15:13] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 3 ms to minimize.
[2024-05-24 04:15:13] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:15:13] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:15:13] [INFO ] Deduced a trap composed of 26 places in 151 ms of which 4 ms to minimize.
[2024-05-24 04:15:14] [INFO ] Deduced a trap composed of 21 places in 130 ms of which 3 ms to minimize.
[2024-05-24 04:15:14] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 3 ms to minimize.
[2024-05-24 04:15:14] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2024-05-24 04:15:14] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 3 ms to minimize.
[2024-05-24 04:15:14] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:15:15] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-24 04:15:15] [INFO ] Deduced a trap composed of 96 places in 157 ms of which 3 ms to minimize.
[2024-05-24 04:15:15] [INFO ] Deduced a trap composed of 29 places in 254 ms of which 4 ms to minimize.
[2024-05-24 04:15:15] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 5 ms to minimize.
[2024-05-24 04:15:17] [INFO ] Deduced a trap composed of 54 places in 390 ms of which 6 ms to minimize.
[2024-05-24 04:15:17] [INFO ] Deduced a trap composed of 80 places in 416 ms of which 6 ms to minimize.
[2024-05-24 04:15:18] [INFO ] Deduced a trap composed of 72 places in 372 ms of which 5 ms to minimize.
[2024-05-24 04:15:18] [INFO ] Deduced a trap composed of 78 places in 424 ms of which 5 ms to minimize.
[2024-05-24 04:15:19] [INFO ] Deduced a trap composed of 74 places in 294 ms of which 4 ms to minimize.
[2024-05-24 04:15:19] [INFO ] Deduced a trap composed of 50 places in 289 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:15:20] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 2 ms to minimize.
[2024-05-24 04:15:20] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 4 ms to minimize.
[2024-05-24 04:15:21] [INFO ] Deduced a trap composed of 89 places in 222 ms of which 3 ms to minimize.
[2024-05-24 04:15:21] [INFO ] Deduced a trap composed of 76 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:15:21] [INFO ] Deduced a trap composed of 86 places in 222 ms of which 3 ms to minimize.
[2024-05-24 04:15:22] [INFO ] Deduced a trap composed of 75 places in 235 ms of which 4 ms to minimize.
[2024-05-24 04:15:22] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 4 ms to minimize.
[2024-05-24 04:15:22] [INFO ] Deduced a trap composed of 4 places in 293 ms of which 5 ms to minimize.
[2024-05-24 04:15:23] [INFO ] Deduced a trap composed of 3 places in 312 ms of which 4 ms to minimize.
[2024-05-24 04:15:23] [INFO ] Deduced a trap composed of 86 places in 267 ms of which 3 ms to minimize.
[2024-05-24 04:15:23] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 1 ms to minimize.
[2024-05-24 04:15:23] [INFO ] Deduced a trap composed of 86 places in 248 ms of which 4 ms to minimize.
[2024-05-24 04:15:24] [INFO ] Deduced a trap composed of 86 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:15:24] [INFO ] Deduced a trap composed of 102 places in 316 ms of which 4 ms to minimize.
[2024-05-24 04:15:24] [INFO ] Deduced a trap composed of 72 places in 363 ms of which 5 ms to minimize.
[2024-05-24 04:15:25] [INFO ] Deduced a trap composed of 20 places in 413 ms of which 5 ms to minimize.
[2024-05-24 04:15:25] [INFO ] Deduced a trap composed of 105 places in 417 ms of which 6 ms to minimize.
[2024-05-24 04:15:25] [INFO ] Deduced a trap composed of 50 places in 257 ms of which 3 ms to minimize.
[2024-05-24 04:15:26] [INFO ] Deduced a trap composed of 77 places in 261 ms of which 4 ms to minimize.
[2024-05-24 04:15:26] [INFO ] Deduced a trap composed of 100 places in 247 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.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)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.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 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 1.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 1.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:15:31] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-05-24 04:15:31] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-05-24 04:15:33] [INFO ] Deduced a trap composed of 86 places in 332 ms of which 5 ms to minimize.
[2024-05-24 04:15:33] [INFO ] Deduced a trap composed of 91 places in 267 ms of which 4 ms to minimize.
[2024-05-24 04:15:33] [INFO ] Deduced a trap composed of 54 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:15:34] [INFO ] Deduced a trap composed of 70 places in 295 ms of which 5 ms to minimize.
[2024-05-24 04:15:34] [INFO ] Deduced a trap composed of 90 places in 300 ms of which 4 ms to minimize.
[2024-05-24 04:15:34] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 2 ms to minimize.
[2024-05-24 04:15:35] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 2 ms to minimize.
[2024-05-24 04:15:36] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-24 04:15:36] [INFO ] Deduced a trap composed of 77 places in 406 ms of which 6 ms to minimize.
[2024-05-24 04:15:37] [INFO ] Deduced a trap composed of 58 places in 410 ms of which 5 ms to minimize.
[2024-05-24 04:15:37] [INFO ] Deduced a trap composed of 98 places in 405 ms of which 6 ms to minimize.
[2024-05-24 04:15:38] [INFO ] Deduced a trap composed of 38 places in 397 ms of which 5 ms to minimize.
[2024-05-24 04:15:38] [INFO ] Deduced a trap composed of 55 places in 405 ms of which 5 ms to minimize.
[2024-05-24 04:15:39] [INFO ] Deduced a trap composed of 103 places in 397 ms of which 6 ms to minimize.
[2024-05-24 04:15:39] [INFO ] Deduced a trap composed of 108 places in 401 ms of which 5 ms to minimize.
[2024-05-24 04:15:39] [INFO ] Deduced a trap composed of 39 places in 401 ms of which 6 ms to minimize.
[2024-05-24 04:15:40] [INFO ] Deduced a trap composed of 87 places in 319 ms of which 5 ms to minimize.
[2024-05-24 04:15:40] [INFO ] Deduced a trap composed of 39 places in 416 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:15:41] [INFO ] Deduced a trap composed of 58 places in 259 ms of which 4 ms to minimize.
[2024-05-24 04:15:43] [INFO ] Deduced a trap composed of 114 places in 480 ms of which 6 ms to minimize.
[2024-05-24 04:15:44] [INFO ] Deduced a trap composed of 93 places in 472 ms of which 6 ms to minimize.
[2024-05-24 04:15:44] [INFO ] Deduced a trap composed of 91 places in 413 ms of which 5 ms to minimize.
[2024-05-24 04:15:45] [INFO ] Deduced a trap composed of 93 places in 409 ms of which 6 ms to minimize.
[2024-05-24 04:15:45] [INFO ] Deduced a trap composed of 24 places in 428 ms of which 5 ms to minimize.
[2024-05-24 04:15:46] [INFO ] Deduced a trap composed of 22 places in 406 ms of which 6 ms to minimize.
[2024-05-24 04:15:46] [INFO ] Deduced a trap composed of 84 places in 379 ms of which 5 ms to minimize.
[2024-05-24 04:15:47] [INFO ] Deduced a trap composed of 93 places in 407 ms of which 5 ms to minimize.
[2024-05-24 04:15:47] [INFO ] Deduced a trap composed of 72 places in 401 ms of which 5 ms to minimize.
[2024-05-24 04:15:48] [INFO ] Deduced a trap composed of 82 places in 424 ms of which 6 ms to minimize.
[2024-05-24 04:15:48] [INFO ] Deduced a trap composed of 69 places in 398 ms of which 5 ms to minimize.
[2024-05-24 04:15:48] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 2 ms to minimize.
[2024-05-24 04:15:49] [INFO ] Deduced a trap composed of 95 places in 329 ms of which 4 ms to minimize.
[2024-05-24 04:15:49] [INFO ] Deduced a trap composed of 96 places in 329 ms of which 4 ms to minimize.
[2024-05-24 04:15:50] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-24 04:15:51] [INFO ] Deduced a trap composed of 89 places in 414 ms of which 5 ms to minimize.
[2024-05-24 04:15:52] [INFO ] Deduced a trap composed of 103 places in 424 ms of which 6 ms to minimize.
[2024-05-24 04:15:52] [INFO ] Deduced a trap composed of 38 places in 412 ms of which 6 ms to minimize.
[2024-05-24 04:15:52] [INFO ] Deduced a trap composed of 113 places in 402 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:15:54] [INFO ] Deduced a trap composed of 90 places in 207 ms of which 4 ms to minimize.
[2024-05-24 04:15:56] [INFO ] Deduced a trap composed of 60 places in 305 ms of which 4 ms to minimize.
[2024-05-24 04:15:57] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:15:57] [INFO ] Deduced a trap composed of 86 places in 238 ms of which 3 ms to minimize.
[2024-05-24 04:15:58] [INFO ] Deduced a trap composed of 93 places in 382 ms of which 5 ms to minimize.
SMT process timed out in 61056ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 61078ms
Finished structural reductions in LTL mode , in 1 iterations and 63357 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 251 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 148764 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 6
Probabilistic random walk after 148764 steps, saw 95341 distinct states, run finished after 3005 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-24 04:16:02] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:16:02] [INFO ] Invariant cache hit.
[2024-05-24 04:16:02] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:16:02] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 19/195 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 48/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/278 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 13/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 201/906 variables, 165/465 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 103/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 568 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1187 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 125/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:16:03] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/176 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/176 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/195 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 291/486 variables, 195/207 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 48/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/486 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 54/540 variables, 24/279 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 13/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 159/699 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/699 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/705 variables, 3/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 6/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:16:04] [INFO ] Deduced a trap composed of 7 places in 319 ms of which 5 ms to minimize.
[2024-05-24 04:16:04] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:16:04] [INFO ] Deduced a trap composed of 3 places in 272 ms of which 4 ms to minimize.
[2024-05-24 04:16:05] [INFO ] Deduced a trap composed of 18 places in 217 ms of which 4 ms to minimize.
[2024-05-24 04:16:05] [INFO ] Deduced a trap composed of 14 places in 266 ms of which 4 ms to minimize.
[2024-05-24 04:16:05] [INFO ] Deduced a trap composed of 18 places in 181 ms of which 3 ms to minimize.
[2024-05-24 04:16:05] [INFO ] Deduced a trap composed of 20 places in 147 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/705 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/705 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 201/906 variables, 165/479 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 103/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/906 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/906 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 582 constraints, problems are : Problem set: 0 solved, 6 unsolved in 3776 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 4984ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 730 ms.
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 378 transition count 996
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 234 transition count 966
Applied a total of 300 rules in 72 ms. Remains 234 /384 variables (removed 150) and now considering 966/1116 (removed 150) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 234/384 places, 966/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 341537 steps, run timeout after 3001 ms. (steps per millisecond=113 ) properties seen :0 out of 6
Probabilistic random walk after 341537 steps, saw 98385 distinct states, run finished after 3001 ms. (steps per millisecond=113 ) properties seen :0
[2024-05-24 04:16:11] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 04:16:11] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 04:16:11] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 8/120 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 216/336 variables, 120/130 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/336 variables, 48/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 54/390 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 15/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 84/474 variables, 6/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 6/480 variables, 3/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 126/606 variables, 90/316 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/606 variables, 101/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/606 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 417 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1004 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:16:12] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:16:12] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/390 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 84/474 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/474 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 6/480 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:16:12] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:16:13] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 2/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/480 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 126/606 variables, 90/326 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 101/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 0/606 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 427 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1310 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 2333ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1056 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 54 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 50 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 04:16:14] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:16:14] [INFO ] Invariant cache hit.
[2024-05-24 04:16:15] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-24 04:16:15] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:16:15] [INFO ] Invariant cache hit.
[2024-05-24 04:16:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:16:16] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1630 ms to find 0 implicit places.
[2024-05-24 04:16:16] [INFO ] Redundant transitions in 17 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-24 04:16:16] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:16:16] [INFO ] Invariant cache hit.
[2024-05-24 04:16:16] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:16:24] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 2 ms to minimize.
[2024-05-24 04:16:24] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:16:24] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:16:24] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:16:24] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 1 ms to minimize.
[2024-05-24 04:16:25] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
[2024-05-24 04:16:25] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 2 ms to minimize.
[2024-05-24 04:16:25] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 3 ms to minimize.
[2024-05-24 04:16:25] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 3 ms to minimize.
[2024-05-24 04:16:25] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 3 ms to minimize.
[2024-05-24 04:16:25] [INFO ] Deduced a trap composed of 37 places in 127 ms of which 2 ms to minimize.
[2024-05-24 04:16:26] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2024-05-24 04:16:26] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:16:26] [INFO ] Deduced a trap composed of 17 places in 144 ms of which 2 ms to minimize.
[2024-05-24 04:16:26] [INFO ] Deduced a trap composed of 21 places in 140 ms of which 3 ms to minimize.
[2024-05-24 04:16:26] [INFO ] Deduced a trap composed of 11 places in 142 ms of which 2 ms to minimize.
[2024-05-24 04:16:26] [INFO ] Deduced a trap composed of 15 places in 142 ms of which 2 ms to minimize.
[2024-05-24 04:16:27] [INFO ] Deduced a trap composed of 59 places in 160 ms of which 2 ms to minimize.
[2024-05-24 04:16:27] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 3 ms to minimize.
[2024-05-24 04:16:27] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:16:28] [INFO ] Deduced a trap composed of 34 places in 150 ms of which 3 ms to minimize.
[2024-05-24 04:16:29] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-05-24 04:16:29] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:16:30] [INFO ] Deduced a trap composed of 13 places in 218 ms of which 3 ms to minimize.
[2024-05-24 04:16:31] [INFO ] Deduced a trap composed of 17 places in 177 ms of which 3 ms to minimize.
[2024-05-24 04:16:32] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 2 ms to minimize.
[2024-05-24 04:16:33] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:16:33] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 2 ms to minimize.
[2024-05-24 04:16:34] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 3 ms to minimize.
[2024-05-24 04:16:34] [INFO ] Deduced a trap composed of 50 places in 266 ms of which 4 ms to minimize.
[2024-05-24 04:16:34] [INFO ] Deduced a trap composed of 44 places in 268 ms of which 2 ms to minimize.
[2024-05-24 04:16:35] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 3 ms to minimize.
[2024-05-24 04:16:36] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 2 ms to minimize.
[2024-05-24 04:16:36] [INFO ] Deduced a trap composed of 19 places in 198 ms of which 2 ms to minimize.
[2024-05-24 04:16:37] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 2 ms to minimize.
[2024-05-24 04:16:37] [INFO ] Deduced a trap composed of 50 places in 288 ms of which 3 ms to minimize.
[2024-05-24 04:16:37] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:16:38] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 4 ms to minimize.
[2024-05-24 04:16:38] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 1 ms to minimize.
[2024-05-24 04:16:38] [INFO ] Deduced a trap composed of 23 places in 318 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:16:50] [INFO ] Deduced a trap composed of 39 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:16:50] [INFO ] Deduced a trap composed of 33 places in 204 ms of which 4 ms to minimize.
[2024-05-24 04:16:52] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 6 ms to minimize.
[2024-05-24 04:16:53] [INFO ] Deduced a trap composed of 47 places in 258 ms of which 4 ms to minimize.
[2024-05-24 04:16:54] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 3 ms to minimize.
[2024-05-24 04:16:54] [INFO ] Deduced a trap composed of 66 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:16:54] [INFO ] Deduced a trap composed of 60 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:16:55] [INFO ] Deduced a trap composed of 55 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:16:55] [INFO ] Deduced a trap composed of 61 places in 245 ms of which 4 ms to minimize.
[2024-05-24 04:16:55] [INFO ] Deduced a trap composed of 33 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:16:56] [INFO ] Deduced a trap composed of 51 places in 260 ms of which 3 ms to minimize.
[2024-05-24 04:16:57] [INFO ] Deduced a trap composed of 53 places in 305 ms of which 4 ms to minimize.
[2024-05-24 04:16:57] [INFO ] Deduced a trap composed of 37 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:16:57] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 3 ms to minimize.
[2024-05-24 04:16:58] [INFO ] Deduced a trap composed of 46 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:16:58] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:16:58] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:16:59] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:16:59] [INFO ] Deduced a trap composed of 45 places in 308 ms of which 3 ms to minimize.
[2024-05-24 04:17:00] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:17:01] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:17:02] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:17:05] [INFO ] Deduced a trap composed of 47 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:17:06] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:17:06] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 3 ms to minimize.
[2024-05-24 04:17:07] [INFO ] Deduced a trap composed of 42 places in 255 ms of which 3 ms to minimize.
[2024-05-24 04:17:07] [INFO ] Deduced a trap composed of 55 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:17:08] [INFO ] Deduced a trap composed of 27 places in 307 ms of which 4 ms to minimize.
[2024-05-24 04:17:08] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 3 ms to minimize.
[2024-05-24 04:17:10] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 2 ms to minimize.
[2024-05-24 04:17:10] [INFO ] Deduced a trap composed of 25 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:17:11] [INFO ] Deduced a trap composed of 40 places in 269 ms of which 3 ms to minimize.
[2024-05-24 04:17:11] [INFO ] Deduced a trap composed of 43 places in 254 ms of which 4 ms to minimize.
[2024-05-24 04:17:11] [INFO ] Deduced a trap composed of 40 places in 252 ms of which 4 ms to minimize.
[2024-05-24 04:17:11] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 3 ms to minimize.
[2024-05-24 04:17:12] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 3 ms to minimize.
[2024-05-24 04:17:12] [INFO ] Deduced a trap composed of 37 places in 250 ms of which 3 ms to minimize.
[2024-05-24 04:17:12] [INFO ] Deduced a trap composed of 40 places in 247 ms of which 4 ms to minimize.
[2024-05-24 04:17:13] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:17:13] [INFO ] Deduced a trap composed of 34 places in 282 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 99 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 80/80 constraints]
After SMT, in 60570ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60582ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62289 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 38 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-05-24 04:17:17] [INFO ] Computed 13 invariants in 2 ms
[2024-05-24 04:17:17] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 04:17:17] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:17:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 04:17:17] [INFO ] After 109ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:17:17] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 04:17:17] [INFO ] After 72ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-24 04:17:17] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 04:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-24 04:17:17] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 04:17:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-05-24 04:17:17] [INFO ] After 307ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-24 04:17:17] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 774 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 203 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 323 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 182 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 228 ms.
Product exploration explored 100000 steps with 0 reset in 312 ms.
Built C files in :
/tmp/ltsmin14483083699337751436
[2024-05-24 04:17:19] [INFO ] Built C files in 50ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14483083699337751436
Running compilation step : cd /tmp/ltsmin14483083699337751436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14483083699337751436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14483083699337751436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 9 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 04:17:22] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 04:17:22] [INFO ] Computed 19 invariants in 6 ms
[2024-05-24 04:17:22] [INFO ] Implicit Places using invariants in 327 ms returned []
[2024-05-24 04:17:22] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:17:22] [INFO ] Invariant cache hit.
[2024-05-24 04:17:23] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:17:24] [INFO ] Implicit Places using invariants and state equation in 1896 ms returned []
Implicit Place search using SMT with State Equation took 2227 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:17:24] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:17:24] [INFO ] Invariant cache hit.
[2024-05-24 04:17:24] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:17:39] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-05-24 04:17:39] [INFO ] Deduced a trap composed of 34 places in 248 ms of which 4 ms to minimize.
[2024-05-24 04:17:40] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 4 ms to minimize.
[2024-05-24 04:17:40] [INFO ] Deduced a trap composed of 32 places in 297 ms of which 5 ms to minimize.
[2024-05-24 04:17:40] [INFO ] Deduced a trap composed of 26 places in 196 ms of which 3 ms to minimize.
[2024-05-24 04:17:40] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 23 places in 356 ms of which 5 ms to minimize.
[2024-05-24 04:17:41] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-24 04:17:42] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 2 ms to minimize.
[2024-05-24 04:17:42] [INFO ] Deduced a trap composed of 96 places in 313 ms of which 5 ms to minimize.
[2024-05-24 04:17:42] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 5 ms to minimize.
[2024-05-24 04:17:43] [INFO ] Deduced a trap composed of 58 places in 293 ms of which 5 ms to minimize.
[2024-05-24 04:17:44] [INFO ] Deduced a trap composed of 54 places in 448 ms of which 5 ms to minimize.
[2024-05-24 04:17:45] [INFO ] Deduced a trap composed of 80 places in 252 ms of which 3 ms to minimize.
[2024-05-24 04:17:45] [INFO ] Deduced a trap composed of 72 places in 255 ms of which 4 ms to minimize.
[2024-05-24 04:17:45] [INFO ] Deduced a trap composed of 78 places in 254 ms of which 3 ms to minimize.
[2024-05-24 04:17:45] [INFO ] Deduced a trap composed of 74 places in 226 ms of which 4 ms to minimize.
[2024-05-24 04:17:46] [INFO ] Deduced a trap composed of 50 places in 284 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:17:47] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:17:47] [INFO ] Deduced a trap composed of 74 places in 257 ms of which 5 ms to minimize.
[2024-05-24 04:17:49] [INFO ] Deduced a trap composed of 89 places in 345 ms of which 5 ms to minimize.
[2024-05-24 04:17:49] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:17:49] [INFO ] Deduced a trap composed of 86 places in 214 ms of which 4 ms to minimize.
[2024-05-24 04:17:49] [INFO ] Deduced a trap composed of 75 places in 229 ms of which 5 ms to minimize.
[2024-05-24 04:17:50] [INFO ] Deduced a trap composed of 76 places in 374 ms of which 6 ms to minimize.
[2024-05-24 04:17:50] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 5 ms to minimize.
[2024-05-24 04:17:51] [INFO ] Deduced a trap composed of 3 places in 460 ms of which 6 ms to minimize.
[2024-05-24 04:17:51] [INFO ] Deduced a trap composed of 86 places in 420 ms of which 5 ms to minimize.
[2024-05-24 04:17:51] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-24 04:17:52] [INFO ] Deduced a trap composed of 86 places in 418 ms of which 5 ms to minimize.
[2024-05-24 04:17:52] [INFO ] Deduced a trap composed of 86 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:17:52] [INFO ] Deduced a trap composed of 102 places in 313 ms of which 3 ms to minimize.
[2024-05-24 04:17:53] [INFO ] Deduced a trap composed of 72 places in 304 ms of which 4 ms to minimize.
[2024-05-24 04:17:53] [INFO ] Deduced a trap composed of 20 places in 337 ms of which 5 ms to minimize.
[2024-05-24 04:17:53] [INFO ] Deduced a trap composed of 105 places in 382 ms of which 6 ms to minimize.
[2024-05-24 04:17:54] [INFO ] Deduced a trap composed of 50 places in 384 ms of which 5 ms to minimize.
[2024-05-24 04:17:54] [INFO ] Deduced a trap composed of 77 places in 382 ms of which 5 ms to minimize.
[2024-05-24 04:17:55] [INFO ] Deduced a trap composed of 100 places in 393 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:17:57] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-24 04:17:58] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:17:59] [INFO ] Deduced a trap composed of 86 places in 305 ms of which 5 ms to minimize.
[2024-05-24 04:18:00] [INFO ] Deduced a trap composed of 91 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:18:00] [INFO ] Deduced a trap composed of 54 places in 259 ms of which 4 ms to minimize.
[2024-05-24 04:18:00] [INFO ] Deduced a trap composed of 70 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:18:01] [INFO ] Deduced a trap composed of 90 places in 288 ms of which 5 ms to minimize.
[2024-05-24 04:18:01] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 2 ms to minimize.
[2024-05-24 04:18:02] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:18:02] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2024-05-24 04:18:03] [INFO ] Deduced a trap composed of 77 places in 412 ms of which 5 ms to minimize.
[2024-05-24 04:18:04] [INFO ] Deduced a trap composed of 58 places in 433 ms of which 6 ms to minimize.
[2024-05-24 04:18:04] [INFO ] Deduced a trap composed of 98 places in 413 ms of which 6 ms to minimize.
[2024-05-24 04:18:04] [INFO ] Deduced a trap composed of 38 places in 403 ms of which 5 ms to minimize.
[2024-05-24 04:18:05] [INFO ] Deduced a trap composed of 55 places in 404 ms of which 5 ms to minimize.
[2024-05-24 04:18:05] [INFO ] Deduced a trap composed of 103 places in 404 ms of which 5 ms to minimize.
[2024-05-24 04:18:06] [INFO ] Deduced a trap composed of 108 places in 405 ms of which 6 ms to minimize.
[2024-05-24 04:18:06] [INFO ] Deduced a trap composed of 39 places in 396 ms of which 6 ms to minimize.
[2024-05-24 04:18:07] [INFO ] Deduced a trap composed of 87 places in 409 ms of which 6 ms to minimize.
[2024-05-24 04:18:07] [INFO ] Deduced a trap composed of 39 places in 420 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:18:08] [INFO ] Deduced a trap composed of 58 places in 281 ms of which 4 ms to minimize.
[2024-05-24 04:18:10] [INFO ] Deduced a trap composed of 114 places in 461 ms of which 6 ms to minimize.
[2024-05-24 04:18:11] [INFO ] Deduced a trap composed of 93 places in 465 ms of which 6 ms to minimize.
[2024-05-24 04:18:11] [INFO ] Deduced a trap composed of 91 places in 407 ms of which 6 ms to minimize.
[2024-05-24 04:18:11] [INFO ] Deduced a trap composed of 93 places in 376 ms of which 5 ms to minimize.
[2024-05-24 04:18:12] [INFO ] Deduced a trap composed of 24 places in 415 ms of which 5 ms to minimize.
[2024-05-24 04:18:12] [INFO ] Deduced a trap composed of 22 places in 399 ms of which 6 ms to minimize.
[2024-05-24 04:18:13] [INFO ] Deduced a trap composed of 84 places in 372 ms of which 5 ms to minimize.
[2024-05-24 04:18:13] [INFO ] Deduced a trap composed of 93 places in 395 ms of which 5 ms to minimize.
[2024-05-24 04:18:14] [INFO ] Deduced a trap composed of 72 places in 372 ms of which 5 ms to minimize.
[2024-05-24 04:18:14] [INFO ] Deduced a trap composed of 82 places in 387 ms of which 5 ms to minimize.
[2024-05-24 04:18:15] [INFO ] Deduced a trap composed of 69 places in 395 ms of which 6 ms to minimize.
[2024-05-24 04:18:15] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 2 ms to minimize.
[2024-05-24 04:18:15] [INFO ] Deduced a trap composed of 95 places in 317 ms of which 5 ms to minimize.
[2024-05-24 04:18:16] [INFO ] Deduced a trap composed of 96 places in 333 ms of which 5 ms to minimize.
[2024-05-24 04:18:16] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2024-05-24 04:18:18] [INFO ] Deduced a trap composed of 89 places in 414 ms of which 6 ms to minimize.
[2024-05-24 04:18:18] [INFO ] Deduced a trap composed of 103 places in 307 ms of which 5 ms to minimize.
[2024-05-24 04:18:19] [INFO ] Deduced a trap composed of 38 places in 433 ms of which 5 ms to minimize.
[2024-05-24 04:18:19] [INFO ] Deduced a trap composed of 113 places in 428 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:18:20] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 2 ms to minimize.
[2024-05-24 04:18:23] [INFO ] Deduced a trap composed of 60 places in 360 ms of which 4 ms to minimize.
[2024-05-24 04:18:23] [INFO ] Deduced a trap composed of 41 places in 321 ms of which 5 ms to minimize.
[2024-05-24 04:18:24] [INFO ] Deduced a trap composed of 86 places in 300 ms of which 5 ms to minimize.
[2024-05-24 04:18:25] [INFO ] Deduced a trap composed of 93 places in 414 ms of which 6 ms to minimize.
[2024-05-24 04:18:25] [INFO ] Deduced a trap composed of 75 places in 371 ms of which 6 ms to minimize.
SMT process timed out in 61043ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 61062ms
Finished structural reductions in LTL mode , in 1 iterations and 63301 ms. Remains : 384/384 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin697385302972006441
[2024-05-24 04:18:25] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin697385302972006441
Running compilation step : cd /tmp/ltsmin697385302972006441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin697385302972006441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin697385302972006441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 04:18:29] [INFO ] Flatten gal took : 94 ms
[2024-05-24 04:18:29] [INFO ] Flatten gal took : 59 ms
[2024-05-24 04:18:29] [INFO ] Time to serialize gal into /tmp/LTL8548134385921063975.gal : 16 ms
[2024-05-24 04:18:29] [INFO ] Time to serialize properties into /tmp/LTL14146660287725214771.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8548134385921063975.gal' '-t' 'CGAL' '-hoa' '/tmp/aut946997565280944942.hoa' '-atoms' '/tmp/LTL14146660287725214771.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL14146660287725214771.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut946997565280944942.hoa
Detected timeout of ITS tools.
[2024-05-24 04:18:44] [INFO ] Flatten gal took : 50 ms
[2024-05-24 04:18:44] [INFO ] Flatten gal took : 49 ms
[2024-05-24 04:18:44] [INFO ] Time to serialize gal into /tmp/LTL10143183993805744498.gal : 13 ms
[2024-05-24 04:18:44] [INFO ] Time to serialize properties into /tmp/LTL4432177038774933922.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10143183993805744498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4432177038774933922.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))"))||(G("(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))")))||((X(X("(((t...266
Formula 0 simplified : G(F!"(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))" & X(!"(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))" | X!"(((turn_5==1)&...193
Detected timeout of ITS tools.
[2024-05-24 04:18:59] [INFO ] Flatten gal took : 46 ms
[2024-05-24 04:18:59] [INFO ] Applying decomposition
[2024-05-24 04:18:59] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph214047058303973105.txt' '-o' '/tmp/graph214047058303973105.bin' '-w' '/tmp/graph214047058303973105.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph214047058303973105.bin' '-l' '-1' '-v' '-w' '/tmp/graph214047058303973105.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:18:59] [INFO ] Decomposing Gal with order
[2024-05-24 04:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:19:00] [INFO ] Removed a total of 1894 redundant transitions.
[2024-05-24 04:19:00] [INFO ] Flatten gal took : 342 ms
[2024-05-24 04:19:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 323 labels/synchronizations in 77 ms.
[2024-05-24 04:19:00] [INFO ] Time to serialize gal into /tmp/LTL631113349177972133.gal : 20 ms
[2024-05-24 04:19:00] [INFO ] Time to serialize properties into /tmp/LTL11900599582931832585.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL631113349177972133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11900599582931832585.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((i0.u1.turn_5==1)&&(i17.u3.flag_5_active==1))&&(i11.i2.u93.p25_2_1==1))"))||(G("(((i0.u1.turn_5==0)||(i17.u3.flag_5_active...358
Formula 0 simplified : G(F!"(((i0.u1.turn_5==0)||(i17.u3.flag_5_active==0))||(i17.u3.p25_4_1==0))" & X(!"(((i0.u1.turn_5==1)&&(i17.u3.flag_5_active==1))&&(...261
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 378472 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(p1)&&p0)))'
Support contains 6 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 27 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 04:19:15] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:19:15] [INFO ] Invariant cache hit.
[2024-05-24 04:19:16] [INFO ] Implicit Places using invariants in 490 ms returned []
[2024-05-24 04:19:16] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:19:16] [INFO ] Invariant cache hit.
[2024-05-24 04:19:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:19:18] [INFO ] Implicit Places using invariants and state equation in 2237 ms returned []
Implicit Place search using SMT with State Equation took 2731 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:19:18] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:19:18] [INFO ] Invariant cache hit.
[2024-05-24 04:19:18] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:19:34] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 5 ms to minimize.
[2024-05-24 04:19:34] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 4 ms to minimize.
[2024-05-24 04:19:34] [INFO ] Deduced a trap composed of 29 places in 298 ms of which 4 ms to minimize.
[2024-05-24 04:19:34] [INFO ] Deduced a trap composed of 32 places in 325 ms of which 4 ms to minimize.
[2024-05-24 04:19:35] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 3 ms to minimize.
[2024-05-24 04:19:35] [INFO ] Deduced a trap composed of 21 places in 245 ms of which 4 ms to minimize.
[2024-05-24 04:19:35] [INFO ] Deduced a trap composed of 35 places in 186 ms of which 3 ms to minimize.
[2024-05-24 04:19:35] [INFO ] Deduced a trap composed of 32 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:19:36] [INFO ] Deduced a trap composed of 23 places in 344 ms of which 5 ms to minimize.
[2024-05-24 04:19:36] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 3 ms to minimize.
[2024-05-24 04:19:36] [INFO ] Deduced a trap composed of 28 places in 159 ms of which 3 ms to minimize.
[2024-05-24 04:19:36] [INFO ] Deduced a trap composed of 96 places in 293 ms of which 5 ms to minimize.
[2024-05-24 04:19:37] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 4 ms to minimize.
[2024-05-24 04:19:37] [INFO ] Deduced a trap composed of 58 places in 285 ms of which 4 ms to minimize.
[2024-05-24 04:19:39] [INFO ] Deduced a trap composed of 54 places in 435 ms of which 6 ms to minimize.
[2024-05-24 04:19:39] [INFO ] Deduced a trap composed of 80 places in 415 ms of which 6 ms to minimize.
[2024-05-24 04:19:40] [INFO ] Deduced a trap composed of 72 places in 404 ms of which 6 ms to minimize.
[2024-05-24 04:19:40] [INFO ] Deduced a trap composed of 78 places in 410 ms of which 6 ms to minimize.
[2024-05-24 04:19:41] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 4 ms to minimize.
[2024-05-24 04:19:41] [INFO ] Deduced a trap composed of 50 places in 323 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:19:42] [INFO ] Deduced a trap composed of 5 places in 163 ms of which 3 ms to minimize.
[2024-05-24 04:19:42] [INFO ] Deduced a trap composed of 74 places in 228 ms of which 4 ms to minimize.
[2024-05-24 04:19:44] [INFO ] Deduced a trap composed of 89 places in 398 ms of which 5 ms to minimize.
[2024-05-24 04:19:44] [INFO ] Deduced a trap composed of 76 places in 385 ms of which 5 ms to minimize.
[2024-05-24 04:19:44] [INFO ] Deduced a trap composed of 86 places in 383 ms of which 6 ms to minimize.
[2024-05-24 04:19:45] [INFO ] Deduced a trap composed of 75 places in 388 ms of which 6 ms to minimize.
[2024-05-24 04:19:45] [INFO ] Deduced a trap composed of 76 places in 365 ms of which 5 ms to minimize.
[2024-05-24 04:19:46] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 6 ms to minimize.
[2024-05-24 04:19:46] [INFO ] Deduced a trap composed of 3 places in 431 ms of which 6 ms to minimize.
[2024-05-24 04:19:47] [INFO ] Deduced a trap composed of 86 places in 425 ms of which 7 ms to minimize.
[2024-05-24 04:19:47] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-24 04:19:47] [INFO ] Deduced a trap composed of 86 places in 368 ms of which 5 ms to minimize.
[2024-05-24 04:19:47] [INFO ] Deduced a trap composed of 86 places in 320 ms of which 5 ms to minimize.
[2024-05-24 04:19:48] [INFO ] Deduced a trap composed of 102 places in 435 ms of which 6 ms to minimize.
[2024-05-24 04:19:48] [INFO ] Deduced a trap composed of 72 places in 417 ms of which 5 ms to minimize.
[2024-05-24 04:19:49] [INFO ] Deduced a trap composed of 20 places in 355 ms of which 5 ms to minimize.
SMT process timed out in 30905ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30924ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33685 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-03 finished in 33896 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(((p1||X(F(p2)))&&p0)))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 385 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 385 transition count 1122
Applied a total of 10 rules in 21 ms. Remains 385 /390 variables (removed 5) and now considering 1122/1152 (removed 30) transitions.
[2024-05-24 04:19:49] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-05-24 04:19:49] [INFO ] Computed 19 invariants in 5 ms
[2024-05-24 04:19:50] [INFO ] Implicit Places using invariants in 710 ms returned []
[2024-05-24 04:19:50] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 04:19:50] [INFO ] Invariant cache hit.
[2024-05-24 04:19:50] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 04:19:52] [INFO ] Implicit Places using invariants and state equation in 2019 ms returned []
Implicit Place search using SMT with State Equation took 2731 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-24 04:19:52] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 04:19:52] [INFO ] Invariant cache hit.
[2024-05-24 04:19:52] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 04:20:06] [INFO ] Deduced a trap composed of 44 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:20:06] [INFO ] Deduced a trap composed of 38 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:20:07] [INFO ] Deduced a trap composed of 20 places in 402 ms of which 9 ms to minimize.
[2024-05-24 04:20:07] [INFO ] Deduced a trap composed of 35 places in 387 ms of which 5 ms to minimize.
[2024-05-24 04:20:07] [INFO ] Deduced a trap composed of 74 places in 395 ms of which 6 ms to minimize.
[2024-05-24 04:20:08] [INFO ] Deduced a trap composed of 64 places in 397 ms of which 5 ms to minimize.
[2024-05-24 04:20:08] [INFO ] Deduced a trap composed of 58 places in 352 ms of which 5 ms to minimize.
[2024-05-24 04:20:09] [INFO ] Deduced a trap composed of 83 places in 387 ms of which 5 ms to minimize.
[2024-05-24 04:20:09] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 5 ms to minimize.
[2024-05-24 04:20:09] [INFO ] Deduced a trap composed of 58 places in 352 ms of which 5 ms to minimize.
[2024-05-24 04:20:10] [INFO ] Deduced a trap composed of 58 places in 317 ms of which 5 ms to minimize.
[2024-05-24 04:20:10] [INFO ] Deduced a trap composed of 72 places in 330 ms of which 5 ms to minimize.
[2024-05-24 04:20:10] [INFO ] Deduced a trap composed of 57 places in 344 ms of which 6 ms to minimize.
[2024-05-24 04:20:11] [INFO ] Deduced a trap composed of 58 places in 329 ms of which 7 ms to minimize.
[2024-05-24 04:20:11] [INFO ] Deduced a trap composed of 74 places in 293 ms of which 5 ms to minimize.
[2024-05-24 04:20:13] [INFO ] Deduced a trap composed of 53 places in 423 ms of which 6 ms to minimize.
[2024-05-24 04:20:13] [INFO ] Deduced a trap composed of 76 places in 449 ms of which 6 ms to minimize.
[2024-05-24 04:20:13] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:20:14] [INFO ] Deduced a trap composed of 68 places in 404 ms of which 6 ms to minimize.
[2024-05-24 04:20:14] [INFO ] Deduced a trap composed of 60 places in 421 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 04:20:15] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 3 ms to minimize.
[2024-05-24 04:20:15] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 5 ms to minimize.
[2024-05-24 04:20:15] [INFO ] Deduced a trap composed of 32 places in 131 ms of which 2 ms to minimize.
[2024-05-24 04:20:17] [INFO ] Deduced a trap composed of 56 places in 376 ms of which 5 ms to minimize.
[2024-05-24 04:20:18] [INFO ] Deduced a trap composed of 75 places in 421 ms of which 5 ms to minimize.
[2024-05-24 04:20:18] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 2 ms to minimize.
[2024-05-24 04:20:18] [INFO ] Deduced a trap composed of 57 places in 400 ms of which 6 ms to minimize.
[2024-05-24 04:20:19] [INFO ] Deduced a trap composed of 60 places in 357 ms of which 5 ms to minimize.
[2024-05-24 04:20:19] [INFO ] Deduced a trap composed of 83 places in 361 ms of which 5 ms to minimize.
[2024-05-24 04:20:19] [INFO ] Deduced a trap composed of 65 places in 370 ms of which 5 ms to minimize.
[2024-05-24 04:20:20] [INFO ] Deduced a trap composed of 78 places in 394 ms of which 5 ms to minimize.
[2024-05-24 04:20:20] [INFO ] Deduced a trap composed of 64 places in 400 ms of which 5 ms to minimize.
[2024-05-24 04:20:21] [INFO ] Deduced a trap composed of 52 places in 376 ms of which 5 ms to minimize.
[2024-05-24 04:20:21] [INFO ] Deduced a trap composed of 76 places in 336 ms of which 5 ms to minimize.
[2024-05-24 04:20:22] [INFO ] Deduced a trap composed of 70 places in 341 ms of which 6 ms to minimize.
[2024-05-24 04:20:22] [INFO ] Deduced a trap composed of 88 places in 372 ms of which 5 ms to minimize.
[2024-05-24 04:20:23] [INFO ] Deduced a trap composed of 85 places in 329 ms of which 4 ms to minimize.
SMT process timed out in 30844ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 30863ms
Starting structural reductions in LTL mode, iteration 1 : 385/390 places, 1122/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33622 ms. Remains : 385/390 places, 1122/1152 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-04 finished in 33841 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 U (G(!p0)||!p0)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))))'
Support contains 5 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 18 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 04:20:23] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 04:20:23] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 04:20:23] [INFO ] Implicit Places using invariants in 579 ms returned []
[2024-05-24 04:20:23] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:20:23] [INFO ] Invariant cache hit.
[2024-05-24 04:20:24] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:20:26] [INFO ] Implicit Places using invariants and state equation in 2168 ms returned []
Implicit Place search using SMT with State Equation took 2752 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:20:26] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:20:26] [INFO ] Invariant cache hit.
[2024-05-24 04:20:26] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:20:41] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:20:41] [INFO ] Deduced a trap composed of 34 places in 267 ms of which 4 ms to minimize.
[2024-05-24 04:20:42] [INFO ] Deduced a trap composed of 29 places in 290 ms of which 5 ms to minimize.
[2024-05-24 04:20:42] [INFO ] Deduced a trap composed of 32 places in 319 ms of which 5 ms to minimize.
[2024-05-24 04:20:42] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:20:43] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:20:43] [INFO ] Deduced a trap composed of 35 places in 194 ms of which 3 ms to minimize.
[2024-05-24 04:20:43] [INFO ] Deduced a trap composed of 32 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:20:43] [INFO ] Deduced a trap composed of 23 places in 367 ms of which 5 ms to minimize.
[2024-05-24 04:20:44] [INFO ] Deduced a trap composed of 38 places in 149 ms of which 2 ms to minimize.
[2024-05-24 04:20:44] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-05-24 04:20:44] [INFO ] Deduced a trap composed of 96 places in 297 ms of which 4 ms to minimize.
[2024-05-24 04:20:44] [INFO ] Deduced a trap composed of 29 places in 296 ms of which 5 ms to minimize.
[2024-05-24 04:20:45] [INFO ] Deduced a trap composed of 58 places in 268 ms of which 4 ms to minimize.
[2024-05-24 04:20:46] [INFO ] Deduced a trap composed of 54 places in 464 ms of which 6 ms to minimize.
[2024-05-24 04:20:47] [INFO ] Deduced a trap composed of 80 places in 427 ms of which 6 ms to minimize.
[2024-05-24 04:20:47] [INFO ] Deduced a trap composed of 72 places in 433 ms of which 5 ms to minimize.
[2024-05-24 04:20:48] [INFO ] Deduced a trap composed of 78 places in 386 ms of which 5 ms to minimize.
[2024-05-24 04:20:48] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 5 ms to minimize.
[2024-05-24 04:20:48] [INFO ] Deduced a trap composed of 50 places in 296 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:20:49] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 3 ms to minimize.
[2024-05-24 04:20:50] [INFO ] Deduced a trap composed of 74 places in 256 ms of which 4 ms to minimize.
[2024-05-24 04:20:51] [INFO ] Deduced a trap composed of 89 places in 399 ms of which 5 ms to minimize.
[2024-05-24 04:20:52] [INFO ] Deduced a trap composed of 76 places in 404 ms of which 5 ms to minimize.
[2024-05-24 04:20:52] [INFO ] Deduced a trap composed of 86 places in 392 ms of which 5 ms to minimize.
[2024-05-24 04:20:53] [INFO ] Deduced a trap composed of 75 places in 402 ms of which 6 ms to minimize.
[2024-05-24 04:20:53] [INFO ] Deduced a trap composed of 76 places in 405 ms of which 5 ms to minimize.
[2024-05-24 04:20:54] [INFO ] Deduced a trap composed of 4 places in 449 ms of which 6 ms to minimize.
[2024-05-24 04:20:54] [INFO ] Deduced a trap composed of 3 places in 456 ms of which 5 ms to minimize.
[2024-05-24 04:20:54] [INFO ] Deduced a trap composed of 86 places in 399 ms of which 5 ms to minimize.
[2024-05-24 04:20:55] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-24 04:20:55] [INFO ] Deduced a trap composed of 86 places in 394 ms of which 5 ms to minimize.
[2024-05-24 04:20:55] [INFO ] Deduced a trap composed of 86 places in 324 ms of which 5 ms to minimize.
[2024-05-24 04:20:56] [INFO ] Deduced a trap composed of 102 places in 353 ms of which 5 ms to minimize.
[2024-05-24 04:20:56] [INFO ] Deduced a trap composed of 72 places in 421 ms of which 6 ms to minimize.
[2024-05-24 04:20:57] [INFO ] Deduced a trap composed of 20 places in 440 ms of which 6 ms to minimize.
SMT process timed out in 31040ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 31060ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33834 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 298 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 511 ms.
Product exploration explored 100000 steps with 0 reset in 449 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 152 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 536 ms. (74 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 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
[2024-05-24 04:20:59] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:20:59] [INFO ] Invariant cache hit.
[2024-05-24 04:20:59] [INFO ] State equation strengthened by 164 read => feed constraints.
Problem apf3 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 124/129 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/195 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 291/486 variables, 195/205 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 46/251 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/251 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/540 variables, 24/275 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/540 variables, 15/290 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 0/290 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 159/699 variables, 6/296 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/699 variables, 0/296 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/705 variables, 3/299 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/705 variables, 0/299 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 201/906 variables, 165/464 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/906 variables, 103/567 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 0/567 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/906 variables, 0/567 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 567 constraints, problems are : Problem set: 3 solved, 2 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/129 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/195 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-24 04:21:00] [INFO ] Deduced a trap composed of 3 places in 134 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 46/252 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/252 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/276 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 15/291 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 2/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 0/302 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 201/906 variables, 165/467 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 103/570 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-24 04:21:01] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 1/571 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 0/571 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/906 variables, 0/571 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 571 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1386 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 2194ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 216 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 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 384 transition count 1111
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 379 transition count 1111
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 379 transition count 997
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 235 transition count 967
Applied a total of 298 rules in 72 ms. Remains 235 /384 variables (removed 149) and now considering 967/1116 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 235/384 places, 967/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 816 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 314874 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :0 out of 2
Probabilistic random walk after 314874 steps, saw 94181 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
[2024-05-24 04:21:05] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 04:21:05] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 04:21:05] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/338 variables, 121/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/392 variables, 24/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 18/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/476 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/482 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 126/608 variables, 90/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 100/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/608 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 471 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:21:05] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:21:06] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 54/392 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 18/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/392 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 84/476 variables, 6/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/476 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 6/482 variables, 3/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 933 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1419ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 89 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 36 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 34 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 04:21:06] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:21:06] [INFO ] Invariant cache hit.
[2024-05-24 04:21:07] [INFO ] Implicit Places using invariants in 560 ms returned []
[2024-05-24 04:21:07] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:21:07] [INFO ] Invariant cache hit.
[2024-05-24 04:21:07] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:21:08] [INFO ] Implicit Places using invariants and state equation in 1168 ms returned []
Implicit Place search using SMT with State Equation took 1729 ms to find 0 implicit places.
[2024-05-24 04:21:08] [INFO ] Redundant transitions in 10 ms returned []
Running 961 sub problems to find dead transitions.
[2024-05-24 04:21:08] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:21:08] [INFO ] Invariant cache hit.
[2024-05-24 04:21:08] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:21:16] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
[2024-05-24 04:21:16] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-24 04:21:16] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:21:16] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-05-24 04:21:16] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2024-05-24 04:21:16] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 2 ms to minimize.
[2024-05-24 04:21:17] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 3 ms to minimize.
[2024-05-24 04:21:17] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-05-24 04:21:17] [INFO ] Deduced a trap composed of 39 places in 117 ms of which 2 ms to minimize.
[2024-05-24 04:21:17] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:21:17] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:21:17] [INFO ] Deduced a trap composed of 28 places in 146 ms of which 2 ms to minimize.
[2024-05-24 04:21:18] [INFO ] Deduced a trap composed of 56 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:21:18] [INFO ] Deduced a trap composed of 33 places in 143 ms of which 2 ms to minimize.
[2024-05-24 04:21:18] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
[2024-05-24 04:21:18] [INFO ] Deduced a trap composed of 50 places in 146 ms of which 3 ms to minimize.
[2024-05-24 04:21:18] [INFO ] Deduced a trap composed of 49 places in 131 ms of which 2 ms to minimize.
[2024-05-24 04:21:18] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 2 ms to minimize.
[2024-05-24 04:21:18] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 2 ms to minimize.
[2024-05-24 04:21:19] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:21:20] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-05-24 04:21:21] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 2 ms to minimize.
[2024-05-24 04:21:21] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-05-24 04:21:22] [INFO ] Deduced a trap composed of 17 places in 123 ms of which 2 ms to minimize.
[2024-05-24 04:21:22] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:21:25] [INFO ] Deduced a trap composed of 17 places in 308 ms of which 4 ms to minimize.
[2024-05-24 04:21:25] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 2 ms to minimize.
[2024-05-24 04:21:25] [INFO ] Deduced a trap composed of 17 places in 155 ms of which 2 ms to minimize.
[2024-05-24 04:21:25] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:21:25] [INFO ] Deduced a trap composed of 21 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:21:26] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 4 ms to minimize.
[2024-05-24 04:21:26] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:21:26] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:21:26] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-24 04:21:27] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-24 04:21:27] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 3 ms to minimize.
[2024-05-24 04:21:27] [INFO ] Deduced a trap composed of 90 places in 320 ms of which 4 ms to minimize.
[2024-05-24 04:21:28] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 4 ms to minimize.
[2024-05-24 04:21:28] [INFO ] Deduced a trap composed of 71 places in 233 ms of which 2 ms to minimize.
[2024-05-24 04:21:28] [INFO ] Deduced a trap composed of 25 places in 302 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:21:45] [INFO ] Deduced a trap composed of 30 places in 66 ms of which 1 ms to minimize.
[2024-05-24 04:21:45] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 2 ms to minimize.
[2024-05-24 04:21:46] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2024-05-24 04:21:46] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2024-05-24 04:21:46] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2024-05-24 04:21:46] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-05-24 04:21:46] [INFO ] Deduced a trap composed of 48 places in 130 ms of which 2 ms to minimize.
[2024-05-24 04:21:46] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2024-05-24 04:21:47] [INFO ] Deduced a trap composed of 48 places in 149 ms of which 2 ms to minimize.
[2024-05-24 04:21:47] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2024-05-24 04:21:47] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 2 ms to minimize.
[2024-05-24 04:21:47] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2024-05-24 04:21:47] [INFO ] Deduced a trap composed of 47 places in 147 ms of which 3 ms to minimize.
[2024-05-24 04:21:48] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
[2024-05-24 04:21:48] [INFO ] Deduced a trap composed of 44 places in 161 ms of which 2 ms to minimize.
[2024-05-24 04:21:48] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2024-05-24 04:21:48] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 3 ms to minimize.
[2024-05-24 04:21:49] [INFO ] Deduced a trap composed of 46 places in 121 ms of which 2 ms to minimize.
[2024-05-24 04:21:49] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 2 ms to minimize.
[2024-05-24 04:21:49] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:21:55] [INFO ] Deduced a trap composed of 45 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:21:55] [INFO ] Deduced a trap composed of 50 places in 162 ms of which 2 ms to minimize.
[2024-05-24 04:21:55] [INFO ] Deduced a trap composed of 59 places in 151 ms of which 2 ms to minimize.
[2024-05-24 04:21:56] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 2 ms to minimize.
[2024-05-24 04:21:56] [INFO ] Deduced a trap composed of 68 places in 180 ms of which 3 ms to minimize.
[2024-05-24 04:21:56] [INFO ] Deduced a trap composed of 62 places in 173 ms of which 2 ms to minimize.
[2024-05-24 04:21:56] [INFO ] Deduced a trap composed of 64 places in 182 ms of which 2 ms to minimize.
[2024-05-24 04:21:57] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 2 ms to minimize.
[2024-05-24 04:21:57] [INFO ] Deduced a trap composed of 68 places in 178 ms of which 2 ms to minimize.
[2024-05-24 04:21:57] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 3 ms to minimize.
[2024-05-24 04:21:57] [INFO ] Deduced a trap composed of 56 places in 174 ms of which 2 ms to minimize.
[2024-05-24 04:21:57] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 2 ms to minimize.
[2024-05-24 04:21:57] [INFO ] Deduced a trap composed of 51 places in 158 ms of which 2 ms to minimize.
[2024-05-24 04:21:58] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
[2024-05-24 04:21:58] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 3 ms to minimize.
[2024-05-24 04:21:58] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 2 ms to minimize.
[2024-05-24 04:21:58] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 1 ms to minimize.
[2024-05-24 04:21:58] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 3 ms to minimize.
[2024-05-24 04:21:58] [INFO ] Deduced a trap composed of 48 places in 182 ms of which 2 ms to minimize.
[2024-05-24 04:21:59] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:22:00] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2024-05-24 04:22:00] [INFO ] Deduced a trap composed of 44 places in 137 ms of which 2 ms to minimize.
[2024-05-24 04:22:01] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2024-05-24 04:22:01] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 2 ms to minimize.
[2024-05-24 04:22:03] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 3 ms to minimize.
[2024-05-24 04:22:03] [INFO ] Deduced a trap composed of 47 places in 161 ms of which 2 ms to minimize.
[2024-05-24 04:22:04] [INFO ] Deduced a trap composed of 46 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:22:05] [INFO ] Deduced a trap composed of 49 places in 273 ms of which 3 ms to minimize.
[2024-05-24 04:22:05] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 3 ms to minimize.
[2024-05-24 04:22:06] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:22:06] [INFO ] Deduced a trap composed of 51 places in 267 ms of which 3 ms to minimize.
[2024-05-24 04:22:08] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 3 ms to minimize.
[2024-05-24 04:22:09] [INFO ] Deduced a trap composed of 54 places in 280 ms of which 4 ms to minimize.
SMT process timed out in 60583ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60593ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62373 ms. Remains : 235/235 places, 967/967 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 24 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-05-24 04:22:09] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 04:22:09] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 04:22:09] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:22:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 04:22:09] [INFO ] After 59ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:22:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:22:09] [INFO ] After 27ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:22:09] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 04:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-24 04:22:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-24 04:22:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
TRAPS : Iteration 1
[2024-05-24 04:22:09] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:22:09] [INFO ] After 267ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 424 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 658 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 202 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 04:22:10] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 04:22:10] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 04:22:11] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-05-24 04:22:11] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:22:11] [INFO ] Invariant cache hit.
[2024-05-24 04:22:11] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:22:12] [INFO ] Implicit Places using invariants and state equation in 1663 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:22:12] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:22:12] [INFO ] Invariant cache hit.
[2024-05-24 04:22:12] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:22:27] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 4 ms to minimize.
[2024-05-24 04:22:28] [INFO ] Deduced a trap composed of 34 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:22:28] [INFO ] Deduced a trap composed of 29 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:22:28] [INFO ] Deduced a trap composed of 32 places in 264 ms of which 4 ms to minimize.
[2024-05-24 04:22:28] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2024-05-24 04:22:29] [INFO ] Deduced a trap composed of 21 places in 218 ms of which 4 ms to minimize.
[2024-05-24 04:22:29] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-24 04:22:29] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 4 ms to minimize.
[2024-05-24 04:22:29] [INFO ] Deduced a trap composed of 23 places in 335 ms of which 5 ms to minimize.
[2024-05-24 04:22:30] [INFO ] Deduced a trap composed of 38 places in 136 ms of which 2 ms to minimize.
[2024-05-24 04:22:30] [INFO ] Deduced a trap composed of 28 places in 167 ms of which 3 ms to minimize.
[2024-05-24 04:22:30] [INFO ] Deduced a trap composed of 96 places in 270 ms of which 5 ms to minimize.
[2024-05-24 04:22:30] [INFO ] Deduced a trap composed of 29 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:22:31] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2024-05-24 04:22:32] [INFO ] Deduced a trap composed of 54 places in 443 ms of which 6 ms to minimize.
[2024-05-24 04:22:33] [INFO ] Deduced a trap composed of 80 places in 427 ms of which 6 ms to minimize.
[2024-05-24 04:22:33] [INFO ] Deduced a trap composed of 72 places in 424 ms of which 6 ms to minimize.
[2024-05-24 04:22:33] [INFO ] Deduced a trap composed of 78 places in 428 ms of which 5 ms to minimize.
[2024-05-24 04:22:34] [INFO ] Deduced a trap composed of 74 places in 275 ms of which 4 ms to minimize.
[2024-05-24 04:22:34] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:22:35] [INFO ] Deduced a trap composed of 5 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:22:35] [INFO ] Deduced a trap composed of 74 places in 270 ms of which 5 ms to minimize.
[2024-05-24 04:22:37] [INFO ] Deduced a trap composed of 89 places in 433 ms of which 6 ms to minimize.
[2024-05-24 04:22:37] [INFO ] Deduced a trap composed of 76 places in 370 ms of which 5 ms to minimize.
[2024-05-24 04:22:38] [INFO ] Deduced a trap composed of 86 places in 384 ms of which 5 ms to minimize.
[2024-05-24 04:22:38] [INFO ] Deduced a trap composed of 75 places in 408 ms of which 5 ms to minimize.
[2024-05-24 04:22:39] [INFO ] Deduced a trap composed of 76 places in 375 ms of which 5 ms to minimize.
[2024-05-24 04:22:39] [INFO ] Deduced a trap composed of 4 places in 461 ms of which 6 ms to minimize.
[2024-05-24 04:22:40] [INFO ] Deduced a trap composed of 3 places in 423 ms of which 6 ms to minimize.
[2024-05-24 04:22:40] [INFO ] Deduced a trap composed of 86 places in 371 ms of which 5 ms to minimize.
[2024-05-24 04:22:40] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2024-05-24 04:22:40] [INFO ] Deduced a trap composed of 86 places in 366 ms of which 5 ms to minimize.
[2024-05-24 04:22:41] [INFO ] Deduced a trap composed of 86 places in 301 ms of which 5 ms to minimize.
[2024-05-24 04:22:41] [INFO ] Deduced a trap composed of 102 places in 411 ms of which 5 ms to minimize.
[2024-05-24 04:22:42] [INFO ] Deduced a trap composed of 72 places in 388 ms of which 5 ms to minimize.
[2024-05-24 04:22:42] [INFO ] Deduced a trap composed of 20 places in 394 ms of which 5 ms to minimize.
[2024-05-24 04:22:43] [INFO ] Deduced a trap composed of 105 places in 399 ms of which 5 ms to minimize.
[2024-05-24 04:22:43] [INFO ] Deduced a trap composed of 50 places in 401 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
(s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.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 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 1.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 1.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 57 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 38/57 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:22:45] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:22:46] [INFO ] Deduced a trap composed of 3 places in 329 ms of which 4 ms to minimize.
[2024-05-24 04:22:46] [INFO ] Deduced a trap composed of 59 places in 295 ms of which 5 ms to minimize.
[2024-05-24 04:22:48] [INFO ] Deduced a trap composed of 86 places in 336 ms of which 4 ms to minimize.
[2024-05-24 04:22:48] [INFO ] Deduced a trap composed of 61 places in 335 ms of which 7 ms to minimize.
[2024-05-24 04:22:48] [INFO ] Deduced a trap composed of 53 places in 304 ms of which 4 ms to minimize.
[2024-05-24 04:22:49] [INFO ] Deduced a trap composed of 91 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:22:49] [INFO ] Deduced a trap composed of 84 places in 268 ms of which 4 ms to minimize.
[2024-05-24 04:22:50] [INFO ] Deduced a trap composed of 83 places in 301 ms of which 5 ms to minimize.
[2024-05-24 04:22:51] [INFO ] Deduced a trap composed of 43 places in 340 ms of which 5 ms to minimize.
[2024-05-24 04:22:51] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 3 ms to minimize.
[2024-05-24 04:22:52] [INFO ] Deduced a trap composed of 93 places in 462 ms of which 6 ms to minimize.
[2024-05-24 04:22:53] [INFO ] Deduced a trap composed of 57 places in 477 ms of which 6 ms to minimize.
[2024-05-24 04:22:53] [INFO ] Deduced a trap composed of 106 places in 450 ms of which 7 ms to minimize.
[2024-05-24 04:22:54] [INFO ] Deduced a trap composed of 115 places in 393 ms of which 6 ms to minimize.
[2024-05-24 04:22:54] [INFO ] Deduced a trap composed of 38 places in 375 ms of which 5 ms to minimize.
[2024-05-24 04:22:55] [INFO ] Deduced a trap composed of 62 places in 464 ms of which 6 ms to minimize.
[2024-05-24 04:22:55] [INFO ] Deduced a trap composed of 86 places in 472 ms of which 6 ms to minimize.
[2024-05-24 04:22:56] [INFO ] Deduced a trap composed of 98 places in 471 ms of which 6 ms to minimize.
[2024-05-24 04:22:56] [INFO ] Deduced a trap composed of 38 places in 371 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:22:57] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 3 ms to minimize.
[2024-05-24 04:22:58] [INFO ] Deduced a trap composed of 99 places in 442 ms of which 6 ms to minimize.
[2024-05-24 04:22:59] [INFO ] Deduced a trap composed of 74 places in 345 ms of which 6 ms to minimize.
[2024-05-24 04:23:00] [INFO ] Deduced a trap composed of 46 places in 317 ms of which 3 ms to minimize.
[2024-05-24 04:23:01] [INFO ] Deduced a trap composed of 41 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:23:01] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-24 04:23:01] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:23:02] [INFO ] Deduced a trap composed of 81 places in 371 ms of which 5 ms to minimize.
[2024-05-24 04:23:02] [INFO ] Deduced a trap composed of 107 places in 419 ms of which 5 ms to minimize.
[2024-05-24 04:23:03] [INFO ] Deduced a trap composed of 74 places in 406 ms of which 6 ms to minimize.
[2024-05-24 04:23:03] [INFO ] Deduced a trap composed of 97 places in 426 ms of which 6 ms to minimize.
[2024-05-24 04:23:04] [INFO ] Deduced a trap composed of 38 places in 300 ms of which 4 ms to minimize.
[2024-05-24 04:23:04] [INFO ] Deduced a trap composed of 102 places in 424 ms of which 6 ms to minimize.
[2024-05-24 04:23:04] [INFO ] Deduced a trap composed of 77 places in 413 ms of which 5 ms to minimize.
[2024-05-24 04:23:05] [INFO ] Deduced a trap composed of 39 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:23:07] [INFO ] Deduced a trap composed of 44 places in 468 ms of which 6 ms to minimize.
[2024-05-24 04:23:07] [INFO ] Deduced a trap composed of 57 places in 406 ms of which 5 ms to minimize.
[2024-05-24 04:23:08] [INFO ] Deduced a trap composed of 17 places in 453 ms of which 6 ms to minimize.
[2024-05-24 04:23:09] [INFO ] Deduced a trap composed of 23 places in 449 ms of which 6 ms to minimize.
[2024-05-24 04:23:10] [INFO ] Deduced a trap composed of 14 places in 388 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/97 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:23:12] [INFO ] Deduced a trap composed of 82 places in 301 ms of which 5 ms to minimize.
(s306 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 1)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 98 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 79/79 constraints]
After SMT, in 60723ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60740ms
Finished structural reductions in LTL mode , in 1 iterations and 62926 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 61 ms. (645 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 2/2 properties
[2024-05-24 04:23:14] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:23:14] [INFO ] Invariant cache hit.
[2024-05-24 04:23:14] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/195 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:23:14] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 46/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 15/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 201/906 variables, 165/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/906 variables, 103/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/906 variables, 0/568 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 568 constraints, problems are : Problem set: 0 solved, 2 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 124/129 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 47/176 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/176 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/195 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/195 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/195 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 291/486 variables, 195/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 46/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/486 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/540 variables, 24/276 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/540 variables, 15/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/540 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 159/699 variables, 6/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/699 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/705 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/705 variables, 2/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/705 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 201/906 variables, 165/467 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 103/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/906 variables, 0/570 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 570 constraints, problems are : Problem set: 0 solved, 2 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 1752ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 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 384 transition count 1111
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 379 transition count 1111
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 379 transition count 997
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 298 place count 235 transition count 967
Applied a total of 298 rules in 63 ms. Remains 235 /384 variables (removed 149) and now considering 967/1116 (removed 149) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 235/384 places, 967/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 1216 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 338632 steps, run timeout after 3001 ms. (steps per millisecond=112 ) properties seen :0 out of 2
Probabilistic random walk after 338632 steps, saw 99392 distinct states, run finished after 3001 ms. (steps per millisecond=112 ) properties seen :0
[2024-05-24 04:23:19] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 04:23:19] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 04:23:19] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/338 variables, 121/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/392 variables, 24/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 18/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/476 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/482 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 126/608 variables, 90/318 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 100/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/608 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 418 constraints, problems are : Problem set: 0 solved, 2 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/338 variables, 121/131 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 46/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/392 variables, 24/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 18/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/476 variables, 6/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/482 variables, 3/228 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 2/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:23:20] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-24 04:23:20] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 953 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1472ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 171 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 35 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 33 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 04:23:21] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:23:21] [INFO ] Invariant cache hit.
[2024-05-24 04:23:21] [INFO ] Implicit Places using invariants in 529 ms returned []
[2024-05-24 04:23:21] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:23:21] [INFO ] Invariant cache hit.
[2024-05-24 04:23:22] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:23:23] [INFO ] Implicit Places using invariants and state equation in 1221 ms returned []
Implicit Place search using SMT with State Equation took 1751 ms to find 0 implicit places.
[2024-05-24 04:23:23] [INFO ] Redundant transitions in 10 ms returned []
Running 961 sub problems to find dead transitions.
[2024-05-24 04:23:23] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:23:23] [INFO ] Invariant cache hit.
[2024-05-24 04:23:23] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:23:32] [INFO ] Deduced a trap composed of 3 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:23:32] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-24 04:23:32] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:23:32] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:23:32] [INFO ] Deduced a trap composed of 33 places in 149 ms of which 2 ms to minimize.
[2024-05-24 04:23:32] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 2 ms to minimize.
[2024-05-24 04:23:33] [INFO ] Deduced a trap composed of 34 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:23:33] [INFO ] Deduced a trap composed of 35 places in 233 ms of which 4 ms to minimize.
[2024-05-24 04:23:34] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-05-24 04:23:34] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 2 ms to minimize.
[2024-05-24 04:23:34] [INFO ] Deduced a trap composed of 23 places in 106 ms of which 1 ms to minimize.
[2024-05-24 04:23:34] [INFO ] Deduced a trap composed of 28 places in 275 ms of which 4 ms to minimize.
[2024-05-24 04:23:35] [INFO ] Deduced a trap composed of 56 places in 221 ms of which 4 ms to minimize.
[2024-05-24 04:23:35] [INFO ] Deduced a trap composed of 33 places in 138 ms of which 2 ms to minimize.
[2024-05-24 04:23:35] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 2 ms to minimize.
[2024-05-24 04:23:35] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:23:35] [INFO ] Deduced a trap composed of 49 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:23:36] [INFO ] Deduced a trap composed of 54 places in 254 ms of which 5 ms to minimize.
[2024-05-24 04:23:36] [INFO ] Deduced a trap composed of 41 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:23:36] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:23:38] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:23:40] [INFO ] Deduced a trap composed of 13 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:23:40] [INFO ] Deduced a trap composed of 17 places in 196 ms of which 3 ms to minimize.
[2024-05-24 04:23:41] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 3 ms to minimize.
[2024-05-24 04:23:42] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 2 ms to minimize.
[2024-05-24 04:23:45] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 4 ms to minimize.
[2024-05-24 04:23:45] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:23:45] [INFO ] Deduced a trap composed of 17 places in 286 ms of which 3 ms to minimize.
[2024-05-24 04:23:46] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 4 ms to minimize.
[2024-05-24 04:23:46] [INFO ] Deduced a trap composed of 21 places in 259 ms of which 3 ms to minimize.
[2024-05-24 04:23:47] [INFO ] Deduced a trap composed of 45 places in 316 ms of which 4 ms to minimize.
[2024-05-24 04:23:47] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:23:47] [INFO ] Deduced a trap composed of 15 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:23:47] [INFO ] Deduced a trap composed of 37 places in 100 ms of which 1 ms to minimize.
[2024-05-24 04:23:47] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 2 ms to minimize.
[2024-05-24 04:23:48] [INFO ] Deduced a trap composed of 45 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:23:48] [INFO ] Deduced a trap composed of 90 places in 320 ms of which 4 ms to minimize.
[2024-05-24 04:23:49] [INFO ] Deduced a trap composed of 26 places in 322 ms of which 3 ms to minimize.
[2024-05-24 04:23:49] [INFO ] Deduced a trap composed of 71 places in 319 ms of which 4 ms to minimize.
[2024-05-24 04:23:49] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:24:01] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 2 ms to minimize.
[2024-05-24 04:24:01] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-24 04:24:02] [INFO ] Deduced a trap composed of 52 places in 283 ms of which 4 ms to minimize.
[2024-05-24 04:24:02] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 4 ms to minimize.
[2024-05-24 04:24:03] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:24:03] [INFO ] Deduced a trap composed of 46 places in 268 ms of which 3 ms to minimize.
[2024-05-24 04:24:03] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:24:03] [INFO ] Deduced a trap composed of 52 places in 231 ms of which 4 ms to minimize.
[2024-05-24 04:24:04] [INFO ] Deduced a trap composed of 48 places in 268 ms of which 3 ms to minimize.
[2024-05-24 04:24:04] [INFO ] Deduced a trap composed of 45 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:24:04] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 3 ms to minimize.
[2024-05-24 04:24:05] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 3 ms to minimize.
[2024-05-24 04:24:05] [INFO ] Deduced a trap composed of 47 places in 268 ms of which 4 ms to minimize.
[2024-05-24 04:24:05] [INFO ] Deduced a trap composed of 59 places in 253 ms of which 4 ms to minimize.
[2024-05-24 04:24:06] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 3 ms to minimize.
[2024-05-24 04:24:06] [INFO ] Deduced a trap composed of 44 places in 323 ms of which 3 ms to minimize.
[2024-05-24 04:24:07] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 4 ms to minimize.
[2024-05-24 04:24:07] [INFO ] Deduced a trap composed of 46 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:24:07] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 3 ms to minimize.
[2024-05-24 04:24:08] [INFO ] Deduced a trap composed of 51 places in 271 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:24:17] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 3 ms to minimize.
[2024-05-24 04:24:18] [INFO ] Deduced a trap composed of 50 places in 274 ms of which 3 ms to minimize.
[2024-05-24 04:24:18] [INFO ] Deduced a trap composed of 59 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:24:18] [INFO ] Deduced a trap composed of 61 places in 306 ms of which 4 ms to minimize.
[2024-05-24 04:24:19] [INFO ] Deduced a trap composed of 68 places in 329 ms of which 4 ms to minimize.
[2024-05-24 04:24:19] [INFO ] Deduced a trap composed of 62 places in 317 ms of which 4 ms to minimize.
[2024-05-24 04:24:19] [INFO ] Deduced a trap composed of 64 places in 304 ms of which 4 ms to minimize.
[2024-05-24 04:24:20] [INFO ] Deduced a trap composed of 54 places in 318 ms of which 4 ms to minimize.
[2024-05-24 04:24:20] [INFO ] Deduced a trap composed of 68 places in 321 ms of which 4 ms to minimize.
[2024-05-24 04:24:21] [INFO ] Deduced a trap composed of 63 places in 318 ms of which 3 ms to minimize.
[2024-05-24 04:24:21] [INFO ] Deduced a trap composed of 56 places in 311 ms of which 4 ms to minimize.
[2024-05-24 04:24:21] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 3 ms to minimize.
[2024-05-24 04:24:22] [INFO ] Deduced a trap composed of 51 places in 298 ms of which 4 ms to minimize.
[2024-05-24 04:24:22] [INFO ] Deduced a trap composed of 76 places in 248 ms of which 4 ms to minimize.
[2024-05-24 04:24:22] [INFO ] Deduced a trap composed of 59 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:24:22] [INFO ] Deduced a trap composed of 53 places in 300 ms of which 4 ms to minimize.
[2024-05-24 04:24:23] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2024-05-24 04:24:23] [INFO ] Deduced a trap composed of 45 places in 304 ms of which 4 ms to minimize.
[2024-05-24 04:24:23] [INFO ] Deduced a trap composed of 48 places in 299 ms of which 4 ms to minimize.
SMT process timed out in 60684ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60694ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62497 ms. Remains : 235/235 places, 967/967 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 2 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 28 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-05-24 04:24:23] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 04:24:23] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 04:24:23] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:24:23] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 04:24:23] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:24:23] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:24:24] [INFO ] After 25ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:24:24] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-24 04:24:24] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:24:24] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-24 04:24:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 103 ms
TRAPS : Iteration 1
[2024-05-24 04:24:24] [INFO ] After 185ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:24:24] [INFO ] After 334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 421 ms.
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 245 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 367 ms.
Product exploration explored 100000 steps with 0 reset in 607 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 384 transition count 1116
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 109 Pre rules applied. Total rules applied 5 place count 384 transition count 1284
Deduced a syphon composed of 114 places in 1 ms
Iterating global reduction 1 with 109 rules applied. Total rules applied 114 place count 384 transition count 1284
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 149 place count 384 transition count 1284
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 154 place count 379 transition count 1279
Deduced a syphon composed of 144 places in 1 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 159 place count 379 transition count 1279
Deduced a syphon composed of 144 places in 2 ms
Applied a total of 159 rules in 196 ms. Remains 379 /384 variables (removed 5) and now considering 1279/1116 (removed -163) transitions.
[2024-05-24 04:24:26] [INFO ] Redundant transitions in 32 ms returned []
Running 1273 sub problems to find dead transitions.
[2024-05-24 04:24:26] [INFO ] Flow matrix only has 601 transitions (discarded 678 similar events)
// Phase 1: matrix 601 rows 379 cols
[2024-05-24 04:24:26] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 04:24:26] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/379 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1273 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/379 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1273 unsolved
[2024-05-24 04:24:43] [INFO ] Deduced a trap composed of 6 places in 297 ms of which 4 ms to minimize.
[2024-05-24 04:24:43] [INFO ] Deduced a trap composed of 6 places in 295 ms of which 4 ms to minimize.
[2024-05-24 04:24:44] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 4 ms to minimize.
[2024-05-24 04:24:44] [INFO ] Deduced a trap composed of 3 places in 214 ms of which 3 ms to minimize.
[2024-05-24 04:24:44] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 2 ms to minimize.
[2024-05-24 04:24:44] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:24:45] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
[2024-05-24 04:24:45] [INFO ] Deduced a trap composed of 38 places in 316 ms of which 5 ms to minimize.
[2024-05-24 04:24:45] [INFO ] Deduced a trap composed of 10 places in 84 ms of which 2 ms to minimize.
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
[2024-05-24 04:24:46] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 3 ms to minimize.
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
[2024-05-24 04:24:46] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 1 ms to minimize.
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
[2024-05-24 04:24:46] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
[2024-05-24 04:24:46] [INFO ] Deduced a trap composed of 42 places in 317 ms of which 5 ms to minimize.
[2024-05-24 04:24:47] [INFO ] Deduced a trap composed of 45 places in 326 ms of which 5 ms to minimize.
[2024-05-24 04:24:47] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
[2024-05-24 04:24:47] [INFO ] Deduced a trap composed of 36 places in 95 ms of which 2 ms to minimize.
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-05-24 04:24:47] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-05-24 04:24:47] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 1 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
[2024-05-24 04:24:48] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 2 ms to minimize.
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
[2024-05-24 04:24:48] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/379 variables, 20/39 constraints. Problems are: Problem set: 281 solved, 992 unsolved
[2024-05-24 04:24:49] [INFO ] Deduced a trap composed of 29 places in 467 ms of which 6 ms to minimize.
[2024-05-24 04:24:50] [INFO ] Deduced a trap composed of 15 places in 438 ms of which 5 ms to minimize.
[2024-05-24 04:24:50] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 5 ms to minimize.
[2024-05-24 04:24:51] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 6 ms to minimize.
[2024-05-24 04:24:51] [INFO ] Deduced a trap composed of 40 places in 386 ms of which 5 ms to minimize.
[2024-05-24 04:24:51] [INFO ] Deduced a trap composed of 24 places in 147 ms of which 3 ms to minimize.
[2024-05-24 04:24:52] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-05-24 04:24:53] [INFO ] Deduced a trap composed of 27 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:24:53] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-24 04:24:53] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:24:53] [INFO ] Deduced a trap composed of 25 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:24:54] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 3 ms to minimize.
[2024-05-24 04:24:54] [INFO ] Deduced a trap composed of 13 places in 475 ms of which 6 ms to minimize.
[2024-05-24 04:24:55] [INFO ] Deduced a trap composed of 15 places in 458 ms of which 6 ms to minimize.
[2024-05-24 04:24:56] [INFO ] Deduced a trap composed of 17 places in 454 ms of which 6 ms to minimize.
[2024-05-24 04:24:56] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:24:57] [INFO ] Deduced a trap composed of 82 places in 279 ms of which 3 ms to minimize.
[2024-05-24 04:24:57] [INFO ] Deduced a trap composed of 45 places in 203 ms of which 3 ms to minimize.
SMT process timed out in 30812ms, After SMT, problems are : Problem set: 281 solved, 992 unsolved
Search for dead transitions found 297 dead transitions in 30834ms
Found 297 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 297 transitions
Dead transitions reduction (with SMT) removed 297 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 379/384 places, 982/1116 transitions.
Graph (complete) has 2211 edges and 379 vertex of which 242 are kept as prefixes of interest. Removing 137 places using SCC suffix rule.3 ms
Discarding 137 places :
Also discarding 0 output transitions
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 1 rules in 31 ms. Remains 242 /379 variables (removed 137) and now considering 982/982 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 242/384 places, 982/1116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 31157 ms. Remains : 242/384 places, 982/1116 transitions.
Built C files in :
/tmp/ltsmin6012942560459991297
[2024-05-24 04:24:57] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6012942560459991297
Running compilation step : cd /tmp/ltsmin6012942560459991297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6012942560459991297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6012942560459991297;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 5 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 04:25:00] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 04:25:00] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 04:25:01] [INFO ] Implicit Places using invariants in 401 ms returned []
[2024-05-24 04:25:01] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:25:01] [INFO ] Invariant cache hit.
[2024-05-24 04:25:01] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:25:02] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1820 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:25:02] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:25:02] [INFO ] Invariant cache hit.
[2024-05-24 04:25:02] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:25:14] [INFO ] Deduced a trap composed of 44 places in 246 ms of which 3 ms to minimize.
[2024-05-24 04:25:14] [INFO ] Deduced a trap composed of 34 places in 255 ms of which 3 ms to minimize.
[2024-05-24 04:25:14] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 4 ms to minimize.
[2024-05-24 04:25:15] [INFO ] Deduced a trap composed of 32 places in 301 ms of which 4 ms to minimize.
[2024-05-24 04:25:15] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:25:15] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 4 ms to minimize.
[2024-05-24 04:25:15] [INFO ] Deduced a trap composed of 35 places in 179 ms of which 3 ms to minimize.
[2024-05-24 04:25:15] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:25:16] [INFO ] Deduced a trap composed of 23 places in 343 ms of which 5 ms to minimize.
[2024-05-24 04:25:16] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2024-05-24 04:25:16] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 2 ms to minimize.
[2024-05-24 04:25:17] [INFO ] Deduced a trap composed of 96 places in 299 ms of which 4 ms to minimize.
[2024-05-24 04:25:17] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 4 ms to minimize.
[2024-05-24 04:25:17] [INFO ] Deduced a trap composed of 58 places in 297 ms of which 4 ms to minimize.
[2024-05-24 04:25:19] [INFO ] Deduced a trap composed of 54 places in 446 ms of which 6 ms to minimize.
[2024-05-24 04:25:19] [INFO ] Deduced a trap composed of 80 places in 423 ms of which 6 ms to minimize.
[2024-05-24 04:25:20] [INFO ] Deduced a trap composed of 72 places in 389 ms of which 5 ms to minimize.
[2024-05-24 04:25:20] [INFO ] Deduced a trap composed of 78 places in 403 ms of which 5 ms to minimize.
[2024-05-24 04:25:21] [INFO ] Deduced a trap composed of 74 places in 291 ms of which 4 ms to minimize.
[2024-05-24 04:25:21] [INFO ] Deduced a trap composed of 50 places in 295 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:25:22] [INFO ] Deduced a trap composed of 5 places in 164 ms of which 3 ms to minimize.
[2024-05-24 04:25:22] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:25:23] [INFO ] Deduced a trap composed of 89 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:25:24] [INFO ] Deduced a trap composed of 76 places in 210 ms of which 4 ms to minimize.
[2024-05-24 04:25:24] [INFO ] Deduced a trap composed of 86 places in 235 ms of which 5 ms to minimize.
[2024-05-24 04:25:24] [INFO ] Deduced a trap composed of 75 places in 338 ms of which 4 ms to minimize.
[2024-05-24 04:25:24] [INFO ] Deduced a trap composed of 76 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:25:25] [INFO ] Deduced a trap composed of 4 places in 233 ms of which 6 ms to minimize.
[2024-05-24 04:25:25] [INFO ] Deduced a trap composed of 3 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:25:25] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 4 ms to minimize.
[2024-05-24 04:25:25] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:25:26] [INFO ] Deduced a trap composed of 86 places in 312 ms of which 5 ms to minimize.
[2024-05-24 04:25:26] [INFO ] Deduced a trap composed of 86 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:25:26] [INFO ] Deduced a trap composed of 102 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:25:26] [INFO ] Deduced a trap composed of 72 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:25:27] [INFO ] Deduced a trap composed of 20 places in 237 ms of which 4 ms to minimize.
[2024-05-24 04:25:27] [INFO ] Deduced a trap composed of 105 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:25:27] [INFO ] Deduced a trap composed of 50 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:25:27] [INFO ] Deduced a trap composed of 77 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:25:28] [INFO ] Deduced a trap composed of 100 places in 218 ms of which 3 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 0.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 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.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)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.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 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 1.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:25:35] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:25:35] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:25:36] [INFO ] Deduced a trap composed of 86 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:25:36] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 2 ms to minimize.
[2024-05-24 04:25:36] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2024-05-24 04:25:36] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 3 ms to minimize.
[2024-05-24 04:25:37] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 3 ms to minimize.
[2024-05-24 04:25:37] [INFO ] Deduced a trap composed of 51 places in 92 ms of which 2 ms to minimize.
[2024-05-24 04:25:37] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:25:38] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:25:38] [INFO ] Deduced a trap composed of 77 places in 269 ms of which 3 ms to minimize.
[2024-05-24 04:25:39] [INFO ] Deduced a trap composed of 58 places in 234 ms of which 4 ms to minimize.
[2024-05-24 04:25:39] [INFO ] Deduced a trap composed of 98 places in 233 ms of which 4 ms to minimize.
[2024-05-24 04:25:39] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:25:39] [INFO ] Deduced a trap composed of 55 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:25:40] [INFO ] Deduced a trap composed of 103 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:25:40] [INFO ] Deduced a trap composed of 108 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:25:40] [INFO ] Deduced a trap composed of 39 places in 241 ms of which 4 ms to minimize.
[2024-05-24 04:25:40] [INFO ] Deduced a trap composed of 87 places in 222 ms of which 3 ms to minimize.
[2024-05-24 04:25:41] [INFO ] Deduced a trap composed of 39 places in 242 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:25:42] [INFO ] Deduced a trap composed of 58 places in 204 ms of which 2 ms to minimize.
[2024-05-24 04:25:43] [INFO ] Deduced a trap composed of 114 places in 280 ms of which 4 ms to minimize.
[2024-05-24 04:25:43] [INFO ] Deduced a trap composed of 93 places in 275 ms of which 4 ms to minimize.
[2024-05-24 04:25:44] [INFO ] Deduced a trap composed of 91 places in 338 ms of which 6 ms to minimize.
[2024-05-24 04:25:44] [INFO ] Deduced a trap composed of 93 places in 241 ms of which 4 ms to minimize.
[2024-05-24 04:25:44] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:25:45] [INFO ] Deduced a trap composed of 22 places in 238 ms of which 4 ms to minimize.
[2024-05-24 04:25:45] [INFO ] Deduced a trap composed of 84 places in 226 ms of which 3 ms to minimize.
[2024-05-24 04:25:45] [INFO ] Deduced a trap composed of 93 places in 227 ms of which 4 ms to minimize.
[2024-05-24 04:25:45] [INFO ] Deduced a trap composed of 72 places in 218 ms of which 3 ms to minimize.
[2024-05-24 04:25:46] [INFO ] Deduced a trap composed of 82 places in 251 ms of which 4 ms to minimize.
[2024-05-24 04:25:46] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 4 ms to minimize.
[2024-05-24 04:25:46] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:25:46] [INFO ] Deduced a trap composed of 95 places in 190 ms of which 3 ms to minimize.
[2024-05-24 04:25:47] [INFO ] Deduced a trap composed of 96 places in 201 ms of which 3 ms to minimize.
[2024-05-24 04:25:47] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:25:48] [INFO ] Deduced a trap composed of 89 places in 241 ms of which 4 ms to minimize.
[2024-05-24 04:25:48] [INFO ] Deduced a trap composed of 103 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:25:48] [INFO ] Deduced a trap composed of 38 places in 248 ms of which 3 ms to minimize.
[2024-05-24 04:25:49] [INFO ] Deduced a trap composed of 113 places in 232 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:25:49] [INFO ] Deduced a trap composed of 90 places in 150 ms of which 2 ms to minimize.
[2024-05-24 04:25:51] [INFO ] Deduced a trap composed of 60 places in 311 ms of which 5 ms to minimize.
[2024-05-24 04:25:52] [INFO ] Deduced a trap composed of 41 places in 194 ms of which 3 ms to minimize.
[2024-05-24 04:25:52] [INFO ] Deduced a trap composed of 86 places in 270 ms of which 5 ms to minimize.
[2024-05-24 04:25:53] [INFO ] Deduced a trap composed of 93 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:25:53] [INFO ] Deduced a trap composed of 75 places in 338 ms of which 5 ms to minimize.
[2024-05-24 04:25:54] [INFO ] Deduced a trap composed of 78 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:25:55] [INFO ] Deduced a trap composed of 43 places in 246 ms of which 3 ms to minimize.
[2024-05-24 04:25:55] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2024-05-24 04:25:56] [INFO ] Deduced a trap composed of 74 places in 310 ms of which 5 ms to minimize.
[2024-05-24 04:25:58] [INFO ] Deduced a trap composed of 70 places in 378 ms of which 5 ms to minimize.
[2024-05-24 04:25:58] [INFO ] Deduced a trap composed of 84 places in 283 ms of which 4 ms to minimize.
[2024-05-24 04:25:59] [INFO ] Deduced a trap composed of 52 places in 321 ms of which 6 ms to minimize.
[2024-05-24 04:25:59] [INFO ] Deduced a trap composed of 58 places in 384 ms of which 5 ms to minimize.
[2024-05-24 04:26:00] [INFO ] Deduced a trap composed of 61 places in 425 ms of which 5 ms to minimize.
[2024-05-24 04:26:00] [INFO ] Deduced a trap composed of 52 places in 421 ms of which 5 ms to minimize.
[2024-05-24 04:26:01] [INFO ] Deduced a trap composed of 39 places in 425 ms of which 6 ms to minimize.
[2024-05-24 04:26:01] [INFO ] Deduced a trap composed of 69 places in 444 ms of which 6 ms to minimize.
[2024-05-24 04:26:02] [INFO ] Deduced a trap composed of 55 places in 412 ms of which 5 ms to minimize.
[2024-05-24 04:26:02] [INFO ] Deduced a trap composed of 114 places in 276 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 119 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 100/100 constraints]
After SMT, in 60475ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60487ms
Finished structural reductions in LTL mode , in 1 iterations and 62315 ms. Remains : 384/384 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin8486238711372218919
[2024-05-24 04:26:02] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8486238711372218919
Running compilation step : cd /tmp/ltsmin8486238711372218919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8486238711372218919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8486238711372218919;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 04:26:06] [INFO ] Flatten gal took : 41 ms
[2024-05-24 04:26:06] [INFO ] Flatten gal took : 37 ms
[2024-05-24 04:26:06] [INFO ] Time to serialize gal into /tmp/LTL15607901451927423737.gal : 9 ms
[2024-05-24 04:26:06] [INFO ] Time to serialize properties into /tmp/LTL16717285748670836740.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15607901451927423737.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16112593670687041698.hoa' '-atoms' '/tmp/LTL16717285748670836740.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16717285748670836740.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16112593670687041698.hoa
Detected timeout of ITS tools.
[2024-05-24 04:26:21] [INFO ] Flatten gal took : 33 ms
[2024-05-24 04:26:21] [INFO ] Flatten gal took : 36 ms
[2024-05-24 04:26:21] [INFO ] Time to serialize gal into /tmp/LTL6898277405849802312.gal : 11 ms
[2024-05-24 04:26:21] [INFO ] Time to serialize properties into /tmp/LTL6751930503520694884.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6898277405849802312.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6751930503520694884.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((!("((turn_3==1)&&(p37_3_4==1))"))U((G(!("((turn_3==1)&&(p37_3_4==1))")))||(!("((turn_3==1)&&(p37_3_4==1))"))))U((G((!("((tu...570
Formula 0 simplified : XXG(F(!"(((!((turn_3==1)&&(p37_3_4==1)))||((turn_3==1)&&(p37_3_4==1)))&&(!((turn_3==1)&&(p37_3_4==1))))" & "((turn_3==1)&&(p37_3_4==...351
Detected timeout of ITS tools.
[2024-05-24 04:26:36] [INFO ] Flatten gal took : 35 ms
[2024-05-24 04:26:36] [INFO ] Applying decomposition
[2024-05-24 04:26:36] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph9801588048190471170.txt' '-o' '/tmp/graph9801588048190471170.bin' '-w' '/tmp/graph9801588048190471170.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph9801588048190471170.bin' '-l' '-1' '-v' '-w' '/tmp/graph9801588048190471170.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:26:36] [INFO ] Decomposing Gal with order
[2024-05-24 04:26:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:26:36] [INFO ] Removed a total of 1879 redundant transitions.
[2024-05-24 04:26:36] [INFO ] Flatten gal took : 100 ms
[2024-05-24 04:26:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 344 labels/synchronizations in 38 ms.
[2024-05-24 04:26:36] [INFO ] Time to serialize gal into /tmp/LTL15711792282252759334.gal : 13 ms
[2024-05-24 04:26:36] [INFO ] Time to serialize properties into /tmp/LTL15135796223702227303.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15711792282252759334.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15135796223702227303.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((!("((i1.u5.turn_3==1)&&(i11.i0.u119.p37_3_4==1))"))U((G(!("((i1.u5.turn_3==1)&&(i11.i0.u119.p37_3_4==1))")))||(!("((i1.u5.t...829
Formula 0 simplified : XXG(F(!"(((!((i1.u5.turn_3==1)&&(i11.i0.u119.p37_3_4==1)))||((i1.u5.turn_3==1)&&(i11.i0.u119.p37_3_4==1)))&&(!((i1.u5.turn_3==1)&&(i...520
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-05 finished in 388441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(((F(p0)&&F(!p1)) U p1))))'
Support contains 6 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 11 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 04:26:51] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:26:51] [INFO ] Invariant cache hit.
[2024-05-24 04:26:52] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-24 04:26:52] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:26:52] [INFO ] Invariant cache hit.
[2024-05-24 04:26:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:26:53] [INFO ] Implicit Places using invariants and state equation in 1619 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:26:53] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:26:53] [INFO ] Invariant cache hit.
[2024-05-24 04:26:53] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:27:08] [INFO ] Deduced a trap composed of 44 places in 166 ms of which 3 ms to minimize.
[2024-05-24 04:27:09] [INFO ] Deduced a trap composed of 34 places in 172 ms of which 3 ms to minimize.
[2024-05-24 04:27:09] [INFO ] Deduced a trap composed of 29 places in 236 ms of which 4 ms to minimize.
[2024-05-24 04:27:09] [INFO ] Deduced a trap composed of 32 places in 303 ms of which 5 ms to minimize.
[2024-05-24 04:27:09] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 3 ms to minimize.
[2024-05-24 04:27:10] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 4 ms to minimize.
[2024-05-24 04:27:10] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 2 ms to minimize.
[2024-05-24 04:27:10] [INFO ] Deduced a trap composed of 32 places in 115 ms of which 2 ms to minimize.
[2024-05-24 04:27:10] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
[2024-05-24 04:27:10] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2024-05-24 04:27:10] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-24 04:27:11] [INFO ] Deduced a trap composed of 96 places in 170 ms of which 3 ms to minimize.
[2024-05-24 04:27:11] [INFO ] Deduced a trap composed of 29 places in 175 ms of which 3 ms to minimize.
[2024-05-24 04:27:11] [INFO ] Deduced a trap composed of 58 places in 185 ms of which 3 ms to minimize.
[2024-05-24 04:27:12] [INFO ] Deduced a trap composed of 54 places in 458 ms of which 6 ms to minimize.
[2024-05-24 04:27:13] [INFO ] Deduced a trap composed of 80 places in 408 ms of which 5 ms to minimize.
[2024-05-24 04:27:13] [INFO ] Deduced a trap composed of 72 places in 408 ms of which 5 ms to minimize.
[2024-05-24 04:27:14] [INFO ] Deduced a trap composed of 78 places in 409 ms of which 5 ms to minimize.
[2024-05-24 04:27:14] [INFO ] Deduced a trap composed of 74 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:27:15] [INFO ] Deduced a trap composed of 50 places in 308 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:27:15] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 2 ms to minimize.
[2024-05-24 04:27:16] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:27:17] [INFO ] Deduced a trap composed of 89 places in 398 ms of which 5 ms to minimize.
[2024-05-24 04:27:17] [INFO ] Deduced a trap composed of 76 places in 376 ms of which 5 ms to minimize.
[2024-05-24 04:27:18] [INFO ] Deduced a trap composed of 86 places in 365 ms of which 5 ms to minimize.
[2024-05-24 04:27:18] [INFO ] Deduced a trap composed of 75 places in 373 ms of which 5 ms to minimize.
[2024-05-24 04:27:19] [INFO ] Deduced a trap composed of 76 places in 359 ms of which 5 ms to minimize.
[2024-05-24 04:27:19] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 6 ms to minimize.
[2024-05-24 04:27:19] [INFO ] Deduced a trap composed of 3 places in 421 ms of which 5 ms to minimize.
[2024-05-24 04:27:20] [INFO ] Deduced a trap composed of 86 places in 384 ms of which 5 ms to minimize.
[2024-05-24 04:27:20] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-05-24 04:27:20] [INFO ] Deduced a trap composed of 86 places in 357 ms of which 5 ms to minimize.
[2024-05-24 04:27:21] [INFO ] Deduced a trap composed of 86 places in 314 ms of which 4 ms to minimize.
[2024-05-24 04:27:21] [INFO ] Deduced a trap composed of 102 places in 407 ms of which 5 ms to minimize.
[2024-05-24 04:27:22] [INFO ] Deduced a trap composed of 72 places in 399 ms of which 6 ms to minimize.
[2024-05-24 04:27:22] [INFO ] Deduced a trap composed of 20 places in 391 ms of which 5 ms to minimize.
[2024-05-24 04:27:23] [INFO ] Deduced a trap composed of 105 places in 400 ms of which 5 ms to minimize.
[2024-05-24 04:27:23] [INFO ] Deduced a trap composed of 50 places in 398 ms of which 5 ms to minimize.
[2024-05-24 04:27:23] [INFO ] Deduced a trap composed of 77 places in 403 ms of which 5 ms to minimize.
[2024-05-24 04:27:24] [INFO ] Deduced a trap composed of 100 places in 380 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:27:26] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:27:26] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-05-24 04:27:28] [INFO ] Deduced a trap composed of 86 places in 330 ms of which 5 ms to minimize.
[2024-05-24 04:27:28] [INFO ] Deduced a trap composed of 91 places in 274 ms of which 4 ms to minimize.
[2024-05-24 04:27:28] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 4 ms to minimize.
[2024-05-24 04:27:29] [INFO ] Deduced a trap composed of 70 places in 304 ms of which 5 ms to minimize.
[2024-05-24 04:27:29] [INFO ] Deduced a trap composed of 90 places in 281 ms of which 5 ms to minimize.
[2024-05-24 04:27:29] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2024-05-24 04:27:30] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:27:31] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:27:32] [INFO ] Deduced a trap composed of 77 places in 425 ms of which 6 ms to minimize.
[2024-05-24 04:27:32] [INFO ] Deduced a trap composed of 58 places in 414 ms of which 5 ms to minimize.
[2024-05-24 04:27:32] [INFO ] Deduced a trap composed of 98 places in 403 ms of which 5 ms to minimize.
[2024-05-24 04:27:33] [INFO ] Deduced a trap composed of 38 places in 400 ms of which 6 ms to minimize.
[2024-05-24 04:27:33] [INFO ] Deduced a trap composed of 55 places in 325 ms of which 5 ms to minimize.
[2024-05-24 04:27:34] [INFO ] Deduced a trap composed of 103 places in 407 ms of which 6 ms to minimize.
[2024-05-24 04:27:34] [INFO ] Deduced a trap composed of 108 places in 399 ms of which 5 ms to minimize.
[2024-05-24 04:27:34] [INFO ] Deduced a trap composed of 39 places in 411 ms of which 5 ms to minimize.
[2024-05-24 04:27:35] [INFO ] Deduced a trap composed of 87 places in 353 ms of which 5 ms to minimize.
[2024-05-24 04:27:35] [INFO ] Deduced a trap composed of 39 places in 415 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:27:36] [INFO ] Deduced a trap composed of 58 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:27:38] [INFO ] Deduced a trap composed of 114 places in 463 ms of which 6 ms to minimize.
[2024-05-24 04:27:39] [INFO ] Deduced a trap composed of 93 places in 475 ms of which 6 ms to minimize.
[2024-05-24 04:27:39] [INFO ] Deduced a trap composed of 91 places in 405 ms of which 5 ms to minimize.
[2024-05-24 04:27:40] [INFO ] Deduced a trap composed of 93 places in 383 ms of which 6 ms to minimize.
[2024-05-24 04:27:40] [INFO ] Deduced a trap composed of 24 places in 411 ms of which 5 ms to minimize.
[2024-05-24 04:27:41] [INFO ] Deduced a trap composed of 22 places in 408 ms of which 5 ms to minimize.
[2024-05-24 04:27:41] [INFO ] Deduced a trap composed of 84 places in 368 ms of which 5 ms to minimize.
[2024-05-24 04:27:42] [INFO ] Deduced a trap composed of 93 places in 342 ms of which 5 ms to minimize.
[2024-05-24 04:27:42] [INFO ] Deduced a trap composed of 72 places in 365 ms of which 5 ms to minimize.
[2024-05-24 04:27:42] [INFO ] Deduced a trap composed of 82 places in 395 ms of which 5 ms to minimize.
[2024-05-24 04:27:43] [INFO ] Deduced a trap composed of 69 places in 381 ms of which 5 ms to minimize.
[2024-05-24 04:27:43] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 1 ms to minimize.
[2024-05-24 04:27:43] [INFO ] Deduced a trap composed of 95 places in 328 ms of which 4 ms to minimize.
[2024-05-24 04:27:44] [INFO ] Deduced a trap composed of 96 places in 324 ms of which 5 ms to minimize.
[2024-05-24 04:27:44] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-24 04:27:46] [INFO ] Deduced a trap composed of 89 places in 339 ms of which 6 ms to minimize.
[2024-05-24 04:27:46] [INFO ] Deduced a trap composed of 103 places in 420 ms of which 6 ms to minimize.
[2024-05-24 04:27:47] [INFO ] Deduced a trap composed of 38 places in 421 ms of which 6 ms to minimize.
[2024-05-24 04:27:47] [INFO ] Deduced a trap composed of 113 places in 406 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:27:48] [INFO ] Deduced a trap composed of 90 places in 253 ms of which 4 ms to minimize.
[2024-05-24 04:27:51] [INFO ] Deduced a trap composed of 60 places in 352 ms of which 5 ms to minimize.
[2024-05-24 04:27:51] [INFO ] Deduced a trap composed of 41 places in 299 ms of which 4 ms to minimize.
[2024-05-24 04:27:52] [INFO ] Deduced a trap composed of 86 places in 281 ms of which 5 ms to minimize.
[2024-05-24 04:27:53] [INFO ] Deduced a trap composed of 93 places in 330 ms of which 5 ms to minimize.
[2024-05-24 04:27:53] [INFO ] Deduced a trap composed of 75 places in 329 ms of which 6 ms to minimize.
[2024-05-24 04:27:54] [INFO ] Deduced a trap composed of 78 places in 327 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 1)
(s17 0)
(s18 0)
(s19 1)
(s20 0)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 1)
(s164 1)
(s165 1)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 1)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 1)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 106 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 87/87 constraints]
After SMT, in 60632ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60646ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62653 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 272 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-08 finished in 63156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F((p1||(F(p3)&&p2)))))))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 390/390 places, 1152/1152 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 390 transition count 1147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 385 transition count 1147
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 10 place count 385 transition count 1034
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 236 place count 272 transition count 1034
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 242 place count 266 transition count 998
Iterating global reduction 2 with 6 rules applied. Total rules applied 248 place count 266 transition count 998
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 308 place count 236 transition count 968
Applied a total of 308 rules in 86 ms. Remains 236 /390 variables (removed 154) and now considering 968/1152 (removed 184) transitions.
[2024-05-24 04:27:55] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 04:27:55] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 04:27:55] [INFO ] Implicit Places using invariants in 485 ms returned []
[2024-05-24 04:27:55] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:27:55] [INFO ] Invariant cache hit.
[2024-05-24 04:27:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:27:56] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
[2024-05-24 04:27:56] [INFO ] Redundant transitions in 12 ms returned []
Running 962 sub problems to find dead transitions.
[2024-05-24 04:27:56] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:27:56] [INFO ] Invariant cache hit.
[2024-05-24 04:27:56] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:28:06] [INFO ] Deduced a trap composed of 3 places in 283 ms of which 3 ms to minimize.
[2024-05-24 04:28:06] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2024-05-24 04:28:06] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:28:06] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:28:06] [INFO ] Deduced a trap composed of 33 places in 179 ms of which 3 ms to minimize.
[2024-05-24 04:28:07] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:28:07] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:28:08] [INFO ] Deduced a trap composed of 58 places in 226 ms of which 3 ms to minimize.
[2024-05-24 04:28:08] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 3 ms to minimize.
[2024-05-24 04:28:08] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:28:09] [INFO ] Deduced a trap composed of 52 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:28:09] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:28:09] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:28:09] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 2 ms to minimize.
[2024-05-24 04:28:09] [INFO ] Deduced a trap composed of 60 places in 189 ms of which 2 ms to minimize.
[2024-05-24 04:28:10] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:28:10] [INFO ] Deduced a trap composed of 34 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:28:10] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 2 ms to minimize.
[2024-05-24 04:28:10] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 3 ms to minimize.
[2024-05-24 04:28:10] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:28:13] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:28:13] [INFO ] Deduced a trap composed of 52 places in 273 ms of which 4 ms to minimize.
[2024-05-24 04:28:13] [INFO ] Deduced a trap composed of 38 places in 303 ms of which 4 ms to minimize.
[2024-05-24 04:28:14] [INFO ] Deduced a trap composed of 46 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:28:14] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:28:14] [INFO ] Deduced a trap composed of 11 places in 97 ms of which 2 ms to minimize.
[2024-05-24 04:28:15] [INFO ] Deduced a trap composed of 59 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:28:15] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:28:15] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2024-05-24 04:28:15] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 3 ms to minimize.
[2024-05-24 04:28:16] [INFO ] Deduced a trap composed of 17 places in 222 ms of which 3 ms to minimize.
[2024-05-24 04:28:16] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2024-05-24 04:28:17] [INFO ] Deduced a trap composed of 53 places in 278 ms of which 4 ms to minimize.
[2024-05-24 04:28:17] [INFO ] Deduced a trap composed of 58 places in 324 ms of which 4 ms to minimize.
[2024-05-24 04:28:17] [INFO ] Deduced a trap composed of 44 places in 324 ms of which 4 ms to minimize.
[2024-05-24 04:28:18] [INFO ] Deduced a trap composed of 50 places in 281 ms of which 4 ms to minimize.
[2024-05-24 04:28:18] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 4 ms to minimize.
[2024-05-24 04:28:18] [INFO ] Deduced a trap composed of 56 places in 217 ms of which 3 ms to minimize.
[2024-05-24 04:28:19] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 4 ms to minimize.
[2024-05-24 04:28:19] [INFO ] Deduced a trap composed of 54 places in 293 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:28:33] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-24 04:28:34] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2024-05-24 04:28:36] [INFO ] Deduced a trap composed of 17 places in 326 ms of which 4 ms to minimize.
[2024-05-24 04:28:36] [INFO ] Deduced a trap composed of 20 places in 305 ms of which 4 ms to minimize.
[2024-05-24 04:28:36] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 3 ms to minimize.
[2024-05-24 04:28:37] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:28:37] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
[2024-05-24 04:28:37] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 1 ms to minimize.
[2024-05-24 04:28:37] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 2 ms to minimize.
[2024-05-24 04:28:38] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-05-24 04:28:38] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:28:38] [INFO ] Deduced a trap composed of 51 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:28:39] [INFO ] Deduced a trap composed of 75 places in 297 ms of which 4 ms to minimize.
[2024-05-24 04:28:39] [INFO ] Deduced a trap composed of 46 places in 292 ms of which 4 ms to minimize.
[2024-05-24 04:28:39] [INFO ] Deduced a trap composed of 46 places in 279 ms of which 3 ms to minimize.
[2024-05-24 04:28:40] [INFO ] Deduced a trap composed of 44 places in 267 ms of which 4 ms to minimize.
[2024-05-24 04:28:40] [INFO ] Deduced a trap composed of 47 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:28:40] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 4 ms to minimize.
[2024-05-24 04:28:40] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:28:41] [INFO ] Deduced a trap composed of 66 places in 278 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:28:50] [INFO ] Deduced a trap composed of 50 places in 264 ms of which 3 ms to minimize.
[2024-05-24 04:28:50] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:28:50] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:28:51] [INFO ] Deduced a trap composed of 50 places in 264 ms of which 4 ms to minimize.
[2024-05-24 04:28:51] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2024-05-24 04:28:51] [INFO ] Deduced a trap composed of 44 places in 294 ms of which 3 ms to minimize.
[2024-05-24 04:28:51] [INFO ] Deduced a trap composed of 47 places in 250 ms of which 4 ms to minimize.
[2024-05-24 04:28:52] [INFO ] Deduced a trap composed of 44 places in 315 ms of which 4 ms to minimize.
[2024-05-24 04:28:52] [INFO ] Deduced a trap composed of 56 places in 344 ms of which 4 ms to minimize.
[2024-05-24 04:28:54] [INFO ] Deduced a trap composed of 59 places in 285 ms of which 3 ms to minimize.
[2024-05-24 04:28:55] [INFO ] Deduced a trap composed of 71 places in 266 ms of which 4 ms to minimize.
[2024-05-24 04:28:57] [INFO ] Deduced a trap composed of 54 places in 228 ms of which 3 ms to minimize.
SMT process timed out in 60701ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60712ms
Starting structural reductions in SI_LTL mode, iteration 1 : 236/390 places, 968/1152 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62237 ms. Remains : 236/390 places, 968/1152 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 336 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-10 finished in 62786 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(G(p0))||(F(p2)&&p1))))'
Support contains 9 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 385 transition count 1122
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 385 transition count 1122
Applied a total of 10 rules in 22 ms. Remains 385 /390 variables (removed 5) and now considering 1122/1152 (removed 30) transitions.
[2024-05-24 04:28:57] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
// Phase 1: matrix 528 rows 385 cols
[2024-05-24 04:28:57] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 04:28:58] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-24 04:28:58] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 04:28:58] [INFO ] Invariant cache hit.
[2024-05-24 04:28:58] [INFO ] State equation strengthened by 169 read => feed constraints.
[2024-05-24 04:29:00] [INFO ] Implicit Places using invariants and state equation in 1832 ms returned []
Implicit Place search using SMT with State Equation took 2366 ms to find 0 implicit places.
Running 1116 sub problems to find dead transitions.
[2024-05-24 04:29:00] [INFO ] Flow matrix only has 528 transitions (discarded 594 similar events)
[2024-05-24 04:29:00] [INFO ] Invariant cache hit.
[2024-05-24 04:29:00] [INFO ] State equation strengthened by 169 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 04:29:14] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:29:15] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 2 ms to minimize.
[2024-05-24 04:29:15] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:29:15] [INFO ] Deduced a trap composed of 38 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:29:15] [INFO ] Deduced a trap composed of 26 places in 225 ms of which 4 ms to minimize.
[2024-05-24 04:29:16] [INFO ] Deduced a trap composed of 36 places in 331 ms of which 5 ms to minimize.
[2024-05-24 04:29:16] [INFO ] Deduced a trap composed of 25 places in 309 ms of which 4 ms to minimize.
[2024-05-24 04:29:16] [INFO ] Deduced a trap composed of 26 places in 342 ms of which 5 ms to minimize.
[2024-05-24 04:29:16] [INFO ] Deduced a trap composed of 26 places in 92 ms of which 2 ms to minimize.
[2024-05-24 04:29:17] [INFO ] Deduced a trap composed of 29 places in 170 ms of which 3 ms to minimize.
[2024-05-24 04:29:17] [INFO ] Deduced a trap composed of 20 places in 175 ms of which 2 ms to minimize.
[2024-05-24 04:29:19] [INFO ] Deduced a trap composed of 51 places in 468 ms of which 6 ms to minimize.
[2024-05-24 04:29:19] [INFO ] Deduced a trap composed of 80 places in 432 ms of which 6 ms to minimize.
[2024-05-24 04:29:19] [INFO ] Deduced a trap composed of 72 places in 422 ms of which 6 ms to minimize.
[2024-05-24 04:29:20] [INFO ] Deduced a trap composed of 89 places in 416 ms of which 5 ms to minimize.
[2024-05-24 04:29:20] [INFO ] Deduced a trap composed of 76 places in 422 ms of which 5 ms to minimize.
[2024-05-24 04:29:21] [INFO ] Deduced a trap composed of 95 places in 364 ms of which 5 ms to minimize.
[2024-05-24 04:29:21] [INFO ] Deduced a trap composed of 97 places in 351 ms of which 5 ms to minimize.
[2024-05-24 04:29:22] [INFO ] Deduced a trap composed of 79 places in 353 ms of which 5 ms to minimize.
[2024-05-24 04:29:22] [INFO ] Deduced a trap composed of 74 places in 354 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1116 unsolved
[2024-05-24 04:29:23] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 3 ms to minimize.
[2024-05-24 04:29:23] [INFO ] Deduced a trap composed of 75 places in 276 ms of which 5 ms to minimize.
[2024-05-24 04:29:24] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-05-24 04:29:25] [INFO ] Deduced a trap composed of 23 places in 143 ms of which 5 ms to minimize.
[2024-05-24 04:29:25] [INFO ] Deduced a trap composed of 78 places in 487 ms of which 6 ms to minimize.
[2024-05-24 04:29:26] [INFO ] Deduced a trap composed of 106 places in 482 ms of which 7 ms to minimize.
[2024-05-24 04:29:26] [INFO ] Deduced a trap composed of 76 places in 461 ms of which 6 ms to minimize.
[2024-05-24 04:29:27] [INFO ] Deduced a trap composed of 111 places in 408 ms of which 5 ms to minimize.
[2024-05-24 04:29:27] [INFO ] Deduced a trap composed of 86 places in 483 ms of which 6 ms to minimize.
[2024-05-24 04:29:28] [INFO ] Deduced a trap composed of 83 places in 453 ms of which 6 ms to minimize.
[2024-05-24 04:29:28] [INFO ] Deduced a trap composed of 87 places in 459 ms of which 6 ms to minimize.
[2024-05-24 04:29:29] [INFO ] Deduced a trap composed of 77 places in 455 ms of which 6 ms to minimize.
[2024-05-24 04:29:29] [INFO ] Deduced a trap composed of 79 places in 428 ms of which 5 ms to minimize.
[2024-05-24 04:29:29] [INFO ] Deduced a trap composed of 74 places in 492 ms of which 6 ms to minimize.
[2024-05-24 04:29:30] [INFO ] Deduced a trap composed of 80 places in 471 ms of which 5 ms to minimize.
[2024-05-24 04:29:30] [INFO ] Deduced a trap composed of 77 places in 462 ms of which 6 ms to minimize.
SMT process timed out in 30804ms, After SMT, problems are : Problem set: 0 solved, 1116 unsolved
Search for dead transitions found 0 dead transitions in 30815ms
Starting structural reductions in LTL mode, iteration 1 : 385/390 places, 1122/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33207 ms. Remains : 385/390 places, 1122/1152 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 693 ms.
Product exploration explored 100000 steps with 50000 reset in 567 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p2), (X p1), (X (NOT (AND p1 (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 14 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-06-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-11 finished in 34804 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 3 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 10 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 04:29:32] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 04:29:32] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 04:29:32] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-24 04:29:32] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:29:32] [INFO ] Invariant cache hit.
[2024-05-24 04:29:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:29:35] [INFO ] Implicit Places using invariants and state equation in 2179 ms returned []
Implicit Place search using SMT with State Equation took 2603 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:29:35] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:29:35] [INFO ] Invariant cache hit.
[2024-05-24 04:29:35] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:29:50] [INFO ] Deduced a trap composed of 44 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:29:50] [INFO ] Deduced a trap composed of 34 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:29:50] [INFO ] Deduced a trap composed of 29 places in 283 ms of which 4 ms to minimize.
[2024-05-24 04:29:51] [INFO ] Deduced a trap composed of 32 places in 315 ms of which 4 ms to minimize.
[2024-05-24 04:29:51] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 4 ms to minimize.
[2024-05-24 04:29:51] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 4 ms to minimize.
[2024-05-24 04:29:51] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-24 04:29:52] [INFO ] Deduced a trap composed of 32 places in 223 ms of which 3 ms to minimize.
[2024-05-24 04:29:52] [INFO ] Deduced a trap composed of 23 places in 368 ms of which 5 ms to minimize.
[2024-05-24 04:29:52] [INFO ] Deduced a trap composed of 38 places in 146 ms of which 2 ms to minimize.
[2024-05-24 04:29:52] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-05-24 04:29:53] [INFO ] Deduced a trap composed of 96 places in 284 ms of which 5 ms to minimize.
[2024-05-24 04:29:53] [INFO ] Deduced a trap composed of 29 places in 300 ms of which 5 ms to minimize.
[2024-05-24 04:29:53] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 4 ms to minimize.
[2024-05-24 04:29:55] [INFO ] Deduced a trap composed of 54 places in 459 ms of which 7 ms to minimize.
[2024-05-24 04:29:55] [INFO ] Deduced a trap composed of 80 places in 422 ms of which 6 ms to minimize.
[2024-05-24 04:29:56] [INFO ] Deduced a trap composed of 72 places in 422 ms of which 6 ms to minimize.
[2024-05-24 04:29:56] [INFO ] Deduced a trap composed of 78 places in 419 ms of which 5 ms to minimize.
[2024-05-24 04:29:57] [INFO ] Deduced a trap composed of 74 places in 292 ms of which 4 ms to minimize.
[2024-05-24 04:29:57] [INFO ] Deduced a trap composed of 50 places in 314 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:29:58] [INFO ] Deduced a trap composed of 5 places in 103 ms of which 2 ms to minimize.
[2024-05-24 04:29:58] [INFO ] Deduced a trap composed of 74 places in 146 ms of which 3 ms to minimize.
[2024-05-24 04:30:00] [INFO ] Deduced a trap composed of 89 places in 396 ms of which 5 ms to minimize.
[2024-05-24 04:30:00] [INFO ] Deduced a trap composed of 76 places in 394 ms of which 5 ms to minimize.
[2024-05-24 04:30:00] [INFO ] Deduced a trap composed of 86 places in 383 ms of which 5 ms to minimize.
[2024-05-24 04:30:01] [INFO ] Deduced a trap composed of 75 places in 388 ms of which 5 ms to minimize.
[2024-05-24 04:30:01] [INFO ] Deduced a trap composed of 76 places in 366 ms of which 5 ms to minimize.
[2024-05-24 04:30:02] [INFO ] Deduced a trap composed of 4 places in 443 ms of which 5 ms to minimize.
[2024-05-24 04:30:02] [INFO ] Deduced a trap composed of 3 places in 457 ms of which 6 ms to minimize.
[2024-05-24 04:30:03] [INFO ] Deduced a trap composed of 86 places in 369 ms of which 5 ms to minimize.
[2024-05-24 04:30:03] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 3 ms to minimize.
[2024-05-24 04:30:03] [INFO ] Deduced a trap composed of 86 places in 381 ms of which 5 ms to minimize.
[2024-05-24 04:30:04] [INFO ] Deduced a trap composed of 86 places in 310 ms of which 4 ms to minimize.
[2024-05-24 04:30:04] [INFO ] Deduced a trap composed of 102 places in 403 ms of which 5 ms to minimize.
[2024-05-24 04:30:04] [INFO ] Deduced a trap composed of 72 places in 407 ms of which 5 ms to minimize.
[2024-05-24 04:30:05] [INFO ] Deduced a trap composed of 20 places in 412 ms of which 6 ms to minimize.
[2024-05-24 04:30:05] [INFO ] Deduced a trap composed of 105 places in 388 ms of which 6 ms to minimize.
[2024-05-24 04:30:06] [INFO ] Deduced a trap composed of 50 places in 420 ms of which 5 ms to minimize.
SMT process timed out in 31110ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 31127ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33746 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-12 finished in 33880 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((G(p0)||G(F((!p1 U (p2||G(!p1)))))||(F((!p1 U (p2||G(!p1))))&&X(p3)))))))'
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 17 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 04:30:06] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:30:06] [INFO ] Invariant cache hit.
[2024-05-24 04:30:07] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-24 04:30:07] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:30:07] [INFO ] Invariant cache hit.
[2024-05-24 04:30:07] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:30:09] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned []
Implicit Place search using SMT with State Equation took 2589 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:30:09] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:30:09] [INFO ] Invariant cache hit.
[2024-05-24 04:30:09] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:30:23] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-24 04:30:24] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 3 ms to minimize.
[2024-05-24 04:30:24] [INFO ] Deduced a trap composed of 29 places in 181 ms of which 4 ms to minimize.
[2024-05-24 04:30:24] [INFO ] Deduced a trap composed of 32 places in 318 ms of which 5 ms to minimize.
[2024-05-24 04:30:24] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:30:25] [INFO ] Deduced a trap composed of 21 places in 254 ms of which 3 ms to minimize.
[2024-05-24 04:30:25] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 2 ms to minimize.
[2024-05-24 04:30:25] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2024-05-24 04:30:25] [INFO ] Deduced a trap composed of 23 places in 376 ms of which 5 ms to minimize.
[2024-05-24 04:30:26] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-05-24 04:30:26] [INFO ] Deduced a trap composed of 28 places in 166 ms of which 3 ms to minimize.
[2024-05-24 04:30:26] [INFO ] Deduced a trap composed of 96 places in 321 ms of which 4 ms to minimize.
[2024-05-24 04:30:27] [INFO ] Deduced a trap composed of 29 places in 295 ms of which 4 ms to minimize.
[2024-05-24 04:30:27] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 4 ms to minimize.
[2024-05-24 04:30:29] [INFO ] Deduced a trap composed of 54 places in 483 ms of which 6 ms to minimize.
[2024-05-24 04:30:29] [INFO ] Deduced a trap composed of 80 places in 449 ms of which 6 ms to minimize.
[2024-05-24 04:30:29] [INFO ] Deduced a trap composed of 72 places in 440 ms of which 5 ms to minimize.
[2024-05-24 04:30:30] [INFO ] Deduced a trap composed of 78 places in 373 ms of which 5 ms to minimize.
[2024-05-24 04:30:30] [INFO ] Deduced a trap composed of 74 places in 303 ms of which 5 ms to minimize.
[2024-05-24 04:30:31] [INFO ] Deduced a trap composed of 50 places in 318 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:30:31] [INFO ] Deduced a trap composed of 5 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:30:32] [INFO ] Deduced a trap composed of 74 places in 305 ms of which 4 ms to minimize.
[2024-05-24 04:30:34] [INFO ] Deduced a trap composed of 89 places in 410 ms of which 5 ms to minimize.
[2024-05-24 04:30:34] [INFO ] Deduced a trap composed of 76 places in 410 ms of which 5 ms to minimize.
[2024-05-24 04:30:34] [INFO ] Deduced a trap composed of 86 places in 384 ms of which 5 ms to minimize.
[2024-05-24 04:30:35] [INFO ] Deduced a trap composed of 75 places in 333 ms of which 5 ms to minimize.
[2024-05-24 04:30:35] [INFO ] Deduced a trap composed of 76 places in 370 ms of which 5 ms to minimize.
[2024-05-24 04:30:36] [INFO ] Deduced a trap composed of 4 places in 453 ms of which 6 ms to minimize.
[2024-05-24 04:30:36] [INFO ] Deduced a trap composed of 3 places in 454 ms of which 6 ms to minimize.
[2024-05-24 04:30:37] [INFO ] Deduced a trap composed of 86 places in 363 ms of which 6 ms to minimize.
[2024-05-24 04:30:37] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
[2024-05-24 04:30:37] [INFO ] Deduced a trap composed of 86 places in 372 ms of which 5 ms to minimize.
[2024-05-24 04:30:37] [INFO ] Deduced a trap composed of 86 places in 355 ms of which 4 ms to minimize.
[2024-05-24 04:30:38] [INFO ] Deduced a trap composed of 102 places in 445 ms of which 6 ms to minimize.
[2024-05-24 04:30:38] [INFO ] Deduced a trap composed of 72 places in 422 ms of which 6 ms to minimize.
[2024-05-24 04:30:39] [INFO ] Deduced a trap composed of 20 places in 438 ms of which 6 ms to minimize.
[2024-05-24 04:30:39] [INFO ] Deduced a trap composed of 105 places in 399 ms of which 5 ms to minimize.
SMT process timed out in 30800ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30817ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33429 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 573 ms.
Product exploration explored 100000 steps with 25000 reset in 484 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1) p3), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1 (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 240 ms. (165 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 444 ms. (89 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 428 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 8/8 properties
[2024-05-24 04:30:42] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:30:42] [INFO ] Invariant cache hit.
[2024-05-24 04:30:42] [INFO ] State equation strengthened by 164 read => feed constraints.
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 182/189 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/190 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 49/239 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/258 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-24 04:30:43] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 368/626 variables, 258/272 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 74/346 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 0/346 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 36/662 variables, 16/362 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/662 variables, 12/374 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/662 variables, 0/374 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 106/768 variables, 4/378 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/768 variables, 0/378 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 4/772 variables, 2/380 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/772 variables, 0/380 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 134/906 variables, 110/490 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 78/568 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/906 variables, 0/568 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/906 variables, 0/568 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 568 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1849 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 182/189 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/190 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 49/239 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-24 04:30:44] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 1/12 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/12 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 19/258 variables, 2/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 368/626 variables, 258/273 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 74/347 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-24 04:30:45] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 1/348 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 0/348 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 36/662 variables, 16/364 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/662 variables, 12/376 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/662 variables, 0/376 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 106/768 variables, 4/380 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/768 variables, 0/380 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 4/772 variables, 2/382 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 6/388 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-24 04:30:46] [INFO ] Deduced a trap composed of 29 places in 310 ms of which 5 ms to minimize.
[2024-05-24 04:30:46] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 4 ms to minimize.
[2024-05-24 04:30:46] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 4 ms to minimize.
[2024-05-24 04:30:47] [INFO ] Deduced a trap composed of 27 places in 162 ms of which 3 ms to minimize.
[2024-05-24 04:30:47] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:30:47] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/772 variables, 6/394 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/772 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 134/906 variables, 110/504 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/906 variables, 78/582 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/906 variables, 0/582 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/906 variables, 0/582 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 582 constraints, problems are : Problem set: 2 solved, 6 unsolved in 4125 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 9/9 constraints]
After SMT, in 5998ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 3 properties in 3241 ms.
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 378 transition count 997
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 44 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 236/384 places, 968/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 670 ms. (59 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 196280 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 3
Probabilistic random walk after 196280 steps, saw 61336 distinct states, run finished after 3004 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-24 04:30:55] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 04:30:55] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 04:30:55] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 270/430 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 74/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 36/466 variables, 16/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/466 variables, 14/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 56/522 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/522 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 4/526 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/526 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 84/610 variables, 60/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/610 variables, 76/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/610 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 419 constraints, problems are : Problem set: 0 solved, 3 unsolved in 727 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 8/160 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 270/430 variables, 160/173 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/430 variables, 74/247 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:30:56] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 3/287 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-24 04:30:57] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
[2024-05-24 04:30:57] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 2/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 84/610 variables, 60/349 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/610 variables, 76/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/610 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/610 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 425 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1339 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 3/3 constraints]
After SMT, in 2089ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 194 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 04:30:57] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:30:57] [INFO ] Invariant cache hit.
[2024-05-24 04:30:58] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-24 04:30:58] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:30:58] [INFO ] Invariant cache hit.
[2024-05-24 04:30:58] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:30:59] [INFO ] Implicit Places using invariants and state equation in 1293 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
[2024-05-24 04:30:59] [INFO ] Redundant transitions in 10 ms returned []
Running 962 sub problems to find dead transitions.
[2024-05-24 04:30:59] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:30:59] [INFO ] Invariant cache hit.
[2024-05-24 04:30:59] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:31:08] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:31:08] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-05-24 04:31:08] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:31:08] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:31:08] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-05-24 04:31:09] [INFO ] Deduced a trap composed of 39 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:31:10] [INFO ] Deduced a trap composed of 68 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:31:10] [INFO ] Deduced a trap composed of 49 places in 237 ms of which 3 ms to minimize.
[2024-05-24 04:31:10] [INFO ] Deduced a trap composed of 59 places in 266 ms of which 4 ms to minimize.
[2024-05-24 04:31:10] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
[2024-05-24 04:31:10] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-05-24 04:31:11] [INFO ] Deduced a trap composed of 71 places in 269 ms of which 4 ms to minimize.
[2024-05-24 04:31:11] [INFO ] Deduced a trap composed of 69 places in 238 ms of which 3 ms to minimize.
[2024-05-24 04:31:11] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:31:11] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:31:11] [INFO ] Deduced a trap composed of 44 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:31:12] [INFO ] Deduced a trap composed of 3 places in 225 ms of which 4 ms to minimize.
[2024-05-24 04:31:12] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 4 ms to minimize.
[2024-05-24 04:31:13] [INFO ] Deduced a trap composed of 15 places in 262 ms of which 4 ms to minimize.
[2024-05-24 04:31:13] [INFO ] Deduced a trap composed of 72 places in 320 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:31:15] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:31:15] [INFO ] Deduced a trap composed of 35 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:31:15] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:31:15] [INFO ] Deduced a trap composed of 13 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:31:16] [INFO ] Deduced a trap composed of 34 places in 266 ms of which 3 ms to minimize.
[2024-05-24 04:31:16] [INFO ] Deduced a trap composed of 34 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:31:16] [INFO ] Deduced a trap composed of 57 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:31:17] [INFO ] Deduced a trap composed of 59 places in 200 ms of which 3 ms to minimize.
[2024-05-24 04:31:17] [INFO ] Deduced a trap composed of 17 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:31:17] [INFO ] Deduced a trap composed of 56 places in 277 ms of which 4 ms to minimize.
[2024-05-24 04:31:18] [INFO ] Deduced a trap composed of 54 places in 271 ms of which 3 ms to minimize.
[2024-05-24 04:31:18] [INFO ] Deduced a trap composed of 69 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:31:18] [INFO ] Deduced a trap composed of 55 places in 256 ms of which 4 ms to minimize.
[2024-05-24 04:31:19] [INFO ] Deduced a trap composed of 63 places in 267 ms of which 4 ms to minimize.
[2024-05-24 04:31:19] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 3 ms to minimize.
[2024-05-24 04:31:19] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 2 ms to minimize.
[2024-05-24 04:31:19] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 4 ms to minimize.
[2024-05-24 04:31:20] [INFO ] Deduced a trap composed of 56 places in 267 ms of which 3 ms to minimize.
[2024-05-24 04:31:20] [INFO ] Deduced a trap composed of 46 places in 300 ms of which 4 ms to minimize.
[2024-05-24 04:31:20] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:31:34] [INFO ] Deduced a trap composed of 54 places in 219 ms of which 3 ms to minimize.
[2024-05-24 04:31:34] [INFO ] Deduced a trap composed of 32 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:31:34] [INFO ] Deduced a trap composed of 11 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:31:35] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:31:36] [INFO ] Deduced a trap composed of 38 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:31:36] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:31:37] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 4 ms to minimize.
[2024-05-24 04:31:37] [INFO ] Deduced a trap composed of 42 places in 271 ms of which 4 ms to minimize.
[2024-05-24 04:31:37] [INFO ] Deduced a trap composed of 51 places in 258 ms of which 3 ms to minimize.
[2024-05-24 04:31:38] [INFO ] Deduced a trap composed of 51 places in 290 ms of which 4 ms to minimize.
[2024-05-24 04:31:38] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:31:38] [INFO ] Deduced a trap composed of 49 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:31:38] [INFO ] Deduced a trap composed of 34 places in 243 ms of which 3 ms to minimize.
[2024-05-24 04:31:39] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 3 ms to minimize.
[2024-05-24 04:31:39] [INFO ] Deduced a trap composed of 15 places in 293 ms of which 4 ms to minimize.
[2024-05-24 04:31:39] [INFO ] Deduced a trap composed of 53 places in 286 ms of which 4 ms to minimize.
[2024-05-24 04:31:39] [INFO ] Deduced a trap composed of 51 places in 275 ms of which 3 ms to minimize.
[2024-05-24 04:31:40] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 2 ms to minimize.
[2024-05-24 04:31:40] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 4 ms to minimize.
[2024-05-24 04:31:40] [INFO ] Deduced a trap composed of 32 places in 248 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:31:43] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:31:43] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 3 ms to minimize.
[2024-05-24 04:31:45] [INFO ] Deduced a trap composed of 77 places in 235 ms of which 4 ms to minimize.
[2024-05-24 04:31:46] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:31:46] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:31:46] [INFO ] Deduced a trap composed of 50 places in 266 ms of which 3 ms to minimize.
[2024-05-24 04:31:47] [INFO ] Deduced a trap composed of 55 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:31:47] [INFO ] Deduced a trap composed of 58 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:31:47] [INFO ] Deduced a trap composed of 50 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:31:48] [INFO ] Deduced a trap composed of 59 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:31:49] [INFO ] Deduced a trap composed of 59 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:31:50] [INFO ] Deduced a trap composed of 30 places in 96 ms of which 1 ms to minimize.
[2024-05-24 04:31:50] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 3 ms to minimize.
[2024-05-24 04:31:52] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 3 ms to minimize.
[2024-05-24 04:31:52] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 3 ms to minimize.
[2024-05-24 04:31:52] [INFO ] Deduced a trap composed of 17 places in 280 ms of which 10 ms to minimize.
[2024-05-24 04:31:52] [INFO ] Deduced a trap composed of 19 places in 264 ms of which 3 ms to minimize.
[2024-05-24 04:31:53] [INFO ] Deduced a trap composed of 23 places in 103 ms of which 2 ms to minimize.
[2024-05-24 04:31:53] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-05-24 04:31:54] [INFO ] Deduced a trap composed of 61 places in 302 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/610 variables, and 99 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 80/80 constraints]
After SMT, in 60464ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60475ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62278 ms. Remains : 236/236 places, 968/968 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 28 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-05-24 04:32:00] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 04:32:00] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-24 04:32:00] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 04:32:00] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 04:32:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 04:32:00] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:32:00] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 04:32:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 04:32:00] [INFO ] After 37ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-24 04:32:00] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-24 04:32:00] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 388 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1) p3), (X (X p2)), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p3)), (F p1)]
Knowledge based reduction with 4 factoid took 309 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 262 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 267 ms :[false, false, false, false, false]
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 9 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 04:32:01] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 04:32:01] [INFO ] Computed 19 invariants in 7 ms
[2024-05-24 04:32:01] [INFO ] Implicit Places using invariants in 589 ms returned []
[2024-05-24 04:32:01] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:32:01] [INFO ] Invariant cache hit.
[2024-05-24 04:32:02] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:32:04] [INFO ] Implicit Places using invariants and state equation in 2146 ms returned []
Implicit Place search using SMT with State Equation took 2736 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:32:04] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:32:04] [INFO ] Invariant cache hit.
[2024-05-24 04:32:04] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:32:18] [INFO ] Deduced a trap composed of 44 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:32:19] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:32:19] [INFO ] Deduced a trap composed of 29 places in 194 ms of which 4 ms to minimize.
[2024-05-24 04:32:19] [INFO ] Deduced a trap composed of 32 places in 247 ms of which 4 ms to minimize.
[2024-05-24 04:32:19] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 3 ms to minimize.
[2024-05-24 04:32:20] [INFO ] Deduced a trap composed of 21 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:32:20] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 3 ms to minimize.
[2024-05-24 04:32:20] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:32:20] [INFO ] Deduced a trap composed of 23 places in 392 ms of which 5 ms to minimize.
[2024-05-24 04:32:21] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-05-24 04:32:21] [INFO ] Deduced a trap composed of 28 places in 115 ms of which 2 ms to minimize.
[2024-05-24 04:32:21] [INFO ] Deduced a trap composed of 96 places in 249 ms of which 4 ms to minimize.
[2024-05-24 04:32:21] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 4 ms to minimize.
[2024-05-24 04:32:21] [INFO ] Deduced a trap composed of 58 places in 245 ms of which 4 ms to minimize.
[2024-05-24 04:32:23] [INFO ] Deduced a trap composed of 54 places in 384 ms of which 6 ms to minimize.
[2024-05-24 04:32:23] [INFO ] Deduced a trap composed of 80 places in 355 ms of which 5 ms to minimize.
[2024-05-24 04:32:24] [INFO ] Deduced a trap composed of 72 places in 354 ms of which 5 ms to minimize.
[2024-05-24 04:32:24] [INFO ] Deduced a trap composed of 78 places in 346 ms of which 5 ms to minimize.
[2024-05-24 04:32:24] [INFO ] Deduced a trap composed of 74 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:32:25] [INFO ] Deduced a trap composed of 50 places in 262 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:32:25] [INFO ] Deduced a trap composed of 5 places in 115 ms of which 2 ms to minimize.
[2024-05-24 04:32:26] [INFO ] Deduced a trap composed of 74 places in 160 ms of which 3 ms to minimize.
[2024-05-24 04:32:27] [INFO ] Deduced a trap composed of 89 places in 281 ms of which 4 ms to minimize.
[2024-05-24 04:32:27] [INFO ] Deduced a trap composed of 76 places in 416 ms of which 5 ms to minimize.
[2024-05-24 04:32:28] [INFO ] Deduced a trap composed of 86 places in 345 ms of which 4 ms to minimize.
[2024-05-24 04:32:28] [INFO ] Deduced a trap composed of 75 places in 257 ms of which 4 ms to minimize.
[2024-05-24 04:32:28] [INFO ] Deduced a trap composed of 76 places in 387 ms of which 5 ms to minimize.
[2024-05-24 04:32:29] [INFO ] Deduced a trap composed of 4 places in 423 ms of which 4 ms to minimize.
[2024-05-24 04:32:29] [INFO ] Deduced a trap composed of 3 places in 422 ms of which 5 ms to minimize.
[2024-05-24 04:32:30] [INFO ] Deduced a trap composed of 86 places in 385 ms of which 4 ms to minimize.
[2024-05-24 04:32:30] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 2 ms to minimize.
[2024-05-24 04:32:30] [INFO ] Deduced a trap composed of 86 places in 380 ms of which 5 ms to minimize.
[2024-05-24 04:32:31] [INFO ] Deduced a trap composed of 86 places in 223 ms of which 3 ms to minimize.
[2024-05-24 04:32:31] [INFO ] Deduced a trap composed of 102 places in 413 ms of which 5 ms to minimize.
[2024-05-24 04:32:31] [INFO ] Deduced a trap composed of 72 places in 433 ms of which 5 ms to minimize.
[2024-05-24 04:32:32] [INFO ] Deduced a trap composed of 20 places in 411 ms of which 5 ms to minimize.
[2024-05-24 04:32:32] [INFO ] Deduced a trap composed of 105 places in 395 ms of which 6 ms to minimize.
[2024-05-24 04:32:33] [INFO ] Deduced a trap composed of 50 places in 392 ms of which 5 ms to minimize.
[2024-05-24 04:32:33] [INFO ] Deduced a trap composed of 77 places in 404 ms of which 6 ms to minimize.
[2024-05-24 04:32:34] [INFO ] Deduced a trap composed of 100 places in 399 ms of which 6 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:32:37] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:32:37] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:32:38] [INFO ] Deduced a trap composed of 86 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:32:38] [INFO ] Deduced a trap composed of 91 places in 191 ms of which 3 ms to minimize.
[2024-05-24 04:32:39] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 3 ms to minimize.
[2024-05-24 04:32:39] [INFO ] Deduced a trap composed of 70 places in 289 ms of which 4 ms to minimize.
[2024-05-24 04:32:39] [INFO ] Deduced a trap composed of 90 places in 286 ms of which 5 ms to minimize.
[2024-05-24 04:32:40] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2024-05-24 04:32:40] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:32:41] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-24 04:32:42] [INFO ] Deduced a trap composed of 77 places in 421 ms of which 6 ms to minimize.
[2024-05-24 04:32:42] [INFO ] Deduced a trap composed of 58 places in 424 ms of which 5 ms to minimize.
[2024-05-24 04:32:43] [INFO ] Deduced a trap composed of 98 places in 428 ms of which 5 ms to minimize.
[2024-05-24 04:32:43] [INFO ] Deduced a trap composed of 38 places in 398 ms of which 5 ms to minimize.
[2024-05-24 04:32:44] [INFO ] Deduced a trap composed of 55 places in 398 ms of which 5 ms to minimize.
[2024-05-24 04:32:44] [INFO ] Deduced a trap composed of 103 places in 431 ms of which 5 ms to minimize.
[2024-05-24 04:32:44] [INFO ] Deduced a trap composed of 108 places in 403 ms of which 5 ms to minimize.
[2024-05-24 04:32:45] [INFO ] Deduced a trap composed of 39 places in 416 ms of which 5 ms to minimize.
[2024-05-24 04:32:45] [INFO ] Deduced a trap composed of 87 places in 409 ms of which 6 ms to minimize.
[2024-05-24 04:32:46] [INFO ] Deduced a trap composed of 39 places in 398 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:32:47] [INFO ] Deduced a trap composed of 58 places in 272 ms of which 5 ms to minimize.
[2024-05-24 04:32:49] [INFO ] Deduced a trap composed of 114 places in 460 ms of which 5 ms to minimize.
[2024-05-24 04:32:49] [INFO ] Deduced a trap composed of 93 places in 465 ms of which 6 ms to minimize.
[2024-05-24 04:32:50] [INFO ] Deduced a trap composed of 91 places in 381 ms of which 5 ms to minimize.
[2024-05-24 04:32:50] [INFO ] Deduced a trap composed of 93 places in 399 ms of which 5 ms to minimize.
[2024-05-24 04:32:51] [INFO ] Deduced a trap composed of 24 places in 392 ms of which 5 ms to minimize.
[2024-05-24 04:32:51] [INFO ] Deduced a trap composed of 22 places in 411 ms of which 5 ms to minimize.
[2024-05-24 04:32:52] [INFO ] Deduced a trap composed of 84 places in 383 ms of which 5 ms to minimize.
[2024-05-24 04:32:52] [INFO ] Deduced a trap composed of 93 places in 390 ms of which 6 ms to minimize.
[2024-05-24 04:32:53] [INFO ] Deduced a trap composed of 72 places in 382 ms of which 5 ms to minimize.
[2024-05-24 04:32:53] [INFO ] Deduced a trap composed of 82 places in 390 ms of which 6 ms to minimize.
[2024-05-24 04:32:53] [INFO ] Deduced a trap composed of 69 places in 395 ms of which 6 ms to minimize.
[2024-05-24 04:32:54] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
[2024-05-24 04:32:54] [INFO ] Deduced a trap composed of 95 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:32:55] [INFO ] Deduced a trap composed of 96 places in 338 ms of which 4 ms to minimize.
[2024-05-24 04:32:55] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 2 ms to minimize.
[2024-05-24 04:32:56] [INFO ] Deduced a trap composed of 89 places in 419 ms of which 5 ms to minimize.
[2024-05-24 04:32:57] [INFO ] Deduced a trap composed of 103 places in 415 ms of which 5 ms to minimize.
[2024-05-24 04:32:57] [INFO ] Deduced a trap composed of 38 places in 425 ms of which 5 ms to minimize.
[2024-05-24 04:32:58] [INFO ] Deduced a trap composed of 113 places in 408 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:32:59] [INFO ] Deduced a trap composed of 90 places in 251 ms of which 4 ms to minimize.
[2024-05-24 04:33:02] [INFO ] Deduced a trap composed of 60 places in 364 ms of which 5 ms to minimize.
[2024-05-24 04:33:02] [INFO ] Deduced a trap composed of 41 places in 348 ms of which 5 ms to minimize.
[2024-05-24 04:33:03] [INFO ] Deduced a trap composed of 86 places in 301 ms of which 4 ms to minimize.
[2024-05-24 04:33:04] [INFO ] Deduced a trap composed of 93 places in 333 ms of which 6 ms to minimize.
[2024-05-24 04:33:04] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 6 ms to minimize.
SMT process timed out in 60759ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60779ms
Finished structural reductions in LTL mode , in 1 iterations and 63530 ms. Remains : 384/384 places, 1116/1116 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 118 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 1452 ms. (27 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 326 ms. (122 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 343 ms. (116 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 5/5 properties
[2024-05-24 04:33:06] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:33:06] [INFO ] Invariant cache hit.
[2024-05-24 04:33:06] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 182/189 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/190 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 49/239 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 19/258 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 368/626 variables, 258/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 74/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/626 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 36/662 variables, 16/361 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 12/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/662 variables, 0/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 106/768 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/768 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 4/772 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/772 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 134/906 variables, 110/489 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/906 variables, 78/567 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/906 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/906 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 906/906 variables, and 567 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 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/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 182/189 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/190 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/190 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 49/239 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:33:08] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2024-05-24 04:33:08] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/239 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 19/258 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:33:08] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 368/626 variables, 258/274 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/626 variables, 74/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/626 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 36/662 variables, 16/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/662 variables, 12/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/662 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 106/768 variables, 4/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/768 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 4/772 variables, 2/382 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/772 variables, 5/387 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:33:09] [INFO ] Deduced a trap composed of 23 places in 142 ms of which 3 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/772 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/772 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 134/906 variables, 110/498 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/906 variables, 78/576 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:33:09] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/906 variables, 1/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/906 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/906 variables, 0/577 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 906/906 variables, and 577 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2620 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 384/384 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 4218ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4480 ms.
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1110
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 378 transition count 1110
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 378 transition count 997
Deduced a syphon composed of 113 places in 1 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 265 transition count 997
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 296 place count 236 transition count 968
Applied a total of 296 rules in 66 ms. Remains 236 /384 variables (removed 148) and now considering 968/1116 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 236/384 places, 968/1116 transitions.
RANDOM walk for 40000 steps (8 resets) in 1758 ms. (22 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 377 ms. (105 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 180859 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :0 out of 5
Probabilistic random walk after 180859 steps, saw 57781 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
[2024-05-24 04:33:19] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 04:33:19] [INFO ] Computed 19 invariants in 3 ms
[2024-05-24 04:33:19] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:33:19] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 270/430 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 74/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 84/610 variables, 60/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 76/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 420 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1201 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:33:20] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 8/160 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:33:20] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 270/430 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:33:21] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 84/610 variables, 60/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 76/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 428 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1873 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 3104ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 2705 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 22 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 22 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 04:33:24] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:33:24] [INFO ] Invariant cache hit.
[2024-05-24 04:33:25] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-05-24 04:33:25] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:33:25] [INFO ] Invariant cache hit.
[2024-05-24 04:33:25] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:33:26] [INFO ] Implicit Places using invariants and state equation in 1285 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2024-05-24 04:33:26] [INFO ] Redundant transitions in 10 ms returned []
Running 962 sub problems to find dead transitions.
[2024-05-24 04:33:26] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:33:26] [INFO ] Invariant cache hit.
[2024-05-24 04:33:26] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:33:35] [INFO ] Deduced a trap composed of 3 places in 278 ms of which 2 ms to minimize.
[2024-05-24 04:33:35] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 1 ms to minimize.
[2024-05-24 04:33:35] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-24 04:33:35] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:33:35] [INFO ] Deduced a trap composed of 33 places in 126 ms of which 2 ms to minimize.
[2024-05-24 04:33:36] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:33:36] [INFO ] Deduced a trap composed of 68 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:33:37] [INFO ] Deduced a trap composed of 49 places in 242 ms of which 3 ms to minimize.
[2024-05-24 04:33:37] [INFO ] Deduced a trap composed of 59 places in 261 ms of which 4 ms to minimize.
[2024-05-24 04:33:37] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-05-24 04:33:37] [INFO ] Deduced a trap composed of 25 places in 66 ms of which 2 ms to minimize.
[2024-05-24 04:33:37] [INFO ] Deduced a trap composed of 71 places in 255 ms of which 4 ms to minimize.
[2024-05-24 04:33:38] [INFO ] Deduced a trap composed of 69 places in 223 ms of which 3 ms to minimize.
[2024-05-24 04:33:38] [INFO ] Deduced a trap composed of 51 places in 212 ms of which 4 ms to minimize.
[2024-05-24 04:33:38] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:33:38] [INFO ] Deduced a trap composed of 44 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:33:38] [INFO ] Deduced a trap composed of 3 places in 190 ms of which 3 ms to minimize.
[2024-05-24 04:33:39] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 3 ms to minimize.
[2024-05-24 04:33:39] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 4 ms to minimize.
[2024-05-24 04:33:39] [INFO ] Deduced a trap composed of 72 places in 260 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:33:41] [INFO ] Deduced a trap composed of 32 places in 144 ms of which 3 ms to minimize.
[2024-05-24 04:33:41] [INFO ] Deduced a trap composed of 35 places in 172 ms of which 3 ms to minimize.
[2024-05-24 04:33:41] [INFO ] Deduced a trap composed of 61 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:33:42] [INFO ] Deduced a trap composed of 13 places in 200 ms of which 3 ms to minimize.
[2024-05-24 04:33:42] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-05-24 04:33:42] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
[2024-05-24 04:33:42] [INFO ] Deduced a trap composed of 57 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:33:43] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 3 ms to minimize.
[2024-05-24 04:33:43] [INFO ] Deduced a trap composed of 17 places in 234 ms of which 4 ms to minimize.
[2024-05-24 04:33:43] [INFO ] Deduced a trap composed of 56 places in 275 ms of which 3 ms to minimize.
[2024-05-24 04:33:44] [INFO ] Deduced a trap composed of 54 places in 265 ms of which 3 ms to minimize.
[2024-05-24 04:33:44] [INFO ] Deduced a trap composed of 69 places in 269 ms of which 3 ms to minimize.
[2024-05-24 04:33:44] [INFO ] Deduced a trap composed of 55 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:33:44] [INFO ] Deduced a trap composed of 63 places in 245 ms of which 3 ms to minimize.
[2024-05-24 04:33:45] [INFO ] Deduced a trap composed of 63 places in 220 ms of which 3 ms to minimize.
[2024-05-24 04:33:45] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2024-05-24 04:33:45] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 4 ms to minimize.
[2024-05-24 04:33:46] [INFO ] Deduced a trap composed of 56 places in 258 ms of which 3 ms to minimize.
[2024-05-24 04:33:46] [INFO ] Deduced a trap composed of 46 places in 259 ms of which 4 ms to minimize.
[2024-05-24 04:33:46] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:33:54] [INFO ] Deduced a trap composed of 54 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:33:55] [INFO ] Deduced a trap composed of 32 places in 178 ms of which 3 ms to minimize.
[2024-05-24 04:33:55] [INFO ] Deduced a trap composed of 11 places in 218 ms of which 3 ms to minimize.
[2024-05-24 04:33:56] [INFO ] Deduced a trap composed of 56 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:33:56] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 64 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 45/45 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 45/64 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:34:01] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 3 ms to minimize.
[2024-05-24 04:34:02] [INFO ] Deduced a trap composed of 36 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:34:02] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:34:02] [INFO ] Deduced a trap composed of 48 places in 299 ms of which 3 ms to minimize.
[2024-05-24 04:34:03] [INFO ] Deduced a trap composed of 40 places in 324 ms of which 4 ms to minimize.
[2024-05-24 04:34:03] [INFO ] Deduced a trap composed of 48 places in 347 ms of which 4 ms to minimize.
[2024-05-24 04:34:03] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 3 ms to minimize.
[2024-05-24 04:34:04] [INFO ] Deduced a trap composed of 38 places in 245 ms of which 3 ms to minimize.
[2024-05-24 04:34:04] [INFO ] Deduced a trap composed of 63 places in 311 ms of which 3 ms to minimize.
[2024-05-24 04:34:04] [INFO ] Deduced a trap composed of 25 places in 254 ms of which 4 ms to minimize.
[2024-05-24 04:34:05] [INFO ] Deduced a trap composed of 52 places in 292 ms of which 3 ms to minimize.
[2024-05-24 04:34:05] [INFO ] Deduced a trap composed of 45 places in 280 ms of which 4 ms to minimize.
[2024-05-24 04:34:05] [INFO ] Deduced a trap composed of 50 places in 300 ms of which 4 ms to minimize.
[2024-05-24 04:34:06] [INFO ] Deduced a trap composed of 47 places in 275 ms of which 4 ms to minimize.
[2024-05-24 04:34:06] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 1 ms to minimize.
[2024-05-24 04:34:06] [INFO ] Deduced a trap composed of 34 places in 328 ms of which 4 ms to minimize.
[2024-05-24 04:34:07] [INFO ] Deduced a trap composed of 59 places in 283 ms of which 4 ms to minimize.
[2024-05-24 04:34:07] [INFO ] Deduced a trap composed of 19 places in 111 ms of which 2 ms to minimize.
[2024-05-24 04:34:07] [INFO ] Deduced a trap composed of 28 places in 143 ms of which 2 ms to minimize.
[2024-05-24 04:34:07] [INFO ] Deduced a trap composed of 26 places in 305 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:34:12] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:34:13] [INFO ] Deduced a trap composed of 45 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:34:13] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 1 ms to minimize.
[2024-05-24 04:34:13] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 2 ms to minimize.
[2024-05-24 04:34:14] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:34:14] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 3 ms to minimize.
[2024-05-24 04:34:15] [INFO ] Deduced a trap composed of 61 places in 231 ms of which 4 ms to minimize.
[2024-05-24 04:34:15] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 4 ms to minimize.
[2024-05-24 04:34:16] [INFO ] Deduced a trap composed of 53 places in 187 ms of which 3 ms to minimize.
[2024-05-24 04:34:16] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 2 ms to minimize.
[2024-05-24 04:34:16] [INFO ] Deduced a trap composed of 19 places in 80 ms of which 2 ms to minimize.
[2024-05-24 04:34:17] [INFO ] Deduced a trap composed of 75 places in 269 ms of which 4 ms to minimize.
[2024-05-24 04:34:17] [INFO ] Deduced a trap composed of 47 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:34:17] [INFO ] Deduced a trap composed of 48 places in 230 ms of which 4 ms to minimize.
[2024-05-24 04:34:18] [INFO ] Deduced a trap composed of 56 places in 239 ms of which 4 ms to minimize.
[2024-05-24 04:34:18] [INFO ] Deduced a trap composed of 50 places in 244 ms of which 4 ms to minimize.
[2024-05-24 04:34:18] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 4 ms to minimize.
[2024-05-24 04:34:18] [INFO ] Deduced a trap composed of 47 places in 239 ms of which 4 ms to minimize.
[2024-05-24 04:34:18] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:34:19] [INFO ] Deduced a trap composed of 60 places in 246 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:34:23] [INFO ] Deduced a trap composed of 46 places in 262 ms of which 4 ms to minimize.
[2024-05-24 04:34:23] [INFO ] Deduced a trap composed of 45 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:34:24] [INFO ] Deduced a trap composed of 73 places in 248 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 236/610 variables, and 107 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 88/88 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60505ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62301 ms. Remains : 236/236 places, 968/968 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 22 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-05-24 04:34:27] [INFO ] Computed 14 invariants in 2 ms
[2024-05-24 04:34:27] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 04:34:27] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 04:34:27] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 04:34:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 04:34:27] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:34:27] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 04:34:27] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 04:34:27] [INFO ] After 65ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-24 04:34:27] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-24 04:34:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-24 04:34:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-24 04:34:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
TRAPS : Iteration 1
[2024-05-24 04:34:27] [INFO ] After 301ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-24 04:34:27] [INFO ] After 563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 750 ms.
Knowledge obtained : [(AND p2 (NOT p1) p3)]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 1 factoid took 154 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 262 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 264 ms :[false, false, false, false, false]
Product exploration explored 100000 steps with 25000 reset in 569 ms.
Product exploration explored 100000 steps with 25000 reset in 435 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 191 ms :[false, false, false, false, false]
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 384 transition count 1116
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 107 Pre rules applied. Total rules applied 6 place count 384 transition count 1284
Deduced a syphon composed of 113 places in 1 ms
Iterating global reduction 1 with 107 rules applied. Total rules applied 113 place count 384 transition count 1284
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 148 places in 2 ms
Iterating global reduction 1 with 35 rules applied. Total rules applied 148 place count 384 transition count 1284
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 154 place count 378 transition count 1278
Deduced a syphon composed of 142 places in 1 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 160 place count 378 transition count 1278
Deduced a syphon composed of 142 places in 1 ms
Applied a total of 160 rules in 83 ms. Remains 378 /384 variables (removed 6) and now considering 1278/1116 (removed -162) transitions.
[2024-05-24 04:34:30] [INFO ] Redundant transitions in 35 ms returned []
Running 1272 sub problems to find dead transitions.
[2024-05-24 04:34:30] [INFO ] Flow matrix only has 600 transitions (discarded 678 similar events)
// Phase 1: matrix 600 rows 378 cols
[2024-05-24 04:34:30] [INFO ] Computed 19 invariants in 5 ms
[2024-05-24 04:34:30] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/378 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/378 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1272 unsolved
[2024-05-24 04:34:48] [INFO ] Deduced a trap composed of 5 places in 323 ms of which 5 ms to minimize.
[2024-05-24 04:34:48] [INFO ] Deduced a trap composed of 3 places in 314 ms of which 4 ms to minimize.
[2024-05-24 04:34:48] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 4 ms to minimize.
[2024-05-24 04:34:49] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-24 04:34:49] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2024-05-24 04:34:49] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
[2024-05-24 04:34:50] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
[2024-05-24 04:34:50] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 2 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
[2024-05-24 04:34:50] [INFO ] Deduced a trap composed of 10 places in 67 ms of which 1 ms to minimize.
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
[2024-05-24 04:34:50] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
[2024-05-24 04:34:50] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
[2024-05-24 04:34:50] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
[2024-05-24 04:34:50] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
[2024-05-24 04:34:50] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 2 ms to minimize.
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
[2024-05-24 04:34:51] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 2 ms to minimize.
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
[2024-05-24 04:34:51] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
[2024-05-24 04:34:51] [INFO ] Deduced a trap composed of 30 places in 124 ms of which 3 ms to minimize.
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
[2024-05-24 04:34:51] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 2 ms to minimize.
[2024-05-24 04:34:51] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 3 ms to minimize.
[2024-05-24 04:34:51] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD821 is UNSAT
Problem TDEAD822 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD832 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD834 is UNSAT
Problem TDEAD835 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD860 is UNSAT
Problem TDEAD861 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Problem TDEAD865 is UNSAT
Problem TDEAD866 is UNSAT
Problem TDEAD867 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD871 is UNSAT
Problem TDEAD872 is UNSAT
Problem TDEAD873 is UNSAT
Problem TDEAD874 is UNSAT
Problem TDEAD875 is UNSAT
Problem TDEAD876 is UNSAT
Problem TDEAD877 is UNSAT
Problem TDEAD878 is UNSAT
Problem TDEAD879 is UNSAT
Problem TDEAD880 is UNSAT
Problem TDEAD881 is UNSAT
Problem TDEAD884 is UNSAT
Problem TDEAD885 is UNSAT
Problem TDEAD886 is UNSAT
Problem TDEAD887 is UNSAT
Problem TDEAD888 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD890 is UNSAT
Problem TDEAD891 is UNSAT
Problem TDEAD892 is UNSAT
Problem TDEAD893 is UNSAT
Problem TDEAD894 is UNSAT
Problem TDEAD897 is UNSAT
Problem TDEAD898 is UNSAT
Problem TDEAD899 is UNSAT
Problem TDEAD900 is UNSAT
Problem TDEAD901 is UNSAT
Problem TDEAD902 is UNSAT
Problem TDEAD903 is UNSAT
Problem TDEAD904 is UNSAT
Problem TDEAD905 is UNSAT
Problem TDEAD906 is UNSAT
Problem TDEAD907 is UNSAT
Problem TDEAD912 is UNSAT
Problem TDEAD913 is UNSAT
Problem TDEAD914 is UNSAT
Problem TDEAD915 is UNSAT
Problem TDEAD916 is UNSAT
Problem TDEAD917 is UNSAT
Problem TDEAD918 is UNSAT
Problem TDEAD919 is UNSAT
Problem TDEAD920 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1276 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 20/39 constraints. Problems are: Problem set: 310 solved, 962 unsolved
[2024-05-24 04:34:53] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 2 ms to minimize.
[2024-05-24 04:34:54] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2024-05-24 04:34:54] [INFO ] Deduced a trap composed of 23 places in 100 ms of which 2 ms to minimize.
[2024-05-24 04:34:54] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:34:54] [INFO ] Deduced a trap composed of 42 places in 288 ms of which 4 ms to minimize.
[2024-05-24 04:34:55] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-24 04:34:55] [INFO ] Deduced a trap composed of 51 places in 304 ms of which 3 ms to minimize.
[2024-05-24 04:34:55] [INFO ] Deduced a trap composed of 11 places in 324 ms of which 4 ms to minimize.
[2024-05-24 04:34:56] [INFO ] Deduced a trap composed of 52 places in 405 ms of which 6 ms to minimize.
[2024-05-24 04:34:56] [INFO ] Deduced a trap composed of 51 places in 307 ms of which 3 ms to minimize.
[2024-05-24 04:34:57] [INFO ] Deduced a trap composed of 45 places in 437 ms of which 5 ms to minimize.
[2024-05-24 04:34:57] [INFO ] Deduced a trap composed of 43 places in 299 ms of which 4 ms to minimize.
[2024-05-24 04:34:57] [INFO ] Deduced a trap composed of 34 places in 287 ms of which 3 ms to minimize.
[2024-05-24 04:34:58] [INFO ] Deduced a trap composed of 51 places in 287 ms of which 3 ms to minimize.
[2024-05-24 04:34:58] [INFO ] Deduced a trap composed of 52 places in 340 ms of which 5 ms to minimize.
[2024-05-24 04:34:58] [INFO ] Deduced a trap composed of 51 places in 432 ms of which 5 ms to minimize.
[2024-05-24 04:34:59] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 4 ms to minimize.
[2024-05-24 04:34:59] [INFO ] Deduced a trap composed of 24 places in 386 ms of which 5 ms to minimize.
[2024-05-24 04:35:00] [INFO ] Deduced a trap composed of 52 places in 368 ms of which 4 ms to minimize.
[2024-05-24 04:35:00] [INFO ] Deduced a trap composed of 49 places in 384 ms of which 5 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 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.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 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 20/59 constraints. Problems are: Problem set: 310 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 378/978 variables, and 59 constraints, problems are : Problem set: 310 solved, 962 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/378 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1272/1272 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 310 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 1/1 constraints. Problems are: Problem set: 310 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 40/41 constraints. Problems are: Problem set: 310 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/41 constraints. Problems are: Problem set: 310 solved, 962 unsolved
At refinement iteration 3 (OVERLAPS) 142/378 variables, 12/53 constraints. Problems are: Problem set: 310 solved, 962 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/378 variables, 6/59 constraints. Problems are: Problem set: 310 solved, 962 unsolved
[2024-05-24 04:35:12] [INFO ] Deduced a trap composed of 34 places in 420 ms of which 5 ms to minimize.
[2024-05-24 04:35:13] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 4 ms to minimize.
[2024-05-24 04:35:14] [INFO ] Deduced a trap composed of 15 places in 458 ms of which 5 ms to minimize.
[2024-05-24 04:35:15] [INFO ] Deduced a trap composed of 53 places in 409 ms of which 5 ms to minimize.
[2024-05-24 04:35:15] [INFO ] Deduced a trap composed of 17 places in 335 ms of which 3 ms to minimize.
[2024-05-24 04:35:15] [INFO ] Deduced a trap composed of 19 places in 149 ms of which 2 ms to minimize.
[2024-05-24 04:35:21] [INFO ] Deduced a trap composed of 53 places in 446 ms of which 6 ms to minimize.
[2024-05-24 04:35:21] [INFO ] Deduced a trap composed of 55 places in 426 ms of which 5 ms to minimize.
[2024-05-24 04:35:21] [INFO ] Deduced a trap composed of 40 places in 490 ms of which 6 ms to minimize.
[2024-05-24 04:35:22] [INFO ] Deduced a trap composed of 62 places in 418 ms of which 6 ms to minimize.
[2024-05-24 04:35:22] [INFO ] Deduced a trap composed of 48 places in 462 ms of which 6 ms to minimize.
[2024-05-24 04:35:23] [INFO ] Deduced a trap composed of 47 places in 351 ms of which 5 ms to minimize.
[2024-05-24 04:35:23] [INFO ] Deduced a trap composed of 40 places in 411 ms of which 5 ms to minimize.
[2024-05-24 04:35:24] [INFO ] Deduced a trap composed of 71 places in 427 ms of which 5 ms to minimize.
[2024-05-24 04:35:24] [INFO ] Deduced a trap composed of 87 places in 433 ms of which 5 ms to minimize.
[2024-05-24 04:35:25] [INFO ] Deduced a trap composed of 41 places in 405 ms of which 5 ms to minimize.
[2024-05-24 04:35:25] [INFO ] Deduced a trap composed of 50 places in 446 ms of which 5 ms to minimize.
[2024-05-24 04:35:26] [INFO ] Deduced a trap composed of 48 places in 540 ms of which 6 ms to minimize.
[2024-05-24 04:35:26] [INFO ] Deduced a trap composed of 54 places in 451 ms of which 6 ms to minimize.
[2024-05-24 04:35:27] [INFO ] Deduced a trap composed of 45 places in 409 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 20/79 constraints. Problems are: Problem set: 310 solved, 962 unsolved
[2024-05-24 04:35:30] [INFO ] Deduced a trap composed of 17 places in 400 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 1)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 1)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 378/978 variables, and 80 constraints, problems are : Problem set: 310 solved, 962 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/378 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1272 constraints, Known Traps: 61/61 constraints]
After SMT, in 60908ms problems are : Problem set: 310 solved, 962 unsolved
Search for dead transitions found 310 dead transitions in 60930ms
Found 310 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 310 transitions
Dead transitions reduction (with SMT) removed 310 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 378/384 places, 968/1116 transitions.
Graph (complete) has 2186 edges and 378 vertex of which 236 are kept as prefixes of interest. Removing 142 places using SCC suffix rule.2 ms
Discarding 142 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 36 ms. Remains 236 /378 variables (removed 142) and now considering 968/968 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 236/384 places, 968/1116 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61098 ms. Remains : 236/384 places, 968/1116 transitions.
Built C files in :
/tmp/ltsmin9819773516228491424
[2024-05-24 04:35:31] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9819773516228491424
Running compilation step : cd /tmp/ltsmin9819773516228491424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9819773516228491424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9819773516228491424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 7 out of 384 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 384/384 places, 1116/1116 transitions.
Applied a total of 0 rules in 8 ms. Remains 384 /384 variables (removed 0) and now considering 1116/1116 (removed 0) transitions.
[2024-05-24 04:35:34] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
// Phase 1: matrix 522 rows 384 cols
[2024-05-24 04:35:34] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 04:35:35] [INFO ] Implicit Places using invariants in 588 ms returned []
[2024-05-24 04:35:35] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:35:35] [INFO ] Invariant cache hit.
[2024-05-24 04:35:35] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:35:36] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 2155 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:35:36] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:35:36] [INFO ] Invariant cache hit.
[2024-05-24 04:35:36] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:35:51] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2024-05-24 04:35:52] [INFO ] Deduced a trap composed of 34 places in 155 ms of which 3 ms to minimize.
[2024-05-24 04:35:52] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 3 ms to minimize.
[2024-05-24 04:35:52] [INFO ] Deduced a trap composed of 32 places in 283 ms of which 3 ms to minimize.
[2024-05-24 04:35:52] [INFO ] Deduced a trap composed of 26 places in 150 ms of which 3 ms to minimize.
[2024-05-24 04:35:52] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 3 ms to minimize.
[2024-05-24 04:35:53] [INFO ] Deduced a trap composed of 35 places in 148 ms of which 3 ms to minimize.
[2024-05-24 04:35:53] [INFO ] Deduced a trap composed of 32 places in 162 ms of which 3 ms to minimize.
[2024-05-24 04:35:53] [INFO ] Deduced a trap composed of 23 places in 336 ms of which 5 ms to minimize.
[2024-05-24 04:35:53] [INFO ] Deduced a trap composed of 38 places in 134 ms of which 2 ms to minimize.
[2024-05-24 04:35:53] [INFO ] Deduced a trap composed of 28 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:35:54] [INFO ] Deduced a trap composed of 96 places in 295 ms of which 4 ms to minimize.
[2024-05-24 04:35:54] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 5 ms to minimize.
[2024-05-24 04:35:54] [INFO ] Deduced a trap composed of 58 places in 287 ms of which 5 ms to minimize.
[2024-05-24 04:35:56] [INFO ] Deduced a trap composed of 54 places in 463 ms of which 6 ms to minimize.
[2024-05-24 04:35:57] [INFO ] Deduced a trap composed of 80 places in 441 ms of which 6 ms to minimize.
[2024-05-24 04:35:57] [INFO ] Deduced a trap composed of 72 places in 419 ms of which 6 ms to minimize.
[2024-05-24 04:35:57] [INFO ] Deduced a trap composed of 78 places in 428 ms of which 6 ms to minimize.
[2024-05-24 04:35:58] [INFO ] Deduced a trap composed of 74 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:35:58] [INFO ] Deduced a trap composed of 50 places in 320 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:35:59] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 2 ms to minimize.
[2024-05-24 04:35:59] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 3 ms to minimize.
[2024-05-24 04:36:01] [INFO ] Deduced a trap composed of 89 places in 392 ms of which 5 ms to minimize.
[2024-05-24 04:36:01] [INFO ] Deduced a trap composed of 76 places in 381 ms of which 5 ms to minimize.
[2024-05-24 04:36:02] [INFO ] Deduced a trap composed of 86 places in 389 ms of which 5 ms to minimize.
[2024-05-24 04:36:02] [INFO ] Deduced a trap composed of 75 places in 344 ms of which 5 ms to minimize.
[2024-05-24 04:36:02] [INFO ] Deduced a trap composed of 76 places in 367 ms of which 5 ms to minimize.
[2024-05-24 04:36:03] [INFO ] Deduced a trap composed of 4 places in 454 ms of which 6 ms to minimize.
[2024-05-24 04:36:03] [INFO ] Deduced a trap composed of 3 places in 439 ms of which 6 ms to minimize.
[2024-05-24 04:36:04] [INFO ] Deduced a trap composed of 86 places in 366 ms of which 5 ms to minimize.
[2024-05-24 04:36:04] [INFO ] Deduced a trap composed of 26 places in 128 ms of which 2 ms to minimize.
[2024-05-24 04:36:04] [INFO ] Deduced a trap composed of 86 places in 365 ms of which 4 ms to minimize.
[2024-05-24 04:36:05] [INFO ] Deduced a trap composed of 86 places in 318 ms of which 5 ms to minimize.
[2024-05-24 04:36:05] [INFO ] Deduced a trap composed of 102 places in 410 ms of which 6 ms to minimize.
[2024-05-24 04:36:05] [INFO ] Deduced a trap composed of 72 places in 428 ms of which 6 ms to minimize.
[2024-05-24 04:36:06] [INFO ] Deduced a trap composed of 20 places in 421 ms of which 5 ms to minimize.
[2024-05-24 04:36:06] [INFO ] Deduced a trap composed of 105 places in 406 ms of which 6 ms to minimize.
[2024-05-24 04:36:07] [INFO ] Deduced a trap composed of 50 places in 381 ms of which 5 ms to minimize.
SMT process timed out in 30708ms, After SMT, problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 30727ms
Finished structural reductions in LTL mode , in 1 iterations and 32895 ms. Remains : 384/384 places, 1116/1116 transitions.
Built C files in :
/tmp/ltsmin9726008481188321272
[2024-05-24 04:36:07] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9726008481188321272
Running compilation step : cd /tmp/ltsmin9726008481188321272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9726008481188321272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9726008481188321272;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 04:36:10] [INFO ] Flatten gal took : 28 ms
[2024-05-24 04:36:10] [INFO ] Flatten gal took : 29 ms
[2024-05-24 04:36:10] [INFO ] Time to serialize gal into /tmp/LTL14231117451237388995.gal : 8 ms
[2024-05-24 04:36:10] [INFO ] Time to serialize properties into /tmp/LTL13802112781736726135.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14231117451237388995.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8452362141221690542.hoa' '-atoms' '/tmp/LTL13802112781736726135.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13802112781736726135.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8452362141221690542.hoa
Detected timeout of ITS tools.
[2024-05-24 04:36:25] [INFO ] Flatten gal took : 29 ms
[2024-05-24 04:36:25] [INFO ] Flatten gal took : 29 ms
[2024-05-24 04:36:25] [INFO ] Time to serialize gal into /tmp/LTL4877568429473477535.gal : 5 ms
[2024-05-24 04:36:25] [INFO ] Time to serialize properties into /tmp/LTL1018097581212247059.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4877568429473477535.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1018097581212247059.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G("(((turn_5==0)||(flag_5_waiting==0))||(p25_4_0==0))"))||(G(F((!("(((turn_0==1)&&(flag_0_idle==1))&&(p25_5_1==1))"))U(("((...588
Formula 0 simplified : XXG(F!"(((turn_5==0)||(flag_5_waiting==0))||(p25_4_0==0))" & FG("(((turn_0==1)&&(flag_0_idle==1))&&(p25_5_1==1))" M !"((!(((turn_5==...440
Detected timeout of ITS tools.
[2024-05-24 04:36:40] [INFO ] Flatten gal took : 27 ms
[2024-05-24 04:36:40] [INFO ] Applying decomposition
[2024-05-24 04:36:40] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph2116033652238559451.txt' '-o' '/tmp/graph2116033652238559451.bin' '-w' '/tmp/graph2116033652238559451.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph2116033652238559451.bin' '-l' '-1' '-v' '-w' '/tmp/graph2116033652238559451.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:36:40] [INFO ] Decomposing Gal with order
[2024-05-24 04:36:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:36:40] [INFO ] Removed a total of 1884 redundant transitions.
[2024-05-24 04:36:40] [INFO ] Flatten gal took : 100 ms
[2024-05-24 04:36:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 350 labels/synchronizations in 29 ms.
[2024-05-24 04:36:41] [INFO ] Time to serialize gal into /tmp/LTL17592534615374757398.gal : 12 ms
[2024-05-24 04:36:41] [INFO ] Time to serialize properties into /tmp/LTL4100677606336043204.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17592534615374757398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4100677606336043204.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G("(((i17.u3.turn_5==0)||(i15.i2.u1.flag_5_waiting==0))||(i17.u3.p25_4_0==0))"))||(G(F((!("(((i17.u3.turn_0==1)&&(i7.i2.u78...829
Formula 0 simplified : XXG(F!"(((i17.u3.turn_5==0)||(i15.i2.u1.flag_5_waiting==0))||(i17.u3.p25_4_0==0))" & FG("(((i17.u3.turn_0==1)&&(i7.i2.u78.flag_0_idl...627
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 409641 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||F(p1)) U X(G(((p2 U X(p1)) U p3)))))'
Support contains 9 out of 390 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 384 transition count 1116
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 384 transition count 1116
Applied a total of 12 rules in 10 ms. Remains 384 /390 variables (removed 6) and now considering 1116/1152 (removed 36) transitions.
[2024-05-24 04:36:56] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:36:56] [INFO ] Invariant cache hit.
[2024-05-24 04:36:56] [INFO ] Implicit Places using invariants in 460 ms returned []
[2024-05-24 04:36:56] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:36:56] [INFO ] Invariant cache hit.
[2024-05-24 04:36:56] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:36:58] [INFO ] Implicit Places using invariants and state equation in 1481 ms returned []
Implicit Place search using SMT with State Equation took 1942 ms to find 0 implicit places.
Running 1110 sub problems to find dead transitions.
[2024-05-24 04:36:58] [INFO ] Flow matrix only has 522 transitions (discarded 594 similar events)
[2024-05-24 04:36:58] [INFO ] Invariant cache hit.
[2024-05-24 04:36:58] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:37:11] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-05-24 04:37:12] [INFO ] Deduced a trap composed of 34 places in 148 ms of which 2 ms to minimize.
[2024-05-24 04:37:12] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 4 ms to minimize.
[2024-05-24 04:37:12] [INFO ] Deduced a trap composed of 32 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:37:12] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:37:12] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 4 ms to minimize.
[2024-05-24 04:37:13] [INFO ] Deduced a trap composed of 35 places in 161 ms of which 3 ms to minimize.
[2024-05-24 04:37:13] [INFO ] Deduced a trap composed of 32 places in 140 ms of which 2 ms to minimize.
[2024-05-24 04:37:13] [INFO ] Deduced a trap composed of 23 places in 299 ms of which 4 ms to minimize.
[2024-05-24 04:37:13] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2024-05-24 04:37:13] [INFO ] Deduced a trap composed of 28 places in 131 ms of which 2 ms to minimize.
[2024-05-24 04:37:14] [INFO ] Deduced a trap composed of 96 places in 243 ms of which 4 ms to minimize.
[2024-05-24 04:37:14] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 4 ms to minimize.
[2024-05-24 04:37:14] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 5 ms to minimize.
[2024-05-24 04:37:15] [INFO ] Deduced a trap composed of 54 places in 380 ms of which 6 ms to minimize.
[2024-05-24 04:37:16] [INFO ] Deduced a trap composed of 80 places in 344 ms of which 6 ms to minimize.
[2024-05-24 04:37:16] [INFO ] Deduced a trap composed of 72 places in 319 ms of which 3 ms to minimize.
[2024-05-24 04:37:17] [INFO ] Deduced a trap composed of 78 places in 353 ms of which 6 ms to minimize.
[2024-05-24 04:37:17] [INFO ] Deduced a trap composed of 74 places in 250 ms of which 5 ms to minimize.
[2024-05-24 04:37:17] [INFO ] Deduced a trap composed of 50 places in 258 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:37:18] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
[2024-05-24 04:37:18] [INFO ] Deduced a trap composed of 74 places in 225 ms of which 5 ms to minimize.
[2024-05-24 04:37:20] [INFO ] Deduced a trap composed of 89 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:37:20] [INFO ] Deduced a trap composed of 76 places in 287 ms of which 4 ms to minimize.
[2024-05-24 04:37:20] [INFO ] Deduced a trap composed of 86 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:37:21] [INFO ] Deduced a trap composed of 75 places in 261 ms of which 4 ms to minimize.
[2024-05-24 04:37:21] [INFO ] Deduced a trap composed of 76 places in 248 ms of which 4 ms to minimize.
[2024-05-24 04:37:21] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 5 ms to minimize.
[2024-05-24 04:37:22] [INFO ] Deduced a trap composed of 3 places in 411 ms of which 4 ms to minimize.
[2024-05-24 04:37:22] [INFO ] Deduced a trap composed of 86 places in 366 ms of which 5 ms to minimize.
[2024-05-24 04:37:22] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2024-05-24 04:37:23] [INFO ] Deduced a trap composed of 86 places in 348 ms of which 3 ms to minimize.
[2024-05-24 04:37:23] [INFO ] Deduced a trap composed of 86 places in 217 ms of which 3 ms to minimize.
[2024-05-24 04:37:23] [INFO ] Deduced a trap composed of 102 places in 278 ms of which 4 ms to minimize.
[2024-05-24 04:37:24] [INFO ] Deduced a trap composed of 72 places in 385 ms of which 5 ms to minimize.
[2024-05-24 04:37:24] [INFO ] Deduced a trap composed of 20 places in 287 ms of which 3 ms to minimize.
[2024-05-24 04:37:24] [INFO ] Deduced a trap composed of 105 places in 286 ms of which 4 ms to minimize.
[2024-05-24 04:37:25] [INFO ] Deduced a trap composed of 50 places in 379 ms of which 6 ms to minimize.
[2024-05-24 04:37:25] [INFO ] Deduced a trap composed of 77 places in 403 ms of which 5 ms to minimize.
[2024-05-24 04:37:26] [INFO ] Deduced a trap composed of 100 places in 341 ms of which 5 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 1.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.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)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 1.0)
(s97 1.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 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/906 variables, and 59 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 1110/1110 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1110 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:37:30] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-24 04:37:30] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:37:32] [INFO ] Deduced a trap composed of 86 places in 329 ms of which 5 ms to minimize.
[2024-05-24 04:37:32] [INFO ] Deduced a trap composed of 91 places in 269 ms of which 5 ms to minimize.
[2024-05-24 04:37:32] [INFO ] Deduced a trap composed of 54 places in 262 ms of which 5 ms to minimize.
[2024-05-24 04:37:33] [INFO ] Deduced a trap composed of 70 places in 305 ms of which 5 ms to minimize.
[2024-05-24 04:37:33] [INFO ] Deduced a trap composed of 90 places in 194 ms of which 3 ms to minimize.
[2024-05-24 04:37:33] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2024-05-24 04:37:34] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:37:35] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-24 04:37:36] [INFO ] Deduced a trap composed of 77 places in 394 ms of which 5 ms to minimize.
[2024-05-24 04:37:36] [INFO ] Deduced a trap composed of 58 places in 376 ms of which 5 ms to minimize.
[2024-05-24 04:37:36] [INFO ] Deduced a trap composed of 98 places in 434 ms of which 6 ms to minimize.
[2024-05-24 04:37:37] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 3 ms to minimize.
[2024-05-24 04:37:37] [INFO ] Deduced a trap composed of 55 places in 405 ms of which 5 ms to minimize.
[2024-05-24 04:37:38] [INFO ] Deduced a trap composed of 103 places in 288 ms of which 4 ms to minimize.
[2024-05-24 04:37:38] [INFO ] Deduced a trap composed of 108 places in 397 ms of which 5 ms to minimize.
[2024-05-24 04:37:38] [INFO ] Deduced a trap composed of 39 places in 409 ms of which 5 ms to minimize.
[2024-05-24 04:37:39] [INFO ] Deduced a trap composed of 87 places in 380 ms of which 5 ms to minimize.
[2024-05-24 04:37:39] [INFO ] Deduced a trap composed of 39 places in 273 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:37:40] [INFO ] Deduced a trap composed of 58 places in 245 ms of which 4 ms to minimize.
[2024-05-24 04:37:42] [INFO ] Deduced a trap composed of 114 places in 338 ms of which 3 ms to minimize.
[2024-05-24 04:37:42] [INFO ] Deduced a trap composed of 93 places in 446 ms of which 6 ms to minimize.
[2024-05-24 04:37:43] [INFO ] Deduced a trap composed of 91 places in 347 ms of which 5 ms to minimize.
[2024-05-24 04:37:43] [INFO ] Deduced a trap composed of 93 places in 377 ms of which 5 ms to minimize.
[2024-05-24 04:37:44] [INFO ] Deduced a trap composed of 24 places in 393 ms of which 5 ms to minimize.
[2024-05-24 04:37:44] [INFO ] Deduced a trap composed of 22 places in 380 ms of which 6 ms to minimize.
[2024-05-24 04:37:45] [INFO ] Deduced a trap composed of 84 places in 353 ms of which 5 ms to minimize.
[2024-05-24 04:37:45] [INFO ] Deduced a trap composed of 93 places in 370 ms of which 5 ms to minimize.
[2024-05-24 04:37:46] [INFO ] Deduced a trap composed of 72 places in 330 ms of which 4 ms to minimize.
[2024-05-24 04:37:46] [INFO ] Deduced a trap composed of 82 places in 305 ms of which 5 ms to minimize.
[2024-05-24 04:37:46] [INFO ] Deduced a trap composed of 69 places in 333 ms of which 5 ms to minimize.
[2024-05-24 04:37:47] [INFO ] Deduced a trap composed of 17 places in 106 ms of which 1 ms to minimize.
[2024-05-24 04:37:47] [INFO ] Deduced a trap composed of 95 places in 312 ms of which 4 ms to minimize.
[2024-05-24 04:37:47] [INFO ] Deduced a trap composed of 96 places in 313 ms of which 4 ms to minimize.
[2024-05-24 04:37:48] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:37:49] [INFO ] Deduced a trap composed of 89 places in 341 ms of which 5 ms to minimize.
[2024-05-24 04:37:50] [INFO ] Deduced a trap composed of 103 places in 333 ms of which 5 ms to minimize.
[2024-05-24 04:37:50] [INFO ] Deduced a trap composed of 38 places in 381 ms of which 6 ms to minimize.
[2024-05-24 04:37:50] [INFO ] Deduced a trap composed of 113 places in 405 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1110 unsolved
[2024-05-24 04:37:51] [INFO ] Deduced a trap composed of 90 places in 142 ms of which 3 ms to minimize.
[2024-05-24 04:37:54] [INFO ] Deduced a trap composed of 60 places in 226 ms of which 4 ms to minimize.
[2024-05-24 04:37:54] [INFO ] Deduced a trap composed of 41 places in 310 ms of which 5 ms to minimize.
[2024-05-24 04:37:55] [INFO ] Deduced a trap composed of 86 places in 308 ms of which 11 ms to minimize.
[2024-05-24 04:37:56] [INFO ] Deduced a trap composed of 93 places in 281 ms of which 4 ms to minimize.
[2024-05-24 04:37:56] [INFO ] Deduced a trap composed of 75 places in 401 ms of which 5 ms to minimize.
[2024-05-24 04:37:57] [INFO ] Deduced a trap composed of 78 places in 381 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 384/906 variables, and 106 constraints, problems are : Problem set: 0 solved, 1110 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/384 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/1110 constraints, Known Traps: 87/87 constraints]
After SMT, in 60533ms problems are : Problem set: 0 solved, 1110 unsolved
Search for dead transitions found 0 dead transitions in 60545ms
Starting structural reductions in LTL mode, iteration 1 : 384/390 places, 1116/1152 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62504 ms. Remains : 384/390 places, 1116/1152 transitions.
Stuttering acceptance computed with spot in 470 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-14
Product exploration explored 100000 steps with 272 reset in 281 ms.
Stack based approach found an accepted trace after 51 steps with 0 reset with depth 52 and stack size 52 in 1 ms.
FORMULA EisenbergMcGuire-PT-06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-14 finished in 63297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||(X(X(p0))&&X(p0)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-01
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 390 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 390 transition count 1146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 384 transition count 1146
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 384 transition count 1032
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 270 transition count 1032
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 246 place count 264 transition count 996
Iterating global reduction 2 with 6 rules applied. Total rules applied 252 place count 264 transition count 996
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 312 place count 234 transition count 966
Applied a total of 312 rules in 55 ms. Remains 234 /390 variables (removed 156) and now considering 966/1152 (removed 186) transitions.
[2024-05-24 04:37:59] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 04:37:59] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 04:38:00] [INFO ] Implicit Places using invariants in 531 ms returned []
[2024-05-24 04:38:00] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:38:00] [INFO ] Invariant cache hit.
[2024-05-24 04:38:00] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:38:01] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1950 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-05-24 04:38:01] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:38:01] [INFO ] Invariant cache hit.
[2024-05-24 04:38:01] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:38:09] [INFO ] Deduced a trap composed of 3 places in 231 ms of which 4 ms to minimize.
[2024-05-24 04:38:09] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2024-05-24 04:38:09] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2024-05-24 04:38:09] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:38:10] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:38:10] [INFO ] Deduced a trap composed of 39 places in 221 ms of which 3 ms to minimize.
[2024-05-24 04:38:11] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:38:11] [INFO ] Deduced a trap composed of 58 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:38:11] [INFO ] Deduced a trap composed of 27 places in 260 ms of which 3 ms to minimize.
[2024-05-24 04:38:11] [INFO ] Deduced a trap composed of 28 places in 258 ms of which 4 ms to minimize.
[2024-05-24 04:38:12] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 1 ms to minimize.
[2024-05-24 04:38:12] [INFO ] Deduced a trap composed of 53 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:38:12] [INFO ] Deduced a trap composed of 70 places in 223 ms of which 3 ms to minimize.
[2024-05-24 04:38:12] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-24 04:38:12] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:38:12] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2024-05-24 04:38:13] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
[2024-05-24 04:38:13] [INFO ] Deduced a trap composed of 51 places in 175 ms of which 2 ms to minimize.
[2024-05-24 04:38:13] [INFO ] Deduced a trap composed of 22 places in 165 ms of which 2 ms to minimize.
[2024-05-24 04:38:13] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:38:15] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-24 04:38:16] [INFO ] Deduced a trap composed of 11 places in 169 ms of which 3 ms to minimize.
[2024-05-24 04:38:17] [INFO ] Deduced a trap composed of 13 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:38:17] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-05-24 04:38:18] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:38:21] [INFO ] Deduced a trap composed of 17 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:38:21] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:38:22] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 3 ms to minimize.
[2024-05-24 04:38:22] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 3 ms to minimize.
[2024-05-24 04:38:22] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-24 04:38:22] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:38:22] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:38:22] [INFO ] Deduced a trap composed of 21 places in 117 ms of which 2 ms to minimize.
[2024-05-24 04:38:22] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 1 ms to minimize.
[2024-05-24 04:38:22] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 2 ms to minimize.
[2024-05-24 04:38:23] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 4 ms to minimize.
[2024-05-24 04:38:23] [INFO ] Deduced a trap composed of 57 places in 316 ms of which 3 ms to minimize.
[2024-05-24 04:38:23] [INFO ] Deduced a trap composed of 57 places in 305 ms of which 3 ms to minimize.
[2024-05-24 04:38:24] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 3 ms to minimize.
[2024-05-24 04:38:24] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:38:32] [INFO ] Deduced a trap composed of 32 places in 204 ms of which 3 ms to minimize.
SMT process timed out in 30597ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 30614ms
Starting structural reductions in LI_LTL mode, iteration 1 : 234/390 places, 966/1152 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 32623 ms. Remains : 234/390 places, 966/1152 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 373 ms.
Product exploration explored 100000 steps with 0 reset in 335 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 195 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 1104 ms. (36 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 603 ms. (66 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 505 ms. (79 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 356 ms. (112 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 100170 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :0 out of 6
Probabilistic random walk after 100170 steps, saw 41669 distinct states, run finished after 3005 ms. (steps per millisecond=33 ) properties seen :0
[2024-05-24 04:38:37] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:38:37] [INFO ] Invariant cache hit.
[2024-05-24 04:38:37] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:38:37] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 126/606 variables, 90/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 101/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1119 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:38:39] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 1 ms to minimize.
[2024-05-24 04:38:39] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 126/606 variables, 90/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 101/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1701 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2840ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1926 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 33 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 40000 steps (8 resets) in 2021 ms. (19 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 348 ms. (114 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 122990 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 6
Probabilistic random walk after 122990 steps, saw 47827 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
[2024-05-24 04:38:46] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:38:46] [INFO ] Invariant cache hit.
[2024-05-24 04:38:46] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:38:46] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 126/606 variables, 90/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 101/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 6 unsolved in 913 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:38:48] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2024-05-24 04:38:48] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 126/606 variables, 90/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 101/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1730 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2662ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2236 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 20 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 04:38:51] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:38:51] [INFO ] Invariant cache hit.
[2024-05-24 04:38:52] [INFO ] Implicit Places using invariants in 503 ms returned []
[2024-05-24 04:38:52] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:38:52] [INFO ] Invariant cache hit.
[2024-05-24 04:38:52] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:38:53] [INFO ] Implicit Places using invariants and state equation in 1118 ms returned []
Implicit Place search using SMT with State Equation took 1623 ms to find 0 implicit places.
[2024-05-24 04:38:53] [INFO ] Redundant transitions in 18 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-24 04:38:53] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:38:53] [INFO ] Invariant cache hit.
[2024-05-24 04:38:53] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:39:01] [INFO ] Deduced a trap composed of 3 places in 300 ms of which 3 ms to minimize.
[2024-05-24 04:39:02] [INFO ] Deduced a trap composed of 3 places in 140 ms of which 2 ms to minimize.
[2024-05-24 04:39:02] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:39:02] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:39:02] [INFO ] Deduced a trap composed of 33 places in 186 ms of which 3 ms to minimize.
[2024-05-24 04:39:03] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 3 ms to minimize.
[2024-05-24 04:39:03] [INFO ] Deduced a trap composed of 67 places in 184 ms of which 3 ms to minimize.
[2024-05-24 04:39:03] [INFO ] Deduced a trap composed of 58 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:39:03] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 3 ms to minimize.
[2024-05-24 04:39:03] [INFO ] Deduced a trap composed of 28 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:39:04] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2024-05-24 04:39:04] [INFO ] Deduced a trap composed of 53 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:39:04] [INFO ] Deduced a trap composed of 70 places in 160 ms of which 2 ms to minimize.
[2024-05-24 04:39:04] [INFO ] Deduced a trap composed of 23 places in 129 ms of which 2 ms to minimize.
[2024-05-24 04:39:04] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:39:05] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 2 ms to minimize.
[2024-05-24 04:39:05] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 2 ms to minimize.
[2024-05-24 04:39:05] [INFO ] Deduced a trap composed of 51 places in 186 ms of which 2 ms to minimize.
[2024-05-24 04:39:05] [INFO ] Deduced a trap composed of 22 places in 112 ms of which 2 ms to minimize.
[2024-05-24 04:39:05] [INFO ] Deduced a trap composed of 15 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:39:08] [INFO ] Deduced a trap composed of 11 places in 135 ms of which 2 ms to minimize.
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2024-05-24 04:39:09] [INFO ] Deduced a trap composed of 17 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:39:11] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-05-24 04:39:14] [INFO ] Deduced a trap composed of 17 places in 305 ms of which 4 ms to minimize.
[2024-05-24 04:39:14] [INFO ] Deduced a trap composed of 19 places in 288 ms of which 4 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 44 places in 266 ms of which 3 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 17 places in 152 ms of which 2 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 2 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 1 ms to minimize.
[2024-05-24 04:39:15] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 2 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 58 places in 303 ms of which 4 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 57 places in 306 ms of which 4 ms to minimize.
[2024-05-24 04:39:16] [INFO ] Deduced a trap composed of 57 places in 293 ms of which 4 ms to minimize.
[2024-05-24 04:39:17] [INFO ] Deduced a trap composed of 44 places in 295 ms of which 4 ms to minimize.
[2024-05-24 04:39:17] [INFO ] Deduced a trap composed of 64 places in 277 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 38 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:39:26] [INFO ] Deduced a trap composed of 35 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:39:27] [INFO ] Deduced a trap composed of 34 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 51 places in 193 ms of which 3 ms to minimize.
[2024-05-24 04:39:28] [INFO ] Deduced a trap composed of 52 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 56 places in 308 ms of which 4 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 52 places in 269 ms of which 4 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 3 ms to minimize.
[2024-05-24 04:39:29] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 54 places in 175 ms of which 2 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 50 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 55 places in 176 ms of which 2 ms to minimize.
[2024-05-24 04:39:30] [INFO ] Deduced a trap composed of 47 places in 156 ms of which 3 ms to minimize.
[2024-05-24 04:39:31] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 2 ms to minimize.
[2024-05-24 04:39:31] [INFO ] Deduced a trap composed of 36 places in 152 ms of which 3 ms to minimize.
[2024-05-24 04:39:31] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 2 ms to minimize.
[2024-05-24 04:39:31] [INFO ] Deduced a trap composed of 38 places in 155 ms of which 2 ms to minimize.
[2024-05-24 04:39:31] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:39:34] [INFO ] Deduced a trap composed of 54 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:39:34] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-24 04:39:35] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 3 ms to minimize.
[2024-05-24 04:39:35] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2024-05-24 04:39:36] [INFO ] Deduced a trap composed of 45 places in 204 ms of which 3 ms to minimize.
[2024-05-24 04:39:37] [INFO ] Deduced a trap composed of 45 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:39:37] [INFO ] Deduced a trap composed of 33 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:39:38] [INFO ] Deduced a trap composed of 64 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 60 places in 252 ms of which 4 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 4 ms to minimize.
[2024-05-24 04:39:39] [INFO ] Deduced a trap composed of 67 places in 232 ms of which 4 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 57 places in 297 ms of which 3 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 3 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 69 places in 274 ms of which 4 ms to minimize.
[2024-05-24 04:39:40] [INFO ] Deduced a trap composed of 46 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 52 places in 250 ms of which 4 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 51 places in 245 ms of which 3 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 47 places in 226 ms of which 3 ms to minimize.
[2024-05-24 04:39:41] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:39:42] [INFO ] Deduced a trap composed of 69 places in 276 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 2 ms to minimize.
[2024-05-24 04:39:46] [INFO ] Deduced a trap composed of 35 places in 150 ms of which 2 ms to minimize.
[2024-05-24 04:39:47] [INFO ] Deduced a trap composed of 44 places in 177 ms of which 2 ms to minimize.
[2024-05-24 04:39:50] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 4 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 46 places in 246 ms of which 3 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 52 places in 156 ms of which 2 ms to minimize.
[2024-05-24 04:39:51] [INFO ] Deduced a trap composed of 44 places in 292 ms of which 4 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 46 places in 286 ms of which 4 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 44 places in 170 ms of which 3 ms to minimize.
[2024-05-24 04:39:52] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2024-05-24 04:39:53] [INFO ] Deduced a trap composed of 51 places in 217 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 1)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 1)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 1)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 1)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 111 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 92/92 constraints]
After SMT, in 60637ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60655ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62328 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 25 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-05-24 04:39:53] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 04:39:53] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 04:39:54] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:39:54] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 04:39:54] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:39:54] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 04:39:54] [INFO ] After 65ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-24 04:39:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 04:39:54] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2024-05-24 04:39:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 64 ms
TRAPS : Iteration 1
[2024-05-24 04:39:54] [INFO ] After 293ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-24 04:39:54] [INFO ] After 547ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 717 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 192 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 5 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 04:39:55] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 04:39:55] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:39:55] [INFO ] Implicit Places using invariants in 464 ms returned []
[2024-05-24 04:39:55] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:39:55] [INFO ] Invariant cache hit.
[2024-05-24 04:39:55] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:39:57] [INFO ] Implicit Places using invariants and state equation in 1483 ms returned []
Implicit Place search using SMT with State Equation took 1949 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-05-24 04:39:57] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:39:57] [INFO ] Invariant cache hit.
[2024-05-24 04:39:57] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:40:05] [INFO ] Deduced a trap composed of 3 places in 289 ms of which 4 ms to minimize.
[2024-05-24 04:40:05] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2024-05-24 04:40:05] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 2 ms to minimize.
[2024-05-24 04:40:05] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:40:05] [INFO ] Deduced a trap composed of 33 places in 153 ms of which 3 ms to minimize.
[2024-05-24 04:40:06] [INFO ] Deduced a trap composed of 39 places in 141 ms of which 3 ms to minimize.
[2024-05-24 04:40:06] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 3 ms to minimize.
[2024-05-24 04:40:06] [INFO ] Deduced a trap composed of 58 places in 188 ms of which 3 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 2 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2024-05-24 04:40:07] [INFO ] Deduced a trap composed of 53 places in 235 ms of which 4 ms to minimize.
[2024-05-24 04:40:08] [INFO ] Deduced a trap composed of 70 places in 226 ms of which 3 ms to minimize.
[2024-05-24 04:40:08] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-24 04:40:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:40:08] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 2 ms to minimize.
[2024-05-24 04:40:08] [INFO ] Deduced a trap composed of 44 places in 233 ms of which 3 ms to minimize.
[2024-05-24 04:40:09] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 4 ms to minimize.
[2024-05-24 04:40:09] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 1 ms to minimize.
[2024-05-24 04:40:09] [INFO ] Deduced a trap composed of 15 places in 121 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:40:11] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-24 04:40:11] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 2 ms to minimize.
[2024-05-24 04:40:12] [INFO ] Deduced a trap composed of 13 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:40:12] [INFO ] Deduced a trap composed of 17 places in 157 ms of which 3 ms to minimize.
[2024-05-24 04:40:13] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-24 04:40:16] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 5 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 3 ms to minimize.
[2024-05-24 04:40:17] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 2 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 21 places in 119 ms of which 2 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 30 places in 87 ms of which 1 ms to minimize.
[2024-05-24 04:40:18] [INFO ] Deduced a trap composed of 58 places in 291 ms of which 4 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 57 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 57 places in 302 ms of which 3 ms to minimize.
[2024-05-24 04:40:19] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 2 ms to minimize.
[2024-05-24 04:40:20] [INFO ] Deduced a trap composed of 64 places in 198 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 32 places in 126 ms of which 2 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 38 places in 141 ms of which 2 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2024-05-24 04:40:30] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 2 ms to minimize.
[2024-05-24 04:40:32] [INFO ] Deduced a trap composed of 52 places in 222 ms of which 3 ms to minimize.
[2024-05-24 04:40:33] [INFO ] Deduced a trap composed of 56 places in 305 ms of which 4 ms to minimize.
[2024-05-24 04:40:33] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:40:33] [INFO ] Deduced a trap composed of 33 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 55 places in 318 ms of which 4 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 54 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 50 places in 269 ms of which 4 ms to minimize.
[2024-05-24 04:40:34] [INFO ] Deduced a trap composed of 48 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:40:35] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:40:35] [INFO ] Deduced a trap composed of 47 places in 162 ms of which 2 ms to minimize.
[2024-05-24 04:40:35] [INFO ] Deduced a trap composed of 38 places in 238 ms of which 4 ms to minimize.
[2024-05-24 04:40:35] [INFO ] Deduced a trap composed of 36 places in 222 ms of which 3 ms to minimize.
[2024-05-24 04:40:36] [INFO ] Deduced a trap composed of 47 places in 155 ms of which 2 ms to minimize.
[2024-05-24 04:40:36] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:40:36] [INFO ] Deduced a trap composed of 35 places in 160 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:40:38] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:40:39] [INFO ] Deduced a trap composed of 32 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 48 places in 248 ms of which 3 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 47 places in 158 ms of which 2 ms to minimize.
[2024-05-24 04:40:40] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 2 ms to minimize.
[2024-05-24 04:40:41] [INFO ] Deduced a trap composed of 45 places in 264 ms of which 4 ms to minimize.
[2024-05-24 04:40:42] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:40:43] [INFO ] Deduced a trap composed of 64 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:40:43] [INFO ] Deduced a trap composed of 60 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:40:44] [INFO ] Deduced a trap composed of 64 places in 283 ms of which 4 ms to minimize.
[2024-05-24 04:40:44] [INFO ] Deduced a trap composed of 67 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:40:44] [INFO ] Deduced a trap composed of 57 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:40:44] [INFO ] Deduced a trap composed of 46 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:40:45] [INFO ] Deduced a trap composed of 69 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:40:45] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:40:45] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 2 ms to minimize.
[2024-05-24 04:40:45] [INFO ] Deduced a trap composed of 51 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:40:45] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 3 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 3 ms to minimize.
[2024-05-24 04:40:46] [INFO ] Deduced a trap composed of 69 places in 258 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:40:50] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 4 ms to minimize.
[2024-05-24 04:40:51] [INFO ] Deduced a trap composed of 35 places in 185 ms of which 3 ms to minimize.
[2024-05-24 04:40:51] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 4 ms to minimize.
[2024-05-24 04:40:54] [INFO ] Deduced a trap composed of 46 places in 207 ms of which 4 ms to minimize.
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 52 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 3 ms to minimize.
[2024-05-24 04:40:55] [INFO ] Deduced a trap composed of 46 places in 285 ms of which 4 ms to minimize.
[2024-05-24 04:40:56] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 2 ms to minimize.
[2024-05-24 04:40:56] [INFO ] Deduced a trap composed of 44 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:40:56] [INFO ] Deduced a trap composed of 28 places in 68 ms of which 2 ms to minimize.
[2024-05-24 04:40:57] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 3 ms to minimize.
[2024-05-24 04:40:57] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 3 ms to minimize.
SMT process timed out in 60835ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60852ms
Finished structural reductions in LTL mode , in 1 iterations and 62810 ms. Remains : 234/234 places, 966/966 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 185 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 2693 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 459 ms. (86 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 147686 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 6
Probabilistic random walk after 147686 steps, saw 54502 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-24 04:41:02] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:41:02] [INFO ] Invariant cache hit.
[2024-05-24 04:41:02] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:41:02] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 126/606 variables, 90/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 101/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2024-05-24 04:41:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 126/606 variables, 90/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 101/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1342 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2379ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2088 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 234/234 places, 966/966 transitions.
RANDOM walk for 40000 steps (8 resets) in 2495 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 147749 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 6
Probabilistic random walk after 147749 steps, saw 54542 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-24 04:41:11] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:41:11] [INFO ] Invariant cache hit.
[2024-05-24 04:41:11] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:41:11] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 126/606 variables, 90/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/606 variables, 101/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 75/79 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 33/112 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 8/120 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 216/336 variables, 120/131 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/336 variables, 48/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/336 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 54/390 variables, 24/203 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 15/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 84/474 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 6/480 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/480 variables, 6/233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:41:13] [INFO ] Deduced a trap composed of 3 places in 89 ms of which 1 ms to minimize.
[2024-05-24 04:41:13] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/480 variables, 2/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/480 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 126/606 variables, 90/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 101/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 426 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1488 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 2617ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1788 ms.
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 37 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 04:41:15] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:41:15] [INFO ] Invariant cache hit.
[2024-05-24 04:41:16] [INFO ] Implicit Places using invariants in 434 ms returned []
[2024-05-24 04:41:16] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:41:16] [INFO ] Invariant cache hit.
[2024-05-24 04:41:16] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:41:17] [INFO ] Implicit Places using invariants and state equation in 1360 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
[2024-05-24 04:41:17] [INFO ] Redundant transitions in 17 ms returned []
Running 960 sub problems to find dead transitions.
[2024-05-24 04:41:17] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:41:17] [INFO ] Invariant cache hit.
[2024-05-24 04:41:17] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 3 places in 226 ms of which 4 ms to minimize.
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:41:26] [INFO ] Deduced a trap composed of 33 places in 161 ms of which 3 ms to minimize.
[2024-05-24 04:41:27] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2024-05-24 04:41:27] [INFO ] Deduced a trap composed of 67 places in 230 ms of which 4 ms to minimize.
[2024-05-24 04:41:27] [INFO ] Deduced a trap composed of 58 places in 233 ms of which 3 ms to minimize.
[2024-05-24 04:41:28] [INFO ] Deduced a trap composed of 27 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:41:28] [INFO ] Deduced a trap composed of 28 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:41:28] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 2 ms to minimize.
[2024-05-24 04:41:28] [INFO ] Deduced a trap composed of 53 places in 241 ms of which 4 ms to minimize.
[2024-05-24 04:41:28] [INFO ] Deduced a trap composed of 70 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:41:29] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
[2024-05-24 04:41:29] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-24 04:41:29] [INFO ] Deduced a trap composed of 48 places in 259 ms of which 4 ms to minimize.
[2024-05-24 04:41:29] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:41:30] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 4 ms to minimize.
[2024-05-24 04:41:30] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 1 ms to minimize.
[2024-05-24 04:41:30] [INFO ] Deduced a trap composed of 15 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:41:32] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:41:32] [INFO ] Deduced a trap composed of 11 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:41:33] [INFO ] Deduced a trap composed of 13 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:41:34] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:41:35] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 17 places in 288 ms of which 4 ms to minimize.
[2024-05-24 04:41:38] [INFO ] Deduced a trap composed of 19 places in 266 ms of which 2 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 3 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 17 places in 151 ms of which 2 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:41:39] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:41:40] [INFO ] Deduced a trap composed of 58 places in 238 ms of which 4 ms to minimize.
[2024-05-24 04:41:40] [INFO ] Deduced a trap composed of 57 places in 308 ms of which 4 ms to minimize.
[2024-05-24 04:41:40] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 4 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 44 places in 321 ms of which 4 ms to minimize.
[2024-05-24 04:41:41] [INFO ] Deduced a trap composed of 64 places in 305 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 59 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 32 places in 136 ms of which 3 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 3 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 3 ms to minimize.
[2024-05-24 04:41:51] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 2 ms to minimize.
[2024-05-24 04:41:52] [INFO ] Deduced a trap composed of 51 places in 134 ms of which 2 ms to minimize.
[2024-05-24 04:41:53] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 3 ms to minimize.
[2024-05-24 04:41:53] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:41:53] [INFO ] Deduced a trap composed of 52 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 33 places in 222 ms of which 4 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 55 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 4 ms to minimize.
[2024-05-24 04:41:54] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:41:55] [INFO ] Deduced a trap composed of 48 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:41:55] [INFO ] Deduced a trap composed of 55 places in 233 ms of which 3 ms to minimize.
[2024-05-24 04:41:55] [INFO ] Deduced a trap composed of 47 places in 191 ms of which 3 ms to minimize.
[2024-05-24 04:41:55] [INFO ] Deduced a trap composed of 38 places in 194 ms of which 3 ms to minimize.
[2024-05-24 04:41:55] [INFO ] Deduced a trap composed of 36 places in 184 ms of which 3 ms to minimize.
[2024-05-24 04:41:56] [INFO ] Deduced a trap composed of 47 places in 186 ms of which 3 ms to minimize.
[2024-05-24 04:41:56] [INFO ] Deduced a trap composed of 38 places in 196 ms of which 3 ms to minimize.
[2024-05-24 04:41:56] [INFO ] Deduced a trap composed of 35 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 54 places in 177 ms of which 4 ms to minimize.
[2024-05-24 04:41:58] [INFO ] Deduced a trap composed of 32 places in 173 ms of which 3 ms to minimize.
[2024-05-24 04:41:59] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 3 ms to minimize.
[2024-05-24 04:41:59] [INFO ] Deduced a trap composed of 47 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 45 places in 160 ms of which 3 ms to minimize.
[2024-05-24 04:42:00] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:42:01] [INFO ] Deduced a trap composed of 33 places in 297 ms of which 3 ms to minimize.
[2024-05-24 04:42:02] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:42:02] [INFO ] Deduced a trap composed of 60 places in 273 ms of which 4 ms to minimize.
[2024-05-24 04:42:03] [INFO ] Deduced a trap composed of 64 places in 287 ms of which 4 ms to minimize.
[2024-05-24 04:42:03] [INFO ] Deduced a trap composed of 67 places in 274 ms of which 4 ms to minimize.
[2024-05-24 04:42:03] [INFO ] Deduced a trap composed of 57 places in 277 ms of which 3 ms to minimize.
[2024-05-24 04:42:04] [INFO ] Deduced a trap composed of 46 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:42:04] [INFO ] Deduced a trap composed of 69 places in 266 ms of which 3 ms to minimize.
[2024-05-24 04:42:04] [INFO ] Deduced a trap composed of 46 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:42:04] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 3 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 51 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 7 ms to minimize.
[2024-05-24 04:42:05] [INFO ] Deduced a trap composed of 46 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:42:06] [INFO ] Deduced a trap composed of 69 places in 247 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:42:10] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 3 ms to minimize.
[2024-05-24 04:42:10] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:42:10] [INFO ] Deduced a trap composed of 44 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 3 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 3 ms to minimize.
[2024-05-24 04:42:14] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 4 ms to minimize.
[2024-05-24 04:42:15] [INFO ] Deduced a trap composed of 44 places in 272 ms of which 3 ms to minimize.
[2024-05-24 04:42:15] [INFO ] Deduced a trap composed of 46 places in 284 ms of which 4 ms to minimize.
[2024-05-24 04:42:15] [INFO ] Deduced a trap composed of 44 places in 250 ms of which 4 ms to minimize.
[2024-05-24 04:42:16] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 4 ms to minimize.
[2024-05-24 04:42:16] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 51 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 55 places in 255 ms of which 3 ms to minimize.
[2024-05-24 04:42:17] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:42:18] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:42:18] [INFO ] Deduced a trap composed of 54 places in 250 ms of which 4 ms to minimize.
SMT process timed out in 60896ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60913ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62778 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 850 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 204 transition count 237
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 159 transition count 237
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 91 place count 159 transition count 224
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 123 place count 140 transition count 224
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 0 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 239 place count 82 transition count 166
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 2 with 26 rules applied. Total rules applied 265 place count 82 transition count 140
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 275 place count 77 transition count 140
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 280 place count 77 transition count 135
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 287 place count 77 transition count 128
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 319 place count 77 transition count 96
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 351 place count 45 transition count 96
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 357 place count 45 transition count 96
Applied a total of 357 rules in 31 ms. Remains 45 /234 variables (removed 189) and now considering 96/966 (removed 870) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 96 rows 45 cols
[2024-05-24 04:42:18] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 04:42:18] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 04:42:18] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:42:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 04:42:19] [INFO ] After 97ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:42:19] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-24 04:42:19] [INFO ] After 59ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-24 04:42:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 60 ms
TRAPS : Iteration 1
[2024-05-24 04:42:19] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-24 04:42:19] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 609 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 132 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 379 ms.
Product exploration explored 100000 steps with 0 reset in 390 ms.
Built C files in :
/tmp/ltsmin1262693386658598604
[2024-05-24 04:42:20] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1262693386658598604
Running compilation step : cd /tmp/ltsmin1262693386658598604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1262693386658598604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1262693386658598604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 4 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 3 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2024-05-24 04:42:23] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2024-05-24 04:42:23] [INFO ] Computed 19 invariants in 8 ms
[2024-05-24 04:42:24] [INFO ] Implicit Places using invariants in 339 ms returned []
[2024-05-24 04:42:24] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:42:24] [INFO ] Invariant cache hit.
[2024-05-24 04:42:24] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:42:25] [INFO ] Implicit Places using invariants and state equation in 1064 ms returned []
Implicit Place search using SMT with State Equation took 1405 ms to find 0 implicit places.
Running 960 sub problems to find dead transitions.
[2024-05-24 04:42:25] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2024-05-24 04:42:25] [INFO ] Invariant cache hit.
[2024-05-24 04:42:25] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 3 places in 198 ms of which 4 ms to minimize.
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 3 places in 124 ms of which 1 ms to minimize.
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2024-05-24 04:42:32] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 33 places in 163 ms of which 3 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 3 ms to minimize.
[2024-05-24 04:42:33] [INFO ] Deduced a trap composed of 67 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 3 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 27 places in 220 ms of which 4 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 28 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-24 04:42:34] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 3 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 3 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 2 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:42:35] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 4 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 3 ms to minimize.
[2024-05-24 04:42:36] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:42:38] [INFO ] Deduced a trap composed of 11 places in 168 ms of which 3 ms to minimize.
[2024-05-24 04:42:39] [INFO ] Deduced a trap composed of 13 places in 203 ms of which 4 ms to minimize.
[2024-05-24 04:42:40] [INFO ] Deduced a trap composed of 17 places in 167 ms of which 3 ms to minimize.
[2024-05-24 04:42:41] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-24 04:42:43] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 4 ms to minimize.
[2024-05-24 04:42:43] [INFO ] Deduced a trap composed of 19 places in 236 ms of which 4 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 17 places in 113 ms of which 2 ms to minimize.
[2024-05-24 04:42:44] [INFO ] Deduced a trap composed of 37 places in 79 ms of which 2 ms to minimize.
[2024-05-24 04:42:45] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:42:45] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-05-24 04:42:45] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-24 04:42:45] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 2 ms to minimize.
[2024-05-24 04:42:45] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:42:45] [INFO ] Deduced a trap composed of 58 places in 241 ms of which 4 ms to minimize.
[2024-05-24 04:42:46] [INFO ] Deduced a trap composed of 57 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:42:46] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 2 ms to minimize.
[2024-05-24 04:42:46] [INFO ] Deduced a trap composed of 44 places in 237 ms of which 4 ms to minimize.
[2024-05-24 04:42:46] [INFO ] Deduced a trap composed of 64 places in 230 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:42:55] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 3 ms to minimize.
[2024-05-24 04:42:55] [INFO ] Deduced a trap composed of 38 places in 169 ms of which 3 ms to minimize.
[2024-05-24 04:42:55] [INFO ] Deduced a trap composed of 34 places in 170 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 Real declared 234/606 variables, and 62 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 43/43 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 43/62 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:42:58] [INFO ] Deduced a trap composed of 35 places in 200 ms of which 4 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 52 places in 257 ms of which 4 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 56 places in 228 ms of which 4 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 33 places in 215 ms of which 4 ms to minimize.
[2024-05-24 04:43:00] [INFO ] Deduced a trap composed of 36 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:43:01] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 3 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 45 places in 238 ms of which 4 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:43:02] [INFO ] Deduced a trap composed of 50 places in 260 ms of which 3 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 54 places in 325 ms of which 4 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 48 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:43:03] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 4 ms to minimize.
[2024-05-24 04:43:04] [INFO ] Deduced a trap composed of 48 places in 291 ms of which 4 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 4 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:43:05] [INFO ] Deduced a trap composed of 45 places in 256 ms of which 3 ms to minimize.
[2024-05-24 04:43:07] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 4 ms to minimize.
[2024-05-24 04:43:07] [INFO ] Deduced a trap composed of 64 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:43:07] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-05-24 04:43:07] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:43:09] [INFO ] Deduced a trap composed of 44 places in 210 ms of which 2 ms to minimize.
[2024-05-24 04:43:09] [INFO ] Deduced a trap composed of 38 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:43:10] [INFO ] Deduced a trap composed of 45 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:43:10] [INFO ] Deduced a trap composed of 35 places in 135 ms of which 2 ms to minimize.
[2024-05-24 04:43:10] [INFO ] Deduced a trap composed of 40 places in 189 ms of which 2 ms to minimize.
[2024-05-24 04:43:11] [INFO ] Deduced a trap composed of 66 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:43:12] [INFO ] Deduced a trap composed of 45 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 51 places in 267 ms of which 4 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 56 places in 293 ms of which 4 ms to minimize.
[2024-05-24 04:43:13] [INFO ] Deduced a trap composed of 64 places in 294 ms of which 4 ms to minimize.
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 69 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 70 places in 219 ms of which 4 ms to minimize.
[2024-05-24 04:43:14] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 38 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 3 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 37 places in 185 ms of which 3 ms to minimize.
[2024-05-24 04:43:15] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 5 ms to minimize.
[2024-05-24 04:43:16] [INFO ] Deduced a trap composed of 36 places in 230 ms of which 4 ms to minimize.
[2024-05-24 04:43:16] [INFO ] Deduced a trap composed of 47 places in 215 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2024-05-24 04:43:21] [INFO ] Deduced a trap composed of 68 places in 304 ms of which 3 ms to minimize.
[2024-05-24 04:43:21] [INFO ] Deduced a trap composed of 47 places in 298 ms of which 4 ms to minimize.
[2024-05-24 04:43:21] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:43:22] [INFO ] Deduced a trap composed of 70 places in 273 ms of which 4 ms to minimize.
[2024-05-24 04:43:22] [INFO ] Deduced a trap composed of 56 places in 279 ms of which 4 ms to minimize.
[2024-05-24 04:43:22] [INFO ] Deduced a trap composed of 69 places in 290 ms of which 4 ms to minimize.
[2024-05-24 04:43:22] [INFO ] Deduced a trap composed of 54 places in 256 ms of which 4 ms to minimize.
[2024-05-24 04:43:23] [INFO ] Deduced a trap composed of 46 places in 283 ms of which 3 ms to minimize.
[2024-05-24 04:43:23] [INFO ] Deduced a trap composed of 62 places in 292 ms of which 4 ms to minimize.
[2024-05-24 04:43:23] [INFO ] Deduced a trap composed of 54 places in 264 ms of which 4 ms to minimize.
[2024-05-24 04:43:24] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 4 ms to minimize.
[2024-05-24 04:43:24] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 3 ms to minimize.
[2024-05-24 04:43:24] [INFO ] Deduced a trap composed of 47 places in 243 ms of which 4 ms to minimize.
[2024-05-24 04:43:24] [INFO ] Deduced a trap composed of 46 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:43:25] [INFO ] Deduced a trap composed of 71 places in 285 ms of which 4 ms to minimize.
[2024-05-24 04:43:25] [INFO ] Deduced a trap composed of 67 places in 280 ms of which 4 ms to minimize.
[2024-05-24 04:43:25] [INFO ] Deduced a trap composed of 60 places in 274 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 119 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 100/100 constraints]
After SMT, in 60663ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60681ms
Finished structural reductions in LTL mode , in 1 iterations and 62092 ms. Remains : 234/234 places, 966/966 transitions.
Built C files in :
/tmp/ltsmin1170414831638703984
[2024-05-24 04:43:25] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1170414831638703984
Running compilation step : cd /tmp/ltsmin1170414831638703984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1170414831638703984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1170414831638703984;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 04:43:28] [INFO ] Flatten gal took : 24 ms
[2024-05-24 04:43:28] [INFO ] Flatten gal took : 25 ms
[2024-05-24 04:43:28] [INFO ] Time to serialize gal into /tmp/LTL14039787957565999971.gal : 4 ms
[2024-05-24 04:43:28] [INFO ] Time to serialize properties into /tmp/LTL2410019652566885742.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14039787957565999971.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7848096888651917196.hoa' '-atoms' '/tmp/LTL2410019652566885742.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2410019652566885742.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7848096888651917196.hoa
Detected timeout of ITS tools.
[2024-05-24 04:43:44] [INFO ] Flatten gal took : 25 ms
[2024-05-24 04:43:44] [INFO ] Flatten gal took : 24 ms
[2024-05-24 04:43:44] [INFO ] Time to serialize gal into /tmp/LTL17973343783290092732.gal : 4 ms
[2024-05-24 04:43:44] [INFO ] Time to serialize properties into /tmp/LTL7658869630468646915.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17973343783290092732.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7658869630468646915.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))"))||(G("(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))")))||((X(X("(((t...266
Formula 0 simplified : G(F!"(((turn_5==0)||(flag_5_active==0))||(p25_4_1==0))" & X(!"(((turn_5==1)&&(flag_5_active==1))&&(p25_2_1==1))" | X!"(((turn_5==1)&...193
Detected timeout of ITS tools.
[2024-05-24 04:43:59] [INFO ] Flatten gal took : 24 ms
[2024-05-24 04:43:59] [INFO ] Applying decomposition
[2024-05-24 04:43:59] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph1583659805298279077.txt' '-o' '/tmp/graph1583659805298279077.bin' '-w' '/tmp/graph1583659805298279077.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph1583659805298279077.bin' '-l' '-1' '-v' '-w' '/tmp/graph1583659805298279077.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:43:59] [INFO ] Decomposing Gal with order
[2024-05-24 04:43:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:43:59] [INFO ] Removed a total of 1781 redundant transitions.
[2024-05-24 04:43:59] [INFO ] Flatten gal took : 117 ms
[2024-05-24 04:43:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 395 labels/synchronizations in 34 ms.
[2024-05-24 04:43:59] [INFO ] Time to serialize gal into /tmp/LTL18281702719986936040.gal : 13 ms
[2024-05-24 04:43:59] [INFO ] Time to serialize properties into /tmp/LTL2904756884680568239.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18281702719986936040.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2904756884680568239.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(((G("(((i0.u1.turn_5==1)&&(i4.i0.u0.flag_5_active==1))&&(i13.u2.p25_2_1==1))"))||(G("(((i0.u1.turn_5==0)||(i4.i0.u0.flag_5_active...356
Formula 0 simplified : G(F!"(((i0.u1.turn_5==0)||(i4.i0.u0.flag_5_active==0))||(i1.i0.u4.p25_4_1==0))" & X(!"(((i0.u1.turn_5==1)&&(i4.i0.u0.flag_5_active==...261
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-01 finished in 375151 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 U (G(!p0)||!p0)) U (G((!p0 U (p1||G(!p0))))||(G(!p2)&&(!p0 U (p1||G(!p0))))))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-05
Stuttering acceptance computed with spot in 252 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 390 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 390/390 places, 1152/1152 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 390 transition count 1147
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 385 transition count 1147
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 10 place count 385 transition count 1033
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 238 place count 271 transition count 1033
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 244 place count 265 transition count 997
Iterating global reduction 2 with 6 rules applied. Total rules applied 250 place count 265 transition count 997
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 310 place count 235 transition count 967
Applied a total of 310 rules in 51 ms. Remains 235 /390 variables (removed 155) and now considering 967/1152 (removed 185) transitions.
[2024-05-24 04:44:14] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 04:44:14] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:44:15] [INFO ] Implicit Places using invariants in 535 ms returned []
[2024-05-24 04:44:15] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:44:15] [INFO ] Invariant cache hit.
[2024-05-24 04:44:15] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:44:16] [INFO ] Implicit Places using invariants and state equation in 1370 ms returned []
Implicit Place search using SMT with State Equation took 1907 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-05-24 04:44:16] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:44:16] [INFO ] Invariant cache hit.
[2024-05-24 04:44:16] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:44:26] [INFO ] Deduced a trap composed of 3 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:44:26] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
[2024-05-24 04:44:26] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:44:26] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-24 04:44:26] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 2 ms to minimize.
[2024-05-24 04:44:27] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:44:28] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
[2024-05-24 04:44:28] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:44:28] [INFO ] Deduced a trap composed of 39 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:44:28] [INFO ] Deduced a trap composed of 11 places in 86 ms of which 2 ms to minimize.
[2024-05-24 04:44:28] [INFO ] Deduced a trap composed of 23 places in 87 ms of which 2 ms to minimize.
[2024-05-24 04:44:29] [INFO ] Deduced a trap composed of 17 places in 249 ms of which 4 ms to minimize.
[2024-05-24 04:44:29] [INFO ] Deduced a trap composed of 17 places in 255 ms of which 4 ms to minimize.
[2024-05-24 04:44:29] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 4 ms to minimize.
[2024-05-24 04:44:30] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 4 ms to minimize.
[2024-05-24 04:44:30] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:44:30] [INFO ] Deduced a trap composed of 50 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:44:30] [INFO ] Deduced a trap composed of 53 places in 218 ms of which 4 ms to minimize.
[2024-05-24 04:44:30] [INFO ] Deduced a trap composed of 56 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:44:31] [INFO ] Deduced a trap composed of 41 places in 245 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:44:33] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:44:34] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 2 ms to minimize.
[2024-05-24 04:44:35] [INFO ] Deduced a trap composed of 17 places in 135 ms of which 2 ms to minimize.
[2024-05-24 04:44:36] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 1 ms to minimize.
[2024-05-24 04:44:38] [INFO ] Deduced a trap composed of 17 places in 281 ms of which 3 ms to minimize.
[2024-05-24 04:44:39] [INFO ] Deduced a trap composed of 19 places in 219 ms of which 2 ms to minimize.
[2024-05-24 04:44:39] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 4 ms to minimize.
[2024-05-24 04:44:39] [INFO ] Deduced a trap composed of 21 places in 190 ms of which 2 ms to minimize.
[2024-05-24 04:44:39] [INFO ] Deduced a trap composed of 19 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:44:40] [INFO ] Deduced a trap composed of 46 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:44:40] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 2 ms to minimize.
[2024-05-24 04:44:41] [INFO ] Deduced a trap composed of 44 places in 304 ms of which 4 ms to minimize.
[2024-05-24 04:44:41] [INFO ] Deduced a trap composed of 44 places in 274 ms of which 3 ms to minimize.
[2024-05-24 04:44:41] [INFO ] Deduced a trap composed of 68 places in 283 ms of which 4 ms to minimize.
[2024-05-24 04:44:41] [INFO ] Deduced a trap composed of 33 places in 82 ms of which 2 ms to minimize.
[2024-05-24 04:44:42] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:44:42] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2024-05-24 04:44:42] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2024-05-24 04:44:42] [INFO ] Deduced a trap composed of 56 places in 299 ms of which 4 ms to minimize.
[2024-05-24 04:44:42] [INFO ] Deduced a trap composed of 52 places in 213 ms of which 3 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 0.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 1.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:44:51] [INFO ] Deduced a trap composed of 35 places in 220 ms of which 3 ms to minimize.
[2024-05-24 04:44:53] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 3 ms to minimize.
[2024-05-24 04:44:53] [INFO ] Deduced a trap composed of 49 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:44:57] [INFO ] Deduced a trap composed of 52 places in 260 ms of which 3 ms to minimize.
[2024-05-24 04:44:58] [INFO ] Deduced a trap composed of 30 places in 99 ms of which 1 ms to minimize.
[2024-05-24 04:44:58] [INFO ] Deduced a trap composed of 25 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:44:58] [INFO ] Deduced a trap composed of 18 places in 267 ms of which 3 ms to minimize.
[2024-05-24 04:44:59] [INFO ] Deduced a trap composed of 34 places in 96 ms of which 1 ms to minimize.
[2024-05-24 04:44:59] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-24 04:44:59] [INFO ] Deduced a trap composed of 48 places in 268 ms of which 3 ms to minimize.
[2024-05-24 04:44:59] [INFO ] Deduced a trap composed of 52 places in 267 ms of which 3 ms to minimize.
[2024-05-24 04:45:00] [INFO ] Deduced a trap composed of 46 places in 221 ms of which 3 ms to minimize.
[2024-05-24 04:45:00] [INFO ] Deduced a trap composed of 46 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:45:00] [INFO ] Deduced a trap composed of 46 places in 237 ms of which 4 ms to minimize.
[2024-05-24 04:45:00] [INFO ] Deduced a trap composed of 48 places in 217 ms of which 3 ms to minimize.
[2024-05-24 04:45:01] [INFO ] Deduced a trap composed of 49 places in 222 ms of which 3 ms to minimize.
[2024-05-24 04:45:01] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 3 ms to minimize.
[2024-05-24 04:45:01] [INFO ] Deduced a trap composed of 58 places in 271 ms of which 3 ms to minimize.
[2024-05-24 04:45:02] [INFO ] Deduced a trap composed of 55 places in 284 ms of which 3 ms to minimize.
[2024-05-24 04:45:02] [INFO ] Deduced a trap composed of 61 places in 289 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:45:11] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 4 ms to minimize.
[2024-05-24 04:45:12] [INFO ] Deduced a trap composed of 45 places in 258 ms of which 3 ms to minimize.
[2024-05-24 04:45:12] [INFO ] Deduced a trap composed of 47 places in 306 ms of which 4 ms to minimize.
[2024-05-24 04:45:12] [INFO ] Deduced a trap composed of 52 places in 305 ms of which 4 ms to minimize.
[2024-05-24 04:45:13] [INFO ] Deduced a trap composed of 45 places in 313 ms of which 4 ms to minimize.
[2024-05-24 04:45:13] [INFO ] Deduced a trap composed of 47 places in 304 ms of which 3 ms to minimize.
[2024-05-24 04:45:14] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 4 ms to minimize.
[2024-05-24 04:45:14] [INFO ] Deduced a trap composed of 34 places in 301 ms of which 3 ms to minimize.
[2024-05-24 04:45:14] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 3 ms to minimize.
[2024-05-24 04:45:15] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:45:15] [INFO ] Deduced a trap composed of 52 places in 280 ms of which 4 ms to minimize.
[2024-05-24 04:45:16] [INFO ] Deduced a trap composed of 55 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:45:16] [INFO ] Deduced a trap composed of 51 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:45:16] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 4 ms to minimize.
[2024-05-24 04:45:17] [INFO ] Deduced a trap composed of 47 places in 319 ms of which 3 ms to minimize.
[2024-05-24 04:45:17] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 4 ms to minimize.
SMT process timed out in 60944ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60962ms
Starting structural reductions in LI_LTL mode, iteration 1 : 235/390 places, 967/1152 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62923 ms. Remains : 235/390 places, 967/1152 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 470 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 184 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 5 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 275 ms :[(AND p0 (NOT p1)), (AND p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 2072 ms. (19 steps per ms) remains 5/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 376 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 5/5 properties
[2024-05-24 04:45:20] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:45:20] [INFO ] Invariant cache hit.
[2024-05-24 04:45:20] [INFO ] State equation strengthened by 164 read => feed constraints.
Problem apf3 is UNSAT
Problem apf9 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 3 unsolved
Problem apf6 is UNSAT
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 217/338 variables, 121/131 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/338 variables, 46/177 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 0/177 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 54/392 variables, 24/201 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/392 variables, 18/219 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 0/219 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 84/476 variables, 6/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/476 variables, 0/225 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/482 variables, 3/228 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/482 variables, 0/228 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 126/608 variables, 90/318 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 100/418 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 0/418 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/608 variables, 0/418 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 418 constraints, problems are : Problem set: 3 solved, 2 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 3 solved, 2 unsolved
[2024-05-24 04:45:21] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/231 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 0/231 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 126/608 variables, 90/321 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 100/421 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 0/421 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/608 variables, 0/421 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 421 constraints, problems are : Problem set: 3 solved, 2 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1132ms problems are : Problem set: 3 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 24 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 235/235 places, 967/967 transitions.
RANDOM walk for 40000 steps (8 resets) in 583 ms. (68 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 309701 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 309701 steps, saw 92656 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2024-05-24 04:45:25] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:45:25] [INFO ] Invariant cache hit.
[2024-05-24 04:45:25] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:45:25] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 126/608 variables, 90/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 100/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 511 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:45:26] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 875 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1397ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 231 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 32 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 31 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 04:45:26] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:45:26] [INFO ] Invariant cache hit.
[2024-05-24 04:45:27] [INFO ] Implicit Places using invariants in 540 ms returned []
[2024-05-24 04:45:27] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:45:27] [INFO ] Invariant cache hit.
[2024-05-24 04:45:27] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:45:28] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1593 ms to find 0 implicit places.
[2024-05-24 04:45:28] [INFO ] Redundant transitions in 17 ms returned []
Running 961 sub problems to find dead transitions.
[2024-05-24 04:45:28] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:45:28] [INFO ] Invariant cache hit.
[2024-05-24 04:45:28] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:45:36] [INFO ] Deduced a trap composed of 3 places in 243 ms of which 2 ms to minimize.
[2024-05-24 04:45:36] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2024-05-24 04:45:36] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-05-24 04:45:36] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:45:36] [INFO ] Deduced a trap composed of 33 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:45:37] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:45:37] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:45:38] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 4 ms to minimize.
[2024-05-24 04:45:38] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:45:38] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-05-24 04:45:38] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-24 04:45:39] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 4 ms to minimize.
[2024-05-24 04:45:39] [INFO ] Deduced a trap composed of 17 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:45:39] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 4 ms to minimize.
[2024-05-24 04:45:39] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 3 ms to minimize.
[2024-05-24 04:45:40] [INFO ] Deduced a trap composed of 39 places in 216 ms of which 4 ms to minimize.
[2024-05-24 04:45:40] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 3 ms to minimize.
[2024-05-24 04:45:40] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:45:40] [INFO ] Deduced a trap composed of 56 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:45:41] [INFO ] Deduced a trap composed of 41 places in 247 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:45:43] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:45:44] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:45:45] [INFO ] Deduced a trap composed of 17 places in 163 ms of which 3 ms to minimize.
[2024-05-24 04:45:46] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 1 ms to minimize.
[2024-05-24 04:45:49] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 3 ms to minimize.
[2024-05-24 04:45:49] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 4 ms to minimize.
[2024-05-24 04:45:49] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 2 ms to minimize.
[2024-05-24 04:45:50] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 3 ms to minimize.
[2024-05-24 04:45:50] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:45:51] [INFO ] Deduced a trap composed of 46 places in 307 ms of which 4 ms to minimize.
[2024-05-24 04:45:51] [INFO ] Deduced a trap composed of 46 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:45:51] [INFO ] Deduced a trap composed of 44 places in 291 ms of which 4 ms to minimize.
[2024-05-24 04:45:51] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:45:52] [INFO ] Deduced a trap composed of 68 places in 279 ms of which 3 ms to minimize.
[2024-05-24 04:45:52] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 1 ms to minimize.
[2024-05-24 04:45:52] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:45:52] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2024-05-24 04:45:52] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-24 04:45:53] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 4 ms to minimize.
[2024-05-24 04:45:53] [INFO ] Deduced a trap composed of 52 places in 280 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.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 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 1.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.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 1.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 1.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:46:02] [INFO ] Deduced a trap composed of 35 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:46:03] [INFO ] Deduced a trap composed of 34 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:46:03] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 3 ms to minimize.
[2024-05-24 04:46:07] [INFO ] Deduced a trap composed of 52 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:46:07] [INFO ] Deduced a trap composed of 30 places in 97 ms of which 1 ms to minimize.
[2024-05-24 04:46:08] [INFO ] Deduced a trap composed of 25 places in 274 ms of which 3 ms to minimize.
[2024-05-24 04:46:08] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 3 ms to minimize.
[2024-05-24 04:46:08] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-05-24 04:46:08] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-05-24 04:46:09] [INFO ] Deduced a trap composed of 48 places in 277 ms of which 3 ms to minimize.
[2024-05-24 04:46:09] [INFO ] Deduced a trap composed of 52 places in 250 ms of which 3 ms to minimize.
[2024-05-24 04:46:09] [INFO ] Deduced a trap composed of 46 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:46:10] [INFO ] Deduced a trap composed of 46 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:46:10] [INFO ] Deduced a trap composed of 46 places in 249 ms of which 3 ms to minimize.
[2024-05-24 04:46:10] [INFO ] Deduced a trap composed of 48 places in 218 ms of which 3 ms to minimize.
[2024-05-24 04:46:10] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:46:11] [INFO ] Deduced a trap composed of 44 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:46:11] [INFO ] Deduced a trap composed of 58 places in 289 ms of which 4 ms to minimize.
[2024-05-24 04:46:12] [INFO ] Deduced a trap composed of 55 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:46:12] [INFO ] Deduced a trap composed of 61 places in 315 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:46:21] [INFO ] Deduced a trap composed of 45 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:46:21] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 4 ms to minimize.
[2024-05-24 04:46:21] [INFO ] Deduced a trap composed of 47 places in 318 ms of which 4 ms to minimize.
[2024-05-24 04:46:22] [INFO ] Deduced a trap composed of 52 places in 304 ms of which 4 ms to minimize.
[2024-05-24 04:46:22] [INFO ] Deduced a trap composed of 45 places in 300 ms of which 4 ms to minimize.
[2024-05-24 04:46:22] [INFO ] Deduced a trap composed of 47 places in 301 ms of which 4 ms to minimize.
[2024-05-24 04:46:23] [INFO ] Deduced a trap composed of 55 places in 270 ms of which 3 ms to minimize.
[2024-05-24 04:46:24] [INFO ] Deduced a trap composed of 34 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:46:24] [INFO ] Deduced a trap composed of 59 places in 271 ms of which 3 ms to minimize.
[2024-05-24 04:46:24] [INFO ] Deduced a trap composed of 44 places in 288 ms of which 3 ms to minimize.
[2024-05-24 04:46:25] [INFO ] Deduced a trap composed of 52 places in 281 ms of which 4 ms to minimize.
[2024-05-24 04:46:25] [INFO ] Deduced a trap composed of 55 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:46:25] [INFO ] Deduced a trap composed of 51 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:46:26] [INFO ] Deduced a trap composed of 52 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:46:27] [INFO ] Deduced a trap composed of 47 places in 315 ms of which 4 ms to minimize.
[2024-05-24 04:46:27] [INFO ] Deduced a trap composed of 49 places in 276 ms of which 4 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 235/608 variables, and 95 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 76/76 constraints]
After SMT, in 60701ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60718ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62371 ms. Remains : 235/235 places, 967/967 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 29 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-05-24 04:46:29] [INFO ] Computed 13 invariants in 1 ms
[2024-05-24 04:46:29] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 04:46:29] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:46:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 04:46:29] [INFO ] After 71ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:46:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:46:29] [INFO ] After 28ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:46:29] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 04:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-24 04:46:29] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-24 04:46:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
TRAPS : Iteration 1
[2024-05-24 04:46:29] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:46:29] [INFO ] After 338ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 516 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (X (NOT p2))), (X (X (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p2 p1)), (G (OR (NOT p0) (NOT p2) p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) p1)))), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p1))]
Knowledge based reduction with 11 factoid took 411 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 200 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1)]
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 5 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 04:46:30] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 04:46:30] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 04:46:31] [INFO ] Implicit Places using invariants in 532 ms returned []
[2024-05-24 04:46:31] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:46:31] [INFO ] Invariant cache hit.
[2024-05-24 04:46:31] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:46:32] [INFO ] Implicit Places using invariants and state equation in 1350 ms returned []
Implicit Place search using SMT with State Equation took 1887 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-05-24 04:46:32] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:46:32] [INFO ] Invariant cache hit.
[2024-05-24 04:46:32] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:46:42] [INFO ] Deduced a trap composed of 3 places in 274 ms of which 4 ms to minimize.
[2024-05-24 04:46:42] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2024-05-24 04:46:42] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-24 04:46:42] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:46:42] [INFO ] Deduced a trap composed of 33 places in 176 ms of which 3 ms to minimize.
[2024-05-24 04:46:42] [INFO ] Deduced a trap composed of 57 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:46:43] [INFO ] Deduced a trap composed of 34 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:46:44] [INFO ] Deduced a trap composed of 35 places in 204 ms of which 3 ms to minimize.
[2024-05-24 04:46:44] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 4 ms to minimize.
[2024-05-24 04:46:44] [INFO ] Deduced a trap composed of 11 places in 93 ms of which 2 ms to minimize.
[2024-05-24 04:46:44] [INFO ] Deduced a trap composed of 23 places in 93 ms of which 2 ms to minimize.
[2024-05-24 04:46:45] [INFO ] Deduced a trap composed of 17 places in 250 ms of which 3 ms to minimize.
[2024-05-24 04:46:45] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 3 ms to minimize.
[2024-05-24 04:46:45] [INFO ] Deduced a trap composed of 56 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:46:45] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 3 ms to minimize.
[2024-05-24 04:46:46] [INFO ] Deduced a trap composed of 39 places in 223 ms of which 3 ms to minimize.
[2024-05-24 04:46:46] [INFO ] Deduced a trap composed of 50 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:46:46] [INFO ] Deduced a trap composed of 53 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:46:46] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:46:47] [INFO ] Deduced a trap composed of 41 places in 189 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:46:49] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:46:50] [INFO ] Deduced a trap composed of 13 places in 182 ms of which 2 ms to minimize.
[2024-05-24 04:46:50] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 3 ms to minimize.
[2024-05-24 04:46:51] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 2 ms to minimize.
[2024-05-24 04:46:54] [INFO ] Deduced a trap composed of 17 places in 212 ms of which 2 ms to minimize.
[2024-05-24 04:46:55] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 3 ms to minimize.
[2024-05-24 04:46:55] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 2 ms to minimize.
[2024-05-24 04:46:55] [INFO ] Deduced a trap composed of 21 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:46:55] [INFO ] Deduced a trap composed of 19 places in 182 ms of which 3 ms to minimize.
[2024-05-24 04:46:56] [INFO ] Deduced a trap composed of 46 places in 233 ms of which 2 ms to minimize.
[2024-05-24 04:46:57] [INFO ] Deduced a trap composed of 46 places in 278 ms of which 3 ms to minimize.
[2024-05-24 04:46:57] [INFO ] Deduced a trap composed of 44 places in 280 ms of which 3 ms to minimize.
[2024-05-24 04:46:57] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 3 ms to minimize.
[2024-05-24 04:46:57] [INFO ] Deduced a trap composed of 68 places in 292 ms of which 4 ms to minimize.
[2024-05-24 04:46:57] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2024-05-24 04:46:58] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 2 ms to minimize.
[2024-05-24 04:46:58] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2024-05-24 04:46:58] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-24 04:46:58] [INFO ] Deduced a trap composed of 56 places in 252 ms of which 4 ms to minimize.
[2024-05-24 04:46:58] [INFO ] Deduced a trap composed of 52 places in 302 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 59 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:47:06] [INFO ] Deduced a trap composed of 35 places in 156 ms of which 2 ms to minimize.
[2024-05-24 04:47:07] [INFO ] Deduced a trap composed of 34 places in 196 ms of which 3 ms to minimize.
[2024-05-24 04:47:07] [INFO ] Deduced a trap composed of 49 places in 214 ms of which 3 ms to minimize.
[2024-05-24 04:47:11] [INFO ] Deduced a trap composed of 52 places in 262 ms of which 4 ms to minimize.
[2024-05-24 04:47:12] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 1 ms to minimize.
[2024-05-24 04:47:12] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 2 ms to minimize.
[2024-05-24 04:47:12] [INFO ] Deduced a trap composed of 18 places in 277 ms of which 4 ms to minimize.
[2024-05-24 04:47:13] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-05-24 04:47:13] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:47:13] [INFO ] Deduced a trap composed of 48 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:47:13] [INFO ] Deduced a trap composed of 52 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:47:14] [INFO ] Deduced a trap composed of 46 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:47:14] [INFO ] Deduced a trap composed of 46 places in 171 ms of which 3 ms to minimize.
[2024-05-24 04:47:14] [INFO ] Deduced a trap composed of 46 places in 196 ms of which 2 ms to minimize.
[2024-05-24 04:47:14] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 3 ms to minimize.
[2024-05-24 04:47:14] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 3 ms to minimize.
[2024-05-24 04:47:15] [INFO ] Deduced a trap composed of 44 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:47:15] [INFO ] Deduced a trap composed of 58 places in 288 ms of which 4 ms to minimize.
[2024-05-24 04:47:16] [INFO ] Deduced a trap composed of 55 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:47:16] [INFO ] Deduced a trap composed of 61 places in 293 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:47:25] [INFO ] Deduced a trap composed of 45 places in 279 ms of which 4 ms to minimize.
[2024-05-24 04:47:25] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 2 ms to minimize.
[2024-05-24 04:47:25] [INFO ] Deduced a trap composed of 47 places in 303 ms of which 4 ms to minimize.
[2024-05-24 04:47:26] [INFO ] Deduced a trap composed of 52 places in 247 ms of which 4 ms to minimize.
[2024-05-24 04:47:26] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 4 ms to minimize.
[2024-05-24 04:47:26] [INFO ] Deduced a trap composed of 47 places in 248 ms of which 4 ms to minimize.
[2024-05-24 04:47:27] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 3 ms to minimize.
[2024-05-24 04:47:27] [INFO ] Deduced a trap composed of 34 places in 250 ms of which 4 ms to minimize.
[2024-05-24 04:47:27] [INFO ] Deduced a trap composed of 59 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:47:28] [INFO ] Deduced a trap composed of 44 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:47:28] [INFO ] Deduced a trap composed of 52 places in 221 ms of which 3 ms to minimize.
[2024-05-24 04:47:29] [INFO ] Deduced a trap composed of 55 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:47:29] [INFO ] Deduced a trap composed of 51 places in 191 ms of which 3 ms to minimize.
[2024-05-24 04:47:29] [INFO ] Deduced a trap composed of 52 places in 208 ms of which 4 ms to minimize.
[2024-05-24 04:47:30] [INFO ] Deduced a trap composed of 47 places in 255 ms of which 3 ms to minimize.
[2024-05-24 04:47:30] [INFO ] Deduced a trap composed of 49 places in 236 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/608 variables, and 95 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 76/76 constraints]
After SMT, in 60690ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60707ms
Finished structural reductions in LTL mode , in 1 iterations and 62604 ms. Remains : 235/235 places, 967/967 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (8 resets) in 1132 ms. (35 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 2/2 properties
[2024-05-24 04:47:34] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:47:34] [INFO ] Invariant cache hit.
[2024-05-24 04:47:34] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:47:34] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 126/608 variables, 90/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 100/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 629 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:47:35] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1526ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 192 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 32 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 235/235 places, 967/967 transitions.
RANDOM walk for 40000 steps (8 resets) in 1053 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 319683 steps, run timeout after 3001 ms. (steps per millisecond=106 ) properties seen :0 out of 2
Probabilistic random walk after 319683 steps, saw 95301 distinct states, run finished after 3001 ms. (steps per millisecond=106 ) properties seen :0
[2024-05-24 04:47:39] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:47:39] [INFO ] Invariant cache hit.
[2024-05-24 04:47:39] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:47:39] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 126/608 variables, 90/319 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/608 variables, 100/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/608 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 608/608 variables, and 419 constraints, problems are : Problem set: 0 solved, 2 unsolved in 663 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 33/113 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/113 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 8/121 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/121 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 217/338 variables, 121/132 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 46/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 54/392 variables, 24/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/392 variables, 18/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/392 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 84/476 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/476 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 6/482 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/482 variables, 2/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-24 04:47:40] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/482 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/482 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 126/608 variables, 90/322 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/608 variables, 100/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/608 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 608/608 variables, and 422 constraints, problems are : Problem set: 0 solved, 2 unsolved in 880 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 235/235 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1560ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 189 ms.
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 32 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 235/235 places, 967/967 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 31 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 04:47:41] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:47:41] [INFO ] Invariant cache hit.
[2024-05-24 04:47:41] [INFO ] Implicit Places using invariants in 544 ms returned []
[2024-05-24 04:47:41] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:47:41] [INFO ] Invariant cache hit.
[2024-05-24 04:47:41] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:47:42] [INFO ] Implicit Places using invariants and state equation in 1304 ms returned []
Implicit Place search using SMT with State Equation took 1850 ms to find 0 implicit places.
[2024-05-24 04:47:42] [INFO ] Redundant transitions in 16 ms returned []
Running 961 sub problems to find dead transitions.
[2024-05-24 04:47:42] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:47:42] [INFO ] Invariant cache hit.
[2024-05-24 04:47:42] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:47:52] [INFO ] Deduced a trap composed of 3 places in 290 ms of which 4 ms to minimize.
[2024-05-24 04:47:52] [INFO ] Deduced a trap composed of 3 places in 123 ms of which 2 ms to minimize.
[2024-05-24 04:47:52] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 3 ms to minimize.
[2024-05-24 04:47:52] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:47:53] [INFO ] Deduced a trap composed of 33 places in 177 ms of which 3 ms to minimize.
[2024-05-24 04:47:53] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 3 ms to minimize.
[2024-05-24 04:47:54] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:47:54] [INFO ] Deduced a trap composed of 35 places in 166 ms of which 3 ms to minimize.
[2024-05-24 04:47:54] [INFO ] Deduced a trap composed of 39 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:47:54] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 1 ms to minimize.
[2024-05-24 04:47:55] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 1 ms to minimize.
[2024-05-24 04:47:55] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 4 ms to minimize.
[2024-05-24 04:47:55] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 4 ms to minimize.
[2024-05-24 04:47:55] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:47:56] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:47:56] [INFO ] Deduced a trap composed of 39 places in 225 ms of which 4 ms to minimize.
[2024-05-24 04:47:56] [INFO ] Deduced a trap composed of 50 places in 250 ms of which 3 ms to minimize.
[2024-05-24 04:47:56] [INFO ] Deduced a trap composed of 53 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:47:57] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 3 ms to minimize.
[2024-05-24 04:47:57] [INFO ] Deduced a trap composed of 41 places in 282 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:47:59] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:48:01] [INFO ] Deduced a trap composed of 13 places in 249 ms of which 4 ms to minimize.
[2024-05-24 04:48:01] [INFO ] Deduced a trap composed of 17 places in 188 ms of which 3 ms to minimize.
[2024-05-24 04:48:02] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:48:04] [INFO ] Deduced a trap composed of 17 places in 161 ms of which 2 ms to minimize.
[2024-05-24 04:48:04] [INFO ] Deduced a trap composed of 19 places in 164 ms of which 2 ms to minimize.
[2024-05-24 04:48:04] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:48:04] [INFO ] Deduced a trap composed of 21 places in 144 ms of which 2 ms to minimize.
[2024-05-24 04:48:04] [INFO ] Deduced a trap composed of 19 places in 143 ms of which 2 ms to minimize.
[2024-05-24 04:48:05] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:48:05] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:48:05] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2024-05-24 04:48:05] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 2 ms to minimize.
[2024-05-24 04:48:06] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 3 ms to minimize.
[2024-05-24 04:48:06] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:48:06] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:48:06] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:48:06] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:48:06] [INFO ] Deduced a trap composed of 56 places in 168 ms of which 3 ms to minimize.
[2024-05-24 04:48:06] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:48:13] [INFO ] Deduced a trap composed of 35 places in 125 ms of which 2 ms to minimize.
SMT process timed out in 30735ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 30751ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32658 ms. Remains : 235/235 places, 967/967 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 864 edges and 235 vertex of which 36 / 235 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 205 transition count 236
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 80 transition count 164
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 274 place count 80 transition count 135
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 286 place count 74 transition count 135
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 292 place count 74 transition count 129
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 298 place count 74 transition count 123
Free-agglomeration rule applied 29 times.
Iterating global reduction 4 with 29 rules applied. Total rules applied 327 place count 74 transition count 94
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 4 with 29 rules applied. Total rules applied 356 place count 45 transition count 94
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 362 place count 45 transition count 94
Applied a total of 362 rules in 21 ms. Remains 45 /235 variables (removed 190) and now considering 94/967 (removed 873) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 45 cols
[2024-05-24 04:48:13] [INFO ] Computed 13 invariants in 0 ms
[2024-05-24 04:48:13] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 04:48:13] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 04:48:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2024-05-24 04:48:13] [INFO ] After 45ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 04:48:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-24 04:48:13] [INFO ] After 16ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 04:48:13] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 0 ms to minimize.
[2024-05-24 04:48:13] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-24 04:48:13] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-24 04:48:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 70 ms
TRAPS : Iteration 1
[2024-05-24 04:48:13] [INFO ] After 121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 04:48:14] [INFO ] After 215ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 291 ms.
Knowledge obtained : [(AND (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND p2 p1)))), (X (X (AND (NOT p2) p1))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2))))]
Knowledge based reduction with 5 factoid took 138 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 254 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 379 ms.
Product exploration explored 100000 steps with 0 reset in 456 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 145 ms :[(NOT p1), (AND (NOT p1) p2), (NOT p1), (NOT p1)]
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 33 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 04:48:15] [INFO ] Redundant transitions in 17 ms returned []
Running 961 sub problems to find dead transitions.
[2024-05-24 04:48:16] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
// Phase 1: matrix 373 rows 235 cols
[2024-05-24 04:48:16] [INFO ] Computed 19 invariants in 1 ms
[2024-05-24 04:48:16] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:48:22] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:48:22] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 1 ms to minimize.
[2024-05-24 04:48:22] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 2 ms to minimize.
[2024-05-24 04:48:22] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:48:22] [INFO ] Deduced a trap composed of 33 places in 165 ms of which 2 ms to minimize.
[2024-05-24 04:48:23] [INFO ] Deduced a trap composed of 39 places in 181 ms of which 3 ms to minimize.
[2024-05-24 04:48:23] [INFO ] Deduced a trap composed of 33 places in 175 ms of which 3 ms to minimize.
[2024-05-24 04:48:23] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 3 ms to minimize.
[2024-05-24 04:48:24] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 3 ms to minimize.
[2024-05-24 04:48:24] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 2 ms to minimize.
[2024-05-24 04:48:24] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
[2024-05-24 04:48:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:48:24] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 3 ms to minimize.
[2024-05-24 04:48:25] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 1 ms to minimize.
[2024-05-24 04:48:25] [INFO ] Deduced a trap composed of 45 places in 188 ms of which 3 ms to minimize.
[2024-05-24 04:48:25] [INFO ] Deduced a trap composed of 15 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:48:25] [INFO ] Deduced a trap composed of 70 places in 231 ms of which 4 ms to minimize.
[2024-05-24 04:48:26] [INFO ] Deduced a trap composed of 56 places in 147 ms of which 2 ms to minimize.
[2024-05-24 04:48:26] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:48:26] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:48:27] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2024-05-24 04:48:27] [INFO ] Deduced a trap composed of 61 places in 107 ms of which 2 ms to minimize.
[2024-05-24 04:48:27] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 3 ms to minimize.
[2024-05-24 04:48:28] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:48:28] [INFO ] Deduced a trap composed of 55 places in 200 ms of which 3 ms to minimize.
[2024-05-24 04:48:28] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 3 ms to minimize.
[2024-05-24 04:48:28] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:48:29] [INFO ] Deduced a trap composed of 58 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:48:29] [INFO ] Deduced a trap composed of 76 places in 142 ms of which 2 ms to minimize.
[2024-05-24 04:48:29] [INFO ] Deduced a trap composed of 63 places in 143 ms of which 2 ms to minimize.
[2024-05-24 04:48:29] [INFO ] Deduced a trap composed of 83 places in 224 ms of which 4 ms to minimize.
[2024-05-24 04:48:29] [INFO ] Deduced a trap composed of 44 places in 194 ms of which 2 ms to minimize.
[2024-05-24 04:48:29] [INFO ] Deduced a trap composed of 55 places in 134 ms of which 2 ms to minimize.
[2024-05-24 04:48:30] [INFO ] Deduced a trap composed of 51 places in 141 ms of which 2 ms to minimize.
[2024-05-24 04:48:30] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 2 ms to minimize.
[2024-05-24 04:48:30] [INFO ] Deduced a trap composed of 37 places in 129 ms of which 2 ms to minimize.
[2024-05-24 04:48:30] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2024-05-24 04:48:30] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
[2024-05-24 04:48:31] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:48:31] [INFO ] Deduced a trap composed of 28 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:48:39] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-05-24 04:48:40] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2024-05-24 04:48:41] [INFO ] Deduced a trap composed of 19 places in 193 ms of which 3 ms to minimize.
[2024-05-24 04:48:41] [INFO ] Deduced a trap composed of 17 places in 208 ms of which 2 ms to minimize.
[2024-05-24 04:48:42] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 3 ms to minimize.
[2024-05-24 04:48:42] [INFO ] Deduced a trap composed of 19 places in 184 ms of which 2 ms to minimize.
[2024-05-24 04:48:42] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-24 04:48:42] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:48:43] [INFO ] Deduced a trap composed of 46 places in 202 ms of which 2 ms to minimize.
[2024-05-24 04:48:43] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:48:43] [INFO ] Deduced a trap composed of 53 places in 222 ms of which 2 ms to minimize.
[2024-05-24 04:48:43] [INFO ] Deduced a trap composed of 52 places in 209 ms of which 2 ms to minimize.
[2024-05-24 04:48:44] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:48:44] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 2 ms to minimize.
[2024-05-24 04:48:44] [INFO ] Deduced a trap composed of 51 places in 132 ms of which 2 ms to minimize.
[2024-05-24 04:48:45] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 3 ms to minimize.
[2024-05-24 04:48:45] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 3 ms to minimize.
[2024-05-24 04:48:45] [INFO ] Deduced a trap composed of 35 places in 178 ms of which 2 ms to minimize.
[2024-05-24 04:48:45] [INFO ] Deduced a trap composed of 34 places in 175 ms of which 3 ms to minimize.
[2024-05-24 04:48:45] [INFO ] Deduced a trap composed of 57 places in 156 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 79 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 60/79 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:48:51] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2024-05-24 04:48:51] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:48:51] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 3 ms to minimize.
[2024-05-24 04:48:52] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 3 ms to minimize.
[2024-05-24 04:48:53] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 4 ms to minimize.
[2024-05-24 04:48:54] [INFO ] Deduced a trap composed of 67 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:48:54] [INFO ] Deduced a trap composed of 60 places in 244 ms of which 4 ms to minimize.
[2024-05-24 04:48:54] [INFO ] Deduced a trap composed of 53 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:48:54] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 2 ms to minimize.
[2024-05-24 04:48:55] [INFO ] Deduced a trap composed of 56 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:48:55] [INFO ] Deduced a trap composed of 38 places in 183 ms of which 2 ms to minimize.
[2024-05-24 04:48:55] [INFO ] Deduced a trap composed of 53 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:48:55] [INFO ] Deduced a trap composed of 52 places in 143 ms of which 2 ms to minimize.
[2024-05-24 04:48:56] [INFO ] Deduced a trap composed of 37 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:48:56] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 3 ms to minimize.
[2024-05-24 04:48:56] [INFO ] Deduced a trap composed of 35 places in 259 ms of which 4 ms to minimize.
[2024-05-24 04:48:56] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:48:56] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 2 ms to minimize.
[2024-05-24 04:48:57] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:48:57] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:49:02] [INFO ] Deduced a trap composed of 45 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:49:03] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-05-24 04:49:03] [INFO ] Deduced a trap composed of 52 places in 253 ms of which 4 ms to minimize.
[2024-05-24 04:49:03] [INFO ] Deduced a trap composed of 47 places in 256 ms of which 4 ms to minimize.
[2024-05-24 04:49:03] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 5 ms to minimize.
[2024-05-24 04:49:04] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
[2024-05-24 04:49:04] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 4 ms to minimize.
[2024-05-24 04:49:04] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 4 ms to minimize.
[2024-05-24 04:49:05] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 4 ms to minimize.
[2024-05-24 04:49:05] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-05-24 04:49:05] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2024-05-24 04:49:05] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 2 ms to minimize.
[2024-05-24 04:49:05] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
[2024-05-24 04:49:06] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 2 ms to minimize.
[2024-05-24 04:49:06] [INFO ] Deduced a trap composed of 62 places in 148 ms of which 2 ms to minimize.
[2024-05-24 04:49:06] [INFO ] Deduced a trap composed of 52 places in 217 ms of which 3 ms to minimize.
[2024-05-24 04:49:06] [INFO ] Deduced a trap composed of 53 places in 133 ms of which 2 ms to minimize.
[2024-05-24 04:49:07] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 2 ms to minimize.
[2024-05-24 04:49:07] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 2 ms to minimize.
[2024-05-24 04:49:07] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/235 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:49:09] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2024-05-24 04:49:09] [INFO ] Deduced a trap composed of 32 places in 120 ms of which 2 ms to minimize.
[2024-05-24 04:49:10] [INFO ] Deduced a trap composed of 52 places in 141 ms of which 2 ms to minimize.
[2024-05-24 04:49:11] [INFO ] Deduced a trap composed of 46 places in 154 ms of which 2 ms to minimize.
[2024-05-24 04:49:11] [INFO ] Deduced a trap composed of 47 places in 141 ms of which 3 ms to minimize.
[2024-05-24 04:49:11] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2024-05-24 04:49:12] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 2 ms to minimize.
[2024-05-24 04:49:13] [INFO ] Deduced a trap composed of 69 places in 174 ms of which 2 ms to minimize.
[2024-05-24 04:49:14] [INFO ] Deduced a trap composed of 58 places in 206 ms of which 2 ms to minimize.
[2024-05-24 04:49:14] [INFO ] Deduced a trap composed of 50 places in 192 ms of which 2 ms to minimize.
[2024-05-24 04:49:14] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:49:15] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 2 ms to minimize.
[2024-05-24 04:49:15] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 3 ms to minimize.
[2024-05-24 04:49:16] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 2 ms to minimize.
[2024-05-24 04:49:16] [INFO ] Deduced a trap composed of 44 places in 160 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 235/608 variables, and 134 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/961 constraints, Known Traps: 115/115 constraints]
After SMT, in 60563ms problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60580ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60639 ms. Remains : 235/235 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin13316204911153091904
[2024-05-24 04:49:16] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13316204911153091904
Running compilation step : cd /tmp/ltsmin13316204911153091904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13316204911153091904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13316204911153091904;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 5 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 967/967 transitions.
Applied a total of 0 rules in 3 ms. Remains 235 /235 variables (removed 0) and now considering 967/967 (removed 0) transitions.
[2024-05-24 04:49:19] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:49:19] [INFO ] Invariant cache hit.
[2024-05-24 04:49:19] [INFO ] Implicit Places using invariants in 331 ms returned []
[2024-05-24 04:49:19] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:49:19] [INFO ] Invariant cache hit.
[2024-05-24 04:49:20] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:49:20] [INFO ] Implicit Places using invariants and state equation in 883 ms returned []
Implicit Place search using SMT with State Equation took 1215 ms to find 0 implicit places.
Running 961 sub problems to find dead transitions.
[2024-05-24 04:49:20] [INFO ] Flow matrix only has 373 transitions (discarded 594 similar events)
[2024-05-24 04:49:20] [INFO ] Invariant cache hit.
[2024-05-24 04:49:20] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:49:26] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:49:26] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:49:27] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:49:27] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-05-24 04:49:27] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 2 ms to minimize.
[2024-05-24 04:49:27] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 3 ms to minimize.
[2024-05-24 04:49:28] [INFO ] Deduced a trap composed of 34 places in 144 ms of which 2 ms to minimize.
[2024-05-24 04:49:28] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-05-24 04:49:28] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 1 ms to minimize.
[2024-05-24 04:49:28] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-24 04:49:28] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-24 04:49:28] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-05-24 04:49:29] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2024-05-24 04:49:29] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 2 ms to minimize.
[2024-05-24 04:49:29] [INFO ] Deduced a trap composed of 33 places in 155 ms of which 3 ms to minimize.
[2024-05-24 04:49:29] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2024-05-24 04:49:29] [INFO ] Deduced a trap composed of 50 places in 137 ms of which 2 ms to minimize.
[2024-05-24 04:49:29] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 2 ms to minimize.
[2024-05-24 04:49:29] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2024-05-24 04:49:30] [INFO ] Deduced a trap composed of 41 places in 144 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:49:32] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2024-05-24 04:49:32] [INFO ] Deduced a trap composed of 13 places in 132 ms of which 2 ms to minimize.
[2024-05-24 04:49:33] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-24 04:49:34] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:49:36] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 3 ms to minimize.
[2024-05-24 04:49:36] [INFO ] Deduced a trap composed of 19 places in 165 ms of which 2 ms to minimize.
[2024-05-24 04:49:36] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-05-24 04:49:36] [INFO ] Deduced a trap composed of 21 places in 145 ms of which 3 ms to minimize.
[2024-05-24 04:49:37] [INFO ] Deduced a trap composed of 19 places in 144 ms of which 2 ms to minimize.
[2024-05-24 04:49:37] [INFO ] Deduced a trap composed of 46 places in 152 ms of which 2 ms to minimize.
[2024-05-24 04:49:37] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-05-24 04:49:38] [INFO ] Deduced a trap composed of 44 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:49:38] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 2 ms to minimize.
[2024-05-24 04:49:38] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 2 ms to minimize.
[2024-05-24 04:49:38] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:49:38] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:49:38] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:49:38] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2024-05-24 04:49:39] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 3 ms to minimize.
[2024-05-24 04:49:39] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:49:46] [INFO ] Deduced a trap composed of 35 places in 132 ms of which 2 ms to minimize.
[2024-05-24 04:49:46] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2024-05-24 04:49:46] [INFO ] Deduced a trap composed of 35 places in 123 ms of which 2 ms to minimize.
[2024-05-24 04:49:47] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 3 ms to minimize.
[2024-05-24 04:49:47] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 3 ms to minimize.
[2024-05-24 04:49:47] [INFO ] Deduced a trap composed of 33 places in 125 ms of which 2 ms to minimize.
[2024-05-24 04:49:48] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 2 ms to minimize.
[2024-05-24 04:49:48] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:49:48] [INFO ] Deduced a trap composed of 55 places in 221 ms of which 3 ms to minimize.
[2024-05-24 04:49:48] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 2 ms to minimize.
[2024-05-24 04:49:49] [INFO ] Deduced a trap composed of 64 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:49:49] [INFO ] Deduced a trap composed of 57 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:49:50] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 4 ms to minimize.
[2024-05-24 04:49:50] [INFO ] Deduced a trap composed of 52 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:49:50] [INFO ] Deduced a trap composed of 53 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:49:50] [INFO ] Deduced a trap composed of 33 places in 158 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 235/608 variables, and 75 constraints, problems are : Problem set: 0 solved, 961 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/235 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 961/961 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 961 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/235 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/235 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 961 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/235 variables, 56/75 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:49:57] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 1 ms to minimize.
[2024-05-24 04:49:57] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:49:57] [INFO ] Deduced a trap composed of 18 places in 143 ms of which 2 ms to minimize.
[2024-05-24 04:49:58] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2024-05-24 04:49:58] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:49:58] [INFO ] Deduced a trap composed of 45 places in 224 ms of which 3 ms to minimize.
[2024-05-24 04:49:59] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 4 ms to minimize.
[2024-05-24 04:49:59] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 2 ms to minimize.
[2024-05-24 04:49:59] [INFO ] Deduced a trap composed of 46 places in 178 ms of which 2 ms to minimize.
[2024-05-24 04:49:59] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:50:00] [INFO ] Deduced a trap composed of 48 places in 255 ms of which 4 ms to minimize.
[2024-05-24 04:50:00] [INFO ] Deduced a trap composed of 44 places in 254 ms of which 4 ms to minimize.
[2024-05-24 04:50:00] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 2 ms to minimize.
[2024-05-24 04:50:01] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 3 ms to minimize.
[2024-05-24 04:50:01] [INFO ] Deduced a trap composed of 53 places in 199 ms of which 2 ms to minimize.
[2024-05-24 04:50:01] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 3 ms to minimize.
[2024-05-24 04:50:02] [INFO ] Deduced a trap composed of 58 places in 290 ms of which 4 ms to minimize.
[2024-05-24 04:50:03] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/235 variables, 18/93 constraints. Problems are: Problem set: 0 solved, 961 unsolved
[2024-05-24 04:50:16] [INFO ] Deduced a trap composed of 45 places in 257 ms of which 4 ms to minimize.
[2024-05-24 04:50:16] [INFO ] Deduced a trap composed of 49 places in 315 ms of which 4 ms to minimize.
[2024-05-24 04:50:16] [INFO ] Deduced a trap composed of 49 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:50:17] [INFO ] Deduced a trap composed of 44 places in 301 ms of which 4 ms to minimize.
[2024-05-24 04:50:17] [INFO ] Deduced a trap composed of 45 places in 266 ms of which 4 ms to minimize.
[2024-05-24 04:50:18] [INFO ] Deduced a trap composed of 65 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:50:18] [INFO ] Deduced a trap composed of 71 places in 297 ms of which 4 ms to minimize.
[2024-05-24 04:50:20] [INFO ] Deduced a trap composed of 60 places in 322 ms of which 3 ms to minimize.
[2024-05-24 04:50:21] [INFO ] Deduced a trap composed of 58 places in 314 ms of which 4 ms to minimize.
[2024-05-24 04:50:21] [INFO ] Deduced a trap composed of 81 places in 305 ms of which 4 ms to minimize.
SMT process timed out in 60523ms, After SMT, problems are : Problem set: 0 solved, 961 unsolved
Search for dead transitions found 0 dead transitions in 60533ms
Finished structural reductions in LTL mode , in 1 iterations and 61753 ms. Remains : 235/235 places, 967/967 transitions.
Built C files in :
/tmp/ltsmin9222372528625428889
[2024-05-24 04:50:21] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9222372528625428889
Running compilation step : cd /tmp/ltsmin9222372528625428889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9222372528625428889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9222372528625428889;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 04:50:24] [INFO ] Flatten gal took : 23 ms
[2024-05-24 04:50:24] [INFO ] Flatten gal took : 23 ms
[2024-05-24 04:50:24] [INFO ] Time to serialize gal into /tmp/LTL6504439743300615228.gal : 3 ms
[2024-05-24 04:50:24] [INFO ] Time to serialize properties into /tmp/LTL1483374954418196203.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6504439743300615228.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12105144265813664392.hoa' '-atoms' '/tmp/LTL1483374954418196203.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1483374954418196203.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12105144265813664392.hoa
Detected timeout of ITS tools.
[2024-05-24 04:50:39] [INFO ] Flatten gal took : 23 ms
[2024-05-24 04:50:39] [INFO ] Flatten gal took : 23 ms
[2024-05-24 04:50:39] [INFO ] Time to serialize gal into /tmp/LTL17061067138541226120.gal : 4 ms
[2024-05-24 04:50:39] [INFO ] Time to serialize properties into /tmp/LTL3886473299043928419.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17061067138541226120.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3886473299043928419.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((!("((turn_3==1)&&(p37_3_4==1))"))U((G(!("((turn_3==1)&&(p37_3_4==1))")))||(!("((turn_3==1)&&(p37_3_4==1))"))))U((G((!("((tu...570
Formula 0 simplified : XXG(F(!"(((!((turn_3==1)&&(p37_3_4==1)))||((turn_3==1)&&(p37_3_4==1)))&&(!((turn_3==1)&&(p37_3_4==1))))" & "((turn_3==1)&&(p37_3_4==...351
Detected timeout of ITS tools.
[2024-05-24 04:50:54] [INFO ] Flatten gal took : 27 ms
[2024-05-24 04:50:54] [INFO ] Applying decomposition
[2024-05-24 04:50:54] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12681866399659014320.txt' '-o' '/tmp/graph12681866399659014320.bin' '-w' '/tmp/graph12681866399659014320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12681866399659014320.bin' '-l' '-1' '-v' '-w' '/tmp/graph12681866399659014320.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:50:54] [INFO ] Decomposing Gal with order
[2024-05-24 04:50:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:50:54] [INFO ] Removed a total of 1793 redundant transitions.
[2024-05-24 04:50:54] [INFO ] Flatten gal took : 90 ms
[2024-05-24 04:50:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 308 labels/synchronizations in 19 ms.
[2024-05-24 04:50:54] [INFO ] Time to serialize gal into /tmp/LTL14302425246832007269.gal : 6 ms
[2024-05-24 04:50:54] [INFO ] Time to serialize properties into /tmp/LTL1695220905719830089.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14302425246832007269.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1695220905719830089.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((!("((i0.u0.turn_3==1)&&(i0.u43.p37_3_4==1))"))U((G(!("((i0.u0.turn_3==1)&&(i0.u43.p37_3_4==1))")))||(!("((i0.u0.turn_3==1)&...762
Formula 0 simplified : XXG(F(!"(((!((i0.u0.turn_3==1)&&(i0.u43.p37_3_4==1)))||((i0.u0.turn_3==1)&&(i0.u43.p37_3_4==1)))&&(!((i0.u0.turn_3==1)&&(i0.u43.p37_...478
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-05 finished in 415425 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((G(p0)||G(F((!p1 U (p2||G(!p1)))))||(F((!p1 U (p2||G(!p1))))&&X(p3)))))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-06-LTLFireability-13
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) p1 (NOT p2)), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p0) p1 (NOT p2))]
Support contains 7 out of 390 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 390/390 places, 1152/1152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 390 transition count 1146
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 384 transition count 1146
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 12 place count 384 transition count 1033
Deduced a syphon composed of 113 places in 2 ms
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 226 rules applied. Total rules applied 238 place count 271 transition count 1033
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 244 place count 265 transition count 997
Iterating global reduction 2 with 6 rules applied. Total rules applied 250 place count 265 transition count 997
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 308 place count 236 transition count 968
Applied a total of 308 rules in 47 ms. Remains 236 /390 variables (removed 154) and now considering 968/1152 (removed 184) transitions.
[2024-05-24 04:51:10] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 04:51:10] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 04:51:10] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-24 04:51:10] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:51:10] [INFO ] Invariant cache hit.
[2024-05-24 04:51:11] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:51:12] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 1939 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-24 04:51:12] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:51:12] [INFO ] Invariant cache hit.
[2024-05-24 04:51:12] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:51:21] [INFO ] Deduced a trap composed of 3 places in 268 ms of which 4 ms to minimize.
[2024-05-24 04:51:22] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 2 ms to minimize.
[2024-05-24 04:51:22] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-24 04:51:22] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 2 ms to minimize.
[2024-05-24 04:51:22] [INFO ] Deduced a trap composed of 33 places in 159 ms of which 3 ms to minimize.
[2024-05-24 04:51:22] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 4 ms to minimize.
[2024-05-24 04:51:23] [INFO ] Deduced a trap composed of 38 places in 206 ms of which 3 ms to minimize.
[2024-05-24 04:51:23] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:51:24] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:51:24] [INFO ] Deduced a trap composed of 58 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:51:24] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
[2024-05-24 04:51:25] [INFO ] Deduced a trap composed of 21 places in 200 ms of which 3 ms to minimize.
[2024-05-24 04:51:25] [INFO ] Deduced a trap composed of 17 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:51:25] [INFO ] Deduced a trap composed of 36 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:51:25] [INFO ] Deduced a trap composed of 34 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:51:26] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:51:26] [INFO ] Deduced a trap composed of 45 places in 273 ms of which 4 ms to minimize.
[2024-05-24 04:51:26] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 2 ms to minimize.
[2024-05-24 04:51:26] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 2 ms to minimize.
[2024-05-24 04:51:27] [INFO ] Deduced a trap composed of 48 places in 252 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:51:29] [INFO ] Deduced a trap composed of 54 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:51:29] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:51:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:51:30] [INFO ] Deduced a trap composed of 32 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:51:30] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-24 04:51:31] [INFO ] Deduced a trap composed of 41 places in 269 ms of which 4 ms to minimize.
[2024-05-24 04:51:31] [INFO ] Deduced a trap composed of 34 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:51:32] [INFO ] Deduced a trap composed of 13 places in 226 ms of which 4 ms to minimize.
[2024-05-24 04:51:32] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 3 ms to minimize.
[2024-05-24 04:51:32] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-24 04:51:32] [INFO ] Deduced a trap composed of 64 places in 251 ms of which 4 ms to minimize.
[2024-05-24 04:51:33] [INFO ] Deduced a trap composed of 66 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:51:34] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 3 ms to minimize.
[2024-05-24 04:51:34] [INFO ] Deduced a trap composed of 76 places in 264 ms of which 3 ms to minimize.
[2024-05-24 04:51:34] [INFO ] Deduced a trap composed of 53 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:51:34] [INFO ] Deduced a trap composed of 49 places in 223 ms of which 3 ms to minimize.
[2024-05-24 04:51:35] [INFO ] Deduced a trap composed of 44 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:51:35] [INFO ] Deduced a trap composed of 75 places in 232 ms of which 3 ms to minimize.
[2024-05-24 04:51:35] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:51:35] [INFO ] Deduced a trap composed of 57 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:51:47] [INFO ] Deduced a trap composed of 36 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:51:49] [INFO ] Deduced a trap composed of 22 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:51:49] [INFO ] Deduced a trap composed of 38 places in 214 ms of which 4 ms to minimize.
[2024-05-24 04:51:50] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 4 ms to minimize.
[2024-05-24 04:51:50] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 4 ms to minimize.
[2024-05-24 04:51:50] [INFO ] Deduced a trap composed of 54 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:51:51] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 3 ms to minimize.
[2024-05-24 04:51:51] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-05-24 04:51:51] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 3 ms to minimize.
[2024-05-24 04:51:52] [INFO ] Deduced a trap composed of 45 places in 198 ms of which 2 ms to minimize.
[2024-05-24 04:51:52] [INFO ] Deduced a trap composed of 45 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:51:53] [INFO ] Deduced a trap composed of 53 places in 277 ms of which 4 ms to minimize.
[2024-05-24 04:51:53] [INFO ] Deduced a trap composed of 36 places in 311 ms of which 4 ms to minimize.
[2024-05-24 04:51:53] [INFO ] Deduced a trap composed of 35 places in 275 ms of which 4 ms to minimize.
[2024-05-24 04:51:53] [INFO ] Deduced a trap composed of 46 places in 274 ms of which 3 ms to minimize.
[2024-05-24 04:51:54] [INFO ] Deduced a trap composed of 53 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:51:54] [INFO ] Deduced a trap composed of 55 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:51:54] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 2 ms to minimize.
[2024-05-24 04:51:55] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 4 ms to minimize.
[2024-05-24 04:51:56] [INFO ] Deduced a trap composed of 59 places in 310 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:51:59] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 2 ms to minimize.
[2024-05-24 04:51:59] [INFO ] Deduced a trap composed of 53 places in 136 ms of which 2 ms to minimize.
[2024-05-24 04:52:00] [INFO ] Deduced a trap composed of 65 places in 155 ms of which 2 ms to minimize.
[2024-05-24 04:52:00] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 2 ms to minimize.
[2024-05-24 04:52:00] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-05-24 04:52:00] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2024-05-24 04:52:00] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2024-05-24 04:52:00] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 3 ms to minimize.
[2024-05-24 04:52:01] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:52:01] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 2 ms to minimize.
[2024-05-24 04:52:01] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 2 ms to minimize.
[2024-05-24 04:52:01] [INFO ] Deduced a trap composed of 34 places in 176 ms of which 3 ms to minimize.
[2024-05-24 04:52:01] [INFO ] Deduced a trap composed of 45 places in 182 ms of which 2 ms to minimize.
[2024-05-24 04:52:01] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 3 ms to minimize.
[2024-05-24 04:52:02] [INFO ] Deduced a trap composed of 52 places in 162 ms of which 2 ms to minimize.
[2024-05-24 04:52:02] [INFO ] Deduced a trap composed of 35 places in 235 ms of which 4 ms to minimize.
[2024-05-24 04:52:02] [INFO ] Deduced a trap composed of 46 places in 289 ms of which 4 ms to minimize.
[2024-05-24 04:52:03] [INFO ] Deduced a trap composed of 53 places in 270 ms of which 4 ms to minimize.
[2024-05-24 04:52:03] [INFO ] Deduced a trap composed of 48 places in 280 ms of which 3 ms to minimize.
[2024-05-24 04:52:03] [INFO ] Deduced a trap composed of 55 places in 283 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:52:06] [INFO ] Deduced a trap composed of 40 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:52:07] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-24 04:52:07] [INFO ] Deduced a trap composed of 44 places in 276 ms of which 3 ms to minimize.
[2024-05-24 04:52:07] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2024-05-24 04:52:07] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 2 ms to minimize.
[2024-05-24 04:52:08] [INFO ] Deduced a trap composed of 45 places in 218 ms of which 3 ms to minimize.
[2024-05-24 04:52:08] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:52:09] [INFO ] Deduced a trap composed of 59 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:52:09] [INFO ] Deduced a trap composed of 49 places in 268 ms of which 4 ms to minimize.
[2024-05-24 04:52:10] [INFO ] Deduced a trap composed of 59 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:52:10] [INFO ] Deduced a trap composed of 56 places in 271 ms of which 3 ms to minimize.
[2024-05-24 04:52:10] [INFO ] Deduced a trap composed of 62 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:52:11] [INFO ] Deduced a trap composed of 58 places in 243 ms of which 3 ms to minimize.
[2024-05-24 04:52:11] [INFO ] Deduced a trap composed of 50 places in 276 ms of which 4 ms to minimize.
[2024-05-24 04:52:11] [INFO ] Deduced a trap composed of 55 places in 272 ms of which 4 ms to minimize.
[2024-05-24 04:52:12] [INFO ] Deduced a trap composed of 48 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:52:12] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 4 ms to minimize.
[2024-05-24 04:52:12] [INFO ] Deduced a trap composed of 45 places in 233 ms of which 3 ms to minimize.
[2024-05-24 04:52:13] [INFO ] Deduced a trap composed of 41 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:52:13] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
SMT process timed out in 60902ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60919ms
Starting structural reductions in LI_LTL mode, iteration 1 : 236/390 places, 968/1152 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 62911 ms. Remains : 236/390 places, 968/1152 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-06-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 543 ms.
Product exploration explored 100000 steps with 25000 reset in 483 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1) p3), (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 5 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1 (NOT p3)), (AND (NOT p0) (NOT p2) p1 (NOT p3))]
RANDOM walk for 40000 steps (8 resets) in 1884 ms. (21 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 416 ms. (95 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 466 ms. (85 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 513 ms. (77 steps per ms) remains 8/8 properties
[2024-05-24 04:52:16] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:52:16] [INFO ] Invariant cache hit.
[2024-05-24 04:52:16] [INFO ] State equation strengthened by 164 read => feed constraints.
Problem apf6 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem apf4 is UNSAT
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 8/160 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-24 04:52:16] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 1/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 270/430 variables, 160/174 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 74/248 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 2 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/284 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 84/610 variables, 60/344 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 76/420 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/420 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/420 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 420 constraints, problems are : Problem set: 2 solved, 6 unsolved in 1218 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-24 04:52:17] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2024-05-24 04:52:17] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 2/13 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/15 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/16 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/176 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/250 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 6/292 constraints. Problems are: Problem set: 2 solved, 6 unsolved
[2024-05-24 04:52:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 1/293 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 84/610 variables, 60/353 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/610 variables, 76/429 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 0/429 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/610 variables, 0/429 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 429 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2113 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 4/4 constraints]
After SMT, in 3356ms problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 3197 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 31 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 236/236 places, 968/968 transitions.
RANDOM walk for 40000 steps (8 resets) in 2449 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 346 ms. (115 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 112581 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :0 out of 6
Probabilistic random walk after 112581 steps, saw 46344 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
[2024-05-24 04:52:26] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:52:26] [INFO ] Invariant cache hit.
[2024-05-24 04:52:26] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:52:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:52:27] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:52:27] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 84/610 variables, 60/346 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/610 variables, 76/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/610 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 0/610 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 422 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1737 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/526 variables, 6/292 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-05-24 04:52:29] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:52:29] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 2/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 84/610 variables, 60/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/610 variables, 76/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (OVERLAPS) 0/610 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 430 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2095 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 5/5 constraints]
After SMT, in 3855ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1671 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 32 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 31 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 04:52:32] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:52:32] [INFO ] Invariant cache hit.
[2024-05-24 04:52:33] [INFO ] Implicit Places using invariants in 533 ms returned []
[2024-05-24 04:52:33] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:52:33] [INFO ] Invariant cache hit.
[2024-05-24 04:52:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:52:34] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1555 ms to find 0 implicit places.
[2024-05-24 04:52:34] [INFO ] Redundant transitions in 18 ms returned []
Running 962 sub problems to find dead transitions.
[2024-05-24 04:52:34] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:52:34] [INFO ] Invariant cache hit.
[2024-05-24 04:52:34] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:52:41] [INFO ] Deduced a trap composed of 3 places in 299 ms of which 4 ms to minimize.
[2024-05-24 04:52:42] [INFO ] Deduced a trap composed of 3 places in 125 ms of which 1 ms to minimize.
[2024-05-24 04:52:42] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 2 ms to minimize.
[2024-05-24 04:52:42] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2024-05-24 04:52:42] [INFO ] Deduced a trap composed of 33 places in 133 ms of which 2 ms to minimize.
[2024-05-24 04:52:42] [INFO ] Deduced a trap composed of 53 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:52:43] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2024-05-24 04:52:43] [INFO ] Deduced a trap composed of 35 places in 146 ms of which 3 ms to minimize.
[2024-05-24 04:52:43] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 2 ms to minimize.
[2024-05-24 04:52:44] [INFO ] Deduced a trap composed of 58 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:52:44] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 2 ms to minimize.
[2024-05-24 04:52:44] [INFO ] Deduced a trap composed of 21 places in 141 ms of which 2 ms to minimize.
[2024-05-24 04:52:45] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 2 ms to minimize.
[2024-05-24 04:52:45] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:52:45] [INFO ] Deduced a trap composed of 34 places in 134 ms of which 2 ms to minimize.
[2024-05-24 04:52:45] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 2 ms to minimize.
[2024-05-24 04:52:46] [INFO ] Deduced a trap composed of 45 places in 183 ms of which 2 ms to minimize.
[2024-05-24 04:52:46] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 2 ms to minimize.
[2024-05-24 04:52:46] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:52:46] [INFO ] Deduced a trap composed of 48 places in 184 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:52:48] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 2 ms to minimize.
[2024-05-24 04:52:49] [INFO ] Deduced a trap composed of 49 places in 161 ms of which 3 ms to minimize.
[2024-05-24 04:52:49] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-24 04:52:49] [INFO ] Deduced a trap composed of 32 places in 171 ms of which 3 ms to minimize.
[2024-05-24 04:52:49] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-24 04:52:50] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 3 ms to minimize.
[2024-05-24 04:52:50] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:52:50] [INFO ] Deduced a trap composed of 13 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:52:51] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 3 ms to minimize.
[2024-05-24 04:52:51] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-24 04:52:51] [INFO ] Deduced a trap composed of 64 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:52:52] [INFO ] Deduced a trap composed of 66 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:52:52] [INFO ] Deduced a trap composed of 62 places in 216 ms of which 4 ms to minimize.
[2024-05-24 04:52:52] [INFO ] Deduced a trap composed of 76 places in 218 ms of which 4 ms to minimize.
[2024-05-24 04:52:52] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 3 ms to minimize.
[2024-05-24 04:52:53] [INFO ] Deduced a trap composed of 49 places in 239 ms of which 4 ms to minimize.
[2024-05-24 04:52:53] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 3 ms to minimize.
[2024-05-24 04:52:53] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 2 ms to minimize.
[2024-05-24 04:52:53] [INFO ] Deduced a trap composed of 50 places in 246 ms of which 3 ms to minimize.
[2024-05-24 04:52:54] [INFO ] Deduced a trap composed of 57 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:53:03] [INFO ] Deduced a trap composed of 54 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:53:03] [INFO ] Deduced a trap composed of 51 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:53:03] [INFO ] Deduced a trap composed of 45 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:53:04] [INFO ] Deduced a trap composed of 39 places in 262 ms of which 4 ms to minimize.
SMT process timed out in 30900ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 30917ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32530 ms. Remains : 236/236 places, 968/968 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 25 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-05-24 04:53:05] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 04:53:05] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-24 04:53:05] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 04:53:05] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 04:53:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 04:53:05] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:53:05] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 04:53:05] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 04:53:05] [INFO ] After 60ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2024-05-24 04:53:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-05-24 04:53:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-24 04:53:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 63 ms
TRAPS : Iteration 1
[2024-05-24 04:53:05] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2024-05-24 04:53:05] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 677 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 p0 (NOT p1) p3), (X (X p2)), (G (OR p0 p2 (NOT p1))), (G (OR (NOT p0) p2 p1))]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 4 factoid took 160 ms. Reduced automaton from 5 states, 9 edges and 4 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 230 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 235 ms :[false, false, false, false, false]
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 5 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 04:53:06] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 04:53:06] [INFO ] Computed 19 invariants in 5 ms
[2024-05-24 04:53:06] [INFO ] Implicit Places using invariants in 423 ms returned []
[2024-05-24 04:53:06] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:53:06] [INFO ] Invariant cache hit.
[2024-05-24 04:53:06] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:53:07] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1479 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-24 04:53:07] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:53:07] [INFO ] Invariant cache hit.
[2024-05-24 04:53:07] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:53:17] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 3 ms to minimize.
[2024-05-24 04:53:17] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 1 ms to minimize.
[2024-05-24 04:53:17] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:53:17] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:53:17] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2024-05-24 04:53:17] [INFO ] Deduced a trap composed of 53 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:53:18] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:53:18] [INFO ] Deduced a trap composed of 35 places in 217 ms of which 3 ms to minimize.
[2024-05-24 04:53:19] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 3 ms to minimize.
[2024-05-24 04:53:19] [INFO ] Deduced a trap composed of 58 places in 237 ms of which 4 ms to minimize.
[2024-05-24 04:53:19] [INFO ] Deduced a trap composed of 45 places in 187 ms of which 3 ms to minimize.
[2024-05-24 04:53:20] [INFO ] Deduced a trap composed of 21 places in 219 ms of which 4 ms to minimize.
[2024-05-24 04:53:20] [INFO ] Deduced a trap composed of 17 places in 214 ms of which 3 ms to minimize.
[2024-05-24 04:53:20] [INFO ] Deduced a trap composed of 36 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:53:21] [INFO ] Deduced a trap composed of 34 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:53:21] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 3 ms to minimize.
[2024-05-24 04:53:21] [INFO ] Deduced a trap composed of 45 places in 208 ms of which 4 ms to minimize.
[2024-05-24 04:53:21] [INFO ] Deduced a trap composed of 37 places in 96 ms of which 2 ms to minimize.
[2024-05-24 04:53:21] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:53:22] [INFO ] Deduced a trap composed of 48 places in 249 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:53:24] [INFO ] Deduced a trap composed of 54 places in 146 ms of which 2 ms to minimize.
[2024-05-24 04:53:24] [INFO ] Deduced a trap composed of 49 places in 207 ms of which 4 ms to minimize.
[2024-05-24 04:53:24] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:53:25] [INFO ] Deduced a trap composed of 32 places in 199 ms of which 3 ms to minimize.
[2024-05-24 04:53:25] [INFO ] Deduced a trap composed of 11 places in 89 ms of which 2 ms to minimize.
[2024-05-24 04:53:26] [INFO ] Deduced a trap composed of 41 places in 275 ms of which 4 ms to minimize.
[2024-05-24 04:53:26] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 4 ms to minimize.
[2024-05-24 04:53:26] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 3 ms to minimize.
[2024-05-24 04:53:27] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:53:27] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-24 04:53:27] [INFO ] Deduced a trap composed of 64 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:53:28] [INFO ] Deduced a trap composed of 66 places in 227 ms of which 4 ms to minimize.
[2024-05-24 04:53:28] [INFO ] Deduced a trap composed of 62 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:53:29] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 2 ms to minimize.
[2024-05-24 04:53:29] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 3 ms to minimize.
[2024-05-24 04:53:29] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 2 ms to minimize.
[2024-05-24 04:53:29] [INFO ] Deduced a trap composed of 44 places in 273 ms of which 3 ms to minimize.
[2024-05-24 04:53:30] [INFO ] Deduced a trap composed of 75 places in 238 ms of which 4 ms to minimize.
[2024-05-24 04:53:30] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 2 ms to minimize.
[2024-05-24 04:53:30] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:53:42] [INFO ] Deduced a trap composed of 36 places in 247 ms of which 4 ms to minimize.
[2024-05-24 04:53:44] [INFO ] Deduced a trap composed of 22 places in 150 ms of which 2 ms to minimize.
[2024-05-24 04:53:44] [INFO ] Deduced a trap composed of 38 places in 229 ms of which 3 ms to minimize.
[2024-05-24 04:53:45] [INFO ] Deduced a trap composed of 46 places in 168 ms of which 3 ms to minimize.
[2024-05-24 04:53:45] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:53:45] [INFO ] Deduced a trap composed of 54 places in 147 ms of which 2 ms to minimize.
[2024-05-24 04:53:45] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 2 ms to minimize.
[2024-05-24 04:53:46] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:53:46] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 2 ms to minimize.
[2024-05-24 04:53:47] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 2 ms to minimize.
[2024-05-24 04:53:47] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:53:47] [INFO ] Deduced a trap composed of 53 places in 301 ms of which 4 ms to minimize.
[2024-05-24 04:53:47] [INFO ] Deduced a trap composed of 36 places in 217 ms of which 2 ms to minimize.
[2024-05-24 04:53:48] [INFO ] Deduced a trap composed of 35 places in 299 ms of which 4 ms to minimize.
[2024-05-24 04:53:48] [INFO ] Deduced a trap composed of 46 places in 205 ms of which 3 ms to minimize.
[2024-05-24 04:53:48] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 2 ms to minimize.
[2024-05-24 04:53:48] [INFO ] Deduced a trap composed of 55 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:53:48] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2024-05-24 04:53:49] [INFO ] Deduced a trap composed of 21 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:53:50] [INFO ] Deduced a trap composed of 59 places in 228 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:53:55] [INFO ] Deduced a trap composed of 64 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:53:56] [INFO ] Deduced a trap composed of 53 places in 243 ms of which 3 ms to minimize.
[2024-05-24 04:53:56] [INFO ] Deduced a trap composed of 65 places in 286 ms of which 3 ms to minimize.
[2024-05-24 04:53:56] [INFO ] Deduced a trap composed of 57 places in 274 ms of which 4 ms to minimize.
[2024-05-24 04:53:57] [INFO ] Deduced a trap composed of 46 places in 263 ms of which 4 ms to minimize.
[2024-05-24 04:53:57] [INFO ] Deduced a trap composed of 46 places in 256 ms of which 4 ms to minimize.
[2024-05-24 04:53:57] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 4 ms to minimize.
[2024-05-24 04:53:57] [INFO ] Deduced a trap composed of 47 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:53:58] [INFO ] Deduced a trap composed of 51 places in 256 ms of which 3 ms to minimize.
[2024-05-24 04:53:58] [INFO ] Deduced a trap composed of 64 places in 238 ms of which 3 ms to minimize.
[2024-05-24 04:53:58] [INFO ] Deduced a trap composed of 51 places in 280 ms of which 3 ms to minimize.
[2024-05-24 04:53:59] [INFO ] Deduced a trap composed of 34 places in 271 ms of which 4 ms to minimize.
[2024-05-24 04:53:59] [INFO ] Deduced a trap composed of 45 places in 272 ms of which 4 ms to minimize.
[2024-05-24 04:53:59] [INFO ] Deduced a trap composed of 52 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:53:59] [INFO ] Deduced a trap composed of 52 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:54:00] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:54:00] [INFO ] Deduced a trap composed of 46 places in 297 ms of which 4 ms to minimize.
[2024-05-24 04:54:00] [INFO ] Deduced a trap composed of 53 places in 283 ms of which 3 ms to minimize.
[2024-05-24 04:54:01] [INFO ] Deduced a trap composed of 48 places in 302 ms of which 5 ms to minimize.
[2024-05-24 04:54:01] [INFO ] Deduced a trap composed of 55 places in 289 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:54:03] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 2 ms to minimize.
[2024-05-24 04:54:04] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-24 04:54:04] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 2 ms to minimize.
[2024-05-24 04:54:05] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 2 ms to minimize.
[2024-05-24 04:54:05] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-24 04:54:05] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 3 ms to minimize.
[2024-05-24 04:54:05] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 2 ms to minimize.
[2024-05-24 04:54:06] [INFO ] Deduced a trap composed of 59 places in 206 ms of which 4 ms to minimize.
[2024-05-24 04:54:07] [INFO ] Deduced a trap composed of 49 places in 244 ms of which 4 ms to minimize.
[2024-05-24 04:54:07] [INFO ] Deduced a trap composed of 59 places in 239 ms of which 4 ms to minimize.
[2024-05-24 04:54:07] [INFO ] Deduced a trap composed of 56 places in 231 ms of which 4 ms to minimize.
[2024-05-24 04:54:08] [INFO ] Deduced a trap composed of 62 places in 138 ms of which 2 ms to minimize.
[2024-05-24 04:54:08] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 2 ms to minimize.
[2024-05-24 04:54:08] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2024-05-24 04:54:08] [INFO ] Deduced a trap composed of 55 places in 158 ms of which 2 ms to minimize.
SMT process timed out in 60774ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60790ms
Finished structural reductions in LTL mode , in 1 iterations and 62279 ms. Remains : 236/236 places, 968/968 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p3)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 89 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[false, false, false, false, false]
RANDOM walk for 40000 steps (8 resets) in 1252 ms. (31 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
[2024-05-24 04:54:09] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:54:09] [INFO ] Invariant cache hit.
[2024-05-24 04:54:09] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:54:09] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 270/430 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 74/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 84/610 variables, 60/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 76/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 420 constraints, problems are : Problem set: 0 solved, 5 unsolved in 737 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:54:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:54:10] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:54:11] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 84/610 variables, 60/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 76/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 428 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1193 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 1943ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 862 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 236/236 places, 968/968 transitions.
RANDOM walk for 40000 steps (8 resets) in 1133 ms. (35 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 305 ms. (130 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 148498 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 5
Probabilistic random walk after 148498 steps, saw 53069 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-05-24 04:54:16] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:54:16] [INFO ] Invariant cache hit.
[2024-05-24 04:54:16] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:54:16] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 270/430 variables, 160/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/430 variables, 74/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 36/466 variables, 16/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/466 variables, 14/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/466 variables, 0/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 56/522 variables, 4/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/522 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 4/526 variables, 2/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/526 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 84/610 variables, 60/344 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/610 variables, 76/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 0/610 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 610/610 variables, and 420 constraints, problems are : Problem set: 0 solved, 5 unsolved in 826 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 109/116 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1/117 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 35/152 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/152 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/160 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:54:17] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/160 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 270/430 variables, 160/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/430 variables, 74/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:54:17] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/430 variables, 1/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/430 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 36/466 variables, 16/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/466 variables, 14/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/466 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 56/522 variables, 4/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/522 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 4/526 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/526 variables, 5/291 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-24 04:54:18] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/526 variables, 1/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/526 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 84/610 variables, 60/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/610 variables, 76/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 0/610 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 610/610 variables, and 428 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1416 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 236/236 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 4/4 constraints]
After SMT, in 2257ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 759 ms.
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 236/236 places, 968/968 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 04:54:19] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:54:19] [INFO ] Invariant cache hit.
[2024-05-24 04:54:19] [INFO ] Implicit Places using invariants in 329 ms returned []
[2024-05-24 04:54:19] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:54:19] [INFO ] Invariant cache hit.
[2024-05-24 04:54:19] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:54:20] [INFO ] Implicit Places using invariants and state equation in 792 ms returned []
Implicit Place search using SMT with State Equation took 1122 ms to find 0 implicit places.
[2024-05-24 04:54:20] [INFO ] Redundant transitions in 10 ms returned []
Running 962 sub problems to find dead transitions.
[2024-05-24 04:54:20] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:54:20] [INFO ] Invariant cache hit.
[2024-05-24 04:54:20] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:54:29] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
[2024-05-24 04:54:29] [INFO ] Deduced a trap composed of 3 places in 115 ms of which 2 ms to minimize.
[2024-05-24 04:54:29] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2024-05-24 04:54:29] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:54:30] [INFO ] Deduced a trap composed of 33 places in 185 ms of which 3 ms to minimize.
[2024-05-24 04:54:30] [INFO ] Deduced a trap composed of 53 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:54:31] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 2 ms to minimize.
[2024-05-24 04:54:31] [INFO ] Deduced a trap composed of 35 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:54:31] [INFO ] Deduced a trap composed of 43 places in 207 ms of which 3 ms to minimize.
[2024-05-24 04:54:32] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 2 ms to minimize.
[2024-05-24 04:54:32] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:54:32] [INFO ] Deduced a trap composed of 21 places in 148 ms of which 2 ms to minimize.
[2024-05-24 04:54:32] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 3 ms to minimize.
[2024-05-24 04:54:33] [INFO ] Deduced a trap composed of 36 places in 219 ms of which 3 ms to minimize.
[2024-05-24 04:54:33] [INFO ] Deduced a trap composed of 34 places in 142 ms of which 2 ms to minimize.
[2024-05-24 04:54:33] [INFO ] Deduced a trap composed of 49 places in 182 ms of which 2 ms to minimize.
[2024-05-24 04:54:33] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 3 ms to minimize.
[2024-05-24 04:54:34] [INFO ] Deduced a trap composed of 37 places in 101 ms of which 1 ms to minimize.
[2024-05-24 04:54:34] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-24 04:54:34] [INFO ] Deduced a trap composed of 48 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:54:36] [INFO ] Deduced a trap composed of 54 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:54:37] [INFO ] Deduced a trap composed of 49 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:54:37] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-05-24 04:54:37] [INFO ] Deduced a trap composed of 32 places in 179 ms of which 2 ms to minimize.
[2024-05-24 04:54:37] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 2 ms to minimize.
[2024-05-24 04:54:38] [INFO ] Deduced a trap composed of 41 places in 192 ms of which 3 ms to minimize.
[2024-05-24 04:54:38] [INFO ] Deduced a trap composed of 34 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:54:39] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:54:39] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 3 ms to minimize.
[2024-05-24 04:54:39] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 2 ms to minimize.
[2024-05-24 04:54:39] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 2 ms to minimize.
[2024-05-24 04:54:40] [INFO ] Deduced a trap composed of 66 places in 235 ms of which 3 ms to minimize.
[2024-05-24 04:54:41] [INFO ] Deduced a trap composed of 62 places in 257 ms of which 3 ms to minimize.
[2024-05-24 04:54:41] [INFO ] Deduced a trap composed of 76 places in 262 ms of which 4 ms to minimize.
[2024-05-24 04:54:41] [INFO ] Deduced a trap composed of 53 places in 225 ms of which 3 ms to minimize.
[2024-05-24 04:54:41] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2024-05-24 04:54:42] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 4 ms to minimize.
[2024-05-24 04:54:42] [INFO ] Deduced a trap composed of 75 places in 240 ms of which 3 ms to minimize.
[2024-05-24 04:54:42] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 3 ms to minimize.
[2024-05-24 04:54:42] [INFO ] Deduced a trap composed of 57 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:54:54] [INFO ] Deduced a trap composed of 36 places in 245 ms of which 3 ms to minimize.
[2024-05-24 04:54:56] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:54:57] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-05-24 04:54:57] [INFO ] Deduced a trap composed of 46 places in 260 ms of which 4 ms to minimize.
[2024-05-24 04:54:57] [INFO ] Deduced a trap composed of 59 places in 227 ms of which 3 ms to minimize.
[2024-05-24 04:54:58] [INFO ] Deduced a trap composed of 54 places in 238 ms of which 3 ms to minimize.
[2024-05-24 04:54:58] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 3 ms to minimize.
[2024-05-24 04:54:58] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-05-24 04:54:58] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 2 ms to minimize.
[2024-05-24 04:54:59] [INFO ] Deduced a trap composed of 45 places in 246 ms of which 4 ms to minimize.
[2024-05-24 04:54:59] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 3 ms to minimize.
[2024-05-24 04:55:00] [INFO ] Deduced a trap composed of 53 places in 290 ms of which 4 ms to minimize.
[2024-05-24 04:55:00] [INFO ] Deduced a trap composed of 36 places in 315 ms of which 4 ms to minimize.
[2024-05-24 04:55:00] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:55:01] [INFO ] Deduced a trap composed of 46 places in 288 ms of which 4 ms to minimize.
[2024-05-24 04:55:01] [INFO ] Deduced a trap composed of 53 places in 223 ms of which 3 ms to minimize.
[2024-05-24 04:55:01] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:55:01] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2024-05-24 04:55:02] [INFO ] Deduced a trap composed of 21 places in 285 ms of which 3 ms to minimize.
[2024-05-24 04:55:03] [INFO ] Deduced a trap composed of 59 places in 304 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:55:08] [INFO ] Deduced a trap composed of 64 places in 246 ms of which 3 ms to minimize.
[2024-05-24 04:55:09] [INFO ] Deduced a trap composed of 53 places in 239 ms of which 3 ms to minimize.
[2024-05-24 04:55:09] [INFO ] Deduced a trap composed of 65 places in 234 ms of which 3 ms to minimize.
[2024-05-24 04:55:09] [INFO ] Deduced a trap composed of 57 places in 281 ms of which 3 ms to minimize.
[2024-05-24 04:55:10] [INFO ] Deduced a trap composed of 46 places in 252 ms of which 3 ms to minimize.
[2024-05-24 04:55:10] [INFO ] Deduced a trap composed of 46 places in 265 ms of which 4 ms to minimize.
[2024-05-24 04:55:10] [INFO ] Deduced a trap composed of 52 places in 230 ms of which 3 ms to minimize.
[2024-05-24 04:55:10] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 4 ms to minimize.
[2024-05-24 04:55:11] [INFO ] Deduced a trap composed of 51 places in 244 ms of which 3 ms to minimize.
[2024-05-24 04:55:11] [INFO ] Deduced a trap composed of 64 places in 287 ms of which 4 ms to minimize.
[2024-05-24 04:55:11] [INFO ] Deduced a trap composed of 51 places in 274 ms of which 4 ms to minimize.
[2024-05-24 04:55:12] [INFO ] Deduced a trap composed of 34 places in 279 ms of which 4 ms to minimize.
[2024-05-24 04:55:12] [INFO ] Deduced a trap composed of 45 places in 279 ms of which 4 ms to minimize.
[2024-05-24 04:55:12] [INFO ] Deduced a trap composed of 52 places in 252 ms of which 4 ms to minimize.
[2024-05-24 04:55:12] [INFO ] Deduced a trap composed of 52 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:55:13] [INFO ] Deduced a trap composed of 35 places in 252 ms of which 3 ms to minimize.
[2024-05-24 04:55:13] [INFO ] Deduced a trap composed of 46 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:55:13] [INFO ] Deduced a trap composed of 53 places in 288 ms of which 3 ms to minimize.
[2024-05-24 04:55:14] [INFO ] Deduced a trap composed of 48 places in 302 ms of which 4 ms to minimize.
[2024-05-24 04:55:14] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:55:17] [INFO ] Deduced a trap composed of 40 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:55:18] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 1 ms to minimize.
[2024-05-24 04:55:18] [INFO ] Deduced a trap composed of 44 places in 260 ms of which 3 ms to minimize.
[2024-05-24 04:55:18] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 1 ms to minimize.
[2024-05-24 04:55:18] [INFO ] Deduced a trap composed of 28 places in 97 ms of which 2 ms to minimize.
[2024-05-24 04:55:18] [INFO ] Deduced a trap composed of 45 places in 231 ms of which 4 ms to minimize.
[2024-05-24 04:55:19] [INFO ] Deduced a trap composed of 45 places in 194 ms of which 3 ms to minimize.
[2024-05-24 04:55:20] [INFO ] Deduced a trap composed of 59 places in 249 ms of which 3 ms to minimize.
[2024-05-24 04:55:20] [INFO ] Deduced a trap composed of 49 places in 288 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/610 variables, and 108 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 89/89 constraints]
After SMT, in 60459ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61628 ms. Remains : 236/236 places, 968/968 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 849 edges and 236 vertex of which 36 / 236 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 569 transitions
Reduce isomorphic transitions removed 683 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 206 transition count 240
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 161 transition count 240
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 91 place count 161 transition count 228
Deduced a syphon composed of 12 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 29 rules applied. Total rules applied 120 place count 144 transition count 228
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 238 place count 85 transition count 169
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 2 with 27 rules applied. Total rules applied 265 place count 85 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 271 place count 82 transition count 142
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 274 place count 82 transition count 139
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 281 place count 82 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 281 place count 82 transition count 131
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 283 place count 81 transition count 131
Free-agglomeration rule applied 32 times.
Iterating global reduction 4 with 32 rules applied. Total rules applied 315 place count 81 transition count 99
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 347 place count 49 transition count 99
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 353 place count 49 transition count 99
Applied a total of 353 rules in 25 ms. Remains 49 /236 variables (removed 187) and now considering 99/968 (removed 869) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 99 rows 49 cols
[2024-05-24 04:55:21] [INFO ] Computed 14 invariants in 1 ms
[2024-05-24 04:55:21] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-24 04:55:21] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:55:21] [INFO ] After 143ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 04:55:21] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-24 04:55:21] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 04:55:21] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 04:55:21] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-24 04:55:21] [INFO ] After 67ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-05-24 04:55:21] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-24 04:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-24 04:55:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-05-24 04:55:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
TRAPS : Iteration 1
[2024-05-24 04:55:21] [INFO ] After 297ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-05-24 04:55:21] [INFO ] After 549ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 733 ms.
Knowledge obtained : [(AND p2 (NOT p1) p3)]
False Knowledge obtained : [(F (NOT p3))]
Knowledge based reduction with 1 factoid took 152 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 5 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 258 ms :[false, false, false, false, false]
Stuttering acceptance computed with spot in 256 ms :[false, false, false, false, false]
Product exploration explored 100000 steps with 25000 reset in 603 ms.
Product exploration explored 100000 steps with 25000 reset in 450 ms.
Applying partial POR strategy [false, true, true, false, false]
Stuttering acceptance computed with spot in 171 ms :[false, false, false, false, false]
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 20 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 04:55:24] [INFO ] Redundant transitions in 10 ms returned []
Running 962 sub problems to find dead transitions.
[2024-05-24 04:55:24] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
// Phase 1: matrix 374 rows 236 cols
[2024-05-24 04:55:24] [INFO ] Computed 19 invariants in 2 ms
[2024-05-24 04:55:24] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:55:33] [INFO ] Deduced a trap composed of 3 places in 296 ms of which 4 ms to minimize.
[2024-05-24 04:55:33] [INFO ] Deduced a trap composed of 3 places in 87 ms of which 1 ms to minimize.
[2024-05-24 04:55:33] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 2 ms to minimize.
[2024-05-24 04:55:33] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-24 04:55:34] [INFO ] Deduced a trap composed of 33 places in 147 ms of which 3 ms to minimize.
[2024-05-24 04:55:34] [INFO ] Deduced a trap composed of 47 places in 221 ms of which 3 ms to minimize.
[2024-05-24 04:55:34] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 2 ms to minimize.
[2024-05-24 04:55:34] [INFO ] Deduced a trap composed of 51 places in 184 ms of which 3 ms to minimize.
[2024-05-24 04:55:35] [INFO ] Deduced a trap composed of 32 places in 205 ms of which 4 ms to minimize.
[2024-05-24 04:55:35] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 4 ms to minimize.
[2024-05-24 04:55:36] [INFO ] Deduced a trap composed of 42 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:55:36] [INFO ] Deduced a trap composed of 56 places in 175 ms of which 2 ms to minimize.
[2024-05-24 04:55:36] [INFO ] Deduced a trap composed of 18 places in 185 ms of which 3 ms to minimize.
[2024-05-24 04:55:36] [INFO ] Deduced a trap composed of 11 places in 92 ms of which 2 ms to minimize.
[2024-05-24 04:55:36] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:55:37] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 3 ms to minimize.
[2024-05-24 04:55:37] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 1 ms to minimize.
[2024-05-24 04:55:38] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-05-24 04:55:38] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2024-05-24 04:55:38] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:55:39] [INFO ] Deduced a trap composed of 57 places in 181 ms of which 3 ms to minimize.
[2024-05-24 04:55:39] [INFO ] Deduced a trap composed of 35 places in 171 ms of which 3 ms to minimize.
[2024-05-24 04:55:41] [INFO ] Deduced a trap composed of 17 places in 172 ms of which 3 ms to minimize.
[2024-05-24 04:55:42] [INFO ] Deduced a trap composed of 34 places in 205 ms of which 4 ms to minimize.
[2024-05-24 04:55:42] [INFO ] Deduced a trap composed of 15 places in 112 ms of which 2 ms to minimize.
[2024-05-24 04:55:43] [INFO ] Deduced a trap composed of 33 places in 172 ms of which 2 ms to minimize.
[2024-05-24 04:55:44] [INFO ] Deduced a trap composed of 71 places in 272 ms of which 4 ms to minimize.
[2024-05-24 04:55:44] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:55:44] [INFO ] Deduced a trap composed of 66 places in 155 ms of which 2 ms to minimize.
[2024-05-24 04:55:44] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 3 ms to minimize.
[2024-05-24 04:55:44] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 4 ms to minimize.
[2024-05-24 04:55:45] [INFO ] Deduced a trap composed of 43 places in 243 ms of which 3 ms to minimize.
[2024-05-24 04:55:45] [INFO ] Deduced a trap composed of 64 places in 290 ms of which 3 ms to minimize.
[2024-05-24 04:55:45] [INFO ] Deduced a trap composed of 57 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:55:45] [INFO ] Deduced a trap composed of 68 places in 274 ms of which 4 ms to minimize.
[2024-05-24 04:55:46] [INFO ] Deduced a trap composed of 60 places in 279 ms of which 4 ms to minimize.
[2024-05-24 04:55:46] [INFO ] Deduced a trap composed of 63 places in 257 ms of which 2 ms to minimize.
[2024-05-24 04:55:46] [INFO ] Deduced a trap composed of 53 places in 311 ms of which 4 ms to minimize.
[2024-05-24 04:55:47] [INFO ] Deduced a trap composed of 66 places in 190 ms of which 2 ms to minimize.
[2024-05-24 04:55:47] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:56:01] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 2 ms to minimize.
[2024-05-24 04:56:03] [INFO ] Deduced a trap composed of 17 places in 337 ms of which 4 ms to minimize.
[2024-05-24 04:56:03] [INFO ] Deduced a trap composed of 19 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:56:03] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 4 ms to minimize.
[2024-05-24 04:56:04] [INFO ] Deduced a trap composed of 18 places in 282 ms of which 3 ms to minimize.
[2024-05-24 04:56:04] [INFO ] Deduced a trap composed of 17 places in 277 ms of which 3 ms to minimize.
[2024-05-24 04:56:04] [INFO ] Deduced a trap composed of 19 places in 278 ms of which 4 ms to minimize.
[2024-05-24 04:56:04] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2024-05-24 04:56:05] [INFO ] Deduced a trap composed of 25 places in 104 ms of which 2 ms to minimize.
[2024-05-24 04:56:05] [INFO ] Deduced a trap composed of 34 places in 111 ms of which 2 ms to minimize.
[2024-05-24 04:56:06] [INFO ] Deduced a trap composed of 45 places in 288 ms of which 3 ms to minimize.
[2024-05-24 04:56:06] [INFO ] Deduced a trap composed of 52 places in 274 ms of which 4 ms to minimize.
[2024-05-24 04:56:06] [INFO ] Deduced a trap composed of 62 places in 321 ms of which 4 ms to minimize.
[2024-05-24 04:56:06] [INFO ] Deduced a trap composed of 49 places in 257 ms of which 4 ms to minimize.
[2024-05-24 04:56:07] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:56:07] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 2 ms to minimize.
[2024-05-24 04:56:07] [INFO ] Deduced a trap composed of 55 places in 225 ms of which 4 ms to minimize.
[2024-05-24 04:56:07] [INFO ] Deduced a trap composed of 62 places in 283 ms of which 4 ms to minimize.
[2024-05-24 04:56:08] [INFO ] Deduced a trap composed of 48 places in 284 ms of which 4 ms to minimize.
[2024-05-24 04:56:08] [INFO ] Deduced a trap composed of 38 places in 234 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:56:15] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-24 04:56:15] [INFO ] Deduced a trap composed of 46 places in 247 ms of which 3 ms to minimize.
[2024-05-24 04:56:15] [INFO ] Deduced a trap composed of 48 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:56:16] [INFO ] Deduced a trap composed of 44 places in 248 ms of which 3 ms to minimize.
[2024-05-24 04:56:16] [INFO ] Deduced a trap composed of 44 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:56:16] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 1 ms to minimize.
[2024-05-24 04:56:16] [INFO ] Deduced a trap composed of 44 places in 209 ms of which 3 ms to minimize.
[2024-05-24 04:56:17] [INFO ] Deduced a trap composed of 44 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:56:17] [INFO ] Deduced a trap composed of 34 places in 322 ms of which 4 ms to minimize.
[2024-05-24 04:56:17] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 3 ms to minimize.
[2024-05-24 04:56:18] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 2 ms to minimize.
[2024-05-24 04:56:18] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 2 ms to minimize.
[2024-05-24 04:56:18] [INFO ] Deduced a trap composed of 48 places in 178 ms of which 2 ms to minimize.
[2024-05-24 04:56:19] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 2 ms to minimize.
[2024-05-24 04:56:19] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 3 ms to minimize.
[2024-05-24 04:56:19] [INFO ] Deduced a trap composed of 55 places in 266 ms of which 3 ms to minimize.
[2024-05-24 04:56:20] [INFO ] Deduced a trap composed of 52 places in 228 ms of which 3 ms to minimize.
[2024-05-24 04:56:20] [INFO ] Deduced a trap composed of 56 places in 288 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 18/97 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 236/610 variables, and 97 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/962 constraints, Known Traps: 78/78 constraints]
After SMT, in 60747ms problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60760ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60796 ms. Remains : 236/236 places, 968/968 transitions.
Built C files in :
/tmp/ltsmin7668513877999966110
[2024-05-24 04:56:24] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7668513877999966110
Running compilation step : cd /tmp/ltsmin7668513877999966110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7668513877999966110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7668513877999966110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
Support contains 7 out of 236 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 236/236 places, 968/968 transitions.
Applied a total of 0 rules in 3 ms. Remains 236 /236 variables (removed 0) and now considering 968/968 (removed 0) transitions.
[2024-05-24 04:56:27] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:56:27] [INFO ] Invariant cache hit.
[2024-05-24 04:56:28] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-24 04:56:28] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:56:28] [INFO ] Invariant cache hit.
[2024-05-24 04:56:28] [INFO ] State equation strengthened by 164 read => feed constraints.
[2024-05-24 04:56:29] [INFO ] Implicit Places using invariants and state equation in 996 ms returned []
Implicit Place search using SMT with State Equation took 1355 ms to find 0 implicit places.
Running 962 sub problems to find dead transitions.
[2024-05-24 04:56:29] [INFO ] Flow matrix only has 374 transitions (discarded 594 similar events)
[2024-05-24 04:56:29] [INFO ] Invariant cache hit.
[2024-05-24 04:56:29] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:56:38] [INFO ] Deduced a trap composed of 3 places in 282 ms of which 4 ms to minimize.
[2024-05-24 04:56:38] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2024-05-24 04:56:38] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-24 04:56:38] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2024-05-24 04:56:39] [INFO ] Deduced a trap composed of 33 places in 124 ms of which 2 ms to minimize.
[2024-05-24 04:56:39] [INFO ] Deduced a trap composed of 53 places in 210 ms of which 3 ms to minimize.
[2024-05-24 04:56:40] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-05-24 04:56:40] [INFO ] Deduced a trap composed of 35 places in 141 ms of which 2 ms to minimize.
[2024-05-24 04:56:40] [INFO ] Deduced a trap composed of 43 places in 204 ms of which 3 ms to minimize.
[2024-05-24 04:56:41] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 2 ms to minimize.
[2024-05-24 04:56:41] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2024-05-24 04:56:41] [INFO ] Deduced a trap composed of 21 places in 198 ms of which 3 ms to minimize.
[2024-05-24 04:56:41] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2024-05-24 04:56:41] [INFO ] Deduced a trap composed of 36 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:56:42] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 3 ms to minimize.
[2024-05-24 04:56:42] [INFO ] Deduced a trap composed of 49 places in 221 ms of which 3 ms to minimize.
[2024-05-24 04:56:42] [INFO ] Deduced a trap composed of 45 places in 259 ms of which 4 ms to minimize.
[2024-05-24 04:56:43] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:56:43] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
[2024-05-24 04:56:43] [INFO ] Deduced a trap composed of 48 places in 208 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:56:45] [INFO ] Deduced a trap composed of 54 places in 208 ms of which 3 ms to minimize.
[2024-05-24 04:56:45] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 3 ms to minimize.
[2024-05-24 04:56:46] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-24 04:56:46] [INFO ] Deduced a trap composed of 32 places in 201 ms of which 3 ms to minimize.
[2024-05-24 04:56:46] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 1 ms to minimize.
[2024-05-24 04:56:47] [INFO ] Deduced a trap composed of 41 places in 265 ms of which 3 ms to minimize.
[2024-05-24 04:56:47] [INFO ] Deduced a trap composed of 34 places in 159 ms of which 3 ms to minimize.
[2024-05-24 04:56:48] [INFO ] Deduced a trap composed of 13 places in 236 ms of which 3 ms to minimize.
[2024-05-24 04:56:48] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 3 ms to minimize.
[2024-05-24 04:56:48] [INFO ] Deduced a trap composed of 15 places in 97 ms of which 2 ms to minimize.
[2024-05-24 04:56:48] [INFO ] Deduced a trap composed of 64 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:56:49] [INFO ] Deduced a trap composed of 66 places in 254 ms of which 4 ms to minimize.
[2024-05-24 04:56:49] [INFO ] Deduced a trap composed of 62 places in 220 ms of which 3 ms to minimize.
[2024-05-24 04:56:50] [INFO ] Deduced a trap composed of 76 places in 217 ms of which 3 ms to minimize.
[2024-05-24 04:56:50] [INFO ] Deduced a trap composed of 53 places in 237 ms of which 3 ms to minimize.
[2024-05-24 04:56:50] [INFO ] Deduced a trap composed of 49 places in 226 ms of which 4 ms to minimize.
[2024-05-24 04:56:50] [INFO ] Deduced a trap composed of 44 places in 265 ms of which 3 ms to minimize.
[2024-05-24 04:56:51] [INFO ] Deduced a trap composed of 75 places in 241 ms of which 4 ms to minimize.
[2024-05-24 04:56:51] [INFO ] Deduced a trap composed of 50 places in 243 ms of which 3 ms to minimize.
[2024-05-24 04:56:51] [INFO ] Deduced a trap composed of 57 places in 226 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 236/610 variables, and 59 constraints, problems are : Problem set: 0 solved, 962 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/236 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 962/962 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 962 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 962 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 40/59 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:57:03] [INFO ] Deduced a trap composed of 36 places in 191 ms of which 4 ms to minimize.
[2024-05-24 04:57:05] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 3 ms to minimize.
[2024-05-24 04:57:05] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 2 ms to minimize.
[2024-05-24 04:57:05] [INFO ] Deduced a trap composed of 46 places in 248 ms of which 4 ms to minimize.
[2024-05-24 04:57:06] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 2 ms to minimize.
[2024-05-24 04:57:06] [INFO ] Deduced a trap composed of 54 places in 145 ms of which 3 ms to minimize.
[2024-05-24 04:57:06] [INFO ] Deduced a trap composed of 44 places in 196 ms of which 4 ms to minimize.
[2024-05-24 04:57:06] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 2 ms to minimize.
[2024-05-24 04:57:06] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 2 ms to minimize.
[2024-05-24 04:57:07] [INFO ] Deduced a trap composed of 45 places in 193 ms of which 3 ms to minimize.
[2024-05-24 04:57:07] [INFO ] Deduced a trap composed of 45 places in 219 ms of which 3 ms to minimize.
[2024-05-24 04:57:08] [INFO ] Deduced a trap composed of 53 places in 202 ms of which 2 ms to minimize.
[2024-05-24 04:57:08] [INFO ] Deduced a trap composed of 36 places in 306 ms of which 4 ms to minimize.
[2024-05-24 04:57:08] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 4 ms to minimize.
[2024-05-24 04:57:08] [INFO ] Deduced a trap composed of 46 places in 286 ms of which 3 ms to minimize.
[2024-05-24 04:57:09] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 2 ms to minimize.
[2024-05-24 04:57:09] [INFO ] Deduced a trap composed of 55 places in 197 ms of which 3 ms to minimize.
[2024-05-24 04:57:09] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 2 ms to minimize.
[2024-05-24 04:57:10] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 3 ms to minimize.
[2024-05-24 04:57:10] [INFO ] Deduced a trap composed of 59 places in 316 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:57:16] [INFO ] Deduced a trap composed of 64 places in 262 ms of which 3 ms to minimize.
[2024-05-24 04:57:16] [INFO ] Deduced a trap composed of 53 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:57:17] [INFO ] Deduced a trap composed of 65 places in 200 ms of which 2 ms to minimize.
[2024-05-24 04:57:17] [INFO ] Deduced a trap composed of 57 places in 289 ms of which 4 ms to minimize.
[2024-05-24 04:57:17] [INFO ] Deduced a trap composed of 46 places in 270 ms of which 3 ms to minimize.
[2024-05-24 04:57:18] [INFO ] Deduced a trap composed of 46 places in 258 ms of which 3 ms to minimize.
[2024-05-24 04:57:18] [INFO ] Deduced a trap composed of 52 places in 166 ms of which 3 ms to minimize.
[2024-05-24 04:57:18] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 3 ms to minimize.
[2024-05-24 04:57:18] [INFO ] Deduced a trap composed of 51 places in 252 ms of which 3 ms to minimize.
[2024-05-24 04:57:19] [INFO ] Deduced a trap composed of 64 places in 272 ms of which 3 ms to minimize.
[2024-05-24 04:57:19] [INFO ] Deduced a trap composed of 51 places in 197 ms of which 2 ms to minimize.
[2024-05-24 04:57:19] [INFO ] Deduced a trap composed of 34 places in 277 ms of which 4 ms to minimize.
[2024-05-24 04:57:19] [INFO ] Deduced a trap composed of 45 places in 190 ms of which 2 ms to minimize.
[2024-05-24 04:57:20] [INFO ] Deduced a trap composed of 52 places in 253 ms of which 3 ms to minimize.
[2024-05-24 04:57:20] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 3 ms to minimize.
[2024-05-24 04:57:20] [INFO ] Deduced a trap composed of 35 places in 240 ms of which 4 ms to minimize.
[2024-05-24 04:57:20] [INFO ] Deduced a trap composed of 46 places in 294 ms of which 4 ms to minimize.
[2024-05-24 04:57:21] [INFO ] Deduced a trap composed of 53 places in 278 ms of which 3 ms to minimize.
[2024-05-24 04:57:21] [INFO ] Deduced a trap composed of 48 places in 289 ms of which 3 ms to minimize.
[2024-05-24 04:57:21] [INFO ] Deduced a trap composed of 55 places in 201 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/236 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 962 unsolved
[2024-05-24 04:57:24] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 3 ms to minimize.
[2024-05-24 04:57:25] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2024-05-24 04:57:25] [INFO ] Deduced a trap composed of 44 places in 275 ms of which 4 ms to minimize.
[2024-05-24 04:57:25] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2024-05-24 04:57:25] [INFO ] Deduced a trap composed of 28 places in 102 ms of which 1 ms to minimize.
[2024-05-24 04:57:26] [INFO ] Deduced a trap composed of 45 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:57:26] [INFO ] Deduced a trap composed of 45 places in 181 ms of which 2 ms to minimize.
[2024-05-24 04:57:27] [INFO ] Deduced a trap composed of 59 places in 241 ms of which 3 ms to minimize.
[2024-05-24 04:57:27] [INFO ] Deduced a trap composed of 49 places in 287 ms of which 4 ms to minimize.
[2024-05-24 04:57:28] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 2 ms to minimize.
[2024-05-24 04:57:28] [INFO ] Deduced a trap composed of 56 places in 161 ms of which 2 ms to minimize.
[2024-05-24 04:57:28] [INFO ] Deduced a trap composed of 62 places in 151 ms of which 2 ms to minimize.
[2024-05-24 04:57:28] [INFO ] Deduced a trap composed of 58 places in 146 ms of which 2 ms to minimize.
[2024-05-24 04:57:29] [INFO ] Deduced a trap composed of 50 places in 158 ms of which 2 ms to minimize.
[2024-05-24 04:57:29] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 4 ms to minimize.
[2024-05-24 04:57:29] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 2 ms to minimize.
[2024-05-24 04:57:29] [INFO ] Deduced a trap composed of 33 places in 188 ms of which 3 ms to minimize.
SMT process timed out in 60544ms, After SMT, problems are : Problem set: 0 solved, 962 unsolved
Search for dead transitions found 0 dead transitions in 60554ms
Finished structural reductions in LTL mode , in 1 iterations and 61915 ms. Remains : 236/236 places, 968/968 transitions.
Built C files in :
/tmp/ltsmin7530737613853565854
[2024-05-24 04:57:29] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7530737613853565854
Running compilation step : cd /tmp/ltsmin7530737613853565854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7530737613853565854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7530737613853565854;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:840)
[2024-05-24 04:57:32] [INFO ] Flatten gal took : 27 ms
[2024-05-24 04:57:33] [INFO ] Flatten gal took : 28 ms
[2024-05-24 04:57:33] [INFO ] Time to serialize gal into /tmp/LTL15111800282339713158.gal : 4 ms
[2024-05-24 04:57:33] [INFO ] Time to serialize properties into /tmp/LTL17777829537778262063.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15111800282339713158.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6396836637546927687.hoa' '-atoms' '/tmp/LTL17777829537778262063.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL17777829537778262063.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6396836637546927687.hoa
Detected timeout of ITS tools.
[2024-05-24 04:57:48] [INFO ] Flatten gal took : 25 ms
[2024-05-24 04:57:48] [INFO ] Flatten gal took : 25 ms
[2024-05-24 04:57:48] [INFO ] Time to serialize gal into /tmp/LTL425826421200127152.gal : 4 ms
[2024-05-24 04:57:48] [INFO ] Time to serialize properties into /tmp/LTL15400104784401764533.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL425826421200127152.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15400104784401764533.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G("(((turn_5==0)||(flag_5_waiting==0))||(p25_4_0==0))"))||(G(F((!("(((turn_0==1)&&(flag_0_idle==1))&&(p25_5_1==1))"))U(("((...588
Formula 0 simplified : XXG(F!"(((turn_5==0)||(flag_5_waiting==0))||(p25_4_0==0))" & FG("(((turn_0==1)&&(flag_0_idle==1))&&(p25_5_1==1))" M !"((!(((turn_5==...440
Detected timeout of ITS tools.
[2024-05-24 04:58:03] [INFO ] Flatten gal took : 25 ms
[2024-05-24 04:58:03] [INFO ] Applying decomposition
[2024-05-24 04:58:03] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8106843322049943812.txt' '-o' '/tmp/graph8106843322049943812.bin' '-w' '/tmp/graph8106843322049943812.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8106843322049943812.bin' '-l' '-1' '-v' '-w' '/tmp/graph8106843322049943812.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:58:03] [INFO ] Decomposing Gal with order
[2024-05-24 04:58:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:58:03] [INFO ] Removed a total of 1799 redundant transitions.
[2024-05-24 04:58:03] [INFO ] Flatten gal took : 64 ms
[2024-05-24 04:58:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 281 labels/synchronizations in 18 ms.
[2024-05-24 04:58:03] [INFO ] Time to serialize gal into /tmp/LTL5841149393712042716.gal : 7 ms
[2024-05-24 04:58:03] [INFO ] Time to serialize properties into /tmp/LTL8656450473062042179.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5841149393712042716.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8656450473062042179.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((G("(((i1.u2.turn_5==0)||(i7.u3.flag_5_waiting==0))||(i6.i0.u4.p25_4_0==0))"))||(G(F((!("(((i2.u5.turn_0==1)&&(i6.i1.u46.fla...790
Formula 0 simplified : XXG(F!"(((i1.u2.turn_5==0)||(i7.u3.flag_5_waiting==0))||(i6.i0.u4.p25_4_0==0))" & FG("(((i2.u5.turn_0==1)&&(i6.i1.u46.flag_0_idle==1...598
Detected timeout of ITS tools.
Treatment of property EisenbergMcGuire-PT-06-LTLFireability-13 finished in 428520 ms.
[2024-05-24 04:58:18] [INFO ] Flatten gal took : 29 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin209237046059465877
[2024-05-24 04:58:18] [INFO ] Computing symmetric may disable matrix : 1152 transitions.
[2024-05-24 04:58:18] [INFO ] Applying decomposition
[2024-05-24 04:58:18] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:58:18] [INFO ] Computing symmetric may enable matrix : 1152 transitions.
[2024-05-24 04:58:18] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:58:18] [INFO ] Flatten gal took : 43 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13728102585568797621.txt' '-o' '/tmp/graph13728102585568797621.bin' '-w' '/tmp/graph13728102585568797621.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13728102585568797621.bin' '-l' '-1' '-v' '-w' '/tmp/graph13728102585568797621.weights' '-q' '0' '-e' '0.001'
[2024-05-24 04:58:18] [INFO ] Decomposing Gal with order
[2024-05-24 04:58:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 04:58:18] [INFO ] Removed a total of 1967 redundant transitions.
[2024-05-24 04:58:18] [INFO ] Flatten gal took : 68 ms
[2024-05-24 04:58:18] [INFO ] Computing Do-Not-Accords matrix : 1152 transitions.
[2024-05-24 04:58:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 352 labels/synchronizations in 35 ms.
[2024-05-24 04:58:18] [INFO ] Time to serialize gal into /tmp/LTLFireability8654497153264430815.gal : 9 ms
[2024-05-24 04:58:18] [INFO ] Time to serialize properties into /tmp/LTLFireability1679473353960391398.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8654497153264430815.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1679473353960391398.ltl' '-c' '-stutter-deadlock'
[2024-05-24 04:58:18] [INFO ] Computation of Completed DNA matrix. took 70 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-24 04:58:18] [INFO ] Built C files in 409ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin209237046059465877
Running compilation step : cd /tmp/ltsmin209237046059465877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 3 LTL properties
Checking formula 0 : !((F(((G("(((i17.u85.turn_5==1)&&(i12.i1.u83.flag_5_active==1))&&(i12.i1.u83.p25_2_1==1))"))||(G("(((i17.u85.turn_5==0)||(i12.i1.u83.f...383
Formula 0 simplified : G(F!"(((i17.u85.turn_5==0)||(i12.i1.u83.flag_5_active==0))||(i17.u85.p25_4_1==0))" & X(!"(((i17.u85.turn_5==1)&&(i12.i1.u83.flag_5_a...280
Compilation finished in 7330 ms.
Running link step : cd /tmp/ltsmin209237046059465877;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 97 ms.
Running LTSmin : cd /tmp/ltsmin209237046059465877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))||(X(X((LTLAPp0==true)))&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin209237046059465877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))||(X(X((LTLAPp0==true)))&&X((LTLAPp0==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin209237046059465877;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(<>(((!(LTLAPp2==true) U ([](!(LTLAPp2==true))||!(LTLAPp2==true))) U ([]((!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true)))))||([](!(LTLAPp4==true))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))))' '--buchi-type=spotba'

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600