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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.9M
-rw-r--r-- 1 mcc users 150K Apr 12 02:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 608K Apr 12 02:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 135K Apr 12 02:34 CTLFireability.txt
-rw-r--r-- 1 mcc users 633K Apr 12 02:34 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 84K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 254K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 294K Apr 12 03:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.2M Apr 12 03:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 432K Apr 12 03:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.9M Apr 12 03:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 877K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717274216861

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:36:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 20:36:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:37:00] [INFO ] Load time of PNML (sax parser for PT used): 417 ms
[2024-06-01 20:37:00] [INFO ] Transformed 1330 places.
[2024-06-01 20:37:00] [INFO ] Transformed 2030 transitions.
[2024-06-01 20:37:00] [INFO ] Found NUPN structural information;
[2024-06-01 20:37:00] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 825 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-6-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1003 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 123 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:37:01] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:37:01] [INFO ] Computed 27 invariants in 72 ms
[2024-06-01 20:37:02] [INFO ] Implicit Places using invariants in 1060 ms returned []
[2024-06-01 20:37:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:37:02] [INFO ] Invariant cache hit.
[2024-06-01 20:37:03] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:37:04] [INFO ] Implicit Places using invariants and state equation in 1797 ms returned []
Implicit Place search using SMT with State Equation took 2919 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:37:04] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:37:04] [INFO ] Invariant cache hit.
[2024-06-01 20:37:04] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 31487ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 31569ms
Finished structural reductions in LTL mode , in 1 iterations and 34668 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1003 out of 1330 places after structural reductions.
[2024-06-01 20:37:36] [INFO ] Flatten gal took : 302 ms
[2024-06-01 20:37:36] [INFO ] Flatten gal took : 164 ms
[2024-06-01 20:37:37] [INFO ] Input system was already deterministic with 2030 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (8 resets) in 2811 ms. (14 steps per ms) remains 11/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
[2024-06-01 20:37:38] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:37:38] [INFO ] Invariant cache hit.
[2024-06-01 20:37:38] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1253/1288 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1288 variables, 1253/1307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1288 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1288 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1820/3108 variables, 1288/2597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3108 variables, 330/2927 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3108 variables, 0/2927 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 42/3150 variables, 42/2969 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3150 variables, 42/3011 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3150 variables, 6/3017 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3150/3150 variables, and 3017 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5015 ms.
Refiners :[Domain max(s): 1330/1330 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1330/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 5/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1253/1288 variables, 9/54 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1288 variables, 1253/1307 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1288 variables, 2/1309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1288 variables, 0/1309 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1820/3108 variables, 1288/2597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3108 variables, 330/2927 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3108 variables, 9/2936 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 20:37:47] [INFO ] Deduced a trap composed of 142 places in 528 ms of which 91 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3108/3150 variables, and 2937 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5039 ms.
Refiners :[Domain max(s): 1288/1330 constraints, Positive P Invariants (semi-flows): 14/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1288/1330 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 10101ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 35 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 576 transitions
Trivial Post-agglo rules discarded 576 transitions
Performed 576 trivial Post agglomeration. Transition count delta: 576
Iterating post reduction 0 with 576 rules applied. Total rules applied 576 place count 1330 transition count 1454
Reduce places removed 576 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 578 rules applied. Total rules applied 1154 place count 754 transition count 1452
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1156 place count 752 transition count 1452
Performed 286 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 286 Pre rules applied. Total rules applied 1156 place count 752 transition count 1166
Deduced a syphon composed of 286 places in 3 ms
Reduce places removed 286 places and 0 transitions.
Iterating global reduction 3 with 572 rules applied. Total rules applied 1728 place count 466 transition count 1166
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1812 place count 424 transition count 1124
Applied a total of 1812 rules in 413 ms. Remains 424 /1330 variables (removed 906) and now considering 1124/2030 (removed 906) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 414 ms. Remains : 424/1330 places, 1124/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 748 ms. (53 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
[2024-06-01 20:37:49] [INFO ] Flow matrix only has 914 transitions (discarded 210 similar events)
// Phase 1: matrix 914 rows 424 cols
[2024-06-01 20:37:49] [INFO ] Computed 27 invariants in 4 ms
[2024-06-01 20:37:49] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 348/382 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 348/399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 914/1296 variables, 382/785 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1296 variables, 330/1115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1296 variables, 0/1115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 42/1338 variables, 42/1157 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1338 variables, 42/1199 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1338 variables, 6/1205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1338 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1338 variables, 0/1205 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1338/1338 variables, and 1205 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2100 ms.
Refiners :[Domain max(s): 424/424 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 424/424 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 3/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 348/382 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/382 variables, 348/399 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/382 variables, 4/403 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/382 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 914/1296 variables, 382/785 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1296 variables, 330/1115 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1296 variables, 7/1122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1296 variables, 0/1122 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 42/1338 variables, 42/1164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1338 variables, 42/1206 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1338 variables, 6/1212 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:37:54] [INFO ] Deduced a trap composed of 37 places in 496 ms of which 6 ms to minimize.
[2024-06-01 20:37:54] [INFO ] Deduced a trap composed of 22 places in 362 ms of which 7 ms to minimize.
[2024-06-01 20:37:55] [INFO ] Deduced a trap composed of 20 places in 571 ms of which 9 ms to minimize.
[2024-06-01 20:37:55] [INFO ] Deduced a trap composed of 48 places in 541 ms of which 6 ms to minimize.
[2024-06-01 20:37:56] [INFO ] Deduced a trap composed of 20 places in 515 ms of which 7 ms to minimize.
[2024-06-01 20:37:56] [INFO ] Deduced a trap composed of 19 places in 490 ms of which 6 ms to minimize.
[2024-06-01 20:37:57] [INFO ] Deduced a trap composed of 45 places in 418 ms of which 4 ms to minimize.
[2024-06-01 20:37:57] [INFO ] Deduced a trap composed of 39 places in 473 ms of which 6 ms to minimize.
[2024-06-01 20:37:58] [INFO ] Deduced a trap composed of 20 places in 570 ms of which 6 ms to minimize.
[2024-06-01 20:37:58] [INFO ] Deduced a trap composed of 10 places in 382 ms of which 4 ms to minimize.
[2024-06-01 20:37:59] [INFO ] Deduced a trap composed of 44 places in 379 ms of which 4 ms to minimize.
[2024-06-01 20:37:59] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 3 ms to minimize.
[2024-06-01 20:37:59] [INFO ] Deduced a trap composed of 45 places in 404 ms of which 6 ms to minimize.
[2024-06-01 20:38:00] [INFO ] Deduced a trap composed of 39 places in 503 ms of which 6 ms to minimize.
[2024-06-01 20:38:01] [INFO ] Deduced a trap composed of 51 places in 492 ms of which 7 ms to minimize.
[2024-06-01 20:38:01] [INFO ] Deduced a trap composed of 34 places in 517 ms of which 6 ms to minimize.
[2024-06-01 20:38:02] [INFO ] Deduced a trap composed of 12 places in 435 ms of which 6 ms to minimize.
[2024-06-01 20:38:02] [INFO ] Deduced a trap composed of 10 places in 469 ms of which 5 ms to minimize.
[2024-06-01 20:38:02] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:38:03] [INFO ] Deduced a trap composed of 11 places in 443 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1338 variables, 20/1232 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:38:04] [INFO ] Deduced a trap composed of 18 places in 499 ms of which 6 ms to minimize.
[2024-06-01 20:38:04] [INFO ] Deduced a trap composed of 12 places in 518 ms of which 6 ms to minimize.
[2024-06-01 20:38:05] [INFO ] Deduced a trap composed of 19 places in 536 ms of which 7 ms to minimize.
[2024-06-01 20:38:06] [INFO ] Deduced a trap composed of 28 places in 529 ms of which 7 ms to minimize.
[2024-06-01 20:38:06] [INFO ] Deduced a trap composed of 78 places in 530 ms of which 7 ms to minimize.
[2024-06-01 20:38:07] [INFO ] Deduced a trap composed of 35 places in 529 ms of which 7 ms to minimize.
[2024-06-01 20:38:07] [INFO ] Deduced a trap composed of 43 places in 530 ms of which 6 ms to minimize.
[2024-06-01 20:38:08] [INFO ] Deduced a trap composed of 19 places in 527 ms of which 7 ms to minimize.
[2024-06-01 20:38:08] [INFO ] Deduced a trap composed of 10 places in 517 ms of which 6 ms to minimize.
[2024-06-01 20:38:09] [INFO ] Deduced a trap composed of 67 places in 495 ms of which 6 ms to minimize.
[2024-06-01 20:38:10] [INFO ] Deduced a trap composed of 80 places in 512 ms of which 6 ms to minimize.
[2024-06-01 20:38:10] [INFO ] Deduced a trap composed of 80 places in 499 ms of which 6 ms to minimize.
[2024-06-01 20:38:11] [INFO ] Deduced a trap composed of 21 places in 442 ms of which 7 ms to minimize.
[2024-06-01 20:38:11] [INFO ] Deduced a trap composed of 18 places in 486 ms of which 6 ms to minimize.
[2024-06-01 20:38:12] [INFO ] Deduced a trap composed of 97 places in 420 ms of which 6 ms to minimize.
[2024-06-01 20:38:12] [INFO ] Deduced a trap composed of 23 places in 488 ms of which 6 ms to minimize.
[2024-06-01 20:38:13] [INFO ] Deduced a trap composed of 20 places in 476 ms of which 6 ms to minimize.
[2024-06-01 20:38:13] [INFO ] Deduced a trap composed of 19 places in 491 ms of which 6 ms to minimize.
[2024-06-01 20:38:14] [INFO ] Deduced a trap composed of 39 places in 448 ms of which 7 ms to minimize.
[2024-06-01 20:38:14] [INFO ] Deduced a trap composed of 68 places in 446 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1338 variables, 20/1252 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:38:15] [INFO ] Deduced a trap composed of 40 places in 459 ms of which 22 ms to minimize.
[2024-06-01 20:38:16] [INFO ] Deduced a trap composed of 41 places in 459 ms of which 6 ms to minimize.
[2024-06-01 20:38:16] [INFO ] Deduced a trap composed of 40 places in 440 ms of which 7 ms to minimize.
[2024-06-01 20:38:17] [INFO ] Deduced a trap composed of 48 places in 468 ms of which 8 ms to minimize.
[2024-06-01 20:38:17] [INFO ] Deduced a trap composed of 31 places in 467 ms of which 6 ms to minimize.
[2024-06-01 20:38:18] [INFO ] Deduced a trap composed of 32 places in 445 ms of which 6 ms to minimize.
[2024-06-01 20:38:18] [INFO ] Deduced a trap composed of 19 places in 479 ms of which 6 ms to minimize.
[2024-06-01 20:38:19] [INFO ] Deduced a trap composed of 33 places in 471 ms of which 6 ms to minimize.
[2024-06-01 20:38:19] [INFO ] Deduced a trap composed of 33 places in 455 ms of which 6 ms to minimize.
[2024-06-01 20:38:20] [INFO ] Deduced a trap composed of 59 places in 431 ms of which 6 ms to minimize.
[2024-06-01 20:38:21] [INFO ] Deduced a trap composed of 44 places in 360 ms of which 5 ms to minimize.
[2024-06-01 20:38:21] [INFO ] Deduced a trap composed of 39 places in 421 ms of which 5 ms to minimize.
[2024-06-01 20:38:21] [INFO ] Deduced a trap composed of 58 places in 412 ms of which 6 ms to minimize.
[2024-06-01 20:38:22] [INFO ] Deduced a trap composed of 58 places in 452 ms of which 5 ms to minimize.
[2024-06-01 20:38:22] [INFO ] Deduced a trap composed of 31 places in 421 ms of which 6 ms to minimize.
[2024-06-01 20:38:23] [INFO ] Deduced a trap composed of 52 places in 440 ms of which 18 ms to minimize.
[2024-06-01 20:38:23] [INFO ] Deduced a trap composed of 47 places in 438 ms of which 5 ms to minimize.
[2024-06-01 20:38:24] [INFO ] Deduced a trap composed of 68 places in 447 ms of which 5 ms to minimize.
[2024-06-01 20:38:24] [INFO ] Deduced a trap composed of 40 places in 418 ms of which 6 ms to minimize.
[2024-06-01 20:38:25] [INFO ] Deduced a trap composed of 73 places in 433 ms of which 6 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1338 variables, 20/1272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:38:26] [INFO ] Deduced a trap composed of 20 places in 500 ms of which 6 ms to minimize.
[2024-06-01 20:38:27] [INFO ] Deduced a trap composed of 20 places in 533 ms of which 6 ms to minimize.
[2024-06-01 20:38:27] [INFO ] Deduced a trap composed of 26 places in 531 ms of which 7 ms to minimize.
[2024-06-01 20:38:28] [INFO ] Deduced a trap composed of 38 places in 522 ms of which 7 ms to minimize.
[2024-06-01 20:38:28] [INFO ] Deduced a trap composed of 19 places in 518 ms of which 6 ms to minimize.
[2024-06-01 20:38:29] [INFO ] Deduced a trap composed of 12 places in 537 ms of which 6 ms to minimize.
[2024-06-01 20:38:29] [INFO ] Deduced a trap composed of 38 places in 482 ms of which 6 ms to minimize.
[2024-06-01 20:38:30] [INFO ] Deduced a trap composed of 10 places in 508 ms of which 6 ms to minimize.
[2024-06-01 20:38:31] [INFO ] Deduced a trap composed of 46 places in 475 ms of which 6 ms to minimize.
[2024-06-01 20:38:31] [INFO ] Deduced a trap composed of 41 places in 466 ms of which 6 ms to minimize.
[2024-06-01 20:38:32] [INFO ] Deduced a trap composed of 23 places in 490 ms of which 6 ms to minimize.
[2024-06-01 20:38:32] [INFO ] Deduced a trap composed of 45 places in 471 ms of which 6 ms to minimize.
[2024-06-01 20:38:33] [INFO ] Deduced a trap composed of 55 places in 488 ms of which 6 ms to minimize.
[2024-06-01 20:38:33] [INFO ] Deduced a trap composed of 26 places in 469 ms of which 6 ms to minimize.
[2024-06-01 20:38:34] [INFO ] Deduced a trap composed of 31 places in 409 ms of which 6 ms to minimize.
[2024-06-01 20:38:34] [INFO ] Deduced a trap composed of 31 places in 503 ms of which 6 ms to minimize.
[2024-06-01 20:38:35] [INFO ] Deduced a trap composed of 44 places in 378 ms of which 6 ms to minimize.
[2024-06-01 20:38:35] [INFO ] Deduced a trap composed of 47 places in 486 ms of which 6 ms to minimize.
[2024-06-01 20:38:36] [INFO ] Deduced a trap composed of 55 places in 406 ms of which 6 ms to minimize.
[2024-06-01 20:38:36] [INFO ] Deduced a trap composed of 47 places in 482 ms of which 6 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1338 variables, 20/1292 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1338/1338 variables, and 1292 constraints, problems are : Problem set: 0 solved, 7 unsolved in 45013 ms.
Refiners :[Domain max(s): 424/424 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 424/424 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 80/80 constraints]
After SMT, in 47147ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 34 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 1124/1124 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 424 transition count 1123
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 423 transition count 1123
Applied a total of 2 rules in 94 ms. Remains 423 /424 variables (removed 1) and now considering 1123/1124 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 423/424 places, 1123/1124 transitions.
RANDOM walk for 40000 steps (8 resets) in 551 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 357200 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :0 out of 7
Probabilistic random walk after 357200 steps, saw 50099 distinct states, run finished after 3011 ms. (steps per millisecond=118 ) properties seen :0
[2024-06-01 20:38:40] [INFO ] Flow matrix only has 913 transitions (discarded 210 similar events)
// Phase 1: matrix 913 rows 423 cols
[2024-06-01 20:38:40] [INFO ] Computed 27 invariants in 4 ms
[2024-06-01 20:38:40] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 347/381 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 347/397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 913/1294 variables, 381/783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 330/1113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 0/1113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 42/1336 variables, 42/1155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1336 variables, 42/1197 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1336 variables, 6/1203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1336 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/1336 variables, 0/1203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1336/1336 variables, and 1203 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1767 ms.
Refiners :[Domain max(s): 423/423 constraints, Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 423/423 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 347/381 variables, 12/50 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 347/397 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 913/1294 variables, 381/783 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1294 variables, 330/1113 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1294 variables, 7/1120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1294 variables, 0/1120 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 42/1336 variables, 42/1162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1336 variables, 42/1204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1336 variables, 6/1210 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:38:44] [INFO ] Deduced a trap composed of 19 places in 386 ms of which 6 ms to minimize.
[2024-06-01 20:38:44] [INFO ] Deduced a trap composed of 35 places in 416 ms of which 6 ms to minimize.
[2024-06-01 20:38:45] [INFO ] Deduced a trap composed of 52 places in 538 ms of which 6 ms to minimize.
[2024-06-01 20:38:45] [INFO ] Deduced a trap composed of 11 places in 531 ms of which 6 ms to minimize.
[2024-06-01 20:38:46] [INFO ] Deduced a trap composed of 11 places in 492 ms of which 6 ms to minimize.
[2024-06-01 20:38:46] [INFO ] Deduced a trap composed of 21 places in 512 ms of which 6 ms to minimize.
[2024-06-01 20:38:47] [INFO ] Deduced a trap composed of 80 places in 521 ms of which 6 ms to minimize.
[2024-06-01 20:38:47] [INFO ] Deduced a trap composed of 19 places in 411 ms of which 6 ms to minimize.
[2024-06-01 20:38:48] [INFO ] Deduced a trap composed of 11 places in 517 ms of which 6 ms to minimize.
[2024-06-01 20:38:49] [INFO ] Deduced a trap composed of 36 places in 469 ms of which 6 ms to minimize.
[2024-06-01 20:38:49] [INFO ] Deduced a trap composed of 10 places in 504 ms of which 6 ms to minimize.
[2024-06-01 20:38:50] [INFO ] Deduced a trap composed of 23 places in 430 ms of which 6 ms to minimize.
[2024-06-01 20:38:50] [INFO ] Deduced a trap composed of 19 places in 505 ms of which 6 ms to minimize.
[2024-06-01 20:38:51] [INFO ] Deduced a trap composed of 24 places in 497 ms of which 6 ms to minimize.
[2024-06-01 20:38:51] [INFO ] Deduced a trap composed of 77 places in 491 ms of which 6 ms to minimize.
[2024-06-01 20:38:52] [INFO ] Deduced a trap composed of 11 places in 515 ms of which 6 ms to minimize.
[2024-06-01 20:38:52] [INFO ] Deduced a trap composed of 73 places in 507 ms of which 6 ms to minimize.
[2024-06-01 20:38:53] [INFO ] Deduced a trap composed of 49 places in 488 ms of which 6 ms to minimize.
[2024-06-01 20:38:53] [INFO ] Deduced a trap composed of 11 places in 486 ms of which 6 ms to minimize.
[2024-06-01 20:38:54] [INFO ] Deduced a trap composed of 12 places in 479 ms of which 6 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1336 variables, 20/1230 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:38:55] [INFO ] Deduced a trap composed of 32 places in 538 ms of which 6 ms to minimize.
[2024-06-01 20:38:56] [INFO ] Deduced a trap composed of 20 places in 510 ms of which 6 ms to minimize.
[2024-06-01 20:38:56] [INFO ] Deduced a trap composed of 45 places in 422 ms of which 5 ms to minimize.
[2024-06-01 20:38:56] [INFO ] Deduced a trap composed of 29 places in 410 ms of which 6 ms to minimize.
[2024-06-01 20:38:57] [INFO ] Deduced a trap composed of 50 places in 439 ms of which 5 ms to minimize.
[2024-06-01 20:38:57] [INFO ] Deduced a trap composed of 31 places in 438 ms of which 5 ms to minimize.
[2024-06-01 20:38:58] [INFO ] Deduced a trap composed of 43 places in 432 ms of which 6 ms to minimize.
[2024-06-01 20:38:58] [INFO ] Deduced a trap composed of 27 places in 411 ms of which 5 ms to minimize.
[2024-06-01 20:38:59] [INFO ] Deduced a trap composed of 27 places in 429 ms of which 6 ms to minimize.
[2024-06-01 20:38:59] [INFO ] Deduced a trap composed of 44 places in 429 ms of which 6 ms to minimize.
[2024-06-01 20:39:00] [INFO ] Deduced a trap composed of 26 places in 431 ms of which 5 ms to minimize.
[2024-06-01 20:39:00] [INFO ] Deduced a trap composed of 37 places in 439 ms of which 6 ms to minimize.
[2024-06-01 20:39:01] [INFO ] Deduced a trap composed of 27 places in 385 ms of which 5 ms to minimize.
[2024-06-01 20:39:01] [INFO ] Deduced a trap composed of 27 places in 452 ms of which 6 ms to minimize.
[2024-06-01 20:39:02] [INFO ] Deduced a trap composed of 11 places in 506 ms of which 5 ms to minimize.
[2024-06-01 20:39:02] [INFO ] Deduced a trap composed of 28 places in 456 ms of which 5 ms to minimize.
[2024-06-01 20:39:03] [INFO ] Deduced a trap composed of 33 places in 447 ms of which 5 ms to minimize.
[2024-06-01 20:39:03] [INFO ] Deduced a trap composed of 37 places in 364 ms of which 4 ms to minimize.
[2024-06-01 20:39:04] [INFO ] Deduced a trap composed of 37 places in 375 ms of which 5 ms to minimize.
[2024-06-01 20:39:04] [INFO ] Deduced a trap composed of 39 places in 373 ms of which 5 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1336 variables, 20/1250 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:39:05] [INFO ] Deduced a trap composed of 23 places in 489 ms of which 5 ms to minimize.
[2024-06-01 20:39:06] [INFO ] Deduced a trap composed of 39 places in 465 ms of which 5 ms to minimize.
[2024-06-01 20:39:06] [INFO ] Deduced a trap composed of 24 places in 470 ms of which 5 ms to minimize.
[2024-06-01 20:39:07] [INFO ] Deduced a trap composed of 55 places in 456 ms of which 5 ms to minimize.
[2024-06-01 20:39:07] [INFO ] Deduced a trap composed of 34 places in 462 ms of which 5 ms to minimize.
[2024-06-01 20:39:08] [INFO ] Deduced a trap composed of 34 places in 459 ms of which 6 ms to minimize.
[2024-06-01 20:39:08] [INFO ] Deduced a trap composed of 34 places in 438 ms of which 5 ms to minimize.
[2024-06-01 20:39:09] [INFO ] Deduced a trap composed of 44 places in 458 ms of which 6 ms to minimize.
[2024-06-01 20:39:09] [INFO ] Deduced a trap composed of 35 places in 462 ms of which 6 ms to minimize.
[2024-06-01 20:39:10] [INFO ] Deduced a trap composed of 44 places in 456 ms of which 6 ms to minimize.
[2024-06-01 20:39:10] [INFO ] Deduced a trap composed of 31 places in 411 ms of which 6 ms to minimize.
[2024-06-01 20:39:11] [INFO ] Deduced a trap composed of 47 places in 408 ms of which 5 ms to minimize.
[2024-06-01 20:39:11] [INFO ] Deduced a trap composed of 47 places in 435 ms of which 5 ms to minimize.
[2024-06-01 20:39:12] [INFO ] Deduced a trap composed of 77 places in 411 ms of which 5 ms to minimize.
[2024-06-01 20:39:12] [INFO ] Deduced a trap composed of 39 places in 419 ms of which 5 ms to minimize.
[2024-06-01 20:39:13] [INFO ] Deduced a trap composed of 39 places in 441 ms of which 5 ms to minimize.
[2024-06-01 20:39:13] [INFO ] Deduced a trap composed of 32 places in 469 ms of which 11 ms to minimize.
[2024-06-01 20:39:14] [INFO ] Deduced a trap composed of 55 places in 444 ms of which 5 ms to minimize.
[2024-06-01 20:39:14] [INFO ] Deduced a trap composed of 49 places in 415 ms of which 5 ms to minimize.
[2024-06-01 20:39:15] [INFO ] Deduced a trap composed of 27 places in 423 ms of which 5 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1336 variables, 20/1270 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:39:17] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 6 ms to minimize.
[2024-06-01 20:39:17] [INFO ] Deduced a trap composed of 27 places in 341 ms of which 5 ms to minimize.
[2024-06-01 20:39:17] [INFO ] Deduced a trap composed of 31 places in 355 ms of which 6 ms to minimize.
[2024-06-01 20:39:18] [INFO ] Deduced a trap composed of 36 places in 190 ms of which 4 ms to minimize.
[2024-06-01 20:39:18] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:39:18] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:39:18] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 3 ms to minimize.
[2024-06-01 20:39:19] [INFO ] Deduced a trap composed of 61 places in 159 ms of which 2 ms to minimize.
[2024-06-01 20:39:19] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 3 ms to minimize.
[2024-06-01 20:39:19] [INFO ] Deduced a trap composed of 64 places in 325 ms of which 5 ms to minimize.
[2024-06-01 20:39:20] [INFO ] Deduced a trap composed of 58 places in 313 ms of which 5 ms to minimize.
[2024-06-01 20:39:20] [INFO ] Deduced a trap composed of 43 places in 313 ms of which 4 ms to minimize.
[2024-06-01 20:39:20] [INFO ] Deduced a trap composed of 62 places in 318 ms of which 4 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:39:21] [INFO ] Deduced a trap composed of 71 places in 270 ms of which 4 ms to minimize.
[2024-06-01 20:39:22] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:39:22] [INFO ] Deduced a trap composed of 56 places in 261 ms of which 3 ms to minimize.
[2024-06-01 20:39:22] [INFO ] Deduced a trap composed of 20 places in 198 ms of which 3 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1336 variables, 20/1290 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:39:24] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 3 ms to minimize.
[2024-06-01 20:39:24] [INFO ] Deduced a trap composed of 102 places in 332 ms of which 6 ms to minimize.
[2024-06-01 20:39:25] [INFO ] Deduced a trap composed of 55 places in 505 ms of which 9 ms to minimize.
[2024-06-01 20:39:26] [INFO ] Deduced a trap composed of 47 places in 533 ms of which 6 ms to minimize.
[2024-06-01 20:39:26] [INFO ] Deduced a trap composed of 39 places in 503 ms of which 6 ms to minimize.
[2024-06-01 20:39:27] [INFO ] Deduced a trap composed of 33 places in 525 ms of which 6 ms to minimize.
[2024-06-01 20:39:28] [INFO ] Deduced a trap composed of 10 places in 524 ms of which 6 ms to minimize.
[2024-06-01 20:39:28] [INFO ] Deduced a trap composed of 26 places in 490 ms of which 6 ms to minimize.
[2024-06-01 20:39:29] [INFO ] Deduced a trap composed of 88 places in 473 ms of which 6 ms to minimize.
[2024-06-01 20:39:29] [INFO ] Deduced a trap composed of 18 places in 463 ms of which 6 ms to minimize.
[2024-06-01 20:39:30] [INFO ] Deduced a trap composed of 50 places in 473 ms of which 6 ms to minimize.
[2024-06-01 20:39:30] [INFO ] Deduced a trap composed of 56 places in 470 ms of which 6 ms to minimize.
[2024-06-01 20:39:31] [INFO ] Deduced a trap composed of 42 places in 359 ms of which 5 ms to minimize.
[2024-06-01 20:39:31] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:39:32] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 6 ms to minimize.
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 40 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:39:33] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 3 ms to minimize.
[2024-06-01 20:39:34] [INFO ] Deduced a trap composed of 21 places in 385 ms of which 5 ms to minimize.
[2024-06-01 20:39:37] [INFO ] Deduced a trap composed of 11 places in 234 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1336 variables, 20/1310 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:39:38] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 3 ms to minimize.
[2024-06-01 20:39:38] [INFO ] Deduced a trap composed of 39 places in 253 ms of which 4 ms to minimize.
[2024-06-01 20:39:39] [INFO ] Deduced a trap composed of 46 places in 424 ms of which 5 ms to minimize.
[2024-06-01 20:39:39] [INFO ] Deduced a trap composed of 46 places in 433 ms of which 6 ms to minimize.
[2024-06-01 20:39:40] [INFO ] Deduced a trap composed of 57 places in 422 ms of which 6 ms to minimize.
[2024-06-01 20:39:40] [INFO ] Deduced a trap composed of 27 places in 422 ms of which 5 ms to minimize.
[2024-06-01 20:39:41] [INFO ] Deduced a trap composed of 14 places in 437 ms of which 6 ms to minimize.
[2024-06-01 20:39:41] [INFO ] Deduced a trap composed of 12 places in 443 ms of which 6 ms to minimize.
[2024-06-01 20:39:42] [INFO ] Deduced a trap composed of 12 places in 427 ms of which 6 ms to minimize.
[2024-06-01 20:39:42] [INFO ] Deduced a trap composed of 12 places in 459 ms of which 6 ms to minimize.
[2024-06-01 20:39:43] [INFO ] Deduced a trap composed of 53 places in 418 ms of which 6 ms to minimize.
[2024-06-01 20:39:43] [INFO ] Deduced a trap composed of 39 places in 386 ms of which 5 ms to minimize.
[2024-06-01 20:39:44] [INFO ] Deduced a trap composed of 32 places in 386 ms of which 5 ms to minimize.
[2024-06-01 20:39:45] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:39:45] [INFO ] Deduced a trap composed of 47 places in 176 ms of which 4 ms to minimize.
[2024-06-01 20:39:45] [INFO ] Deduced a trap composed of 55 places in 300 ms of which 4 ms to minimize.
[2024-06-01 20:39:46] [INFO ] Deduced a trap composed of 26 places in 340 ms of which 5 ms to minimize.
[2024-06-01 20:39:47] [INFO ] Deduced a trap composed of 18 places in 413 ms of which 5 ms to minimize.
[2024-06-01 20:39:47] [INFO ] Deduced a trap composed of 102 places in 321 ms of which 5 ms to minimize.
[2024-06-01 20:39:48] [INFO ] Deduced a trap composed of 20 places in 414 ms of which 5 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1336 variables, 20/1330 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 20:39:50] [INFO ] Deduced a trap composed of 10 places in 443 ms of which 6 ms to minimize.
[2024-06-01 20:39:51] [INFO ] Deduced a trap composed of 39 places in 372 ms of which 5 ms to minimize.
[2024-06-01 20:39:51] [INFO ] Deduced a trap composed of 52 places in 379 ms of which 5 ms to minimize.
[2024-06-01 20:39:51] [INFO ] Deduced a trap composed of 40 places in 384 ms of which 5 ms to minimize.
[2024-06-01 20:39:52] [INFO ] Deduced a trap composed of 50 places in 411 ms of which 5 ms to minimize.
[2024-06-01 20:39:53] [INFO ] Deduced a trap composed of 94 places in 414 ms of which 5 ms to minimize.
[2024-06-01 20:39:53] [INFO ] Deduced a trap composed of 28 places in 417 ms of which 6 ms to minimize.
[2024-06-01 20:39:54] [INFO ] Deduced a trap composed of 43 places in 382 ms of which 5 ms to minimize.
[2024-06-01 20:39:54] [INFO ] Deduced a trap composed of 43 places in 367 ms of which 5 ms to minimize.
[2024-06-01 20:39:54] [INFO ] Deduced a trap composed of 43 places in 378 ms of which 5 ms to minimize.
[2024-06-01 20:39:55] [INFO ] Deduced a trap composed of 42 places in 373 ms of which 5 ms to minimize.
[2024-06-01 20:39:55] [INFO ] Deduced a trap composed of 50 places in 377 ms of which 5 ms to minimize.
[2024-06-01 20:39:56] [INFO ] Deduced a trap composed of 39 places in 363 ms of which 5 ms to minimize.
[2024-06-01 20:39:56] [INFO ] Deduced a trap composed of 43 places in 357 ms of which 5 ms to minimize.
[2024-06-01 20:39:57] [INFO ] Deduced a trap composed of 26 places in 291 ms of which 5 ms to minimize.
SMT process timed out in 76819ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 2819 ms.
Support contains 8 out of 423 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 423/423 places, 1123/1123 transitions.
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 0 place count 423 transition count 1116
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 416 transition count 1116
Applied a total of 14 rules in 49 ms. Remains 416 /423 variables (removed 7) and now considering 1116/1123 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 416/423 places, 1116/1123 transitions.
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' '!((p0 U (!X(X(G(X(p1)))) U p2)))'
Support contains 392 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 35 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:40:00] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:40:00] [INFO ] Computed 27 invariants in 11 ms
[2024-06-01 20:40:01] [INFO ] Implicit Places using invariants in 705 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 711 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 57 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 806 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 529 ms :[(NOT p2), p1, p1, (OR (NOT p2) p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-00
Product exploration explored 100000 steps with 395 reset in 881 ms.
Stack based approach found an accepted trace after 1653 steps with 6 reset with depth 117 and stack size 117 in 11 ms.
FORMULA Peterson-PT-6-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-00 finished in 2325 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Support contains 266 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:40:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:40:02] [INFO ] Invariant cache hit.
[2024-06-01 20:40:03] [INFO ] Implicit Places using invariants in 723 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 738 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 64 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 841 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 254 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 1130 ms.
Product exploration explored 100000 steps with 25000 reset in 798 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 909 steps (0 resets) in 8 ms. (101 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 283 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 1323 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 58 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:40:06] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 20:40:06] [INFO ] Computed 20 invariants in 13 ms
[2024-06-01 20:40:07] [INFO ] Implicit Places using invariants in 940 ms returned []
[2024-06-01 20:40:07] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:40:07] [INFO ] Invariant cache hit.
[2024-06-01 20:40:09] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:40:11] [INFO ] Implicit Places using invariants and state equation in 3925 ms returned []
Implicit Place search using SMT with State Equation took 4880 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:40:11] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:40:11] [INFO ] Invariant cache hit.
[2024-06-01 20:40:11] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30828ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30854ms
Finished structural reductions in LTL mode , in 1 iterations and 35798 ms. Remains : 1323/1323 places, 2030/2030 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 968 steps (0 resets) in 14 ms. (64 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 207 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 627 ms.
Product exploration explored 100000 steps with 25000 reset in 569 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 335 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1323 transition count 2030
Performed 253 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 253 Pre rules applied. Total rules applied 335 place count 1323 transition count 2210
Deduced a syphon composed of 588 places in 2 ms
Iterating global reduction 1 with 253 rules applied. Total rules applied 588 place count 1323 transition count 2210
Discarding 150 places :
Symmetric choice reduction at 1 with 150 rule applications. Total rules 738 place count 1173 transition count 2060
Deduced a syphon composed of 438 places in 1 ms
Iterating global reduction 1 with 150 rules applied. Total rules applied 888 place count 1173 transition count 2060
Performed 322 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 760 places in 0 ms
Iterating global reduction 1 with 322 rules applied. Total rules applied 1210 place count 1173 transition count 2060
Discarding 292 places :
Symmetric choice reduction at 1 with 292 rule applications. Total rules 1502 place count 881 transition count 1768
Deduced a syphon composed of 468 places in 1 ms
Iterating global reduction 1 with 292 rules applied. Total rules applied 1794 place count 881 transition count 1768
Deduced a syphon composed of 468 places in 1 ms
Applied a total of 1794 rules in 857 ms. Remains 881 /1323 variables (removed 442) and now considering 1768/2030 (removed 262) transitions.
[2024-06-01 20:40:46] [INFO ] Redundant transitions in 174 ms returned []
Running 1761 sub problems to find dead transitions.
[2024-06-01 20:40:46] [INFO ] Flow matrix only has 1558 transitions (discarded 210 similar events)
// Phase 1: matrix 1558 rows 881 cols
[2024-06-01 20:40:46] [INFO ] Computed 20 invariants in 6 ms
[2024-06-01 20:40:46] [INFO ] State equation strengthened by 510 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1761 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 881/2439 variables, and 20 constraints, problems are : Problem set: 0 solved, 1761 unsolved in 30062 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/881 constraints, ReadFeed: 0/510 constraints, PredecessorRefiner: 1761/1761 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1761 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/881 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1761 unsolved
[2024-06-01 20:41:20] [INFO ] Deduced a trap composed of 14 places in 744 ms of which 10 ms to minimize.
[2024-06-01 20:41:21] [INFO ] Deduced a trap composed of 10 places in 597 ms of which 7 ms to minimize.
[2024-06-01 20:41:21] [INFO ] Deduced a trap composed of 19 places in 482 ms of which 9 ms to minimize.
[2024-06-01 20:41:22] [INFO ] Deduced a trap composed of 28 places in 822 ms of which 10 ms to minimize.
[2024-06-01 20:41:23] [INFO ] Deduced a trap composed of 18 places in 938 ms of which 10 ms to minimize.
[2024-06-01 20:41:24] [INFO ] Deduced a trap composed of 47 places in 586 ms of which 6 ms to minimize.
[2024-06-01 20:41:24] [INFO ] Deduced a trap composed of 53 places in 573 ms of which 6 ms to minimize.
[2024-06-01 20:41:25] [INFO ] Deduced a trap composed of 73 places in 587 ms of which 7 ms to minimize.
[2024-06-01 20:41:26] [INFO ] Deduced a trap composed of 30 places in 579 ms of which 7 ms to minimize.
[2024-06-01 20:41:26] [INFO ] Deduced a trap composed of 30 places in 571 ms of which 7 ms to minimize.
[2024-06-01 20:41:27] [INFO ] Deduced a trap composed of 54 places in 558 ms of which 6 ms to minimize.
[2024-06-01 20:41:27] [INFO ] Deduced a trap composed of 20 places in 524 ms of which 6 ms to minimize.
[2024-06-01 20:41:28] [INFO ] Deduced a trap composed of 18 places in 549 ms of which 7 ms to minimize.
[2024-06-01 20:41:29] [INFO ] Deduced a trap composed of 63 places in 606 ms of which 10 ms to minimize.
[2024-06-01 20:41:29] [INFO ] Deduced a trap composed of 24 places in 810 ms of which 10 ms to minimize.
[2024-06-01 20:41:30] [INFO ] Deduced a trap composed of 43 places in 726 ms of which 9 ms to minimize.
[2024-06-01 20:41:31] [INFO ] Deduced a trap composed of 26 places in 898 ms of which 10 ms to minimize.
[2024-06-01 20:41:32] [INFO ] Deduced a trap composed of 18 places in 960 ms of which 11 ms to minimize.
[2024-06-01 20:41:33] [INFO ] Deduced a trap composed of 18 places in 969 ms of which 11 ms to minimize.
[2024-06-01 20:41:34] [INFO ] Deduced a trap composed of 18 places in 881 ms of which 11 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/881 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 1761 unsolved
[2024-06-01 20:41:36] [INFO ] Deduced a trap composed of 10 places in 745 ms of which 9 ms to minimize.
[2024-06-01 20:41:37] [INFO ] Deduced a trap composed of 10 places in 723 ms of which 9 ms to minimize.
[2024-06-01 20:41:37] [INFO ] Deduced a trap composed of 34 places in 714 ms of which 9 ms to minimize.
[2024-06-01 20:41:38] [INFO ] Deduced a trap composed of 13 places in 814 ms of which 9 ms to minimize.
[2024-06-01 20:41:39] [INFO ] Deduced a trap composed of 10 places in 749 ms of which 9 ms to minimize.
[2024-06-01 20:41:40] [INFO ] Deduced a trap composed of 27 places in 674 ms of which 8 ms to minimize.
[2024-06-01 20:41:40] [INFO ] Deduced a trap composed of 10 places in 690 ms of which 8 ms to minimize.
[2024-06-01 20:41:41] [INFO ] Deduced a trap composed of 29 places in 718 ms of which 8 ms to minimize.
[2024-06-01 20:41:42] [INFO ] Deduced a trap composed of 31 places in 795 ms of which 9 ms to minimize.
[2024-06-01 20:41:43] [INFO ] Deduced a trap composed of 31 places in 773 ms of which 10 ms to minimize.
[2024-06-01 20:41:43] [INFO ] Deduced a trap composed of 31 places in 719 ms of which 10 ms to minimize.
[2024-06-01 20:41:44] [INFO ] Deduced a trap composed of 10 places in 554 ms of which 7 ms to minimize.
[2024-06-01 20:41:45] [INFO ] Deduced a trap composed of 55 places in 740 ms of which 10 ms to minimize.
[2024-06-01 20:41:45] [INFO ] Deduced a trap composed of 31 places in 514 ms of which 7 ms to minimize.
[2024-06-01 20:41:46] [INFO ] Deduced a trap composed of 52 places in 424 ms of which 6 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 20:41:46] [INFO ] Deduced a trap composed of 46 places in 444 ms of which 6 ms to minimize.
[2024-06-01 20:41:47] [INFO ] Deduced a trap composed of 54 places in 393 ms of which 5 ms to minimize.
[2024-06-01 20:41:47] [INFO ] Deduced a trap composed of 54 places in 408 ms of which 6 ms to minimize.
SMT process timed out in 60832ms, After SMT, problems are : Problem set: 0 solved, 1761 unsolved
Search for dead transitions found 0 dead transitions in 60859ms
Starting structural reductions in SI_LTL mode, iteration 1 : 881/1323 places, 1768/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61905 ms. Remains : 881/1323 places, 1768/2030 transitions.
Support contains 7 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 72 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:41:47] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 20:41:47] [INFO ] Computed 20 invariants in 11 ms
[2024-06-01 20:41:48] [INFO ] Implicit Places using invariants in 1110 ms returned []
[2024-06-01 20:41:48] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:41:48] [INFO ] Invariant cache hit.
[2024-06-01 20:41:50] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:41:57] [INFO ] Implicit Places using invariants and state equation in 9132 ms returned []
Implicit Place search using SMT with State Equation took 10244 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:41:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:41:57] [INFO ] Invariant cache hit.
[2024-06-01 20:41:57] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30733ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30758ms
Finished structural reductions in LTL mode , in 1 iterations and 41080 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Treatment of property Peterson-PT-6-LTLFireability-01 finished in 146145 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 28 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 70 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:42:29] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:42:29] [INFO ] Computed 27 invariants in 14 ms
[2024-06-01 20:42:30] [INFO ] Implicit Places using invariants in 847 ms returned []
[2024-06-01 20:42:30] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:42:30] [INFO ] Invariant cache hit.
[2024-06-01 20:42:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:42:35] [INFO ] Implicit Places using invariants and state equation in 5223 ms returned []
Implicit Place search using SMT with State Equation took 6072 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:42:35] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:42:35] [INFO ] Invariant cache hit.
[2024-06-01 20:42:35] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30663ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30699ms
Finished structural reductions in LTL mode , in 1 iterations and 36849 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 445 ms.
Stack based approach found an accepted trace after 465 steps with 0 reset with depth 466 and stack size 466 in 5 ms.
FORMULA Peterson-PT-6-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-02 finished in 37509 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 14 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 123 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2024-06-01 20:43:06] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2024-06-01 20:43:06] [INFO ] Computed 27 invariants in 6 ms
[2024-06-01 20:43:07] [INFO ] Implicit Places using invariants in 894 ms returned []
[2024-06-01 20:43:07] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 20:43:07] [INFO ] Invariant cache hit.
[2024-06-01 20:43:08] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:43:10] [INFO ] Implicit Places using invariants and state equation in 3234 ms returned []
Implicit Place search using SMT with State Equation took 4139 ms to find 0 implicit places.
[2024-06-01 20:43:10] [INFO ] Redundant transitions in 41 ms returned []
Running 1099 sub problems to find dead transitions.
[2024-06-01 20:43:10] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2024-06-01 20:43:10] [INFO ] Invariant cache hit.
[2024-06-01 20:43:10] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 399/399 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 6/405 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/399 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 7/406 variables, 14/419 constraints. Problems are: Problem set: 0 solved, 1099 unsolved
SMT process timed out in 30683ms, After SMT, problems are : Problem set: 0 solved, 1099 unsolved
Search for dead transitions found 0 dead transitions in 30702ms
Starting structural reductions in SI_LTL mode, iteration 1 : 406/1330 places, 1106/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 35021 ms. Remains : 406/1330 places, 1106/2030 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 376 ms.
Stack based approach found an accepted trace after 271 steps with 0 reset with depth 272 and stack size 235 in 3 ms.
FORMULA Peterson-PT-6-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-03 finished in 35472 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))))'
Support contains 84 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 64 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:43:42] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:43:42] [INFO ] Computed 27 invariants in 13 ms
[2024-06-01 20:43:43] [INFO ] Implicit Places using invariants in 1148 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1158 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 59 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1282 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, p0, p0, p0]
Running random walk in product with property : Peterson-PT-6-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-04 finished in 1487 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(p1)||p0)))))'
Support contains 511 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:43:43] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:43:43] [INFO ] Invariant cache hit.
[2024-06-01 20:43:44] [INFO ] Implicit Places using invariants in 965 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 974 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1048 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-06
Product exploration explored 100000 steps with 4076 reset in 4136 ms.
Product exploration explored 100000 steps with 4096 reset in 4034 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 115 steps (0 resets) in 16 ms. (6 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 224 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 20:43:53] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 20:43:54] [INFO ] Computed 20 invariants in 9 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 32 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:44:09] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:44:09] [INFO ] Invariant cache hit.
[2024-06-01 20:44:10] [INFO ] Implicit Places using invariants in 868 ms returned []
[2024-06-01 20:44:10] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:44:10] [INFO ] Invariant cache hit.
[2024-06-01 20:44:12] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:44:15] [INFO ] Implicit Places using invariants and state equation in 4891 ms returned []
Implicit Place search using SMT with State Equation took 5765 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:44:15] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:44:15] [INFO ] Invariant cache hit.
[2024-06-01 20:44:15] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30894ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30929ms
Finished structural reductions in LTL mode , in 1 iterations and 36735 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 110 steps (0 resets) in 30 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 260 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 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))]
[2024-06-01 20:44:47] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:44:47] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4099 reset in 6387 ms.
Product exploration explored 100000 steps with 4114 reset in 6374 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 84 rules applied. Total rules applied 84 place count 1323 transition count 2030
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 259 Pre rules applied. Total rules applied 84 place count 1323 transition count 2030
Deduced a syphon composed of 343 places in 2 ms
Iterating global reduction 1 with 259 rules applied. Total rules applied 343 place count 1323 transition count 2030
Discarding 114 places :
Symmetric choice reduction at 1 with 114 rule applications. Total rules 457 place count 1209 transition count 1916
Deduced a syphon composed of 229 places in 2 ms
Iterating global reduction 1 with 114 rules applied. Total rules applied 571 place count 1209 transition count 1916
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 306 places in 2 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 648 place count 1209 transition count 1916
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 689 place count 1168 transition count 1875
Deduced a syphon composed of 265 places in 1 ms
Iterating global reduction 1 with 41 rules applied. Total rules applied 730 place count 1168 transition count 1875
Deduced a syphon composed of 265 places in 1 ms
Applied a total of 730 rules in 295 ms. Remains 1168 /1323 variables (removed 155) and now considering 1875/2030 (removed 155) transitions.
[2024-06-01 20:45:16] [INFO ] Redundant transitions in 70 ms returned []
Running 1868 sub problems to find dead transitions.
[2024-06-01 20:45:16] [INFO ] Flow matrix only has 1665 transitions (discarded 210 similar events)
// Phase 1: matrix 1665 rows 1168 cols
[2024-06-01 20:45:16] [INFO ] Computed 20 invariants in 12 ms
[2024-06-01 20:45:16] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1168 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1168/2833 variables, and 20 constraints, problems are : Problem set: 0 solved, 1868 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/1168 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1868/1868 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1168 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 1868 unsolved
[2024-06-01 20:45:50] [INFO ] Deduced a trap composed of 12 places in 1193 ms of which 10 ms to minimize.
[2024-06-01 20:45:51] [INFO ] Deduced a trap composed of 49 places in 986 ms of which 15 ms to minimize.
[2024-06-01 20:45:52] [INFO ] Deduced a trap composed of 35 places in 1125 ms of which 14 ms to minimize.
[2024-06-01 20:45:53] [INFO ] Deduced a trap composed of 42 places in 1172 ms of which 14 ms to minimize.
[2024-06-01 20:45:54] [INFO ] Deduced a trap composed of 84 places in 1094 ms of which 10 ms to minimize.
[2024-06-01 20:45:55] [INFO ] Deduced a trap composed of 42 places in 844 ms of which 9 ms to minimize.
[2024-06-01 20:45:56] [INFO ] Deduced a trap composed of 107 places in 851 ms of which 12 ms to minimize.
[2024-06-01 20:45:57] [INFO ] Deduced a trap composed of 80 places in 660 ms of which 9 ms to minimize.
[2024-06-01 20:45:58] [INFO ] Deduced a trap composed of 74 places in 875 ms of which 12 ms to minimize.
[2024-06-01 20:45:59] [INFO ] Deduced a trap composed of 61 places in 781 ms of which 8 ms to minimize.
[2024-06-01 20:45:59] [INFO ] Deduced a trap composed of 58 places in 819 ms of which 12 ms to minimize.
[2024-06-01 20:46:00] [INFO ] Deduced a trap composed of 147 places in 717 ms of which 7 ms to minimize.
[2024-06-01 20:46:01] [INFO ] Deduced a trap composed of 128 places in 488 ms of which 6 ms to minimize.
[2024-06-01 20:46:01] [INFO ] Deduced a trap composed of 147 places in 590 ms of which 7 ms to minimize.
[2024-06-01 20:46:02] [INFO ] Deduced a trap composed of 195 places in 600 ms of which 10 ms to minimize.
[2024-06-01 20:46:03] [INFO ] Deduced a trap composed of 122 places in 699 ms of which 7 ms to minimize.
Problem TDEAD0 is UNSAT
[2024-06-01 20:46:04] [INFO ] Deduced a trap composed of 67 places in 1006 ms of which 14 ms to minimize.
[2024-06-01 20:46:05] [INFO ] Deduced a trap composed of 67 places in 896 ms of which 9 ms to minimize.
[2024-06-01 20:46:05] [INFO ] Deduced a trap composed of 64 places in 858 ms of which 13 ms to minimize.
[2024-06-01 20:46:06] [INFO ] Deduced a trap composed of 81 places in 871 ms of which 11 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD551 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD583 is UNSAT
Problem TDEAD592 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD599 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD663 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD675 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1501 is UNSAT
Problem TDEAD1510 is UNSAT
Problem TDEAD1517 is UNSAT
Problem TDEAD1518 is UNSAT
Problem TDEAD1540 is UNSAT
Problem TDEAD1545 is UNSAT
Problem TDEAD1621 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1819 is UNSAT
Problem TDEAD1843 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/1168 variables, 20/40 constraints. Problems are: Problem set: 37 solved, 1831 unsolved
[2024-06-01 20:46:08] [INFO ] Deduced a trap composed of 34 places in 1027 ms of which 10 ms to minimize.
[2024-06-01 20:46:09] [INFO ] Deduced a trap composed of 37 places in 1011 ms of which 10 ms to minimize.
[2024-06-01 20:46:10] [INFO ] Deduced a trap composed of 37 places in 1050 ms of which 14 ms to minimize.
[2024-06-01 20:46:11] [INFO ] Deduced a trap composed of 33 places in 967 ms of which 10 ms to minimize.
[2024-06-01 20:46:13] [INFO ] Deduced a trap composed of 97 places in 1076 ms of which 15 ms to minimize.
[2024-06-01 20:46:14] [INFO ] Deduced a trap composed of 37 places in 1231 ms of which 15 ms to minimize.
[2024-06-01 20:46:15] [INFO ] Deduced a trap composed of 18 places in 1104 ms of which 10 ms to minimize.
[2024-06-01 20:46:16] [INFO ] Deduced a trap composed of 55 places in 868 ms of which 9 ms to minimize.
[2024-06-01 20:46:17] [INFO ] Deduced a trap composed of 78 places in 996 ms of which 9 ms to minimize.
SMT process timed out in 61222ms, After SMT, problems are : Problem set: 37 solved, 1831 unsolved
Search for dead transitions found 37 dead transitions in 61255ms
Found 37 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 37 transitions
Dead transitions reduction (with SMT) removed 37 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 1168/1323 places, 1838/2030 transitions.
Graph (complete) has 3630 edges and 1168 vertex of which 1131 are kept as prefixes of interest. Removing 37 places using SCC suffix rule.7 ms
Discarding 37 places :
Also discarding 0 output transitions
Deduced a syphon composed of 228 places in 1 ms
Applied a total of 1 rules in 44 ms. Remains 1131 /1168 variables (removed 37) and now considering 1838/1838 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 1131/1323 places, 1838/2030 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 61682 ms. Remains : 1131/1323 places, 1838/2030 transitions.
Support contains 511 out of 1323 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Applied a total of 0 rules in 28 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:46:17] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 20:46:17] [INFO ] Computed 20 invariants in 8 ms
[2024-06-01 20:46:18] [INFO ] Implicit Places using invariants in 641 ms returned []
[2024-06-01 20:46:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:46:18] [INFO ] Invariant cache hit.
[2024-06-01 20:46:19] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:46:21] [INFO ] Implicit Places using invariants and state equation in 3634 ms returned []
Implicit Place search using SMT with State Equation took 4277 ms to find 0 implicit places.
Running 2023 sub problems to find dead transitions.
[2024-06-01 20:46:21] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:46:21] [INFO ] Invariant cache hit.
[2024-06-01 20:46:21] [INFO ] State equation strengthened by 330 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1323 variables, 1323/1323 constraints. Problems are: Problem set: 0 solved, 2023 unsolved
SMT process timed out in 30740ms, After SMT, problems are : Problem set: 0 solved, 2023 unsolved
Search for dead transitions found 0 dead transitions in 30768ms
Finished structural reductions in LTL mode , in 1 iterations and 35084 ms. Remains : 1323/1323 places, 2030/2030 transitions.
Treatment of property Peterson-PT-6-LTLFireability-06 finished in 189078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U (X(p2)||p1)))'
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 22 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:46:52] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:46:52] [INFO ] Computed 27 invariants in 10 ms
[2024-06-01 20:46:53] [INFO ] Implicit Places using invariants in 855 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 858 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 22 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 904 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p1) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p2))), true, p0]
Running random walk in product with property : Peterson-PT-6-LTLFireability-07
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-07 finished in 1060 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(G(p1))&&F((G(!p2)||(!p2&&F(p3)))))))))'
Support contains 7 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 585 transitions
Trivial Post-agglo rules discarded 585 transitions
Performed 585 trivial Post agglomeration. Transition count delta: 585
Iterating post reduction 0 with 585 rules applied. Total rules applied 585 place count 1330 transition count 1445
Reduce places removed 585 places and 0 transitions.
Iterating post reduction 1 with 585 rules applied. Total rules applied 1170 place count 745 transition count 1445
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 293 Pre rules applied. Total rules applied 1170 place count 745 transition count 1152
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 2 with 586 rules applied. Total rules applied 1756 place count 452 transition count 1152
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1840 place count 410 transition count 1110
Applied a total of 1840 rules in 73 ms. Remains 410 /1330 variables (removed 920) and now considering 1110/2030 (removed 920) transitions.
[2024-06-01 20:46:53] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 410 cols
[2024-06-01 20:46:53] [INFO ] Computed 27 invariants in 3 ms
[2024-06-01 20:46:54] [INFO ] Implicit Places using invariants in 564 ms returned [390, 391, 393, 402, 403, 404, 405]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 566 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/1330 places, 1110/2030 transitions.
Applied a total of 0 rules in 17 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 657 ms. Remains : 403/1330 places, 1110/2030 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-08
Product exploration explored 100000 steps with 0 reset in 270 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-08 finished in 1107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X(X(G(p1))))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 40 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:46:54] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:46:54] [INFO ] Computed 27 invariants in 6 ms
[2024-06-01 20:46:55] [INFO ] Implicit Places using invariants in 1023 ms returned [1205, 1206, 1208, 1302, 1303, 1304]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 1032 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1324/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 58 ms. Remains 1324 /1324 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1130 ms. Remains : 1324/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : Peterson-PT-6-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1454 steps with 1 reset in 6 ms.
FORMULA Peterson-PT-6-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-09 finished in 1366 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(X((X((X(F(!p0)) U p1))||p2)))))'
Support contains 6 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 59 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:46:56] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:46:56] [INFO ] Invariant cache hit.
[2024-06-01 20:46:57] [INFO ] Implicit Places using invariants in 922 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 924 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1024 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1) p0), (AND (NOT p2) (NOT p1) p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-10
Product exploration explored 100000 steps with 2 reset in 281 ms.
Stack based approach found an accepted trace after 2886 steps with 7 reset with depth 340 and stack size 340 in 10 ms.
FORMULA Peterson-PT-6-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-10 finished in 1544 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||G(p1))) U G((X(p0)||p2)))))'
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 39 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:46:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:46:57] [INFO ] Invariant cache hit.
[2024-06-01 20:46:58] [INFO ] Implicit Places using invariants in 1009 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1011 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1091 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), false, true, (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 245 ms.
Product exploration explored 100000 steps with 3 reset in 366 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) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 21 factoid took 137 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 8 states, 19 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), false, true, (NOT p1)]
Reduction of identical properties reduced properties to check from 12 to 11
RANDOM walk for 40000 steps (8 resets) in 694 ms. (57 steps per ms) remains 5/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 5/5 properties
[2024-06-01 20:47:00] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 20:47:00] [INFO ] Computed 20 invariants in 6 ms
[2024-06-01 20:47:00] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 543/546 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 543/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 3/549 variables, 3/552 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 780/1329 variables, 549/1104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1329 variables, 60/1164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1329 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 186/1515 variables, 42/1206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1515 variables, 42/1248 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1515 variables, 6/1254 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1515 variables, 6/1260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1515 variables, 0/1260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 288/1803 variables, 48/1308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1803 variables, 48/1356 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1803 variables, 264/1620 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1803 variables, 0/1620 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 680/2483 variables, 4/1624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2483 variables, 680/2304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2483 variables, 0/2304 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 4/2487 variables, 4/2308 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2487 variables, 4/2312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2487 variables, 0/2312 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 656/3143 variables, 684/2996 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (OVERLAPS) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3143/3143 variables, and 2996 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3254 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1323/1323 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Problem apf0 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 543/546 variables, 3/6 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/546 variables, 543/549 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/546 variables, 0/549 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 3/549 variables, 3/552 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/549 variables, 3/555 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/549 variables, 0/555 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 780/1329 variables, 549/1104 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1329 variables, 60/1164 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1329 variables, 3/1167 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1329 variables, 0/1167 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 186/1515 variables, 42/1209 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1515 variables, 42/1251 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1515 variables, 6/1257 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1515 variables, 6/1263 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:47:05] [INFO ] Deduced a trap composed of 12 places in 348 ms of which 5 ms to minimize.
[2024-06-01 20:47:05] [INFO ] Deduced a trap composed of 65 places in 408 ms of which 5 ms to minimize.
[2024-06-01 20:47:06] [INFO ] Deduced a trap composed of 72 places in 403 ms of which 5 ms to minimize.
[2024-06-01 20:47:06] [INFO ] Deduced a trap composed of 42 places in 379 ms of which 7 ms to minimize.
[2024-06-01 20:47:06] [INFO ] Deduced a trap composed of 35 places in 434 ms of which 4 ms to minimize.
[2024-06-01 20:47:07] [INFO ] Deduced a trap composed of 107 places in 318 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1515 variables, 6/1269 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1515 variables, 0/1269 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 288/1803 variables, 48/1317 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1803 variables, 48/1365 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1803 variables, 264/1629 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:47:08] [INFO ] Deduced a trap composed of 185 places in 233 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1803 variables, 1/1630 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1803 variables, 0/1630 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 680/2483 variables, 4/1634 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2483 variables, 680/2314 constraints. Problems are: Problem set: 2 solved, 3 unsolved
[2024-06-01 20:47:09] [INFO ] Deduced a trap composed of 20 places in 989 ms of which 12 ms to minimize.
SMT process timed out in 8960ms, After SMT, problems are : Problem set: 2 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 584 transitions
Trivial Post-agglo rules discarded 584 transitions
Performed 584 trivial Post agglomeration. Transition count delta: 584
Iterating post reduction 0 with 584 rules applied. Total rules applied 584 place count 1323 transition count 1446
Reduce places removed 584 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 585 rules applied. Total rules applied 1169 place count 739 transition count 1445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1170 place count 738 transition count 1445
Performed 293 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 293 Pre rules applied. Total rules applied 1170 place count 738 transition count 1152
Deduced a syphon composed of 293 places in 1 ms
Reduce places removed 293 places and 0 transitions.
Iterating global reduction 3 with 586 rules applied. Total rules applied 1756 place count 445 transition count 1152
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1840 place count 403 transition count 1110
Applied a total of 1840 rules in 80 ms. Remains 403 /1323 variables (removed 920) and now considering 1110/2030 (removed 920) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 403/1323 places, 1110/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 437 ms. (91 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 526552 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 3
Probabilistic random walk after 526552 steps, saw 71229 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-06-01 20:47:13] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
// Phase 1: matrix 900 rows 403 cols
[2024-06-01 20:47:13] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 20:47:13] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 102/104 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 260/366 variables, 106/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 24/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 222/588 variables, 42/282 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/588 variables, 42/324 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 6/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/588 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 360/948 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/948 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/948 variables, 300/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 190/1138 variables, 5/761 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1138 variables, 190/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1138 variables, 0/951 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 5/1143 variables, 5/956 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1143 variables, 5/961 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1143 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 160/1303 variables, 195/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1303 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1303 variables, 0/1156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1303/1303 variables, and 1156 constraints, problems are : Problem set: 0 solved, 3 unsolved in 872 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 403/403 constraints, ReadFeed: 330/330 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/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 102/104 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 102/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/106 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 260/366 variables, 106/216 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/366 variables, 24/240 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/366 variables, 3/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/366 variables, 0/243 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 222/588 variables, 42/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/588 variables, 42/327 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/588 variables, 6/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/588 variables, 6/339 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:47:14] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:47:14] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 2 ms to minimize.
[2024-06-01 20:47:14] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-06-01 20:47:14] [INFO ] Deduced a trap composed of 15 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:47:14] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/588 variables, 5/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/588 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 360/948 variables, 60/404 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/948 variables, 60/464 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/948 variables, 300/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:47:14] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 2 ms to minimize.
[2024-06-01 20:47:15] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/948 variables, 2/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/948 variables, 0/766 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 190/1138 variables, 5/771 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1138 variables, 190/961 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:47:15] [INFO ] Deduced a trap composed of 53 places in 267 ms of which 3 ms to minimize.
[2024-06-01 20:47:15] [INFO ] Deduced a trap composed of 26 places in 268 ms of which 3 ms to minimize.
[2024-06-01 20:47:16] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1138 variables, 3/964 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1138 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 5/1143 variables, 5/969 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1143 variables, 5/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1143 variables, 0/974 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (OVERLAPS) 160/1303 variables, 195/1169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 20:47:16] [INFO ] Deduced a trap composed of 10 places in 257 ms of which 3 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/1303 variables, 1/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1303 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (OVERLAPS) 0/1303 variables, 0/1170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1303/1303 variables, and 1170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3088 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 403/403 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 3975ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 198 ms.
Support contains 2 out of 403 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 15 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 403/403 places, 1110/1110 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 403/403 places, 1110/1110 transitions.
Applied a total of 0 rules in 16 ms. Remains 403 /403 variables (removed 0) and now considering 1110/1110 (removed 0) transitions.
[2024-06-01 20:47:17] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-06-01 20:47:17] [INFO ] Invariant cache hit.
[2024-06-01 20:47:17] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-06-01 20:47:17] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-06-01 20:47:17] [INFO ] Invariant cache hit.
[2024-06-01 20:47:18] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:47:20] [INFO ] Implicit Places using invariants and state equation in 2203 ms returned []
Implicit Place search using SMT with State Equation took 2830 ms to find 0 implicit places.
[2024-06-01 20:47:20] [INFO ] Redundant transitions in 14 ms returned []
Running 1103 sub problems to find dead transitions.
[2024-06-01 20:47:20] [INFO ] Flow matrix only has 900 transitions (discarded 210 similar events)
[2024-06-01 20:47:20] [INFO ] Invariant cache hit.
[2024-06-01 20:47:20] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 403/403 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-06-01 20:47:30] [INFO ] Deduced a trap composed of 11 places in 334 ms of which 4 ms to minimize.
[2024-06-01 20:47:31] [INFO ] Deduced a trap composed of 18 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:47:31] [INFO ] Deduced a trap composed of 12 places in 274 ms of which 3 ms to minimize.
[2024-06-01 20:47:31] [INFO ] Deduced a trap composed of 37 places in 275 ms of which 3 ms to minimize.
[2024-06-01 20:47:32] [INFO ] Deduced a trap composed of 13 places in 267 ms of which 4 ms to minimize.
[2024-06-01 20:47:32] [INFO ] Deduced a trap composed of 10 places in 259 ms of which 3 ms to minimize.
[2024-06-01 20:47:32] [INFO ] Deduced a trap composed of 30 places in 335 ms of which 4 ms to minimize.
[2024-06-01 20:47:33] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 4 ms to minimize.
[2024-06-01 20:47:33] [INFO ] Deduced a trap composed of 29 places in 318 ms of which 4 ms to minimize.
[2024-06-01 20:47:33] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 4 ms to minimize.
[2024-06-01 20:47:33] [INFO ] Deduced a trap composed of 53 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:47:34] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 4 ms to minimize.
[2024-06-01 20:47:34] [INFO ] Deduced a trap composed of 12 places in 285 ms of which 3 ms to minimize.
[2024-06-01 20:47:34] [INFO ] Deduced a trap composed of 46 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:47:34] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:47:34] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:47:35] [INFO ] Deduced a trap composed of 46 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:47:35] [INFO ] Deduced a trap composed of 45 places in 138 ms of which 2 ms to minimize.
[2024-06-01 20:47:35] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 2 ms to minimize.
[2024-06-01 20:47:35] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-06-01 20:47:36] [INFO ] Deduced a trap composed of 18 places in 344 ms of which 4 ms to minimize.
[2024-06-01 20:47:36] [INFO ] Deduced a trap composed of 28 places in 335 ms of which 3 ms to minimize.
[2024-06-01 20:47:36] [INFO ] Deduced a trap composed of 81 places in 317 ms of which 4 ms to minimize.
[2024-06-01 20:47:37] [INFO ] Deduced a trap composed of 27 places in 316 ms of which 4 ms to minimize.
[2024-06-01 20:47:37] [INFO ] Deduced a trap composed of 12 places in 299 ms of which 4 ms to minimize.
[2024-06-01 20:47:37] [INFO ] Deduced a trap composed of 11 places in 319 ms of which 4 ms to minimize.
[2024-06-01 20:47:38] [INFO ] Deduced a trap composed of 27 places in 347 ms of which 4 ms to minimize.
[2024-06-01 20:47:38] [INFO ] Deduced a trap composed of 23 places in 322 ms of which 4 ms to minimize.
[2024-06-01 20:47:38] [INFO ] Deduced a trap composed of 10 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:47:39] [INFO ] Deduced a trap composed of 51 places in 298 ms of which 3 ms to minimize.
[2024-06-01 20:47:39] [INFO ] Deduced a trap composed of 20 places in 309 ms of which 3 ms to minimize.
[2024-06-01 20:47:39] [INFO ] Deduced a trap composed of 20 places in 310 ms of which 4 ms to minimize.
[2024-06-01 20:47:40] [INFO ] Deduced a trap composed of 18 places in 307 ms of which 4 ms to minimize.
[2024-06-01 20:47:40] [INFO ] Deduced a trap composed of 50 places in 305 ms of which 4 ms to minimize.
[2024-06-01 20:47:40] [INFO ] Deduced a trap composed of 24 places in 284 ms of which 4 ms to minimize.
[2024-06-01 20:47:41] [INFO ] Deduced a trap composed of 28 places in 288 ms of which 3 ms to minimize.
[2024-06-01 20:47:41] [INFO ] Deduced a trap composed of 29 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:47:41] [INFO ] Deduced a trap composed of 18 places in 275 ms of which 3 ms to minimize.
[2024-06-01 20:47:41] [INFO ] Deduced a trap composed of 23 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:47:42] [INFO ] Deduced a trap composed of 39 places in 228 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 403/1303 variables, and 463 constraints, problems are : Problem set: 0 solved, 1103 unsolved in 30042 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/403 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1103/1103 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1103 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/403 variables, 403/403 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/403 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/403 variables, 40/463 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-06-01 20:47:53] [INFO ] Deduced a trap composed of 11 places in 317 ms of which 4 ms to minimize.
[2024-06-01 20:47:53] [INFO ] Deduced a trap composed of 18 places in 300 ms of which 3 ms to minimize.
[2024-06-01 20:47:53] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:47:54] [INFO ] Deduced a trap composed of 10 places in 289 ms of which 3 ms to minimize.
[2024-06-01 20:47:54] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:47:54] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:47:54] [INFO ] Deduced a trap composed of 36 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:47:55] [INFO ] Deduced a trap composed of 44 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:47:55] [INFO ] Deduced a trap composed of 52 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:47:55] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:47:55] [INFO ] Deduced a trap composed of 65 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:47:56] [INFO ] Deduced a trap composed of 82 places in 200 ms of which 2 ms to minimize.
[2024-06-01 20:47:56] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:47:56] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 2 ms to minimize.
[2024-06-01 20:47:56] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:47:56] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:47:57] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 2 ms to minimize.
[2024-06-01 20:47:57] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 2 ms to minimize.
[2024-06-01 20:47:57] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:47:57] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/403 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-06-01 20:47:58] [INFO ] Deduced a trap composed of 18 places in 305 ms of which 4 ms to minimize.
[2024-06-01 20:47:59] [INFO ] Deduced a trap composed of 43 places in 285 ms of which 4 ms to minimize.
[2024-06-01 20:47:59] [INFO ] Deduced a trap composed of 26 places in 273 ms of which 3 ms to minimize.
[2024-06-01 20:47:59] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:47:59] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 4 ms to minimize.
[2024-06-01 20:48:00] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:48:00] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:48:00] [INFO ] Deduced a trap composed of 51 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:48:00] [INFO ] Deduced a trap composed of 52 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:48:01] [INFO ] Deduced a trap composed of 30 places in 240 ms of which 4 ms to minimize.
[2024-06-01 20:48:01] [INFO ] Deduced a trap composed of 24 places in 254 ms of which 4 ms to minimize.
[2024-06-01 20:48:01] [INFO ] Deduced a trap composed of 10 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:48:01] [INFO ] Deduced a trap composed of 52 places in 205 ms of which 5 ms to minimize.
[2024-06-01 20:48:02] [INFO ] Deduced a trap composed of 11 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:48:02] [INFO ] Deduced a trap composed of 20 places in 271 ms of which 3 ms to minimize.
[2024-06-01 20:48:02] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:48:02] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:48:03] [INFO ] Deduced a trap composed of 54 places in 302 ms of which 4 ms to minimize.
[2024-06-01 20:48:03] [INFO ] Deduced a trap composed of 10 places in 290 ms of which 4 ms to minimize.
[2024-06-01 20:48:03] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/403 variables, 20/503 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-06-01 20:48:05] [INFO ] Deduced a trap composed of 28 places in 270 ms of which 3 ms to minimize.
[2024-06-01 20:48:05] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 2 ms to minimize.
[2024-06-01 20:48:05] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2024-06-01 20:48:05] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
[2024-06-01 20:48:05] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:48:06] [INFO ] Deduced a trap composed of 38 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:48:06] [INFO ] Deduced a trap composed of 37 places in 173 ms of which 2 ms to minimize.
[2024-06-01 20:48:06] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:48:06] [INFO ] Deduced a trap composed of 19 places in 249 ms of which 3 ms to minimize.
[2024-06-01 20:48:07] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:48:07] [INFO ] Deduced a trap composed of 58 places in 266 ms of which 3 ms to minimize.
[2024-06-01 20:48:07] [INFO ] Deduced a trap composed of 31 places in 115 ms of which 2 ms to minimize.
[2024-06-01 20:48:07] [INFO ] Deduced a trap composed of 22 places in 283 ms of which 4 ms to minimize.
[2024-06-01 20:48:08] [INFO ] Deduced a trap composed of 19 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:48:08] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:48:08] [INFO ] Deduced a trap composed of 13 places in 280 ms of which 3 ms to minimize.
[2024-06-01 20:48:08] [INFO ] Deduced a trap composed of 15 places in 265 ms of which 3 ms to minimize.
[2024-06-01 20:48:09] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 3 ms to minimize.
[2024-06-01 20:48:09] [INFO ] Deduced a trap composed of 30 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:48:09] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/403 variables, 20/523 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
[2024-06-01 20:48:12] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 3 ms to minimize.
[2024-06-01 20:48:12] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:48:12] [INFO ] Deduced a trap composed of 44 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:48:12] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2024-06-01 20:48:13] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 3 ms to minimize.
[2024-06-01 20:48:13] [INFO ] Deduced a trap composed of 45 places in 270 ms of which 4 ms to minimize.
[2024-06-01 20:48:13] [INFO ] Deduced a trap composed of 36 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:48:13] [INFO ] Deduced a trap composed of 31 places in 260 ms of which 3 ms to minimize.
[2024-06-01 20:48:14] [INFO ] Deduced a trap composed of 31 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:48:14] [INFO ] Deduced a trap composed of 28 places in 261 ms of which 3 ms to minimize.
[2024-06-01 20:48:14] [INFO ] Deduced a trap composed of 36 places in 239 ms of which 3 ms to minimize.
[2024-06-01 20:48:15] [INFO ] Deduced a trap composed of 20 places in 246 ms of which 3 ms to minimize.
[2024-06-01 20:48:15] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:48:15] [INFO ] Deduced a trap composed of 29 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:48:15] [INFO ] Deduced a trap composed of 35 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:48:16] [INFO ] Deduced a trap composed of 22 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:48:16] [INFO ] Deduced a trap composed of 20 places in 275 ms of which 3 ms to minimize.
[2024-06-01 20:48:16] [INFO ] Deduced a trap composed of 21 places in 281 ms of which 3 ms to minimize.
[2024-06-01 20:48:16] [INFO ] Deduced a trap composed of 22 places in 270 ms of which 3 ms to minimize.
[2024-06-01 20:48:17] [INFO ] Deduced a trap composed of 21 places in 270 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 20/543 constraints. Problems are: Problem set: 0 solved, 1103 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/1303 variables, and 543 constraints, problems are : Problem set: 0 solved, 1103 unsolved in 30025 ms.
Refiners :[Domain max(s): 403/403 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/403 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1103 constraints, Known Traps: 120/120 constraints]
After SMT, in 60510ms problems are : Problem set: 0 solved, 1103 unsolved
Search for dead transitions found 0 dead transitions in 60522ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63392 ms. Remains : 403/403 places, 1110/1110 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 840 edges and 403 vertex of which 288 / 403 are part of one of the 42 SCC in 5 ms
Free SCC test removed 246 places
Drop transitions (Empty/Sink Transition effects.) removed 492 transitions
Ensure Unique test removed 250 transitions
Reduce isomorphic transitions removed 742 transitions.
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 40 Pre rules applied. Total rules applied 1 place count 157 transition count 328
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 80 rules applied. Total rules applied 81 place count 117 transition count 328
Performed 6 Post agglomeration using F-continuation condition with reduction of 4 identical transitions.
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 93 place count 111 transition count 318
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 25 rules applied. Total rules applied 118 place count 95 transition count 323
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 51 edges and 95 vertex of which 49 / 95 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 121 place count 53 transition count 321
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Graph (complete) has 284 edges and 48 vertex of which 20 are kept as prefixes of interest. Removing 28 places using SCC suffix rule.0 ms
Discarding 28 places :
Also discarding 120 output transitions
Drop transitions (Output transitions of discarded places.) removed 120 transitions
Graph (trivial) has 110 edges and 20 vertex of which 10 / 20 are part of one of the 2 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 1 with 56 rules applied. Total rules applied 177 place count 12 transition count 152
Drop transitions (Empty/Sink Transition effects.) removed 88 transitions
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 305 place count 12 transition count 24
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 311 place count 12 transition count 18
Graph (complete) has 22 edges and 12 vertex of which 6 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Iterating post reduction 3 with 1 rules applied. Total rules applied 312 place count 6 transition count 14
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 320 place count 6 transition count 6
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 320 place count 6 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 324 place count 4 transition count 4
Applied a total of 324 rules in 52 ms. Remains 4 /403 variables (removed 399) and now considering 4/1110 (removed 1106) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 4 rows 4 cols
[2024-06-01 20:48:20] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 20:48:20] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-01 20:48:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 20:48:20] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-06-01 20:48:20] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-06-01 20:48:20] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 158 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1))), (X (AND (NOT p0) p1)), (X (OR p0 p1)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p2) (NOT p0) p1))), (X (X (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (X (AND (NOT p0) p1))), (X (X (OR p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR (NOT p0) p2 p1)), (G (OR p0 p2 p1))]
False Knowledge obtained : [(F (NOT (OR (AND p0 (NOT p2)) (AND (NOT p2) p1)))), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR p0 p1))), (F p2), (F (NOT p1)), (F (NOT (OR p0 p1))), (F (NOT (AND (NOT p0) (NOT p2) p1)))]
Property proved to be false thanks to negative knowledge :(F (NOT (OR p0 p1)))
Knowledge based reduction with 23 factoid took 309 ms. Reduced automaton from 8 states, 19 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Peterson-PT-6-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Peterson-PT-6-LTLFireability-11 finished in 83413 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(p1)) U (F(p3)&&p2))))'
Support contains 4 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:48:21] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:48:21] [INFO ] Computed 27 invariants in 10 ms
[2024-06-01 20:48:22] [INFO ] Implicit Places using invariants in 919 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 921 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 44 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1011 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-12
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-12 finished in 1253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:48:22] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2024-06-01 20:48:22] [INFO ] Invariant cache hit.
[2024-06-01 20:48:23] [INFO ] Implicit Places using invariants in 874 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 878 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 43 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 968 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 259 ms.
Product exploration explored 100000 steps with 0 reset in 394 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 346464 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :0 out of 1
Probabilistic random walk after 346464 steps, saw 212638 distinct states, run finished after 3004 ms. (steps per millisecond=115 ) properties seen :0
[2024-06-01 20:48:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1323 cols
[2024-06-01 20:48:27] [INFO ] Computed 20 invariants in 5 ms
[2024-06-01 20:48:27] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 363/365 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 363/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/366 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 520/886 variables, 366/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 36/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/886 variables, 0/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/1108 variables, 42/814 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1108 variables, 42/856 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1108 variables, 6/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1108 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/1468 variables, 60/922 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1468 variables, 60/982 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1468 variables, 294/1276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1468 variables, 0/1276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 850/2318 variables, 5/1281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2318 variables, 850/2131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2318 variables, 0/2131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/2323 variables, 5/2136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2323 variables, 5/2141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2323 variables, 0/2141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 820/3143 variables, 855/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/3143 variables, 0/2996 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3143/3143 variables, and 2996 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1333 ms.
Refiners :[Domain max(s): 1323/1323 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 1323/1323 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 363/365 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/365 variables, 363/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/366 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/366 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/366 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 520/886 variables, 366/736 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/886 variables, 36/772 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/886 variables, 1/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/1108 variables, 42/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1108 variables, 42/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1108 variables, 6/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:48:29] [INFO ] Deduced a trap composed of 117 places in 209 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/1108 variables, 1/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1108 variables, 0/864 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/1468 variables, 60/924 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1468 variables, 60/984 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1468 variables, 294/1278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1468 variables, 0/1278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 850/2318 variables, 5/1283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2318 variables, 850/2133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:48:31] [INFO ] Deduced a trap composed of 15 places in 1191 ms of which 11 ms to minimize.
[2024-06-01 20:48:32] [INFO ] Deduced a trap composed of 19 places in 1229 ms of which 12 ms to minimize.
[2024-06-01 20:48:33] [INFO ] Deduced a trap composed of 98 places in 1200 ms of which 10 ms to minimize.
[2024-06-01 20:48:34] [INFO ] Deduced a trap composed of 94 places in 906 ms of which 10 ms to minimize.
SMT process timed out in 7158ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1323 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 736 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 736 transition count 1149
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 442 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 400 transition count 1107
Applied a total of 1846 rules in 68 ms. Remains 400 /1323 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 400/1323 places, 1107/2030 transitions.
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 791432 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 1
Probabilistic random walk after 791432 steps, saw 105718 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2024-06-01 20:48:37] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-06-01 20:48:37] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 20:48:37] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 543 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:48:38] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 2 ms to minimize.
[2024-06-01 20:48:38] [INFO ] Deduced a trap composed of 37 places in 88 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:48:39] [INFO ] Deduced a trap composed of 62 places in 326 ms of which 4 ms to minimize.
[2024-06-01 20:48:39] [INFO ] Deduced a trap composed of 37 places in 315 ms of which 4 ms to minimize.
[2024-06-01 20:48:39] [INFO ] Deduced a trap composed of 21 places in 322 ms of which 4 ms to minimize.
[2024-06-01 20:48:40] [INFO ] Deduced a trap composed of 44 places in 323 ms of which 4 ms to minimize.
[2024-06-01 20:48:40] [INFO ] Deduced a trap composed of 11 places in 331 ms of which 4 ms to minimize.
[2024-06-01 20:48:40] [INFO ] Deduced a trap composed of 12 places in 317 ms of which 4 ms to minimize.
[2024-06-01 20:48:41] [INFO ] Deduced a trap composed of 15 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:48:41] [INFO ] Deduced a trap composed of 22 places in 284 ms of which 4 ms to minimize.
[2024-06-01 20:48:41] [INFO ] Deduced a trap composed of 88 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:48:42] [INFO ] Deduced a trap composed of 26 places in 277 ms of which 3 ms to minimize.
[2024-06-01 20:48:42] [INFO ] Deduced a trap composed of 37 places in 285 ms of which 3 ms to minimize.
[2024-06-01 20:48:42] [INFO ] Deduced a trap composed of 14 places in 295 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 12/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1297 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4740 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 5297ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 20 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 18 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-06-01 20:48:42] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:48:42] [INFO ] Invariant cache hit.
[2024-06-01 20:48:43] [INFO ] Implicit Places using invariants in 504 ms returned []
[2024-06-01 20:48:43] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:48:43] [INFO ] Invariant cache hit.
[2024-06-01 20:48:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:48:45] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 2579 ms to find 0 implicit places.
[2024-06-01 20:48:45] [INFO ] Redundant transitions in 14 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 20:48:45] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:48:45] [INFO ] Invariant cache hit.
[2024-06-01 20:48:45] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:48:56] [INFO ] Deduced a trap composed of 46 places in 324 ms of which 4 ms to minimize.
[2024-06-01 20:48:56] [INFO ] Deduced a trap composed of 29 places in 412 ms of which 6 ms to minimize.
[2024-06-01 20:48:57] [INFO ] Deduced a trap composed of 51 places in 371 ms of which 3 ms to minimize.
[2024-06-01 20:48:57] [INFO ] Deduced a trap composed of 19 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:48:57] [INFO ] Deduced a trap composed of 12 places in 308 ms of which 4 ms to minimize.
[2024-06-01 20:48:58] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:48:58] [INFO ] Deduced a trap composed of 13 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:48:58] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 3 ms to minimize.
[2024-06-01 20:48:58] [INFO ] Deduced a trap composed of 55 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:48:59] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 4 ms to minimize.
[2024-06-01 20:48:59] [INFO ] Deduced a trap composed of 21 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:48:59] [INFO ] Deduced a trap composed of 29 places in 282 ms of which 4 ms to minimize.
[2024-06-01 20:49:00] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 3 ms to minimize.
[2024-06-01 20:49:00] [INFO ] Deduced a trap composed of 27 places in 276 ms of which 3 ms to minimize.
[2024-06-01 20:49:00] [INFO ] Deduced a trap composed of 29 places in 279 ms of which 3 ms to minimize.
[2024-06-01 20:49:00] [INFO ] Deduced a trap composed of 56 places in 270 ms of which 3 ms to minimize.
[2024-06-01 20:49:01] [INFO ] Deduced a trap composed of 38 places in 203 ms of which 3 ms to minimize.
[2024-06-01 20:49:01] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 3 ms to minimize.
[2024-06-01 20:49:01] [INFO ] Deduced a trap composed of 21 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:49:02] [INFO ] Deduced a trap composed of 51 places in 273 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:49:02] [INFO ] Deduced a trap composed of 62 places in 318 ms of which 3 ms to minimize.
[2024-06-01 20:49:03] [INFO ] Deduced a trap composed of 60 places in 321 ms of which 4 ms to minimize.
[2024-06-01 20:49:03] [INFO ] Deduced a trap composed of 14 places in 336 ms of which 6 ms to minimize.
[2024-06-01 20:49:03] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 4 ms to minimize.
[2024-06-01 20:49:04] [INFO ] Deduced a trap composed of 21 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:49:04] [INFO ] Deduced a trap composed of 12 places in 298 ms of which 3 ms to minimize.
[2024-06-01 20:49:04] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 3 ms to minimize.
[2024-06-01 20:49:05] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 4 ms to minimize.
[2024-06-01 20:49:05] [INFO ] Deduced a trap composed of 52 places in 265 ms of which 3 ms to minimize.
[2024-06-01 20:49:05] [INFO ] Deduced a trap composed of 27 places in 262 ms of which 4 ms to minimize.
[2024-06-01 20:49:05] [INFO ] Deduced a trap composed of 33 places in 248 ms of which 3 ms to minimize.
[2024-06-01 20:49:06] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:49:06] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:49:06] [INFO ] Deduced a trap composed of 29 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:49:06] [INFO ] Deduced a trap composed of 30 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:49:07] [INFO ] Deduced a trap composed of 40 places in 240 ms of which 3 ms to minimize.
[2024-06-01 20:49:07] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 3 ms to minimize.
[2024-06-01 20:49:07] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 3 ms to minimize.
[2024-06-01 20:49:07] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 3 ms to minimize.
[2024-06-01 20:49:08] [INFO ] Deduced a trap composed of 27 places in 229 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 460 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30025 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:49:18] [INFO ] Deduced a trap composed of 26 places in 324 ms of which 4 ms to minimize.
[2024-06-01 20:49:19] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 4 ms to minimize.
[2024-06-01 20:49:19] [INFO ] Deduced a trap composed of 51 places in 297 ms of which 4 ms to minimize.
[2024-06-01 20:49:19] [INFO ] Deduced a trap composed of 35 places in 289 ms of which 3 ms to minimize.
[2024-06-01 20:49:20] [INFO ] Deduced a trap composed of 19 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:49:20] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:49:20] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 3 ms to minimize.
[2024-06-01 20:49:20] [INFO ] Deduced a trap composed of 47 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:49:21] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:49:21] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:49:21] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:49:21] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 4 ms to minimize.
[2024-06-01 20:49:22] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 3 ms to minimize.
[2024-06-01 20:49:22] [INFO ] Deduced a trap composed of 50 places in 217 ms of which 4 ms to minimize.
[2024-06-01 20:49:22] [INFO ] Deduced a trap composed of 51 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:49:22] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2024-06-01 20:49:23] [INFO ] Deduced a trap composed of 13 places in 326 ms of which 4 ms to minimize.
[2024-06-01 20:49:23] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 3 ms to minimize.
[2024-06-01 20:49:23] [INFO ] Deduced a trap composed of 35 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:49:23] [INFO ] Deduced a trap composed of 27 places in 234 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:49:25] [INFO ] Deduced a trap composed of 10 places in 286 ms of which 4 ms to minimize.
[2024-06-01 20:49:25] [INFO ] Deduced a trap composed of 10 places in 285 ms of which 3 ms to minimize.
[2024-06-01 20:49:25] [INFO ] Deduced a trap composed of 62 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:49:25] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:49:26] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:49:26] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:49:26] [INFO ] Deduced a trap composed of 68 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:49:26] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:49:26] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:49:27] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:49:27] [INFO ] Deduced a trap composed of 76 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:49:28] [INFO ] Deduced a trap composed of 18 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:49:28] [INFO ] Deduced a trap composed of 28 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:49:28] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:49:29] [INFO ] Deduced a trap composed of 19 places in 233 ms of which 3 ms to minimize.
[2024-06-01 20:49:29] [INFO ] Deduced a trap composed of 31 places in 179 ms of which 3 ms to minimize.
[2024-06-01 20:49:29] [INFO ] Deduced a trap composed of 26 places in 195 ms of which 3 ms to minimize.
[2024-06-01 20:49:30] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 2 ms to minimize.
[2024-06-01 20:49:30] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 3 ms to minimize.
[2024-06-01 20:49:30] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:49:31] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 2 ms to minimize.
[2024-06-01 20:49:31] [INFO ] Deduced a trap composed of 72 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:49:32] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:49:32] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:49:32] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 3 ms to minimize.
[2024-06-01 20:49:32] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 4 ms to minimize.
[2024-06-01 20:49:33] [INFO ] Deduced a trap composed of 30 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:49:33] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:49:33] [INFO ] Deduced a trap composed of 21 places in 226 ms of which 3 ms to minimize.
[2024-06-01 20:49:33] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 3 ms to minimize.
[2024-06-01 20:49:34] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 3 ms to minimize.
[2024-06-01 20:49:34] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 4 ms to minimize.
[2024-06-01 20:49:34] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:49:34] [INFO ] Deduced a trap composed of 24 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:49:35] [INFO ] Deduced a trap composed of 50 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:49:35] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:49:35] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:49:35] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:49:36] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:49:36] [INFO ] Deduced a trap composed of 31 places in 193 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:49:37] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:49:37] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 2 ms to minimize.
[2024-06-01 20:49:37] [INFO ] Deduced a trap composed of 34 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:49:38] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 2 ms to minimize.
[2024-06-01 20:49:38] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:49:38] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 4 ms to minimize.
[2024-06-01 20:49:40] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 2 ms to minimize.
[2024-06-01 20:49:40] [INFO ] Deduced a trap composed of 34 places in 139 ms of which 2 ms to minimize.
[2024-06-01 20:49:40] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:49:40] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:49:41] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 3 ms to minimize.
[2024-06-01 20:49:41] [INFO ] Deduced a trap composed of 11 places in 264 ms of which 3 ms to minimize.
[2024-06-01 20:49:41] [INFO ] Deduced a trap composed of 33 places in 279 ms of which 3 ms to minimize.
[2024-06-01 20:49:42] [INFO ] Deduced a trap composed of 74 places in 281 ms of which 3 ms to minimize.
[2024-06-01 20:49:42] [INFO ] Deduced a trap composed of 43 places in 272 ms of which 3 ms to minimize.
[2024-06-01 20:49:43] [INFO ] Deduced a trap composed of 22 places in 222 ms of which 2 ms to minimize.
[2024-06-01 20:49:43] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:49:43] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:49:43] [INFO ] Deduced a trap composed of 15 places in 191 ms of which 2 ms to minimize.
[2024-06-01 20:49:43] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:49:45] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:49:45] [INFO ] Deduced a trap composed of 45 places in 178 ms of which 2 ms to minimize.
[2024-06-01 20:49:46] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 3 ms to minimize.
SMT process timed out in 60613ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60625ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63243 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 1 ms
Free SCC test removed 249 places
Drop transitions (Empty/Sink Transition effects.) removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 18 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-06-01 20:49:46] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 20:49:46] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:49:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-06-01 20:49:46] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:49:46] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 20:49:46] [INFO ] After 52ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 106 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Support contains 2 out of 1323 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1323/1323 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1323 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 736 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 736 transition count 1149
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 442 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 400 transition count 1107
Applied a total of 1846 rules in 65 ms. Remains 400 /1323 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
[2024-06-01 20:49:46] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-06-01 20:49:46] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 20:49:47] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-06-01 20:49:47] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:49:47] [INFO ] Invariant cache hit.
[2024-06-01 20:49:47] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:49:49] [INFO ] Implicit Places using invariants and state equation in 2064 ms returned []
Implicit Place search using SMT with State Equation took 2796 ms to find 0 implicit places.
[2024-06-01 20:49:49] [INFO ] Redundant transitions in 17 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 20:49:49] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:49:49] [INFO ] Invariant cache hit.
[2024-06-01 20:49:49] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:50:00] [INFO ] Deduced a trap composed of 46 places in 346 ms of which 5 ms to minimize.
[2024-06-01 20:50:00] [INFO ] Deduced a trap composed of 29 places in 381 ms of which 4 ms to minimize.
[2024-06-01 20:50:00] [INFO ] Deduced a trap composed of 51 places in 327 ms of which 4 ms to minimize.
[2024-06-01 20:50:01] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 4 ms to minimize.
[2024-06-01 20:50:01] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 3 ms to minimize.
[2024-06-01 20:50:01] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 4 ms to minimize.
[2024-06-01 20:50:02] [INFO ] Deduced a trap composed of 13 places in 237 ms of which 3 ms to minimize.
[2024-06-01 20:50:02] [INFO ] Deduced a trap composed of 10 places in 312 ms of which 4 ms to minimize.
[2024-06-01 20:50:02] [INFO ] Deduced a trap composed of 55 places in 326 ms of which 4 ms to minimize.
[2024-06-01 20:50:03] [INFO ] Deduced a trap composed of 11 places in 328 ms of which 3 ms to minimize.
[2024-06-01 20:50:03] [INFO ] Deduced a trap composed of 21 places in 327 ms of which 3 ms to minimize.
[2024-06-01 20:50:03] [INFO ] Deduced a trap composed of 29 places in 301 ms of which 3 ms to minimize.
[2024-06-01 20:50:04] [INFO ] Deduced a trap composed of 29 places in 275 ms of which 3 ms to minimize.
[2024-06-01 20:50:04] [INFO ] Deduced a trap composed of 27 places in 280 ms of which 4 ms to minimize.
[2024-06-01 20:50:04] [INFO ] Deduced a trap composed of 29 places in 273 ms of which 4 ms to minimize.
[2024-06-01 20:50:04] [INFO ] Deduced a trap composed of 56 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:50:05] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:50:05] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 3 ms to minimize.
[2024-06-01 20:50:05] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:50:05] [INFO ] Deduced a trap composed of 51 places in 269 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:50:06] [INFO ] Deduced a trap composed of 62 places in 423 ms of which 4 ms to minimize.
[2024-06-01 20:50:07] [INFO ] Deduced a trap composed of 60 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:50:07] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 3 ms to minimize.
[2024-06-01 20:50:07] [INFO ] Deduced a trap composed of 11 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:50:08] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 3 ms to minimize.
[2024-06-01 20:50:08] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 3 ms to minimize.
[2024-06-01 20:50:08] [INFO ] Deduced a trap composed of 36 places in 292 ms of which 3 ms to minimize.
[2024-06-01 20:50:09] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 3 ms to minimize.
[2024-06-01 20:50:09] [INFO ] Deduced a trap composed of 52 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:50:09] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 3 ms to minimize.
[2024-06-01 20:50:09] [INFO ] Deduced a trap composed of 33 places in 250 ms of which 4 ms to minimize.
[2024-06-01 20:50:10] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 3 ms to minimize.
[2024-06-01 20:50:10] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 4 ms to minimize.
[2024-06-01 20:50:10] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:50:10] [INFO ] Deduced a trap composed of 30 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:50:11] [INFO ] Deduced a trap composed of 40 places in 260 ms of which 3 ms to minimize.
[2024-06-01 20:50:11] [INFO ] Deduced a trap composed of 36 places in 224 ms of which 4 ms to minimize.
[2024-06-01 20:50:11] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 4 ms to minimize.
[2024-06-01 20:50:12] [INFO ] Deduced a trap composed of 23 places in 258 ms of which 4 ms to minimize.
[2024-06-01 20:50:12] [INFO ] Deduced a trap composed of 27 places in 241 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(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 1.0)
(s211 1.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 1.0)
(s221 1.0)
(s222 0.0)
(s223 1.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 1.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 1.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 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 460 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30031 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:50:22] [INFO ] Deduced a trap composed of 26 places in 337 ms of which 4 ms to minimize.
[2024-06-01 20:50:23] [INFO ] Deduced a trap composed of 10 places in 324 ms of which 3 ms to minimize.
[2024-06-01 20:50:23] [INFO ] Deduced a trap composed of 51 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:50:23] [INFO ] Deduced a trap composed of 35 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:50:24] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 4 ms to minimize.
[2024-06-01 20:50:24] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:50:24] [INFO ] Deduced a trap composed of 30 places in 284 ms of which 3 ms to minimize.
[2024-06-01 20:50:24] [INFO ] Deduced a trap composed of 47 places in 235 ms of which 3 ms to minimize.
[2024-06-01 20:50:25] [INFO ] Deduced a trap composed of 59 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:50:25] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:50:25] [INFO ] Deduced a trap composed of 70 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:50:25] [INFO ] Deduced a trap composed of 18 places in 289 ms of which 3 ms to minimize.
[2024-06-01 20:50:26] [INFO ] Deduced a trap composed of 30 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:50:26] [INFO ] Deduced a trap composed of 50 places in 236 ms of which 3 ms to minimize.
[2024-06-01 20:50:26] [INFO ] Deduced a trap composed of 51 places in 231 ms of which 3 ms to minimize.
[2024-06-01 20:50:26] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
[2024-06-01 20:50:27] [INFO ] Deduced a trap composed of 13 places in 339 ms of which 4 ms to minimize.
[2024-06-01 20:50:27] [INFO ] Deduced a trap composed of 10 places in 322 ms of which 3 ms to minimize.
[2024-06-01 20:50:27] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 3 ms to minimize.
[2024-06-01 20:50:27] [INFO ] Deduced a trap composed of 27 places in 233 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:50:28] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 3 ms to minimize.
[2024-06-01 20:50:29] [INFO ] Deduced a trap composed of 10 places in 283 ms of which 3 ms to minimize.
[2024-06-01 20:50:29] [INFO ] Deduced a trap composed of 62 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:50:29] [INFO ] Deduced a trap composed of 37 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:50:29] [INFO ] Deduced a trap composed of 73 places in 206 ms of which 5 ms to minimize.
[2024-06-01 20:50:30] [INFO ] Deduced a trap composed of 43 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:50:30] [INFO ] Deduced a trap composed of 68 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:50:30] [INFO ] Deduced a trap composed of 54 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:50:30] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 2 ms to minimize.
[2024-06-01 20:50:31] [INFO ] Deduced a trap composed of 20 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:50:31] [INFO ] Deduced a trap composed of 76 places in 223 ms of which 4 ms to minimize.
[2024-06-01 20:50:31] [INFO ] Deduced a trap composed of 18 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:50:32] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 2 ms to minimize.
[2024-06-01 20:50:32] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:50:33] [INFO ] Deduced a trap composed of 19 places in 186 ms of which 3 ms to minimize.
[2024-06-01 20:50:33] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:50:33] [INFO ] Deduced a trap composed of 26 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:50:33] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:50:34] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 3 ms to minimize.
[2024-06-01 20:50:34] [INFO ] Deduced a trap composed of 49 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:50:35] [INFO ] Deduced a trap composed of 54 places in 318 ms of which 4 ms to minimize.
[2024-06-01 20:50:36] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:50:36] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 2 ms to minimize.
[2024-06-01 20:50:36] [INFO ] Deduced a trap composed of 69 places in 190 ms of which 2 ms to minimize.
[2024-06-01 20:50:36] [INFO ] Deduced a trap composed of 20 places in 238 ms of which 3 ms to minimize.
[2024-06-01 20:50:37] [INFO ] Deduced a trap composed of 30 places in 267 ms of which 3 ms to minimize.
[2024-06-01 20:50:37] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:50:37] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:50:37] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 4 ms to minimize.
[2024-06-01 20:50:38] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 3 ms to minimize.
[2024-06-01 20:50:38] [INFO ] Deduced a trap composed of 30 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:50:38] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 4 ms to minimize.
[2024-06-01 20:50:38] [INFO ] Deduced a trap composed of 40 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:50:39] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:50:39] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:50:39] [INFO ] Deduced a trap composed of 27 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:50:39] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:50:39] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:50:40] [INFO ] Deduced a trap composed of 40 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:50:40] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:50:41] [INFO ] Deduced a trap composed of 38 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:50:42] [INFO ] Deduced a trap composed of 37 places in 194 ms of which 3 ms to minimize.
[2024-06-01 20:50:42] [INFO ] Deduced a trap composed of 34 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:50:42] [INFO ] Deduced a trap composed of 37 places in 189 ms of which 2 ms to minimize.
[2024-06-01 20:50:42] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:50:42] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:50:44] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-06-01 20:50:44] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-06-01 20:50:44] [INFO ] Deduced a trap composed of 26 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:50:45] [INFO ] Deduced a trap composed of 23 places in 221 ms of which 3 ms to minimize.
[2024-06-01 20:50:45] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 3 ms to minimize.
[2024-06-01 20:50:45] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:50:46] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 4 ms to minimize.
[2024-06-01 20:50:46] [INFO ] Deduced a trap composed of 74 places in 304 ms of which 3 ms to minimize.
[2024-06-01 20:50:46] [INFO ] Deduced a trap composed of 43 places in 261 ms of which 4 ms to minimize.
[2024-06-01 20:50:47] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:50:47] [INFO ] Deduced a trap composed of 13 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:50:47] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:50:48] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 2 ms to minimize.
[2024-06-01 20:50:48] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1297 variables, and 540 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30024 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 120/120 constraints]
After SMT, in 60460ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60472ms
Starting structural reductions in SI_LTL mode, iteration 1 : 400/1323 places, 1107/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 63361 ms. Remains : 400/1323 places, 1107/2030 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 125 ms. (317 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 786280 steps, run timeout after 3001 ms. (steps per millisecond=262 ) properties seen :0 out of 1
Probabilistic random walk after 786280 steps, saw 105069 distinct states, run finished after 3001 ms. (steps per millisecond=262 ) properties seen :0
[2024-06-01 20:50:53] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:50:53] [INFO ] Invariant cache hit.
[2024-06-01 20:50:53] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:50:53] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:50:53] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:50:54] [INFO ] Deduced a trap composed of 37 places in 90 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:50:54] [INFO ] Deduced a trap composed of 19 places in 250 ms of which 4 ms to minimize.
[2024-06-01 20:50:54] [INFO ] Deduced a trap composed of 31 places in 343 ms of which 5 ms to minimize.
[2024-06-01 20:50:55] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 4 ms to minimize.
[2024-06-01 20:50:55] [INFO ] Deduced a trap composed of 64 places in 293 ms of which 3 ms to minimize.
[2024-06-01 20:50:55] [INFO ] Deduced a trap composed of 27 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:50:56] [INFO ] Deduced a trap composed of 52 places in 288 ms of which 3 ms to minimize.
[2024-06-01 20:50:56] [INFO ] Deduced a trap composed of 19 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:50:56] [INFO ] Deduced a trap composed of 21 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:50:57] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 9/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:50:57] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3987 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 4554ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 400/400 places, 1107/1107 transitions.
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 791504 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 1
Probabilistic random walk after 791504 steps, saw 105741 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2024-06-01 20:51:00] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:51:00] [INFO ] Invariant cache hit.
[2024-06-01 20:51:00] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 528 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:51:01] [INFO ] Deduced a trap composed of 13 places in 87 ms of which 1 ms to minimize.
[2024-06-01 20:51:01] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-06-01 20:51:01] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:51:02] [INFO ] Deduced a trap composed of 19 places in 338 ms of which 4 ms to minimize.
[2024-06-01 20:51:02] [INFO ] Deduced a trap composed of 31 places in 326 ms of which 4 ms to minimize.
[2024-06-01 20:51:02] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 3 ms to minimize.
[2024-06-01 20:51:03] [INFO ] Deduced a trap composed of 64 places in 308 ms of which 3 ms to minimize.
[2024-06-01 20:51:03] [INFO ] Deduced a trap composed of 27 places in 312 ms of which 3 ms to minimize.
[2024-06-01 20:51:03] [INFO ] Deduced a trap composed of 52 places in 302 ms of which 4 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 4 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 3 ms to minimize.
[2024-06-01 20:51:04] [INFO ] Deduced a trap composed of 22 places in 256 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 9/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:51:05] [INFO ] Deduced a trap composed of 13 places in 216 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4135 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 4674ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 13 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-06-01 20:51:05] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:51:05] [INFO ] Invariant cache hit.
[2024-06-01 20:51:06] [INFO ] Implicit Places using invariants in 651 ms returned []
[2024-06-01 20:51:06] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:51:06] [INFO ] Invariant cache hit.
[2024-06-01 20:51:06] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:51:08] [INFO ] Implicit Places using invariants and state equation in 2180 ms returned []
Implicit Place search using SMT with State Equation took 2836 ms to find 0 implicit places.
[2024-06-01 20:51:08] [INFO ] Redundant transitions in 13 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 20:51:08] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:51:08] [INFO ] Invariant cache hit.
[2024-06-01 20:51:08] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 46 places in 375 ms of which 5 ms to minimize.
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 29 places in 407 ms of which 4 ms to minimize.
[2024-06-01 20:51:19] [INFO ] Deduced a trap composed of 51 places in 324 ms of which 4 ms to minimize.
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 19 places in 318 ms of which 4 ms to minimize.
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 12 places in 312 ms of which 4 ms to minimize.
[2024-06-01 20:51:20] [INFO ] Deduced a trap composed of 11 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 13 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:51:21] [INFO ] Deduced a trap composed of 55 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:51:22] [INFO ] Deduced a trap composed of 11 places in 320 ms of which 3 ms to minimize.
[2024-06-01 20:51:22] [INFO ] Deduced a trap composed of 21 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:51:22] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 4 ms to minimize.
[2024-06-01 20:51:22] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:51:23] [INFO ] Deduced a trap composed of 27 places in 281 ms of which 3 ms to minimize.
[2024-06-01 20:51:23] [INFO ] Deduced a trap composed of 29 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:51:23] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:51:24] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:51:24] [INFO ] Deduced a trap composed of 22 places in 271 ms of which 4 ms to minimize.
[2024-06-01 20:51:24] [INFO ] Deduced a trap composed of 21 places in 265 ms of which 3 ms to minimize.
[2024-06-01 20:51:24] [INFO ] Deduced a trap composed of 51 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:51:25] [INFO ] Deduced a trap composed of 62 places in 431 ms of which 4 ms to minimize.
[2024-06-01 20:51:26] [INFO ] Deduced a trap composed of 60 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:51:26] [INFO ] Deduced a trap composed of 14 places in 300 ms of which 4 ms to minimize.
[2024-06-01 20:51:26] [INFO ] Deduced a trap composed of 11 places in 297 ms of which 4 ms to minimize.
[2024-06-01 20:51:27] [INFO ] Deduced a trap composed of 21 places in 308 ms of which 4 ms to minimize.
[2024-06-01 20:51:27] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 3 ms to minimize.
[2024-06-01 20:51:27] [INFO ] Deduced a trap composed of 36 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:51:27] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 4 ms to minimize.
[2024-06-01 20:51:28] [INFO ] Deduced a trap composed of 52 places in 261 ms of which 3 ms to minimize.
[2024-06-01 20:51:28] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 3 ms to minimize.
[2024-06-01 20:51:28] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 4 ms to minimize.
[2024-06-01 20:51:29] [INFO ] Deduced a trap composed of 51 places in 267 ms of which 3 ms to minimize.
[2024-06-01 20:51:29] [INFO ] Deduced a trap composed of 19 places in 255 ms of which 3 ms to minimize.
[2024-06-01 20:51:29] [INFO ] Deduced a trap composed of 29 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:51:29] [INFO ] Deduced a trap composed of 30 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 36 places in 249 ms of which 4 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 3 ms to minimize.
[2024-06-01 20:51:30] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:51:31] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 460 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30021 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:51:41] [INFO ] Deduced a trap composed of 26 places in 364 ms of which 3 ms to minimize.
[2024-06-01 20:51:41] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 5 ms to minimize.
[2024-06-01 20:51:42] [INFO ] Deduced a trap composed of 51 places in 435 ms of which 5 ms to minimize.
[2024-06-01 20:51:42] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 3 ms to minimize.
[2024-06-01 20:51:42] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 3 ms to minimize.
[2024-06-01 20:51:43] [INFO ] Deduced a trap composed of 19 places in 302 ms of which 3 ms to minimize.
[2024-06-01 20:51:43] [INFO ] Deduced a trap composed of 30 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:51:43] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 3 ms to minimize.
[2024-06-01 20:51:44] [INFO ] Deduced a trap composed of 59 places in 188 ms of which 2 ms to minimize.
[2024-06-01 20:51:44] [INFO ] Deduced a trap composed of 43 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:51:44] [INFO ] Deduced a trap composed of 70 places in 180 ms of which 2 ms to minimize.
[2024-06-01 20:51:44] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:51:44] [INFO ] Deduced a trap composed of 30 places in 259 ms of which 3 ms to minimize.
[2024-06-01 20:51:45] [INFO ] Deduced a trap composed of 50 places in 223 ms of which 4 ms to minimize.
[2024-06-01 20:51:45] [INFO ] Deduced a trap composed of 51 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:51:45] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 1 ms to minimize.
[2024-06-01 20:51:45] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 4 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 10 places in 336 ms of which 4 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 35 places in 232 ms of which 3 ms to minimize.
[2024-06-01 20:51:46] [INFO ] Deduced a trap composed of 27 places in 223 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:51:47] [INFO ] Deduced a trap composed of 10 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:51:48] [INFO ] Deduced a trap composed of 10 places in 279 ms of which 3 ms to minimize.
[2024-06-01 20:51:48] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:51:48] [INFO ] Deduced a trap composed of 37 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:51:48] [INFO ] Deduced a trap composed of 73 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:51:49] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:51:49] [INFO ] Deduced a trap composed of 68 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:51:49] [INFO ] Deduced a trap composed of 54 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:51:49] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:51:50] [INFO ] Deduced a trap composed of 20 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:51:50] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 4 ms to minimize.
[2024-06-01 20:51:50] [INFO ] Deduced a trap composed of 18 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:51:51] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 2 ms to minimize.
[2024-06-01 20:51:51] [INFO ] Deduced a trap composed of 11 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:51:52] [INFO ] Deduced a trap composed of 19 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:51:52] [INFO ] Deduced a trap composed of 31 places in 173 ms of which 3 ms to minimize.
[2024-06-01 20:51:52] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 2 ms to minimize.
[2024-06-01 20:51:52] [INFO ] Deduced a trap composed of 10 places in 185 ms of which 2 ms to minimize.
[2024-06-01 20:51:53] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-06-01 20:51:53] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:51:54] [INFO ] Deduced a trap composed of 54 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:51:54] [INFO ] Deduced a trap composed of 72 places in 206 ms of which 3 ms to minimize.
[2024-06-01 20:51:55] [INFO ] Deduced a trap composed of 37 places in 200 ms of which 2 ms to minimize.
[2024-06-01 20:51:55] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 3 ms to minimize.
[2024-06-01 20:51:55] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 4 ms to minimize.
[2024-06-01 20:51:55] [INFO ] Deduced a trap composed of 30 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:51:56] [INFO ] Deduced a trap composed of 30 places in 243 ms of which 4 ms to minimize.
[2024-06-01 20:51:56] [INFO ] Deduced a trap composed of 22 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:51:56] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:51:56] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 3 ms to minimize.
[2024-06-01 20:51:57] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 3 ms to minimize.
[2024-06-01 20:51:57] [INFO ] Deduced a trap composed of 18 places in 263 ms of which 4 ms to minimize.
[2024-06-01 20:51:57] [INFO ] Deduced a trap composed of 40 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:51:57] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:51:58] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:51:58] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2024-06-01 20:51:58] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:51:58] [INFO ] Deduced a trap composed of 18 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:51:59] [INFO ] Deduced a trap composed of 40 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:51:59] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:52:00] [INFO ] Deduced a trap composed of 38 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:52:00] [INFO ] Deduced a trap composed of 37 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:52:00] [INFO ] Deduced a trap composed of 34 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:52:01] [INFO ] Deduced a trap composed of 37 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:52:01] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 20:52:01] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
[2024-06-01 20:52:03] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 3 ms to minimize.
[2024-06-01 20:52:03] [INFO ] Deduced a trap composed of 34 places in 147 ms of which 2 ms to minimize.
[2024-06-01 20:52:03] [INFO ] Deduced a trap composed of 26 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:52:04] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:52:04] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:52:04] [INFO ] Deduced a trap composed of 11 places in 256 ms of which 3 ms to minimize.
[2024-06-01 20:52:04] [INFO ] Deduced a trap composed of 33 places in 276 ms of which 3 ms to minimize.
[2024-06-01 20:52:05] [INFO ] Deduced a trap composed of 74 places in 265 ms of which 3 ms to minimize.
[2024-06-01 20:52:05] [INFO ] Deduced a trap composed of 43 places in 252 ms of which 3 ms to minimize.
[2024-06-01 20:52:06] [INFO ] Deduced a trap composed of 22 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:52:06] [INFO ] Deduced a trap composed of 13 places in 191 ms of which 3 ms to minimize.
[2024-06-01 20:52:06] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 3 ms to minimize.
[2024-06-01 20:52:06] [INFO ] Deduced a trap composed of 15 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:52:06] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1297 variables, and 540 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30023 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 120/120 constraints]
After SMT, in 60426ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60438ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63310 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 1 ms
Free SCC test removed 249 places
Drop transitions (Empty/Sink Transition effects.) removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 24 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-06-01 20:52:08] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 20:52:08] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:52:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2024-06-01 20:52:08] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:52:08] [INFO ] After 32ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 20:52:08] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 117 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 239 ms.
Product exploration explored 100000 steps with 0 reset in 288 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 13 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-06-01 20:52:09] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-06-01 20:52:09] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 20:52:10] [INFO ] Implicit Places using invariants in 626 ms returned []
[2024-06-01 20:52:10] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:52:10] [INFO ] Invariant cache hit.
[2024-06-01 20:52:10] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:52:12] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2564 ms to find 0 implicit places.
[2024-06-01 20:52:12] [INFO ] Redundant transitions in 13 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 20:52:12] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:52:12] [INFO ] Invariant cache hit.
[2024-06-01 20:52:12] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:52:22] [INFO ] Deduced a trap composed of 46 places in 308 ms of which 4 ms to minimize.
[2024-06-01 20:52:23] [INFO ] Deduced a trap composed of 29 places in 311 ms of which 3 ms to minimize.
[2024-06-01 20:52:23] [INFO ] Deduced a trap composed of 51 places in 313 ms of which 3 ms to minimize.
[2024-06-01 20:52:23] [INFO ] Deduced a trap composed of 19 places in 326 ms of which 4 ms to minimize.
[2024-06-01 20:52:23] [INFO ] Deduced a trap composed of 12 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:52:24] [INFO ] Deduced a trap composed of 11 places in 318 ms of which 4 ms to minimize.
[2024-06-01 20:52:24] [INFO ] Deduced a trap composed of 13 places in 299 ms of which 4 ms to minimize.
[2024-06-01 20:52:24] [INFO ] Deduced a trap composed of 10 places in 298 ms of which 3 ms to minimize.
[2024-06-01 20:52:25] [INFO ] Deduced a trap composed of 55 places in 314 ms of which 4 ms to minimize.
[2024-06-01 20:52:25] [INFO ] Deduced a trap composed of 11 places in 323 ms of which 4 ms to minimize.
[2024-06-01 20:52:25] [INFO ] Deduced a trap composed of 21 places in 325 ms of which 5 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 29 places in 421 ms of which 4 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 29 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:52:26] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 3 ms to minimize.
[2024-06-01 20:52:27] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 3 ms to minimize.
[2024-06-01 20:52:27] [INFO ] Deduced a trap composed of 56 places in 264 ms of which 4 ms to minimize.
[2024-06-01 20:52:27] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2024-06-01 20:52:27] [INFO ] Deduced a trap composed of 22 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:52:28] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:52:28] [INFO ] Deduced a trap composed of 51 places in 255 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:52:29] [INFO ] Deduced a trap composed of 62 places in 312 ms of which 4 ms to minimize.
[2024-06-01 20:52:29] [INFO ] Deduced a trap composed of 60 places in 315 ms of which 4 ms to minimize.
[2024-06-01 20:52:29] [INFO ] Deduced a trap composed of 14 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:52:30] [INFO ] Deduced a trap composed of 11 places in 283 ms of which 3 ms to minimize.
[2024-06-01 20:52:30] [INFO ] Deduced a trap composed of 21 places in 297 ms of which 4 ms to minimize.
[2024-06-01 20:52:30] [INFO ] Deduced a trap composed of 12 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:52:31] [INFO ] Deduced a trap composed of 36 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:52:31] [INFO ] Deduced a trap composed of 22 places in 286 ms of which 4 ms to minimize.
[2024-06-01 20:52:31] [INFO ] Deduced a trap composed of 52 places in 270 ms of which 3 ms to minimize.
[2024-06-01 20:52:31] [INFO ] Deduced a trap composed of 27 places in 250 ms of which 3 ms to minimize.
[2024-06-01 20:52:32] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 3 ms to minimize.
[2024-06-01 20:52:32] [INFO ] Deduced a trap composed of 51 places in 266 ms of which 3 ms to minimize.
[2024-06-01 20:52:32] [INFO ] Deduced a trap composed of 19 places in 280 ms of which 3 ms to minimize.
[2024-06-01 20:52:33] [INFO ] Deduced a trap composed of 29 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:52:33] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 2 ms to minimize.
[2024-06-01 20:52:33] [INFO ] Deduced a trap composed of 40 places in 277 ms of which 3 ms to minimize.
[2024-06-01 20:52:33] [INFO ] Deduced a trap composed of 36 places in 235 ms of which 3 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 19 places in 251 ms of which 3 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 23 places in 246 ms of which 3 ms to minimize.
[2024-06-01 20:52:34] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 460 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30022 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:52:45] [INFO ] Deduced a trap composed of 26 places in 404 ms of which 4 ms to minimize.
[2024-06-01 20:52:45] [INFO ] Deduced a trap composed of 10 places in 322 ms of which 3 ms to minimize.
[2024-06-01 20:52:46] [INFO ] Deduced a trap composed of 51 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:52:46] [INFO ] Deduced a trap composed of 35 places in 282 ms of which 4 ms to minimize.
[2024-06-01 20:52:46] [INFO ] Deduced a trap composed of 19 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:52:47] [INFO ] Deduced a trap composed of 19 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:52:47] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 3 ms to minimize.
[2024-06-01 20:52:47] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:52:47] [INFO ] Deduced a trap composed of 59 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:52:47] [INFO ] Deduced a trap composed of 43 places in 184 ms of which 2 ms to minimize.
[2024-06-01 20:52:48] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 2 ms to minimize.
[2024-06-01 20:52:48] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 3 ms to minimize.
[2024-06-01 20:52:48] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 3 ms to minimize.
[2024-06-01 20:52:48] [INFO ] Deduced a trap composed of 50 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:52:49] [INFO ] Deduced a trap composed of 51 places in 237 ms of which 3 ms to minimize.
[2024-06-01 20:52:49] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 2 ms to minimize.
[2024-06-01 20:52:49] [INFO ] Deduced a trap composed of 13 places in 320 ms of which 4 ms to minimize.
[2024-06-01 20:52:49] [INFO ] Deduced a trap composed of 10 places in 313 ms of which 4 ms to minimize.
[2024-06-01 20:52:50] [INFO ] Deduced a trap composed of 35 places in 237 ms of which 5 ms to minimize.
[2024-06-01 20:52:50] [INFO ] Deduced a trap composed of 27 places in 261 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:52:51] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:52:51] [INFO ] Deduced a trap composed of 10 places in 288 ms of which 3 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 3 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 37 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:52:52] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 68 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 3 ms to minimize.
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 3 ms to minimize.
[2024-06-01 20:52:53] [INFO ] Deduced a trap composed of 20 places in 217 ms of which 2 ms to minimize.
[2024-06-01 20:52:54] [INFO ] Deduced a trap composed of 76 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:52:54] [INFO ] Deduced a trap composed of 18 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:52:55] [INFO ] Deduced a trap composed of 28 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:52:55] [INFO ] Deduced a trap composed of 11 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:52:55] [INFO ] Deduced a trap composed of 19 places in 232 ms of which 3 ms to minimize.
[2024-06-01 20:52:56] [INFO ] Deduced a trap composed of 31 places in 164 ms of which 2 ms to minimize.
[2024-06-01 20:52:56] [INFO ] Deduced a trap composed of 26 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:52:56] [INFO ] Deduced a trap composed of 10 places in 193 ms of which 2 ms to minimize.
[2024-06-01 20:52:57] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 3 ms to minimize.
[2024-06-01 20:52:57] [INFO ] Deduced a trap composed of 49 places in 171 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:52:58] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 3 ms to minimize.
[2024-06-01 20:52:58] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:52:58] [INFO ] Deduced a trap composed of 37 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:52:59] [INFO ] Deduced a trap composed of 69 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:52:59] [INFO ] Deduced a trap composed of 20 places in 251 ms of which 3 ms to minimize.
[2024-06-01 20:52:59] [INFO ] Deduced a trap composed of 30 places in 256 ms of which 3 ms to minimize.
[2024-06-01 20:52:59] [INFO ] Deduced a trap composed of 30 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:53:00] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 3 ms to minimize.
[2024-06-01 20:53:00] [INFO ] Deduced a trap composed of 21 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:53:00] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 3 ms to minimize.
[2024-06-01 20:53:01] [INFO ] Deduced a trap composed of 30 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:53:01] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 3 ms to minimize.
[2024-06-01 20:53:01] [INFO ] Deduced a trap composed of 40 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:53:01] [INFO ] Deduced a trap composed of 24 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:53:01] [INFO ] Deduced a trap composed of 50 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:53:02] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:53:02] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:53:02] [INFO ] Deduced a trap composed of 18 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:53:02] [INFO ] Deduced a trap composed of 40 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:53:03] [INFO ] Deduced a trap composed of 31 places in 202 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:53:04] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 2 ms to minimize.
[2024-06-01 20:53:04] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:53:04] [INFO ] Deduced a trap composed of 34 places in 216 ms of which 3 ms to minimize.
[2024-06-01 20:53:05] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:53:05] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2024-06-01 20:53:05] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 3 ms to minimize.
[2024-06-01 20:53:07] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-06-01 20:53:07] [INFO ] Deduced a trap composed of 34 places in 135 ms of which 2 ms to minimize.
[2024-06-01 20:53:07] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 3 ms to minimize.
[2024-06-01 20:53:07] [INFO ] Deduced a trap composed of 23 places in 197 ms of which 3 ms to minimize.
[2024-06-01 20:53:08] [INFO ] Deduced a trap composed of 22 places in 281 ms of which 3 ms to minimize.
[2024-06-01 20:53:08] [INFO ] Deduced a trap composed of 11 places in 269 ms of which 4 ms to minimize.
[2024-06-01 20:53:08] [INFO ] Deduced a trap composed of 33 places in 260 ms of which 3 ms to minimize.
[2024-06-01 20:53:09] [INFO ] Deduced a trap composed of 74 places in 290 ms of which 3 ms to minimize.
[2024-06-01 20:53:09] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 4 ms to minimize.
[2024-06-01 20:53:10] [INFO ] Deduced a trap composed of 22 places in 171 ms of which 3 ms to minimize.
[2024-06-01 20:53:10] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:53:10] [INFO ] Deduced a trap composed of 23 places in 198 ms of which 3 ms to minimize.
[2024-06-01 20:53:10] [INFO ] Deduced a trap composed of 15 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:53:10] [INFO ] Deduced a trap composed of 15 places in 197 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:53:12] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 3 ms to minimize.
SMT process timed out in 60549ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60561ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63161 ms. Remains : 400/400 places, 1107/1107 transitions.
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 290375 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))))'
Support contains 1 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 41 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2024-06-01 20:53:12] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2024-06-01 20:53:12] [INFO ] Computed 27 invariants in 5 ms
[2024-06-01 20:53:13] [INFO ] Implicit Places using invariants in 1017 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 1018 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1104 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-15
Product exploration explored 100000 steps with 0 reset in 508 ms.
Stack based approach found an accepted trace after 362 steps with 0 reset with depth 363 and stack size 363 in 2 ms.
FORMULA Peterson-PT-6-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-15 finished in 1771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(F(p1))))))'
Found a Shortening insensitive property : Peterson-PT-6-LTLFireability-01
Stuttering acceptance computed with spot in 176 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Support contains 266 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 335 rules applied. Total rules applied 335 place count 1330 transition count 1695
Reduce places removed 335 places and 0 transitions.
Iterating post reduction 1 with 335 rules applied. Total rules applied 670 place count 995 transition count 1695
Performed 288 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 288 Pre rules applied. Total rules applied 670 place count 995 transition count 1407
Deduced a syphon composed of 288 places in 0 ms
Reduce places removed 288 places and 0 transitions.
Iterating global reduction 2 with 576 rules applied. Total rules applied 1246 place count 707 transition count 1407
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 1316 place count 672 transition count 1372
Applied a total of 1316 rules in 62 ms. Remains 672 /1330 variables (removed 658) and now considering 1372/2030 (removed 658) transitions.
[2024-06-01 20:53:14] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 672 cols
[2024-06-01 20:53:14] [INFO ] Computed 27 invariants in 3 ms
[2024-06-01 20:53:15] [INFO ] Implicit Places using invariants in 440 ms returned [646, 647, 649, 657, 658, 659, 660]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 441 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 665/1330 places, 1372/2030 transitions.
Applied a total of 0 rules in 15 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 518 ms. Remains : 665/1330 places, 1372/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-01
Product exploration explored 100000 steps with 25000 reset in 736 ms.
Product exploration explored 100000 steps with 25000 reset in 748 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 698 steps (0 resets) in 8 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 665 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Applied a total of 0 rules in 5 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-06-01 20:53:17] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 665 cols
[2024-06-01 20:53:17] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 20:53:17] [INFO ] Implicit Places using invariants in 398 ms returned []
[2024-06-01 20:53:17] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-06-01 20:53:17] [INFO ] Invariant cache hit.
[2024-06-01 20:53:18] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:53:19] [INFO ] Implicit Places using invariants and state equation in 1397 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
Running 1365 sub problems to find dead transitions.
[2024-06-01 20:53:19] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-06-01 20:53:19] [INFO ] Invariant cache hit.
[2024-06-01 20:53:19] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 665/665 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-06-01 20:53:38] [INFO ] Deduced a trap composed of 11 places in 550 ms of which 6 ms to minimize.
[2024-06-01 20:53:39] [INFO ] Deduced a trap composed of 31 places in 541 ms of which 6 ms to minimize.
[2024-06-01 20:53:39] [INFO ] Deduced a trap composed of 25 places in 528 ms of which 5 ms to minimize.
[2024-06-01 20:53:40] [INFO ] Deduced a trap composed of 25 places in 526 ms of which 5 ms to minimize.
[2024-06-01 20:53:40] [INFO ] Deduced a trap composed of 102 places in 513 ms of which 5 ms to minimize.
[2024-06-01 20:53:41] [INFO ] Deduced a trap composed of 150 places in 441 ms of which 4 ms to minimize.
[2024-06-01 20:53:41] [INFO ] Deduced a trap composed of 89 places in 599 ms of which 8 ms to minimize.
[2024-06-01 20:53:42] [INFO ] Deduced a trap composed of 49 places in 377 ms of which 5 ms to minimize.
[2024-06-01 20:53:42] [INFO ] Deduced a trap composed of 43 places in 458 ms of which 6 ms to minimize.
[2024-06-01 20:53:43] [INFO ] Deduced a trap composed of 37 places in 406 ms of which 4 ms to minimize.
[2024-06-01 20:53:43] [INFO ] Deduced a trap composed of 61 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:53:43] [INFO ] Deduced a trap composed of 55 places in 403 ms of which 5 ms to minimize.
[2024-06-01 20:53:44] [INFO ] Deduced a trap composed of 57 places in 301 ms of which 3 ms to minimize.
[2024-06-01 20:53:44] [INFO ] Deduced a trap composed of 61 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:53:44] [INFO ] Deduced a trap composed of 55 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:53:44] [INFO ] Deduced a trap composed of 57 places in 277 ms of which 3 ms to minimize.
[2024-06-01 20:53:45] [INFO ] Deduced a trap composed of 57 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:53:45] [INFO ] Deduced a trap composed of 11 places in 370 ms of which 4 ms to minimize.
[2024-06-01 20:53:46] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 4 ms to minimize.
[2024-06-01 20:53:46] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/665 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-06-01 20:53:47] [INFO ] Deduced a trap composed of 17 places in 564 ms of which 7 ms to minimize.
[2024-06-01 20:53:48] [INFO ] Deduced a trap composed of 25 places in 555 ms of which 6 ms to minimize.
[2024-06-01 20:53:48] [INFO ] Deduced a trap composed of 27 places in 567 ms of which 6 ms to minimize.
[2024-06-01 20:53:49] [INFO ] Deduced a trap composed of 21 places in 569 ms of which 7 ms to minimize.
[2024-06-01 20:53:50] [INFO ] Deduced a trap composed of 31 places in 557 ms of which 6 ms to minimize.
SMT process timed out in 30745ms, After SMT, problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 30759ms
Finished structural reductions in LTL mode , in 1 iterations and 32567 ms. Remains : 665/665 places, 1372/1372 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 : [p1]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 707 steps (0 resets) in 6 ms. (101 steps per ms) remains 0/1 properties
Knowledge obtained : [p1]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 1 factoid took 90 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 351 ms.
Product exploration explored 100000 steps with 25000 reset in 372 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 7 out of 665 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 252 Pre rules applied. Total rules applied 0 place count 665 transition count 1624
Deduced a syphon composed of 252 places in 1 ms
Iterating global reduction 0 with 252 rules applied. Total rules applied 252 place count 665 transition count 1624
Deduced a syphon composed of 252 places in 0 ms
Applied a total of 252 rules in 49 ms. Remains 665 /665 variables (removed 0) and now considering 1624/1372 (removed -252) transitions.
[2024-06-01 20:53:51] [INFO ] Redundant transitions in 35 ms returned []
Running 1617 sub problems to find dead transitions.
[2024-06-01 20:53:51] [INFO ] Flow matrix only has 1414 transitions (discarded 210 similar events)
// Phase 1: matrix 1414 rows 665 cols
[2024-06-01 20:53:51] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 20:53:51] [INFO ] State equation strengthened by 582 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 665/665 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
[2024-06-01 20:54:15] [INFO ] Deduced a trap composed of 10 places in 615 ms of which 6 ms to minimize.
[2024-06-01 20:54:16] [INFO ] Deduced a trap composed of 10 places in 719 ms of which 6 ms to minimize.
[2024-06-01 20:54:16] [INFO ] Deduced a trap composed of 18 places in 552 ms of which 5 ms to minimize.
[2024-06-01 20:54:17] [INFO ] Deduced a trap composed of 27 places in 485 ms of which 5 ms to minimize.
[2024-06-01 20:54:17] [INFO ] Deduced a trap composed of 41 places in 411 ms of which 5 ms to minimize.
[2024-06-01 20:54:18] [INFO ] Deduced a trap composed of 28 places in 454 ms of which 5 ms to minimize.
[2024-06-01 20:54:18] [INFO ] Deduced a trap composed of 54 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:54:18] [INFO ] Deduced a trap composed of 38 places in 293 ms of which 4 ms to minimize.
[2024-06-01 20:54:18] [INFO ] Deduced a trap composed of 55 places in 283 ms of which 4 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 54 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 50 places in 233 ms of which 4 ms to minimize.
[2024-06-01 20:54:19] [INFO ] Deduced a trap composed of 64 places in 293 ms of which 4 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 54 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 85 places in 276 ms of which 4 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 38 places in 280 ms of which 3 ms to minimize.
[2024-06-01 20:54:20] [INFO ] Deduced a trap composed of 46 places in 280 ms of which 4 ms to minimize.
[2024-06-01 20:54:21] [INFO ] Deduced a trap composed of 38 places in 283 ms of which 4 ms to minimize.
[2024-06-01 20:54:21] [INFO ] Deduced a trap composed of 38 places in 294 ms of which 4 ms to minimize.
[2024-06-01 20:54:21] [INFO ] Deduced a trap composed of 75 places in 266 ms of which 4 ms to minimize.
[2024-06-01 20:54:22] [INFO ] Deduced a trap composed of 54 places in 361 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/665 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 665/2079 variables, and 705 constraints, problems are : Problem set: 0 solved, 1617 unsolved in 30028 ms.
Refiners :[Domain max(s): 665/665 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/665 constraints, ReadFeed: 0/582 constraints, PredecessorRefiner: 1617/1617 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1617 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 665/665 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/665 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
[2024-06-01 20:54:27] [INFO ] Deduced a trap composed of 28 places in 715 ms of which 6 ms to minimize.
[2024-06-01 20:54:27] [INFO ] Deduced a trap composed of 11 places in 587 ms of which 6 ms to minimize.
[2024-06-01 20:54:28] [INFO ] Deduced a trap composed of 11 places in 572 ms of which 6 ms to minimize.
[2024-06-01 20:54:28] [INFO ] Deduced a trap composed of 11 places in 562 ms of which 6 ms to minimize.
[2024-06-01 20:54:29] [INFO ] Deduced a trap composed of 11 places in 728 ms of which 7 ms to minimize.
[2024-06-01 20:54:30] [INFO ] Deduced a trap composed of 57 places in 606 ms of which 6 ms to minimize.
[2024-06-01 20:54:30] [INFO ] Deduced a trap composed of 21 places in 577 ms of which 7 ms to minimize.
[2024-06-01 20:54:31] [INFO ] Deduced a trap composed of 57 places in 602 ms of which 9 ms to minimize.
[2024-06-01 20:54:32] [INFO ] Deduced a trap composed of 27 places in 621 ms of which 5 ms to minimize.
[2024-06-01 20:54:32] [INFO ] Deduced a trap composed of 30 places in 453 ms of which 5 ms to minimize.
[2024-06-01 20:54:32] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 5 ms to minimize.
[2024-06-01 20:54:33] [INFO ] Deduced a trap composed of 21 places in 492 ms of which 5 ms to minimize.
[2024-06-01 20:54:33] [INFO ] Deduced a trap composed of 19 places in 498 ms of which 6 ms to minimize.
[2024-06-01 20:54:34] [INFO ] Deduced a trap composed of 54 places in 504 ms of which 5 ms to minimize.
[2024-06-01 20:54:34] [INFO ] Deduced a trap composed of 19 places in 467 ms of which 5 ms to minimize.
[2024-06-01 20:54:35] [INFO ] Deduced a trap composed of 19 places in 438 ms of which 5 ms to minimize.
[2024-06-01 20:54:35] [INFO ] Deduced a trap composed of 21 places in 460 ms of which 5 ms to minimize.
[2024-06-01 20:54:36] [INFO ] Deduced a trap composed of 21 places in 493 ms of which 8 ms to minimize.
[2024-06-01 20:54:36] [INFO ] Deduced a trap composed of 37 places in 495 ms of which 5 ms to minimize.
[2024-06-01 20:54:37] [INFO ] Deduced a trap composed of 24 places in 536 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/665 variables, 20/725 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 34 places in 542 ms of which 6 ms to minimize.
[2024-06-01 20:54:39] [INFO ] Deduced a trap composed of 10 places in 590 ms of which 8 ms to minimize.
[2024-06-01 20:54:40] [INFO ] Deduced a trap composed of 43 places in 603 ms of which 6 ms to minimize.
[2024-06-01 20:54:40] [INFO ] Deduced a trap composed of 45 places in 488 ms of which 5 ms to minimize.
[2024-06-01 20:54:41] [INFO ] Deduced a trap composed of 62 places in 532 ms of which 8 ms to minimize.
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 54 places in 515 ms of which 5 ms to minimize.
[2024-06-01 20:54:42] [INFO ] Deduced a trap composed of 26 places in 466 ms of which 5 ms to minimize.
[2024-06-01 20:54:43] [INFO ] Deduced a trap composed of 26 places in 459 ms of which 5 ms to minimize.
[2024-06-01 20:54:43] [INFO ] Deduced a trap composed of 36 places in 480 ms of which 6 ms to minimize.
[2024-06-01 20:54:44] [INFO ] Deduced a trap composed of 18 places in 530 ms of which 6 ms to minimize.
[2024-06-01 20:54:44] [INFO ] Deduced a trap composed of 46 places in 321 ms of which 4 ms to minimize.
[2024-06-01 20:54:44] [INFO ] Deduced a trap composed of 54 places in 322 ms of which 4 ms to minimize.
[2024-06-01 20:54:45] [INFO ] Deduced a trap composed of 44 places in 264 ms of which 4 ms to minimize.
[2024-06-01 20:54:45] [INFO ] Deduced a trap composed of 71 places in 319 ms of which 5 ms to minimize.
[2024-06-01 20:54:45] [INFO ] Deduced a trap composed of 71 places in 322 ms of which 4 ms to minimize.
[2024-06-01 20:54:46] [INFO ] Deduced a trap composed of 66 places in 339 ms of which 4 ms to minimize.
[2024-06-01 20:54:46] [INFO ] Deduced a trap composed of 18 places in 528 ms of which 6 ms to minimize.
[2024-06-01 20:54:47] [INFO ] Deduced a trap composed of 28 places in 470 ms of which 5 ms to minimize.
[2024-06-01 20:54:47] [INFO ] Deduced a trap composed of 62 places in 496 ms of which 6 ms to minimize.
[2024-06-01 20:54:48] [INFO ] Deduced a trap composed of 46 places in 496 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/665 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 1617 unsolved
[2024-06-01 20:54:49] [INFO ] Deduced a trap composed of 87 places in 525 ms of which 6 ms to minimize.
[2024-06-01 20:54:50] [INFO ] Deduced a trap composed of 35 places in 509 ms of which 6 ms to minimize.
[2024-06-01 20:54:50] [INFO ] Deduced a trap composed of 13 places in 436 ms of which 6 ms to minimize.
[2024-06-01 20:54:51] [INFO ] Deduced a trap composed of 12 places in 503 ms of which 6 ms to minimize.
[2024-06-01 20:54:51] [INFO ] Deduced a trap composed of 27 places in 483 ms of which 8 ms to minimize.
[2024-06-01 20:54:52] [INFO ] Deduced a trap composed of 27 places in 571 ms of which 5 ms to minimize.
SMT process timed out in 60734ms, After SMT, problems are : Problem set: 0 solved, 1617 unsolved
Search for dead transitions found 0 dead transitions in 60752ms
Starting structural reductions in SI_LTL mode, iteration 1 : 665/665 places, 1624/1372 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60845 ms. Remains : 665/665 places, 1624/1372 transitions.
Support contains 7 out of 665 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 665/665 places, 1372/1372 transitions.
Applied a total of 0 rules in 9 ms. Remains 665 /665 variables (removed 0) and now considering 1372/1372 (removed 0) transitions.
[2024-06-01 20:54:52] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
// Phase 1: matrix 1162 rows 665 cols
[2024-06-01 20:54:52] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 20:54:53] [INFO ] Implicit Places using invariants in 696 ms returned []
[2024-06-01 20:54:53] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-06-01 20:54:53] [INFO ] Invariant cache hit.
[2024-06-01 20:54:53] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:54:56] [INFO ] Implicit Places using invariants and state equation in 3496 ms returned []
Implicit Place search using SMT with State Equation took 4194 ms to find 0 implicit places.
Running 1365 sub problems to find dead transitions.
[2024-06-01 20:54:56] [INFO ] Flow matrix only has 1162 transitions (discarded 210 similar events)
[2024-06-01 20:54:56] [INFO ] Invariant cache hit.
[2024-06-01 20:54:56] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/665 variables, 665/665 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/665 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-06-01 20:55:16] [INFO ] Deduced a trap composed of 11 places in 684 ms of which 6 ms to minimize.
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 31 places in 512 ms of which 6 ms to minimize.
[2024-06-01 20:55:17] [INFO ] Deduced a trap composed of 25 places in 462 ms of which 5 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 25 places in 491 ms of which 5 ms to minimize.
[2024-06-01 20:55:18] [INFO ] Deduced a trap composed of 102 places in 490 ms of which 5 ms to minimize.
[2024-06-01 20:55:19] [INFO ] Deduced a trap composed of 150 places in 438 ms of which 5 ms to minimize.
[2024-06-01 20:55:19] [INFO ] Deduced a trap composed of 89 places in 402 ms of which 5 ms to minimize.
[2024-06-01 20:55:19] [INFO ] Deduced a trap composed of 49 places in 340 ms of which 4 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 43 places in 371 ms of which 5 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 37 places in 402 ms of which 7 ms to minimize.
[2024-06-01 20:55:20] [INFO ] Deduced a trap composed of 61 places in 355 ms of which 3 ms to minimize.
[2024-06-01 20:55:21] [INFO ] Deduced a trap composed of 55 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:55:21] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 4 ms to minimize.
[2024-06-01 20:55:21] [INFO ] Deduced a trap composed of 61 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:55:22] [INFO ] Deduced a trap composed of 55 places in 267 ms of which 3 ms to minimize.
[2024-06-01 20:55:22] [INFO ] Deduced a trap composed of 57 places in 273 ms of which 3 ms to minimize.
[2024-06-01 20:55:22] [INFO ] Deduced a trap composed of 57 places in 277 ms of which 3 ms to minimize.
[2024-06-01 20:55:23] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 5 ms to minimize.
[2024-06-01 20:55:23] [INFO ] Deduced a trap composed of 13 places in 439 ms of which 7 ms to minimize.
[2024-06-01 20:55:23] [INFO ] Deduced a trap composed of 75 places in 295 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/665 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 1365 unsolved
[2024-06-01 20:55:25] [INFO ] Deduced a trap composed of 17 places in 546 ms of which 7 ms to minimize.
[2024-06-01 20:55:25] [INFO ] Deduced a trap composed of 25 places in 562 ms of which 6 ms to minimize.
[2024-06-01 20:55:26] [INFO ] Deduced a trap composed of 27 places in 683 ms of which 6 ms to minimize.
[2024-06-01 20:55:27] [INFO ] Deduced a trap composed of 21 places in 637 ms of which 10 ms to minimize.
[2024-06-01 20:55:27] [INFO ] Deduced a trap composed of 31 places in 631 ms of which 6 ms to minimize.
SMT process timed out in 30895ms, After SMT, problems are : Problem set: 0 solved, 1365 unsolved
Search for dead transitions found 0 dead transitions in 30910ms
Finished structural reductions in LTL mode , in 1 iterations and 35115 ms. Remains : 665/665 places, 1372/1372 transitions.
Treatment of property Peterson-PT-6-LTLFireability-01 finished in 133229 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(p1)||p0)))))'
Found a Shortening insensitive property : Peterson-PT-6-LTLFireability-06
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 511 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 1330 transition count 1910
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 1210 transition count 1910
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 258 Pre rules applied. Total rules applied 240 place count 1210 transition count 1652
Deduced a syphon composed of 258 places in 0 ms
Reduce places removed 258 places and 0 transitions.
Iterating global reduction 2 with 516 rules applied. Total rules applied 756 place count 952 transition count 1652
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 840 place count 910 transition count 1610
Applied a total of 840 rules in 97 ms. Remains 910 /1330 variables (removed 420) and now considering 1610/2030 (removed 420) transitions.
[2024-06-01 20:55:28] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
// Phase 1: matrix 1400 rows 910 cols
[2024-06-01 20:55:28] [INFO ] Computed 27 invariants in 4 ms
[2024-06-01 20:55:28] [INFO ] Implicit Places using invariants in 493 ms returned [836, 837, 839, 902, 903, 904, 905]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 495 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 903/1330 places, 1610/2030 transitions.
Applied a total of 0 rules in 13 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 609 ms. Remains : 903/1330 places, 1610/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-06
Product exploration explored 100000 steps with 4474 reset in 4527 ms.
Product exploration explored 100000 steps with 4457 reset in 4427 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 65 steps (0 resets) in 13 ms. (4 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 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 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 20:55:38] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
// Phase 1: matrix 1400 rows 903 cols
[2024-06-01 20:55:38] [INFO ] Computed 20 invariants in 3 ms
[2024-06-01 20:55:53] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 6 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-06-01 20:55:53] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 20:55:53] [INFO ] Invariant cache hit.
[2024-06-01 20:55:53] [INFO ] Implicit Places using invariants in 466 ms returned []
[2024-06-01 20:55:53] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 20:55:53] [INFO ] Invariant cache hit.
[2024-06-01 20:55:54] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:55:55] [INFO ] Implicit Places using invariants and state equation in 2020 ms returned []
Implicit Place search using SMT with State Equation took 2487 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2024-06-01 20:55:55] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 20:55:55] [INFO ] Invariant cache hit.
[2024-06-01 20:55:55] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 903/903 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/903 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-06-01 20:56:26] [INFO ] Deduced a trap composed of 21 places in 883 ms of which 12 ms to minimize.
[2024-06-01 20:56:26] [INFO ] Deduced a trap composed of 118 places in 746 ms of which 7 ms to minimize.
SMT process timed out in 30997ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 31014ms
Finished structural reductions in LTL mode , in 1 iterations and 33510 ms. Remains : 903/903 places, 1610/1610 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 129 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 71 steps (0 resets) in 19 ms. (3 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p0) (NOT p1)))), (F p0), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 5 factoid took 184 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2024-06-01 20:56:27] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 20:56:27] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 4445 reset in 6425 ms.
Product exploration explored 100000 steps with 4447 reset in 6453 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 20 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-06-01 20:56:56] [INFO ] Redundant transitions in 29 ms returned []
Running 1603 sub problems to find dead transitions.
[2024-06-01 20:56:56] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 20:56:56] [INFO ] Invariant cache hit.
[2024-06-01 20:56:56] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 903/903 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/903 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-06-01 20:57:26] [INFO ] Deduced a trap composed of 21 places in 907 ms of which 12 ms to minimize.
[2024-06-01 20:57:27] [INFO ] Deduced a trap composed of 118 places in 874 ms of which 8 ms to minimize.
SMT process timed out in 31130ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 31148ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 31207 ms. Remains : 903/903 places, 1610/1610 transitions.
Support contains 511 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1610/1610 transitions.
Applied a total of 0 rules in 7 ms. Remains 903 /903 variables (removed 0) and now considering 1610/1610 (removed 0) transitions.
[2024-06-01 20:57:27] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 20:57:27] [INFO ] Invariant cache hit.
[2024-06-01 20:57:27] [INFO ] Implicit Places using invariants in 449 ms returned []
[2024-06-01 20:57:27] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 20:57:27] [INFO ] Invariant cache hit.
[2024-06-01 20:57:28] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:57:29] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2472 ms to find 0 implicit places.
Running 1603 sub problems to find dead transitions.
[2024-06-01 20:57:29] [INFO ] Flow matrix only has 1400 transitions (discarded 210 similar events)
[2024-06-01 20:57:29] [INFO ] Invariant cache hit.
[2024-06-01 20:57:29] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/903 variables, 903/903 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/903 variables, 20/923 constraints. Problems are: Problem set: 0 solved, 1603 unsolved
[2024-06-01 20:57:59] [INFO ] Deduced a trap composed of 21 places in 763 ms of which 8 ms to minimize.
[2024-06-01 20:58:00] [INFO ] Deduced a trap composed of 118 places in 763 ms of which 8 ms to minimize.
[2024-06-01 20:58:00] [INFO ] Deduced a trap composed of 31 places in 757 ms of which 8 ms to minimize.
SMT process timed out in 31090ms, After SMT, problems are : Problem set: 0 solved, 1603 unsolved
Search for dead transitions found 0 dead transitions in 31107ms
Finished structural reductions in LTL mode , in 1 iterations and 33590 ms. Remains : 903/903 places, 1610/1610 transitions.
Treatment of property Peterson-PT-6-LTLFireability-06 finished in 153304 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)))'
Found a Lengthening insensitive property : Peterson-PT-6-LTLFireability-13
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 587 transitions
Trivial Post-agglo rules discarded 587 transitions
Performed 587 trivial Post agglomeration. Transition count delta: 587
Iterating post reduction 0 with 587 rules applied. Total rules applied 587 place count 1330 transition count 1443
Reduce places removed 587 places and 0 transitions.
Iterating post reduction 1 with 587 rules applied. Total rules applied 1174 place count 743 transition count 1443
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1174 place count 743 transition count 1149
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1762 place count 449 transition count 1149
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1846 place count 407 transition count 1107
Applied a total of 1846 rules in 52 ms. Remains 407 /1330 variables (removed 923) and now considering 1107/2030 (removed 923) transitions.
[2024-06-01 20:58:01] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 407 cols
[2024-06-01 20:58:01] [INFO ] Computed 27 invariants in 2 ms
[2024-06-01 20:58:01] [INFO ] Implicit Places using invariants in 559 ms returned [388, 389, 391, 399, 400, 401, 402]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 560 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 400/1330 places, 1107/2030 transitions.
Applied a total of 0 rules in 11 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 623 ms. Remains : 400/1330 places, 1107/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 243 ms.
Product exploration explored 100000 steps with 0 reset in 281 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 792600 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 792600 steps, saw 105885 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2024-06-01 20:58:05] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-06-01 20:58:05] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 20:58:05] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 532 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:58:06] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 2 ms to minimize.
[2024-06-01 20:58:06] [INFO ] Deduced a trap composed of 37 places in 93 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/399 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/948 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:58:07] [INFO ] Deduced a trap composed of 62 places in 286 ms of which 4 ms to minimize.
[2024-06-01 20:58:07] [INFO ] Deduced a trap composed of 37 places in 319 ms of which 3 ms to minimize.
[2024-06-01 20:58:07] [INFO ] Deduced a trap composed of 21 places in 309 ms of which 4 ms to minimize.
[2024-06-01 20:58:08] [INFO ] Deduced a trap composed of 44 places in 311 ms of which 4 ms to minimize.
[2024-06-01 20:58:08] [INFO ] Deduced a trap composed of 11 places in 337 ms of which 4 ms to minimize.
[2024-06-01 20:58:08] [INFO ] Deduced a trap composed of 12 places in 310 ms of which 4 ms to minimize.
[2024-06-01 20:58:09] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 4 ms to minimize.
[2024-06-01 20:58:09] [INFO ] Deduced a trap composed of 22 places in 287 ms of which 4 ms to minimize.
[2024-06-01 20:58:09] [INFO ] Deduced a trap composed of 88 places in 288 ms of which 4 ms to minimize.
[2024-06-01 20:58:09] [INFO ] Deduced a trap composed of 26 places in 279 ms of which 3 ms to minimize.
[2024-06-01 20:58:10] [INFO ] Deduced a trap composed of 37 places in 277 ms of which 4 ms to minimize.
[2024-06-01 20:58:10] [INFO ] Deduced a trap composed of 14 places in 274 ms of which 4 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 12/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/965 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1297 variables, 0/1165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4626 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 14/14 constraints]
After SMT, in 5183ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 400/400 places, 1107/1107 transitions.
RANDOM walk for 40000 steps (8 resets) in 117 ms. (338 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 791488 steps, run timeout after 3001 ms. (steps per millisecond=263 ) properties seen :0 out of 1
Probabilistic random walk after 791488 steps, saw 105738 distinct states, run finished after 3001 ms. (steps per millisecond=263 ) properties seen :0
[2024-06-01 20:58:13] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:58:13] [INFO ] Invariant cache hit.
[2024-06-01 20:58:13] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 541 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:58:14] [INFO ] Deduced a trap composed of 13 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:58:14] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-01 20:58:14] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:58:15] [INFO ] Deduced a trap composed of 19 places in 339 ms of which 4 ms to minimize.
[2024-06-01 20:58:15] [INFO ] Deduced a trap composed of 31 places in 331 ms of which 4 ms to minimize.
[2024-06-01 20:58:16] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 4 ms to minimize.
[2024-06-01 20:58:16] [INFO ] Deduced a trap composed of 64 places in 297 ms of which 4 ms to minimize.
[2024-06-01 20:58:16] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 3 ms to minimize.
[2024-06-01 20:58:17] [INFO ] Deduced a trap composed of 52 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:58:17] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 4 ms to minimize.
[2024-06-01 20:58:17] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 3 ms to minimize.
[2024-06-01 20:58:17] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 9/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 20:58:18] [INFO ] Deduced a trap composed of 13 places in 205 ms of which 4 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4058 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 4616ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 22 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 17 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-06-01 20:58:18] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:58:18] [INFO ] Invariant cache hit.
[2024-06-01 20:58:19] [INFO ] Implicit Places using invariants in 518 ms returned []
[2024-06-01 20:58:19] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:58:19] [INFO ] Invariant cache hit.
[2024-06-01 20:58:19] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:58:21] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 2624 ms to find 0 implicit places.
[2024-06-01 20:58:21] [INFO ] Redundant transitions in 13 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 20:58:21] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:58:21] [INFO ] Invariant cache hit.
[2024-06-01 20:58:21] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:58:32] [INFO ] Deduced a trap composed of 46 places in 316 ms of which 4 ms to minimize.
[2024-06-01 20:58:32] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 4 ms to minimize.
[2024-06-01 20:58:32] [INFO ] Deduced a trap composed of 51 places in 312 ms of which 3 ms to minimize.
[2024-06-01 20:58:32] [INFO ] Deduced a trap composed of 19 places in 315 ms of which 4 ms to minimize.
[2024-06-01 20:58:33] [INFO ] Deduced a trap composed of 12 places in 300 ms of which 4 ms to minimize.
[2024-06-01 20:58:33] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 4 ms to minimize.
[2024-06-01 20:58:33] [INFO ] Deduced a trap composed of 13 places in 311 ms of which 3 ms to minimize.
[2024-06-01 20:58:34] [INFO ] Deduced a trap composed of 10 places in 310 ms of which 4 ms to minimize.
[2024-06-01 20:58:34] [INFO ] Deduced a trap composed of 55 places in 311 ms of which 3 ms to minimize.
[2024-06-01 20:58:34] [INFO ] Deduced a trap composed of 11 places in 328 ms of which 4 ms to minimize.
[2024-06-01 20:58:35] [INFO ] Deduced a trap composed of 21 places in 272 ms of which 3 ms to minimize.
[2024-06-01 20:58:35] [INFO ] Deduced a trap composed of 29 places in 297 ms of which 3 ms to minimize.
[2024-06-01 20:58:35] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 3 ms to minimize.
[2024-06-01 20:58:36] [INFO ] Deduced a trap composed of 27 places in 291 ms of which 4 ms to minimize.
[2024-06-01 20:58:36] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 4 ms to minimize.
[2024-06-01 20:58:36] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 6 ms to minimize.
[2024-06-01 20:58:36] [INFO ] Deduced a trap composed of 38 places in 188 ms of which 3 ms to minimize.
[2024-06-01 20:58:37] [INFO ] Deduced a trap composed of 22 places in 257 ms of which 4 ms to minimize.
[2024-06-01 20:58:37] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 3 ms to minimize.
[2024-06-01 20:58:37] [INFO ] Deduced a trap composed of 51 places in 253 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 62 places in 316 ms of which 4 ms to minimize.
[2024-06-01 20:58:38] [INFO ] Deduced a trap composed of 60 places in 319 ms of which 3 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 14 places in 298 ms of which 4 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 3 ms to minimize.
[2024-06-01 20:58:39] [INFO ] Deduced a trap composed of 21 places in 296 ms of which 3 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 12 places in 282 ms of which 3 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 36 places in 274 ms of which 4 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 22 places in 289 ms of which 4 ms to minimize.
[2024-06-01 20:58:40] [INFO ] Deduced a trap composed of 52 places in 266 ms of which 3 ms to minimize.
[2024-06-01 20:58:41] [INFO ] Deduced a trap composed of 27 places in 270 ms of which 4 ms to minimize.
[2024-06-01 20:58:41] [INFO ] Deduced a trap composed of 33 places in 256 ms of which 3 ms to minimize.
[2024-06-01 20:58:41] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 4 ms to minimize.
[2024-06-01 20:58:41] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 4 ms to minimize.
[2024-06-01 20:58:42] [INFO ] Deduced a trap composed of 29 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:58:42] [INFO ] Deduced a trap composed of 30 places in 199 ms of which 3 ms to minimize.
[2024-06-01 20:58:42] [INFO ] Deduced a trap composed of 40 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:58:42] [INFO ] Deduced a trap composed of 36 places in 248 ms of which 3 ms to minimize.
[2024-06-01 20:58:43] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 3 ms to minimize.
[2024-06-01 20:58:43] [INFO ] Deduced a trap composed of 23 places in 242 ms of which 3 ms to minimize.
[2024-06-01 20:58:43] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 460 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30022 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:58:53] [INFO ] Deduced a trap composed of 26 places in 327 ms of which 4 ms to minimize.
[2024-06-01 20:58:53] [INFO ] Deduced a trap composed of 10 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:58:54] [INFO ] Deduced a trap composed of 51 places in 311 ms of which 3 ms to minimize.
[2024-06-01 20:58:54] [INFO ] Deduced a trap composed of 35 places in 302 ms of which 3 ms to minimize.
[2024-06-01 20:58:54] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 3 ms to minimize.
[2024-06-01 20:58:55] [INFO ] Deduced a trap composed of 19 places in 279 ms of which 4 ms to minimize.
[2024-06-01 20:58:55] [INFO ] Deduced a trap composed of 30 places in 261 ms of which 3 ms to minimize.
[2024-06-01 20:58:55] [INFO ] Deduced a trap composed of 47 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:58:55] [INFO ] Deduced a trap composed of 59 places in 189 ms of which 3 ms to minimize.
[2024-06-01 20:58:56] [INFO ] Deduced a trap composed of 43 places in 170 ms of which 3 ms to minimize.
[2024-06-01 20:58:56] [INFO ] Deduced a trap composed of 70 places in 176 ms of which 3 ms to minimize.
[2024-06-01 20:58:56] [INFO ] Deduced a trap composed of 18 places in 291 ms of which 3 ms to minimize.
[2024-06-01 20:58:56] [INFO ] Deduced a trap composed of 30 places in 280 ms of which 3 ms to minimize.
[2024-06-01 20:58:57] [INFO ] Deduced a trap composed of 50 places in 227 ms of which 3 ms to minimize.
[2024-06-01 20:58:57] [INFO ] Deduced a trap composed of 51 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:58:57] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2024-06-01 20:58:57] [INFO ] Deduced a trap composed of 13 places in 325 ms of which 3 ms to minimize.
[2024-06-01 20:58:58] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 3 ms to minimize.
[2024-06-01 20:58:58] [INFO ] Deduced a trap composed of 35 places in 230 ms of which 3 ms to minimize.
[2024-06-01 20:58:58] [INFO ] Deduced a trap composed of 27 places in 227 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:58:59] [INFO ] Deduced a trap composed of 10 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:58:59] [INFO ] Deduced a trap composed of 10 places in 284 ms of which 4 ms to minimize.
[2024-06-01 20:59:00] [INFO ] Deduced a trap composed of 62 places in 229 ms of which 3 ms to minimize.
[2024-06-01 20:59:00] [INFO ] Deduced a trap composed of 37 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:59:00] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 2 ms to minimize.
[2024-06-01 20:59:00] [INFO ] Deduced a trap composed of 43 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:59:00] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 3 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 54 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 3 ms to minimize.
[2024-06-01 20:59:01] [INFO ] Deduced a trap composed of 20 places in 228 ms of which 3 ms to minimize.
[2024-06-01 20:59:02] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 3 ms to minimize.
[2024-06-01 20:59:02] [INFO ] Deduced a trap composed of 18 places in 215 ms of which 3 ms to minimize.
[2024-06-01 20:59:03] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 2 ms to minimize.
[2024-06-01 20:59:03] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:59:03] [INFO ] Deduced a trap composed of 19 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:59:03] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 3 ms to minimize.
[2024-06-01 20:59:04] [INFO ] Deduced a trap composed of 26 places in 194 ms of which 2 ms to minimize.
[2024-06-01 20:59:04] [INFO ] Deduced a trap composed of 10 places in 205 ms of which 2 ms to minimize.
[2024-06-01 20:59:04] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
[2024-06-01 20:59:05] [INFO ] Deduced a trap composed of 49 places in 159 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:59:06] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 3 ms to minimize.
[2024-06-01 20:59:06] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 3 ms to minimize.
[2024-06-01 20:59:06] [INFO ] Deduced a trap composed of 37 places in 182 ms of which 3 ms to minimize.
[2024-06-01 20:59:06] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 3 ms to minimize.
[2024-06-01 20:59:07] [INFO ] Deduced a trap composed of 20 places in 253 ms of which 4 ms to minimize.
[2024-06-01 20:59:07] [INFO ] Deduced a trap composed of 30 places in 248 ms of which 3 ms to minimize.
[2024-06-01 20:59:07] [INFO ] Deduced a trap composed of 30 places in 244 ms of which 3 ms to minimize.
[2024-06-01 20:59:07] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 2 ms to minimize.
[2024-06-01 20:59:08] [INFO ] Deduced a trap composed of 21 places in 234 ms of which 3 ms to minimize.
[2024-06-01 20:59:08] [INFO ] Deduced a trap composed of 29 places in 269 ms of which 3 ms to minimize.
[2024-06-01 20:59:08] [INFO ] Deduced a trap composed of 30 places in 268 ms of which 4 ms to minimize.
[2024-06-01 20:59:09] [INFO ] Deduced a trap composed of 18 places in 271 ms of which 3 ms to minimize.
[2024-06-01 20:59:09] [INFO ] Deduced a trap composed of 40 places in 217 ms of which 3 ms to minimize.
[2024-06-01 20:59:09] [INFO ] Deduced a trap composed of 24 places in 225 ms of which 3 ms to minimize.
[2024-06-01 20:59:09] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:59:09] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 3 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 23 places in 214 ms of which 3 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 3 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 40 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:59:10] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:59:12] [INFO ] Deduced a trap composed of 38 places in 205 ms of which 3 ms to minimize.
[2024-06-01 20:59:12] [INFO ] Deduced a trap composed of 37 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:59:12] [INFO ] Deduced a trap composed of 34 places in 201 ms of which 3 ms to minimize.
[2024-06-01 20:59:12] [INFO ] Deduced a trap composed of 37 places in 172 ms of which 3 ms to minimize.
[2024-06-01 20:59:13] [INFO ] Deduced a trap composed of 46 places in 100 ms of which 1 ms to minimize.
[2024-06-01 20:59:13] [INFO ] Deduced a trap composed of 22 places in 234 ms of which 3 ms to minimize.
[2024-06-01 20:59:14] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 3 ms to minimize.
[2024-06-01 20:59:15] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
[2024-06-01 20:59:15] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 2 ms to minimize.
[2024-06-01 20:59:15] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 3 ms to minimize.
[2024-06-01 20:59:16] [INFO ] Deduced a trap composed of 22 places in 282 ms of which 4 ms to minimize.
[2024-06-01 20:59:16] [INFO ] Deduced a trap composed of 11 places in 289 ms of which 6 ms to minimize.
[2024-06-01 20:59:16] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 3 ms to minimize.
[2024-06-01 20:59:17] [INFO ] Deduced a trap composed of 74 places in 255 ms of which 4 ms to minimize.
[2024-06-01 20:59:17] [INFO ] Deduced a trap composed of 43 places in 275 ms of which 3 ms to minimize.
[2024-06-01 20:59:17] [INFO ] Deduced a trap composed of 22 places in 203 ms of which 3 ms to minimize.
[2024-06-01 20:59:18] [INFO ] Deduced a trap composed of 13 places in 210 ms of which 3 ms to minimize.
[2024-06-01 20:59:18] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 2 ms to minimize.
[2024-06-01 20:59:18] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 3 ms to minimize.
[2024-06-01 20:59:18] [INFO ] Deduced a trap composed of 15 places in 200 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:59:20] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 3 ms to minimize.
[2024-06-01 20:59:20] [INFO ] Deduced a trap composed of 45 places in 163 ms of which 3 ms to minimize.
[2024-06-01 20:59:21] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 3 ms to minimize.
[2024-06-01 20:59:21] [INFO ] Deduced a trap composed of 36 places in 208 ms of which 3 ms to minimize.
[2024-06-01 20:59:21] [INFO ] Deduced a trap composed of 58 places in 237 ms of which 3 ms to minimize.
SMT process timed out in 60506ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60519ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63181 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 1 ms
Free SCC test removed 249 places
Drop transitions (Empty/Sink Transition effects.) removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 18 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-06-01 20:59:21] [INFO ] Computed 9 invariants in 0 ms
[2024-06-01 20:59:21] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 20:59:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-01 20:59:21] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 20:59:21] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 20:59:21] [INFO ] After 73ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 119 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-06-01 20:59:21] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-06-01 20:59:21] [INFO ] Computed 20 invariants in 1 ms
[2024-06-01 20:59:22] [INFO ] Implicit Places using invariants in 602 ms returned []
[2024-06-01 20:59:22] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:59:22] [INFO ] Invariant cache hit.
[2024-06-01 20:59:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 20:59:24] [INFO ] Implicit Places using invariants and state equation in 2103 ms returned []
Implicit Place search using SMT with State Equation took 2706 ms to find 0 implicit places.
[2024-06-01 20:59:24] [INFO ] Redundant transitions in 14 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 20:59:24] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 20:59:24] [INFO ] Invariant cache hit.
[2024-06-01 20:59:24] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:59:35] [INFO ] Deduced a trap composed of 46 places in 323 ms of which 4 ms to minimize.
[2024-06-01 20:59:35] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 4 ms to minimize.
[2024-06-01 20:59:35] [INFO ] Deduced a trap composed of 51 places in 308 ms of which 4 ms to minimize.
[2024-06-01 20:59:36] [INFO ] Deduced a trap composed of 19 places in 306 ms of which 4 ms to minimize.
[2024-06-01 20:59:36] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 3 ms to minimize.
[2024-06-01 20:59:36] [INFO ] Deduced a trap composed of 11 places in 328 ms of which 5 ms to minimize.
[2024-06-01 20:59:37] [INFO ] Deduced a trap composed of 13 places in 434 ms of which 4 ms to minimize.
[2024-06-01 20:59:37] [INFO ] Deduced a trap composed of 10 places in 296 ms of which 4 ms to minimize.
[2024-06-01 20:59:38] [INFO ] Deduced a trap composed of 55 places in 316 ms of which 4 ms to minimize.
[2024-06-01 20:59:38] [INFO ] Deduced a trap composed of 11 places in 301 ms of which 4 ms to minimize.
[2024-06-01 20:59:38] [INFO ] Deduced a trap composed of 21 places in 276 ms of which 3 ms to minimize.
[2024-06-01 20:59:38] [INFO ] Deduced a trap composed of 29 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:59:39] [INFO ] Deduced a trap composed of 29 places in 284 ms of which 3 ms to minimize.
[2024-06-01 20:59:39] [INFO ] Deduced a trap composed of 27 places in 288 ms of which 3 ms to minimize.
[2024-06-01 20:59:39] [INFO ] Deduced a trap composed of 29 places in 287 ms of which 3 ms to minimize.
[2024-06-01 20:59:40] [INFO ] Deduced a trap composed of 56 places in 257 ms of which 3 ms to minimize.
[2024-06-01 20:59:40] [INFO ] Deduced a trap composed of 38 places in 212 ms of which 3 ms to minimize.
[2024-06-01 20:59:40] [INFO ] Deduced a trap composed of 22 places in 263 ms of which 3 ms to minimize.
[2024-06-01 20:59:40] [INFO ] Deduced a trap composed of 21 places in 284 ms of which 3 ms to minimize.
[2024-06-01 20:59:41] [INFO ] Deduced a trap composed of 51 places in 283 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:59:41] [INFO ] Deduced a trap composed of 62 places in 314 ms of which 6 ms to minimize.
[2024-06-01 20:59:42] [INFO ] Deduced a trap composed of 60 places in 308 ms of which 4 ms to minimize.
[2024-06-01 20:59:42] [INFO ] Deduced a trap composed of 14 places in 295 ms of which 3 ms to minimize.
[2024-06-01 20:59:42] [INFO ] Deduced a trap composed of 11 places in 303 ms of which 4 ms to minimize.
[2024-06-01 20:59:43] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 4 ms to minimize.
[2024-06-01 20:59:43] [INFO ] Deduced a trap composed of 12 places in 281 ms of which 3 ms to minimize.
[2024-06-01 20:59:43] [INFO ] Deduced a trap composed of 36 places in 279 ms of which 3 ms to minimize.
[2024-06-01 20:59:44] [INFO ] Deduced a trap composed of 22 places in 266 ms of which 3 ms to minimize.
[2024-06-01 20:59:44] [INFO ] Deduced a trap composed of 52 places in 259 ms of which 3 ms to minimize.
[2024-06-01 20:59:44] [INFO ] Deduced a trap composed of 27 places in 265 ms of which 3 ms to minimize.
[2024-06-01 20:59:44] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 3 ms to minimize.
[2024-06-01 20:59:45] [INFO ] Deduced a trap composed of 51 places in 258 ms of which 4 ms to minimize.
[2024-06-01 20:59:45] [INFO ] Deduced a trap composed of 19 places in 260 ms of which 3 ms to minimize.
[2024-06-01 20:59:45] [INFO ] Deduced a trap composed of 29 places in 196 ms of which 3 ms to minimize.
[2024-06-01 20:59:45] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 3 ms to minimize.
[2024-06-01 20:59:46] [INFO ] Deduced a trap composed of 40 places in 258 ms of which 4 ms to minimize.
[2024-06-01 20:59:46] [INFO ] Deduced a trap composed of 36 places in 241 ms of which 3 ms to minimize.
[2024-06-01 20:59:46] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 4 ms to minimize.
[2024-06-01 20:59:46] [INFO ] Deduced a trap composed of 23 places in 245 ms of which 3 ms to minimize.
[2024-06-01 20:59:47] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 460 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30021 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 20:59:57] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 3 ms to minimize.
[2024-06-01 20:59:58] [INFO ] Deduced a trap composed of 10 places in 325 ms of which 4 ms to minimize.
[2024-06-01 20:59:58] [INFO ] Deduced a trap composed of 51 places in 300 ms of which 3 ms to minimize.
[2024-06-01 20:59:58] [INFO ] Deduced a trap composed of 35 places in 293 ms of which 3 ms to minimize.
[2024-06-01 20:59:59] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 3 ms to minimize.
[2024-06-01 20:59:59] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 3 ms to minimize.
[2024-06-01 20:59:59] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 3 ms to minimize.
[2024-06-01 20:59:59] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 3 ms to minimize.
[2024-06-01 21:00:00] [INFO ] Deduced a trap composed of 59 places in 187 ms of which 3 ms to minimize.
[2024-06-01 21:00:00] [INFO ] Deduced a trap composed of 43 places in 174 ms of which 3 ms to minimize.
[2024-06-01 21:00:00] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 3 ms to minimize.
[2024-06-01 21:00:00] [INFO ] Deduced a trap composed of 18 places in 297 ms of which 3 ms to minimize.
[2024-06-01 21:00:01] [INFO ] Deduced a trap composed of 30 places in 286 ms of which 3 ms to minimize.
[2024-06-01 21:00:01] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 2 ms to minimize.
[2024-06-01 21:00:01] [INFO ] Deduced a trap composed of 51 places in 233 ms of which 3 ms to minimize.
[2024-06-01 21:00:01] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-06-01 21:00:01] [INFO ] Deduced a trap composed of 13 places in 324 ms of which 3 ms to minimize.
[2024-06-01 21:00:02] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 4 ms to minimize.
[2024-06-01 21:00:02] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2024-06-01 21:00:02] [INFO ] Deduced a trap composed of 27 places in 225 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:00:03] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 4 ms to minimize.
[2024-06-01 21:00:04] [INFO ] Deduced a trap composed of 10 places in 277 ms of which 3 ms to minimize.
[2024-06-01 21:00:04] [INFO ] Deduced a trap composed of 62 places in 217 ms of which 3 ms to minimize.
[2024-06-01 21:00:04] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 3 ms to minimize.
[2024-06-01 21:00:04] [INFO ] Deduced a trap composed of 73 places in 225 ms of which 3 ms to minimize.
[2024-06-01 21:00:05] [INFO ] Deduced a trap composed of 43 places in 222 ms of which 3 ms to minimize.
[2024-06-01 21:00:05] [INFO ] Deduced a trap composed of 68 places in 222 ms of which 3 ms to minimize.
[2024-06-01 21:00:05] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 3 ms to minimize.
[2024-06-01 21:00:05] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 3 ms to minimize.
[2024-06-01 21:00:06] [INFO ] Deduced a trap composed of 20 places in 225 ms of which 3 ms to minimize.
[2024-06-01 21:00:06] [INFO ] Deduced a trap composed of 76 places in 236 ms of which 3 ms to minimize.
[2024-06-01 21:00:07] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 3 ms to minimize.
[2024-06-01 21:00:07] [INFO ] Deduced a trap composed of 28 places in 184 ms of which 3 ms to minimize.
[2024-06-01 21:00:07] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 3 ms to minimize.
[2024-06-01 21:00:08] [INFO ] Deduced a trap composed of 19 places in 231 ms of which 3 ms to minimize.
[2024-06-01 21:00:08] [INFO ] Deduced a trap composed of 31 places in 180 ms of which 2 ms to minimize.
[2024-06-01 21:00:08] [INFO ] Deduced a trap composed of 26 places in 198 ms of which 2 ms to minimize.
[2024-06-01 21:00:08] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 2 ms to minimize.
[2024-06-01 21:00:09] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 3 ms to minimize.
[2024-06-01 21:00:09] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:00:10] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 2 ms to minimize.
[2024-06-01 21:00:10] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 2 ms to minimize.
[2024-06-01 21:00:11] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-06-01 21:00:11] [INFO ] Deduced a trap composed of 69 places in 196 ms of which 3 ms to minimize.
[2024-06-01 21:00:11] [INFO ] Deduced a trap composed of 20 places in 258 ms of which 3 ms to minimize.
[2024-06-01 21:00:11] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 3 ms to minimize.
[2024-06-01 21:00:12] [INFO ] Deduced a trap composed of 30 places in 262 ms of which 3 ms to minimize.
[2024-06-01 21:00:12] [INFO ] Deduced a trap composed of 22 places in 204 ms of which 3 ms to minimize.
[2024-06-01 21:00:12] [INFO ] Deduced a trap composed of 21 places in 238 ms of which 3 ms to minimize.
[2024-06-01 21:00:12] [INFO ] Deduced a trap composed of 29 places in 265 ms of which 4 ms to minimize.
[2024-06-01 21:00:13] [INFO ] Deduced a trap composed of 30 places in 277 ms of which 3 ms to minimize.
[2024-06-01 21:00:13] [INFO ] Deduced a trap composed of 18 places in 280 ms of which 4 ms to minimize.
[2024-06-01 21:00:13] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2024-06-01 21:00:13] [INFO ] Deduced a trap composed of 24 places in 218 ms of which 3 ms to minimize.
[2024-06-01 21:00:14] [INFO ] Deduced a trap composed of 50 places in 218 ms of which 3 ms to minimize.
[2024-06-01 21:00:14] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 3 ms to minimize.
[2024-06-01 21:00:14] [INFO ] Deduced a trap composed of 23 places in 200 ms of which 3 ms to minimize.
[2024-06-01 21:00:14] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 3 ms to minimize.
[2024-06-01 21:00:15] [INFO ] Deduced a trap composed of 40 places in 203 ms of which 2 ms to minimize.
[2024-06-01 21:00:15] [INFO ] Deduced a trap composed of 31 places in 210 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:00:16] [INFO ] Deduced a trap composed of 38 places in 176 ms of which 3 ms to minimize.
[2024-06-01 21:00:16] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 3 ms to minimize.
[2024-06-01 21:00:17] [INFO ] Deduced a trap composed of 34 places in 218 ms of which 3 ms to minimize.
[2024-06-01 21:00:17] [INFO ] Deduced a trap composed of 37 places in 174 ms of which 3 ms to minimize.
[2024-06-01 21:00:17] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 21:00:17] [INFO ] Deduced a trap composed of 22 places in 233 ms of which 3 ms to minimize.
[2024-06-01 21:00:19] [INFO ] Deduced a trap composed of 39 places in 168 ms of which 3 ms to minimize.
[2024-06-01 21:00:19] [INFO ] Deduced a trap composed of 34 places in 143 ms of which 2 ms to minimize.
[2024-06-01 21:00:19] [INFO ] Deduced a trap composed of 26 places in 217 ms of which 3 ms to minimize.
[2024-06-01 21:00:20] [INFO ] Deduced a trap composed of 23 places in 231 ms of which 3 ms to minimize.
[2024-06-01 21:00:20] [INFO ] Deduced a trap composed of 22 places in 267 ms of which 4 ms to minimize.
[2024-06-01 21:00:20] [INFO ] Deduced a trap composed of 11 places in 276 ms of which 4 ms to minimize.
[2024-06-01 21:00:21] [INFO ] Deduced a trap composed of 33 places in 273 ms of which 3 ms to minimize.
[2024-06-01 21:00:21] [INFO ] Deduced a trap composed of 74 places in 268 ms of which 4 ms to minimize.
[2024-06-01 21:00:21] [INFO ] Deduced a trap composed of 43 places in 273 ms of which 3 ms to minimize.
[2024-06-01 21:00:22] [INFO ] Deduced a trap composed of 22 places in 212 ms of which 3 ms to minimize.
[2024-06-01 21:00:22] [INFO ] Deduced a trap composed of 13 places in 188 ms of which 3 ms to minimize.
[2024-06-01 21:00:22] [INFO ] Deduced a trap composed of 23 places in 201 ms of which 3 ms to minimize.
[2024-06-01 21:00:22] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 3 ms to minimize.
[2024-06-01 21:00:23] [INFO ] Deduced a trap composed of 15 places in 202 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:00:25] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 2 ms to minimize.
[2024-06-01 21:00:25] [INFO ] Deduced a trap composed of 45 places in 199 ms of which 3 ms to minimize.
SMT process timed out in 60504ms, After SMT, problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60516ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63257 ms. Remains : 400/400 places, 1107/1107 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 793440 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 793440 steps, saw 106025 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2024-06-01 21:00:28] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 21:00:28] [INFO ] Invariant cache hit.
[2024-06-01 21:00:28] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 545 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:00:29] [INFO ] Deduced a trap composed of 13 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:00:29] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-06-01 21:00:29] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:00:30] [INFO ] Deduced a trap composed of 19 places in 330 ms of which 4 ms to minimize.
[2024-06-01 21:00:30] [INFO ] Deduced a trap composed of 31 places in 330 ms of which 4 ms to minimize.
[2024-06-01 21:00:30] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 3 ms to minimize.
[2024-06-01 21:00:31] [INFO ] Deduced a trap composed of 64 places in 297 ms of which 3 ms to minimize.
[2024-06-01 21:00:31] [INFO ] Deduced a trap composed of 27 places in 295 ms of which 4 ms to minimize.
[2024-06-01 21:00:31] [INFO ] Deduced a trap composed of 52 places in 305 ms of which 4 ms to minimize.
[2024-06-01 21:00:31] [INFO ] Deduced a trap composed of 19 places in 299 ms of which 4 ms to minimize.
[2024-06-01 21:00:32] [INFO ] Deduced a trap composed of 21 places in 286 ms of which 4 ms to minimize.
[2024-06-01 21:00:32] [INFO ] Deduced a trap composed of 22 places in 243 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 9/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:00:32] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4050 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 4611ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 13 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 400/400 places, 1107/1107 transitions.
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 794408 steps, run timeout after 3001 ms. (steps per millisecond=264 ) properties seen :0 out of 1
Probabilistic random walk after 794408 steps, saw 106113 distinct states, run finished after 3001 ms. (steps per millisecond=264 ) properties seen :0
[2024-06-01 21:00:36] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 21:00:36] [INFO ] Invariant cache hit.
[2024-06-01 21:00:36] [INFO ] State equation strengthened by 330 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 222/582 variables, 42/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/582 variables, 42/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 6/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 360/942 variables, 60/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/942 variables, 60/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/942 variables, 294/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 0/750 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 190/1132 variables, 5/755 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1132 variables, 190/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1132 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 5/1137 variables, 5/950 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1137 variables, 5/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1137 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 160/1297 variables, 195/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1297 variables, 0/1150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1297/1297 variables, and 1150 constraints, problems are : Problem set: 0 solved, 1 unsolved in 534 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/102 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 100/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/103 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/103 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 257/360 variables, 103/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/360 variables, 36/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/360 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/360 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 222/582 variables, 42/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/582 variables, 42/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/582 variables, 6/337 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:00:36] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-06-01 21:00:37] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-06-01 21:00:37] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/582 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/582 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 360/942 variables, 60/400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/942 variables, 60/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 294/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 190/1132 variables, 5/759 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1132 variables, 190/949 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:00:37] [INFO ] Deduced a trap composed of 19 places in 301 ms of which 4 ms to minimize.
[2024-06-01 21:00:38] [INFO ] Deduced a trap composed of 31 places in 333 ms of which 4 ms to minimize.
[2024-06-01 21:00:38] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 4 ms to minimize.
[2024-06-01 21:00:38] [INFO ] Deduced a trap composed of 64 places in 287 ms of which 3 ms to minimize.
[2024-06-01 21:00:39] [INFO ] Deduced a trap composed of 27 places in 310 ms of which 3 ms to minimize.
[2024-06-01 21:00:39] [INFO ] Deduced a trap composed of 52 places in 294 ms of which 4 ms to minimize.
[2024-06-01 21:00:39] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 4 ms to minimize.
[2024-06-01 21:00:40] [INFO ] Deduced a trap composed of 21 places in 297 ms of which 4 ms to minimize.
[2024-06-01 21:00:40] [INFO ] Deduced a trap composed of 22 places in 237 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1132 variables, 9/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1132 variables, 0/958 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 5/1137 variables, 5/963 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1137 variables, 5/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1137 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 160/1297 variables, 195/1163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 21:00:40] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 3 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1297 variables, 1/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1297 variables, 0/1164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1297/1297 variables, and 1164 constraints, problems are : Problem set: 0 solved, 1 unsolved in 4113 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 400/400 constraints, ReadFeed: 330/330 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 4658ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 13 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 400/400 places, 1107/1107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-06-01 21:00:40] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 21:00:40] [INFO ] Invariant cache hit.
[2024-06-01 21:00:41] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-06-01 21:00:41] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 21:00:41] [INFO ] Invariant cache hit.
[2024-06-01 21:00:41] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 21:00:43] [INFO ] Implicit Places using invariants and state equation in 2102 ms returned []
Implicit Place search using SMT with State Equation took 2689 ms to find 0 implicit places.
[2024-06-01 21:00:43] [INFO ] Redundant transitions in 14 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 21:00:43] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 21:00:43] [INFO ] Invariant cache hit.
[2024-06-01 21:00:43] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:00:54] [INFO ] Deduced a trap composed of 46 places in 327 ms of which 4 ms to minimize.
[2024-06-01 21:00:54] [INFO ] Deduced a trap composed of 29 places in 313 ms of which 4 ms to minimize.
[2024-06-01 21:00:54] [INFO ] Deduced a trap composed of 51 places in 320 ms of which 4 ms to minimize.
[2024-06-01 21:00:54] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 3 ms to minimize.
[2024-06-01 21:00:55] [INFO ] Deduced a trap composed of 12 places in 305 ms of which 4 ms to minimize.
[2024-06-01 21:00:55] [INFO ] Deduced a trap composed of 11 places in 308 ms of which 4 ms to minimize.
[2024-06-01 21:00:55] [INFO ] Deduced a trap composed of 13 places in 310 ms of which 4 ms to minimize.
[2024-06-01 21:00:56] [INFO ] Deduced a trap composed of 10 places in 234 ms of which 4 ms to minimize.
[2024-06-01 21:00:56] [INFO ] Deduced a trap composed of 55 places in 320 ms of which 4 ms to minimize.
[2024-06-01 21:00:56] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 4 ms to minimize.
[2024-06-01 21:00:57] [INFO ] Deduced a trap composed of 21 places in 300 ms of which 3 ms to minimize.
[2024-06-01 21:00:57] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 4 ms to minimize.
[2024-06-01 21:00:57] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 3 ms to minimize.
[2024-06-01 21:00:58] [INFO ] Deduced a trap composed of 27 places in 301 ms of which 3 ms to minimize.
[2024-06-01 21:00:58] [INFO ] Deduced a trap composed of 29 places in 288 ms of which 4 ms to minimize.
[2024-06-01 21:00:58] [INFO ] Deduced a trap composed of 56 places in 276 ms of which 3 ms to minimize.
[2024-06-01 21:00:58] [INFO ] Deduced a trap composed of 38 places in 197 ms of which 3 ms to minimize.
[2024-06-01 21:00:59] [INFO ] Deduced a trap composed of 22 places in 259 ms of which 3 ms to minimize.
[2024-06-01 21:00:59] [INFO ] Deduced a trap composed of 21 places in 268 ms of which 4 ms to minimize.
[2024-06-01 21:00:59] [INFO ] Deduced a trap composed of 51 places in 270 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:01:00] [INFO ] Deduced a trap composed of 62 places in 314 ms of which 4 ms to minimize.
[2024-06-01 21:01:00] [INFO ] Deduced a trap composed of 60 places in 310 ms of which 3 ms to minimize.
[2024-06-01 21:01:01] [INFO ] Deduced a trap composed of 14 places in 283 ms of which 3 ms to minimize.
[2024-06-01 21:01:01] [INFO ] Deduced a trap composed of 11 places in 282 ms of which 4 ms to minimize.
[2024-06-01 21:01:01] [INFO ] Deduced a trap composed of 21 places in 306 ms of which 4 ms to minimize.
[2024-06-01 21:01:02] [INFO ] Deduced a trap composed of 12 places in 248 ms of which 3 ms to minimize.
[2024-06-01 21:01:02] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 4 ms to minimize.
[2024-06-01 21:01:02] [INFO ] Deduced a trap composed of 22 places in 268 ms of which 4 ms to minimize.
[2024-06-01 21:01:02] [INFO ] Deduced a trap composed of 52 places in 264 ms of which 3 ms to minimize.
[2024-06-01 21:01:03] [INFO ] Deduced a trap composed of 27 places in 259 ms of which 3 ms to minimize.
[2024-06-01 21:01:03] [INFO ] Deduced a trap composed of 33 places in 252 ms of which 4 ms to minimize.
[2024-06-01 21:01:03] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 3 ms to minimize.
[2024-06-01 21:01:04] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 4 ms to minimize.
[2024-06-01 21:01:04] [INFO ] Deduced a trap composed of 29 places in 200 ms of which 3 ms to minimize.
[2024-06-01 21:01:04] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 3 ms to minimize.
[2024-06-01 21:01:04] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 4 ms to minimize.
[2024-06-01 21:01:04] [INFO ] Deduced a trap composed of 36 places in 227 ms of which 3 ms to minimize.
[2024-06-01 21:01:05] [INFO ] Deduced a trap composed of 19 places in 238 ms of which 4 ms to minimize.
[2024-06-01 21:01:05] [INFO ] Deduced a trap composed of 23 places in 288 ms of which 3 ms to minimize.
[2024-06-01 21:01:05] [INFO ] Deduced a trap composed of 27 places in 234 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")
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 460 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30023 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:01:16] [INFO ] Deduced a trap composed of 26 places in 421 ms of which 3 ms to minimize.
[2024-06-01 21:01:17] [INFO ] Deduced a trap composed of 10 places in 319 ms of which 4 ms to minimize.
[2024-06-01 21:01:17] [INFO ] Deduced a trap composed of 51 places in 294 ms of which 4 ms to minimize.
[2024-06-01 21:01:17] [INFO ] Deduced a trap composed of 35 places in 300 ms of which 4 ms to minimize.
[2024-06-01 21:01:18] [INFO ] Deduced a trap composed of 19 places in 271 ms of which 3 ms to minimize.
[2024-06-01 21:01:18] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 3 ms to minimize.
[2024-06-01 21:01:18] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 3 ms to minimize.
[2024-06-01 21:01:18] [INFO ] Deduced a trap composed of 47 places in 227 ms of which 3 ms to minimize.
[2024-06-01 21:01:19] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 2 ms to minimize.
[2024-06-01 21:01:19] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 2 ms to minimize.
[2024-06-01 21:01:19] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 3 ms to minimize.
[2024-06-01 21:01:19] [INFO ] Deduced a trap composed of 18 places in 283 ms of which 3 ms to minimize.
[2024-06-01 21:01:20] [INFO ] Deduced a trap composed of 30 places in 237 ms of which 4 ms to minimize.
[2024-06-01 21:01:20] [INFO ] Deduced a trap composed of 50 places in 222 ms of which 3 ms to minimize.
[2024-06-01 21:01:20] [INFO ] Deduced a trap composed of 51 places in 231 ms of which 3 ms to minimize.
[2024-06-01 21:01:20] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2024-06-01 21:01:21] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 4 ms to minimize.
[2024-06-01 21:01:21] [INFO ] Deduced a trap composed of 10 places in 311 ms of which 3 ms to minimize.
[2024-06-01 21:01:21] [INFO ] Deduced a trap composed of 35 places in 223 ms of which 3 ms to minimize.
[2024-06-01 21:01:21] [INFO ] Deduced a trap composed of 27 places in 207 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:01:22] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 3 ms to minimize.
[2024-06-01 21:01:23] [INFO ] Deduced a trap composed of 10 places in 284 ms of which 4 ms to minimize.
[2024-06-01 21:01:23] [INFO ] Deduced a trap composed of 62 places in 205 ms of which 3 ms to minimize.
[2024-06-01 21:01:23] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 3 ms to minimize.
[2024-06-01 21:01:23] [INFO ] Deduced a trap composed of 73 places in 215 ms of which 3 ms to minimize.
[2024-06-01 21:01:24] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 3 ms to minimize.
[2024-06-01 21:01:24] [INFO ] Deduced a trap composed of 68 places in 207 ms of which 3 ms to minimize.
[2024-06-01 21:01:24] [INFO ] Deduced a trap composed of 54 places in 217 ms of which 3 ms to minimize.
[2024-06-01 21:01:24] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 3 ms to minimize.
[2024-06-01 21:01:25] [INFO ] Deduced a trap composed of 20 places in 208 ms of which 3 ms to minimize.
[2024-06-01 21:01:25] [INFO ] Deduced a trap composed of 76 places in 215 ms of which 3 ms to minimize.
[2024-06-01 21:01:25] [INFO ] Deduced a trap composed of 18 places in 210 ms of which 3 ms to minimize.
[2024-06-01 21:01:26] [INFO ] Deduced a trap composed of 28 places in 173 ms of which 3 ms to minimize.
[2024-06-01 21:01:26] [INFO ] Deduced a trap composed of 11 places in 217 ms of which 3 ms to minimize.
[2024-06-01 21:01:26] [INFO ] Deduced a trap composed of 19 places in 239 ms of which 3 ms to minimize.
[2024-06-01 21:01:27] [INFO ] Deduced a trap composed of 31 places in 185 ms of which 3 ms to minimize.
[2024-06-01 21:01:27] [INFO ] Deduced a trap composed of 26 places in 205 ms of which 3 ms to minimize.
[2024-06-01 21:01:27] [INFO ] Deduced a trap composed of 10 places in 191 ms of which 3 ms to minimize.
[2024-06-01 21:01:28] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 3 ms to minimize.
[2024-06-01 21:01:28] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:01:29] [INFO ] Deduced a trap composed of 54 places in 315 ms of which 5 ms to minimize.
[2024-06-01 21:01:29] [INFO ] Deduced a trap composed of 72 places in 227 ms of which 3 ms to minimize.
[2024-06-01 21:01:30] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 2 ms to minimize.
[2024-06-01 21:01:30] [INFO ] Deduced a trap composed of 69 places in 191 ms of which 3 ms to minimize.
[2024-06-01 21:01:30] [INFO ] Deduced a trap composed of 20 places in 254 ms of which 3 ms to minimize.
[2024-06-01 21:01:30] [INFO ] Deduced a trap composed of 30 places in 245 ms of which 3 ms to minimize.
[2024-06-01 21:01:31] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 3 ms to minimize.
[2024-06-01 21:01:31] [INFO ] Deduced a trap composed of 22 places in 202 ms of which 3 ms to minimize.
[2024-06-01 21:01:31] [INFO ] Deduced a trap composed of 21 places in 240 ms of which 3 ms to minimize.
[2024-06-01 21:01:31] [INFO ] Deduced a trap composed of 29 places in 255 ms of which 4 ms to minimize.
[2024-06-01 21:01:32] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 3 ms to minimize.
[2024-06-01 21:01:32] [INFO ] Deduced a trap composed of 18 places in 269 ms of which 4 ms to minimize.
[2024-06-01 21:01:32] [INFO ] Deduced a trap composed of 40 places in 219 ms of which 3 ms to minimize.
[2024-06-01 21:01:33] [INFO ] Deduced a trap composed of 24 places in 233 ms of which 3 ms to minimize.
[2024-06-01 21:01:33] [INFO ] Deduced a trap composed of 50 places in 221 ms of which 3 ms to minimize.
[2024-06-01 21:01:33] [INFO ] Deduced a trap composed of 27 places in 228 ms of which 3 ms to minimize.
[2024-06-01 21:01:33] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 2 ms to minimize.
[2024-06-01 21:01:33] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 3 ms to minimize.
[2024-06-01 21:01:34] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 3 ms to minimize.
[2024-06-01 21:01:34] [INFO ] Deduced a trap composed of 31 places in 205 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:01:35] [INFO ] Deduced a trap composed of 38 places in 178 ms of which 3 ms to minimize.
[2024-06-01 21:01:35] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 3 ms to minimize.
[2024-06-01 21:01:36] [INFO ] Deduced a trap composed of 34 places in 245 ms of which 3 ms to minimize.
[2024-06-01 21:01:36] [INFO ] Deduced a trap composed of 37 places in 177 ms of which 3 ms to minimize.
[2024-06-01 21:01:36] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 21:01:36] [INFO ] Deduced a trap composed of 22 places in 236 ms of which 3 ms to minimize.
[2024-06-01 21:01:38] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 2 ms to minimize.
[2024-06-01 21:01:38] [INFO ] Deduced a trap composed of 34 places in 136 ms of which 2 ms to minimize.
[2024-06-01 21:01:38] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 3 ms to minimize.
[2024-06-01 21:01:39] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 3 ms to minimize.
[2024-06-01 21:01:39] [INFO ] Deduced a trap composed of 22 places in 273 ms of which 4 ms to minimize.
[2024-06-01 21:01:39] [INFO ] Deduced a trap composed of 11 places in 280 ms of which 4 ms to minimize.
[2024-06-01 21:01:40] [INFO ] Deduced a trap composed of 33 places in 266 ms of which 3 ms to minimize.
[2024-06-01 21:01:40] [INFO ] Deduced a trap composed of 74 places in 274 ms of which 4 ms to minimize.
[2024-06-01 21:01:40] [INFO ] Deduced a trap composed of 43 places in 276 ms of which 3 ms to minimize.
[2024-06-01 21:01:41] [INFO ] Deduced a trap composed of 22 places in 211 ms of which 3 ms to minimize.
[2024-06-01 21:01:41] [INFO ] Deduced a trap composed of 13 places in 213 ms of which 2 ms to minimize.
[2024-06-01 21:01:41] [INFO ] Deduced a trap composed of 23 places in 205 ms of which 3 ms to minimize.
[2024-06-01 21:01:42] [INFO ] Deduced a trap composed of 15 places in 207 ms of which 3 ms to minimize.
[2024-06-01 21:01:42] [INFO ] Deduced a trap composed of 15 places in 203 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1297 variables, and 540 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30023 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 120/120 constraints]
After SMT, in 60417ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63154 ms. Remains : 400/400 places, 1107/1107 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 838 edges and 400 vertex of which 291 / 400 are part of one of the 42 SCC in 0 ms
Free SCC test removed 249 places
Drop transitions (Empty/Sink Transition effects.) removed 498 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 749 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 151 transition count 317
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 110 transition count 317
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 87 place count 108 transition count 315
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 89 place count 108 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 109 place count 95 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 49 edges and 95 vertex of which 42 / 95 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Iterating post reduction 1 with 2 rules applied. Total rules applied 111 place count 59 transition count 312
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Graph (trivial) has 187 edges and 54 vertex of which 30 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 2 with 48 rules applied. Total rules applied 159 place count 30 transition count 270
Drop transitions (Empty/Sink Transition effects.) removed 120 transitions
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 220 transitions.
Iterating post reduction 3 with 220 rules applied. Total rules applied 379 place count 30 transition count 50
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 382 place count 30 transition count 47
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 383 place count 30 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 384 place count 29 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 385 place count 29 transition count 46
Applied a total of 385 rules in 17 ms. Remains 29 /400 variables (removed 371) and now considering 46/1107 (removed 1061) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 46 rows 29 cols
[2024-06-01 21:01:43] [INFO ] Computed 9 invariants in 1 ms
[2024-06-01 21:01:44] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 21:01:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-06-01 21:01:44] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 21:01:44] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 21:01:44] [INFO ] After 74ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 127 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 244 ms.
Product exploration explored 100000 steps with 0 reset in 287 ms.
Support contains 2 out of 400 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 400/400 places, 1107/1107 transitions.
Applied a total of 0 rules in 14 ms. Remains 400 /400 variables (removed 0) and now considering 1107/1107 (removed 0) transitions.
[2024-06-01 21:01:44] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
// Phase 1: matrix 897 rows 400 cols
[2024-06-01 21:01:44] [INFO ] Computed 20 invariants in 2 ms
[2024-06-01 21:01:45] [INFO ] Implicit Places using invariants in 678 ms returned []
[2024-06-01 21:01:45] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 21:01:45] [INFO ] Invariant cache hit.
[2024-06-01 21:01:46] [INFO ] State equation strengthened by 330 read => feed constraints.
[2024-06-01 21:01:47] [INFO ] Implicit Places using invariants and state equation in 2170 ms returned []
Implicit Place search using SMT with State Equation took 2850 ms to find 0 implicit places.
[2024-06-01 21:01:47] [INFO ] Redundant transitions in 13 ms returned []
Running 1100 sub problems to find dead transitions.
[2024-06-01 21:01:47] [INFO ] Flow matrix only has 897 transitions (discarded 210 similar events)
[2024-06-01 21:01:47] [INFO ] Invariant cache hit.
[2024-06-01 21:01:47] [INFO ] State equation strengthened by 330 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:01:58] [INFO ] Deduced a trap composed of 46 places in 321 ms of which 4 ms to minimize.
[2024-06-01 21:01:58] [INFO ] Deduced a trap composed of 29 places in 331 ms of which 4 ms to minimize.
[2024-06-01 21:01:58] [INFO ] Deduced a trap composed of 51 places in 268 ms of which 3 ms to minimize.
[2024-06-01 21:01:58] [INFO ] Deduced a trap composed of 19 places in 307 ms of which 4 ms to minimize.
[2024-06-01 21:01:59] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 3 ms to minimize.
[2024-06-01 21:01:59] [INFO ] Deduced a trap composed of 11 places in 306 ms of which 4 ms to minimize.
[2024-06-01 21:01:59] [INFO ] Deduced a trap composed of 13 places in 301 ms of which 4 ms to minimize.
[2024-06-01 21:02:00] [INFO ] Deduced a trap composed of 10 places in 314 ms of which 4 ms to minimize.
[2024-06-01 21:02:00] [INFO ] Deduced a trap composed of 55 places in 311 ms of which 4 ms to minimize.
[2024-06-01 21:02:00] [INFO ] Deduced a trap composed of 11 places in 348 ms of which 4 ms to minimize.
[2024-06-01 21:02:01] [INFO ] Deduced a trap composed of 21 places in 289 ms of which 3 ms to minimize.
[2024-06-01 21:02:01] [INFO ] Deduced a trap composed of 29 places in 281 ms of which 3 ms to minimize.
[2024-06-01 21:02:01] [INFO ] Deduced a trap composed of 29 places in 286 ms of which 3 ms to minimize.
[2024-06-01 21:02:02] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 3 ms to minimize.
[2024-06-01 21:02:02] [INFO ] Deduced a trap composed of 29 places in 285 ms of which 3 ms to minimize.
[2024-06-01 21:02:02] [INFO ] Deduced a trap composed of 56 places in 259 ms of which 3 ms to minimize.
[2024-06-01 21:02:02] [INFO ] Deduced a trap composed of 38 places in 204 ms of which 3 ms to minimize.
[2024-06-01 21:02:03] [INFO ] Deduced a trap composed of 22 places in 269 ms of which 4 ms to minimize.
[2024-06-01 21:02:03] [INFO ] Deduced a trap composed of 21 places in 273 ms of which 3 ms to minimize.
[2024-06-01 21:02:03] [INFO ] Deduced a trap composed of 51 places in 277 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 20/440 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:02:04] [INFO ] Deduced a trap composed of 62 places in 232 ms of which 4 ms to minimize.
[2024-06-01 21:02:04] [INFO ] Deduced a trap composed of 60 places in 317 ms of which 4 ms to minimize.
[2024-06-01 21:02:05] [INFO ] Deduced a trap composed of 14 places in 299 ms of which 3 ms to minimize.
[2024-06-01 21:02:05] [INFO ] Deduced a trap composed of 11 places in 300 ms of which 4 ms to minimize.
[2024-06-01 21:02:05] [INFO ] Deduced a trap composed of 21 places in 298 ms of which 4 ms to minimize.
[2024-06-01 21:02:06] [INFO ] Deduced a trap composed of 12 places in 302 ms of which 3 ms to minimize.
[2024-06-01 21:02:06] [INFO ] Deduced a trap composed of 36 places in 288 ms of which 4 ms to minimize.
[2024-06-01 21:02:06] [INFO ] Deduced a trap composed of 22 places in 265 ms of which 4 ms to minimize.
[2024-06-01 21:02:07] [INFO ] Deduced a trap composed of 52 places in 266 ms of which 4 ms to minimize.
[2024-06-01 21:02:07] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 3 ms to minimize.
[2024-06-01 21:02:07] [INFO ] Deduced a trap composed of 33 places in 258 ms of which 3 ms to minimize.
[2024-06-01 21:02:07] [INFO ] Deduced a trap composed of 51 places in 251 ms of which 3 ms to minimize.
[2024-06-01 21:02:08] [INFO ] Deduced a trap composed of 19 places in 253 ms of which 3 ms to minimize.
[2024-06-01 21:02:08] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 3 ms to minimize.
[2024-06-01 21:02:08] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 2 ms to minimize.
[2024-06-01 21:02:08] [INFO ] Deduced a trap composed of 40 places in 232 ms of which 3 ms to minimize.
[2024-06-01 21:02:09] [INFO ] Deduced a trap composed of 36 places in 242 ms of which 3 ms to minimize.
[2024-06-01 21:02:09] [INFO ] Deduced a trap composed of 19 places in 247 ms of which 3 ms to minimize.
[2024-06-01 21:02:09] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 3 ms to minimize.
[2024-06-01 21:02:09] [INFO ] Deduced a trap composed of 27 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 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(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 1.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 1.0)
(s225 1.0)
(s226 0.0)
(s227 0.0)
timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/1297 variables, and 460 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30021 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 1100/1100 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1100 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 400/400 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/400 variables, 20/420 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/400 variables, 40/460 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:02:21] [INFO ] Deduced a trap composed of 26 places in 316 ms of which 4 ms to minimize.
[2024-06-01 21:02:21] [INFO ] Deduced a trap composed of 10 places in 308 ms of which 4 ms to minimize.
[2024-06-01 21:02:21] [INFO ] Deduced a trap composed of 51 places in 291 ms of which 3 ms to minimize.
[2024-06-01 21:02:22] [INFO ] Deduced a trap composed of 35 places in 298 ms of which 4 ms to minimize.
[2024-06-01 21:02:22] [INFO ] Deduced a trap composed of 19 places in 300 ms of which 3 ms to minimize.
[2024-06-01 21:02:22] [INFO ] Deduced a trap composed of 19 places in 308 ms of which 3 ms to minimize.
[2024-06-01 21:02:22] [INFO ] Deduced a trap composed of 30 places in 273 ms of which 4 ms to minimize.
[2024-06-01 21:02:23] [INFO ] Deduced a trap composed of 47 places in 218 ms of which 3 ms to minimize.
[2024-06-01 21:02:23] [INFO ] Deduced a trap composed of 59 places in 172 ms of which 2 ms to minimize.
[2024-06-01 21:02:23] [INFO ] Deduced a trap composed of 43 places in 171 ms of which 2 ms to minimize.
[2024-06-01 21:02:23] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 2 ms to minimize.
[2024-06-01 21:02:24] [INFO ] Deduced a trap composed of 18 places in 266 ms of which 4 ms to minimize.
[2024-06-01 21:02:24] [INFO ] Deduced a trap composed of 30 places in 269 ms of which 4 ms to minimize.
[2024-06-01 21:02:24] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 3 ms to minimize.
[2024-06-01 21:02:24] [INFO ] Deduced a trap composed of 51 places in 231 ms of which 3 ms to minimize.
[2024-06-01 21:02:24] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 1 ms to minimize.
[2024-06-01 21:02:25] [INFO ] Deduced a trap composed of 13 places in 321 ms of which 4 ms to minimize.
[2024-06-01 21:02:25] [INFO ] Deduced a trap composed of 10 places in 320 ms of which 4 ms to minimize.
[2024-06-01 21:02:25] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 3 ms to minimize.
[2024-06-01 21:02:26] [INFO ] Deduced a trap composed of 27 places in 224 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 20/480 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:02:27] [INFO ] Deduced a trap composed of 10 places in 387 ms of which 4 ms to minimize.
[2024-06-01 21:02:27] [INFO ] Deduced a trap composed of 10 places in 278 ms of which 4 ms to minimize.
[2024-06-01 21:02:27] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 3 ms to minimize.
[2024-06-01 21:02:28] [INFO ] Deduced a trap composed of 37 places in 228 ms of which 3 ms to minimize.
[2024-06-01 21:02:28] [INFO ] Deduced a trap composed of 73 places in 217 ms of which 3 ms to minimize.
[2024-06-01 21:02:28] [INFO ] Deduced a trap composed of 43 places in 216 ms of which 3 ms to minimize.
[2024-06-01 21:02:28] [INFO ] Deduced a trap composed of 68 places in 217 ms of which 3 ms to minimize.
[2024-06-01 21:02:29] [INFO ] Deduced a trap composed of 54 places in 220 ms of which 3 ms to minimize.
[2024-06-01 21:02:29] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 3 ms to minimize.
[2024-06-01 21:02:29] [INFO ] Deduced a trap composed of 20 places in 209 ms of which 3 ms to minimize.
[2024-06-01 21:02:30] [INFO ] Deduced a trap composed of 76 places in 212 ms of which 3 ms to minimize.
[2024-06-01 21:02:30] [INFO ] Deduced a trap composed of 18 places in 208 ms of which 3 ms to minimize.
[2024-06-01 21:02:31] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 3 ms to minimize.
[2024-06-01 21:02:31] [INFO ] Deduced a trap composed of 11 places in 212 ms of which 3 ms to minimize.
[2024-06-01 21:02:31] [INFO ] Deduced a trap composed of 19 places in 214 ms of which 4 ms to minimize.
[2024-06-01 21:02:31] [INFO ] Deduced a trap composed of 31 places in 168 ms of which 3 ms to minimize.
[2024-06-01 21:02:32] [INFO ] Deduced a trap composed of 26 places in 173 ms of which 3 ms to minimize.
[2024-06-01 21:02:32] [INFO ] Deduced a trap composed of 10 places in 196 ms of which 2 ms to minimize.
[2024-06-01 21:02:32] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 2 ms to minimize.
[2024-06-01 21:02:32] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/500 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:02:34] [INFO ] Deduced a trap composed of 54 places in 187 ms of which 3 ms to minimize.
[2024-06-01 21:02:34] [INFO ] Deduced a trap composed of 72 places in 200 ms of which 3 ms to minimize.
[2024-06-01 21:02:34] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 21:02:34] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 3 ms to minimize.
[2024-06-01 21:02:35] [INFO ] Deduced a trap composed of 20 places in 264 ms of which 3 ms to minimize.
[2024-06-01 21:02:35] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 3 ms to minimize.
[2024-06-01 21:02:35] [INFO ] Deduced a trap composed of 30 places in 253 ms of which 3 ms to minimize.
[2024-06-01 21:02:35] [INFO ] Deduced a trap composed of 22 places in 196 ms of which 3 ms to minimize.
[2024-06-01 21:02:36] [INFO ] Deduced a trap composed of 21 places in 223 ms of which 3 ms to minimize.
[2024-06-01 21:02:36] [INFO ] Deduced a trap composed of 29 places in 260 ms of which 3 ms to minimize.
[2024-06-01 21:02:36] [INFO ] Deduced a trap composed of 30 places in 275 ms of which 4 ms to minimize.
[2024-06-01 21:02:36] [INFO ] Deduced a trap composed of 18 places in 273 ms of which 3 ms to minimize.
[2024-06-01 21:02:37] [INFO ] Deduced a trap composed of 40 places in 221 ms of which 3 ms to minimize.
[2024-06-01 21:02:37] [INFO ] Deduced a trap composed of 24 places in 219 ms of which 3 ms to minimize.
[2024-06-01 21:02:37] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 3 ms to minimize.
[2024-06-01 21:02:37] [INFO ] Deduced a trap composed of 27 places in 219 ms of which 3 ms to minimize.
[2024-06-01 21:02:38] [INFO ] Deduced a trap composed of 23 places in 210 ms of which 3 ms to minimize.
[2024-06-01 21:02:38] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 3 ms to minimize.
[2024-06-01 21:02:38] [INFO ] Deduced a trap composed of 40 places in 202 ms of which 3 ms to minimize.
[2024-06-01 21:02:38] [INFO ] Deduced a trap composed of 31 places in 208 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/520 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
[2024-06-01 21:02:40] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 2 ms to minimize.
[2024-06-01 21:02:40] [INFO ] Deduced a trap composed of 37 places in 219 ms of which 3 ms to minimize.
[2024-06-01 21:02:40] [INFO ] Deduced a trap composed of 34 places in 217 ms of which 3 ms to minimize.
[2024-06-01 21:02:40] [INFO ] Deduced a trap composed of 37 places in 187 ms of which 3 ms to minimize.
[2024-06-01 21:02:40] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 2 ms to minimize.
[2024-06-01 21:02:41] [INFO ] Deduced a trap composed of 22 places in 242 ms of which 3 ms to minimize.
[2024-06-01 21:02:42] [INFO ] Deduced a trap composed of 39 places in 157 ms of which 2 ms to minimize.
[2024-06-01 21:02:43] [INFO ] Deduced a trap composed of 34 places in 133 ms of which 2 ms to minimize.
[2024-06-01 21:02:43] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 3 ms to minimize.
[2024-06-01 21:02:43] [INFO ] Deduced a trap composed of 23 places in 229 ms of which 3 ms to minimize.
[2024-06-01 21:02:44] [INFO ] Deduced a trap composed of 22 places in 279 ms of which 4 ms to minimize.
[2024-06-01 21:02:44] [INFO ] Deduced a trap composed of 11 places in 260 ms of which 4 ms to minimize.
[2024-06-01 21:02:44] [INFO ] Deduced a trap composed of 33 places in 259 ms of which 3 ms to minimize.
[2024-06-01 21:02:44] [INFO ] Deduced a trap composed of 74 places in 259 ms of which 5 ms to minimize.
[2024-06-01 21:02:45] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2024-06-01 21:02:45] [INFO ] Deduced a trap composed of 22 places in 213 ms of which 3 ms to minimize.
[2024-06-01 21:02:45] [INFO ] Deduced a trap composed of 13 places in 195 ms of which 3 ms to minimize.
[2024-06-01 21:02:46] [INFO ] Deduced a trap composed of 23 places in 173 ms of which 3 ms to minimize.
[2024-06-01 21:02:46] [INFO ] Deduced a trap composed of 15 places in 210 ms of which 3 ms to minimize.
[2024-06-01 21:02:46] [INFO ] Deduced a trap composed of 15 places in 206 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/540 constraints. Problems are: Problem set: 0 solved, 1100 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 400/1297 variables, and 540 constraints, problems are : Problem set: 0 solved, 1100 unsolved in 30023 ms.
Refiners :[Domain max(s): 400/400 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 0/400 constraints, ReadFeed: 0/330 constraints, PredecessorRefiner: 0/1100 constraints, Known Traps: 120/120 constraints]
After SMT, in 60439ms problems are : Problem set: 0 solved, 1100 unsolved
Search for dead transitions found 0 dead transitions in 60452ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 63336 ms. Remains : 400/400 places, 1107/1107 transitions.
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 287194 ms.
[2024-06-01 21:02:48] [INFO ] Flatten gal took : 109 ms
[2024-06-01 21:02:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 28 ms.
[2024-06-01 21:02:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 2030 transitions and 6272 arcs took 26 ms.
Total runtime 1549001 ms.
There are residual formulas that ITS could not solve within timeout

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-6"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Peterson-PT-6, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r512-smll-171654407300284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;