MCC'2024- Execution of r536-tall-171690533300877

About the Execution of LTSMin+red for Szymanski-PT-b06

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
16137.447	796039.00	936785.00	2144.40	6 0 0 6 6 0 1 0 1 0 ? 0 1 1 ? 0	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r536-tall-171690533300877.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 Szymanski-PT-b06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r536-tall-171690533300877
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 19:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 11 15:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 15:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717283277083

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 23:07:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 23:07:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 23:07:58] [INFO ] Load time of PNML (sax parser for PT used): 325 ms
[2024-06-01 23:07:58] [INFO ] Transformed 568 places.
[2024-06-01 23:07:58] [INFO ] Transformed 8320 transitions.
[2024-06-01 23:07:58] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 495 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-06-01 23:07:58] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 308 cols
[2024-06-01 23:07:58] [INFO ] Computed 3 invariants in 64 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[13, 13, 13, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10003 steps (2 resets) in 59 ms. (166 steps per ms)
FORMULA Szymanski-PT-b06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-b06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70007 steps (18 resets) in 176 ms. (395 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 2, 6, 0, 0, 0, 0] Max Struct:[13, 13, 13, 1, 1, 1, 1]
[2024-06-01 23:07:59] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2024-06-01 23:07:59] [INFO ] Invariant cache hit.
[2024-06-01 23:07:59] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-06-01 23:07:59] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2024-06-01 23:07:59] [INFO ] [Real]Absence check using state equation in 499 ms returned unsat
[2024-06-01 23:07:59] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:07:59] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:08:00] [INFO ] [Real]Absence check using state equation in 447 ms returned sat
[2024-06-01 23:08:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:08:00] [INFO ] [Real]Added 147 Read/Feed constraints in 192 ms returned sat
[2024-06-01 23:08:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:00] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:08:01] [INFO ] [Nat]Absence check using state equation in 423 ms returned sat
[2024-06-01 23:08:01] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:08:02] [INFO ] [Nat]Added 147 Read/Feed constraints in 1046 ms returned unknown
[2024-06-01 23:08:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:02] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:08:02] [INFO ] [Real]Absence check using state equation in 432 ms returned sat
[2024-06-01 23:08:03] [INFO ] [Real]Added 147 Read/Feed constraints in 170 ms returned sat
[2024-06-01 23:08:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:03] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:08:03] [INFO ] [Nat]Absence check using state equation in 434 ms returned sat
[2024-06-01 23:08:04] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:08:04] [INFO ] [Nat]Added 147 Read/Feed constraints in 1042 ms returned unknown
[2024-06-01 23:08:04] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:04] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:08:05] [INFO ] [Real]Absence check using state equation in 466 ms returned sat
[2024-06-01 23:08:05] [INFO ] [Real]Added 147 Read/Feed constraints in 287 ms returned sat
[2024-06-01 23:08:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 23:08:05] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:08:06] [INFO ] [Nat]Absence check using state equation in 424 ms returned sat
[2024-06-01 23:08:06] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:08:07] [INFO ] [Nat]Added 147 Read/Feed constraints in 1051 ms returned unknown
[2024-06-01 23:08:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:07] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:08:07] [INFO ] [Real]Absence check using state equation in 434 ms returned sat
[2024-06-01 23:08:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-06-01 23:08:07] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:08:08] [INFO ] [Nat]Absence check using state equation in 435 ms returned sat
[2024-06-01 23:08:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:08:09] [INFO ] [Nat]Added 147 Read/Feed constraints in 1042 ms returned unknown
[2024-06-01 23:08:09] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 23:08:09] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:08:09] [INFO ] [Real]Absence check using state equation in 458 ms returned sat
[2024-06-01 23:08:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:09] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:09] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:08:10] [INFO ] [Nat]Absence check using state equation in 474 ms returned sat
[2024-06-01 23:08:10] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:08:11] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
[2024-06-01 23:08:11] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:11] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-06-01 23:08:11] [INFO ] [Real]Absence check using state equation in 413 ms returned sat
[2024-06-01 23:08:12] [INFO ] [Real]Added 147 Read/Feed constraints in 324 ms returned sat
[2024-06-01 23:08:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2024-06-01 23:08:12] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-06-01 23:08:12] [INFO ] [Nat]Absence check using state equation in 428 ms returned sat
[2024-06-01 23:08:13] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:08:13] [INFO ] [Nat]Added 147 Read/Feed constraints in 1046 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[6, 2, 6, 0, 0, 0, 0] Max Struct:[6, 13, 13, 1, 1, 1, 1]
FORMULA Szymanski-PT-b06-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 6, 0, 0, 0, 0] Max Struct:[13, 13, 1, 1, 1, 1]
Support contains 6 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Graph (complete) has 9195 edges and 308 vertex of which 306 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.17 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 306 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 305 transition count 7808
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 305 transition count 7808
Applied a total of 131 rules in 454 ms. Remains 305 /308 variables (removed 3) and now considering 7808/8064 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 475 ms. Remains : 305/308 places, 7808/8064 transitions.
[2024-06-01 23:08:14] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2024-06-01 23:08:14] [INFO ] Computed 3 invariants in 27 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 6, 0, 0, 0, 0] Max Struct:[7, 7, 1, 1, 1, 1]
RANDOM walk for 1000005 steps (2 resets) in 1262 ms. (791 steps per ms)
BEST_FIRST walk for 6000006 steps (12 resets) in 5739 ms. (1045 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5, 6, 0, 0, 0, 0] Max Struct:[7, 7, 1, 1, 1, 1]
[2024-06-01 23:08:21] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:08:21] [INFO ] Invariant cache hit.
[2024-06-01 23:08:21] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:21] [INFO ] [Real]Absence check using state equation in 404 ms returned sat
[2024-06-01 23:08:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:08:22] [INFO ] [Real]Added 147 Read/Feed constraints in 132 ms returned sat
[2024-06-01 23:08:22] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:08:22] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-06-01 23:08:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:08:31] [INFO ] [Nat]Added 147 Read/Feed constraints in 9069 ms returned unknown
[2024-06-01 23:08:31] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:32] [INFO ] [Real]Absence check using state equation in 364 ms returned sat
[2024-06-01 23:08:32] [INFO ] [Real]Added 147 Read/Feed constraints in 331 ms returned sat
[2024-06-01 23:08:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:32] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2024-06-01 23:08:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:08:39] [INFO ] [Nat]Added 147 Read/Feed constraints in 6490 ms returned sat
[2024-06-01 23:08:39] [INFO ] Deduced a trap composed of 31 places in 552 ms of which 22 ms to minimize.
[2024-06-01 23:08:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 618 ms
[2024-06-01 23:08:40] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:40] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2024-06-01 23:08:40] [INFO ] [Real]Added 147 Read/Feed constraints in 166 ms returned sat
[2024-06-01 23:08:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:41] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-06-01 23:08:45] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:08:46] [INFO ] [Nat]Added 147 Read/Feed constraints in 5352 ms returned sat
[2024-06-01 23:08:47] [INFO ] Deduced a trap composed of 137 places in 534 ms of which 3 ms to minimize.
[2024-06-01 23:08:47] [INFO ] Deduced a trap composed of 132 places in 522 ms of which 2 ms to minimize.
[2024-06-01 23:08:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1252 ms
[2024-06-01 23:08:48] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 564 ms.
[2024-06-01 23:08:48] [INFO ] Added : 0 causal constraints over 0 iterations in 745 ms. Result :sat
Minimization took 4912 ms.
[2024-06-01 23:08:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:08:53] [INFO ] [Real]Absence check using state equation in 402 ms returned sat
[2024-06-01 23:08:54] [INFO ] [Real]Added 147 Read/Feed constraints in 90 ms returned sat
[2024-06-01 23:08:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:08:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:08:54] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2024-06-01 23:08:58] [INFO ] [Nat]Added 147 Read/Feed constraints in 4012 ms returned sat
[2024-06-01 23:08:59] [INFO ] Deduced a trap composed of 134 places in 524 ms of which 2 ms to minimize.
[2024-06-01 23:08:59] [INFO ] Deduced a trap composed of 137 places in 595 ms of which 6 ms to minimize.
[2024-06-01 23:08:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1328 ms
[2024-06-01 23:09:00] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 478 ms.
[2024-06-01 23:09:00] [INFO ] Added : 0 causal constraints over 0 iterations in 641 ms. Result :sat
Minimization took 4911 ms.
[2024-06-01 23:09:05] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:09:05] [INFO ] [Real]Absence check using state equation in 365 ms returned sat
[2024-06-01 23:09:05] [INFO ] [Real]Added 147 Read/Feed constraints in 86 ms returned sat
[2024-06-01 23:09:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:09:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:09:06] [INFO ] [Nat]Absence check using state equation in 387 ms returned sat
[2024-06-01 23:09:08] [INFO ] [Nat]Added 147 Read/Feed constraints in 1976 ms returned sat
[2024-06-01 23:09:09] [INFO ] Deduced a trap composed of 136 places in 583 ms of which 2 ms to minimize.
[2024-06-01 23:09:09] [INFO ] Deduced a trap composed of 144 places in 567 ms of which 2 ms to minimize.
[2024-06-01 23:09:10] [INFO ] Deduced a trap composed of 134 places in 530 ms of which 2 ms to minimize.
[2024-06-01 23:09:10] [INFO ] Deduced a trap composed of 137 places in 568 ms of which 2 ms to minimize.
[2024-06-01 23:09:11] [INFO ] Deduced a trap composed of 132 places in 588 ms of which 2 ms to minimize.
[2024-06-01 23:09:11] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3168 ms
[2024-06-01 23:09:11] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 353 ms.
[2024-06-01 23:09:12] [INFO ] Added : 0 causal constraints over 0 iterations in 518 ms. Result :sat
Minimization took 5102 ms.
[2024-06-01 23:09:17] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:09:17] [INFO ] [Real]Absence check using state equation in 355 ms returned sat
[2024-06-01 23:09:17] [INFO ] [Real]Added 147 Read/Feed constraints in 99 ms returned sat
[2024-06-01 23:09:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:09:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:09:18] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-06-01 23:09:19] [INFO ] [Nat]Added 147 Read/Feed constraints in 859 ms returned sat
[2024-06-01 23:09:19] [INFO ] Deduced a trap composed of 97 places in 540 ms of which 2 ms to minimize.
[2024-06-01 23:09:20] [INFO ] Deduced a trap composed of 136 places in 577 ms of which 2 ms to minimize.
[2024-06-01 23:09:20] [INFO ] Deduced a trap composed of 136 places in 567 ms of which 2 ms to minimize.
[2024-06-01 23:09:21] [INFO ] Deduced a trap composed of 153 places in 510 ms of which 3 ms to minimize.
[2024-06-01 23:09:22] [INFO ] Deduced a trap composed of 38 places in 497 ms of which 3 ms to minimize.
[2024-06-01 23:09:22] [INFO ] Deduced a trap composed of 50 places in 522 ms of which 2 ms to minimize.
[2024-06-01 23:09:23] [INFO ] Deduced a trap composed of 50 places in 474 ms of which 2 ms to minimize.
[2024-06-01 23:09:23] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4205 ms
[2024-06-01 23:09:23] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 369 ms.
[2024-06-01 23:09:23] [INFO ] Added : 2 causal constraints over 1 iterations in 617 ms. Result :sat
Minimization took 4918 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[5, 6, 0, 0, 0, 0] Max Struct:[7, 6, 1, 1, 1, 1]
FORMULA Szymanski-PT-b06-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5, 0, 0, 0, 0] Max Struct:[7, 1, 1, 1, 1]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 287 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 305/305 places, 7808/7808 transitions.
[2024-06-01 23:09:29] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:09:29] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5, 0, 0, 0, 0] Max Struct:[7, 1, 1, 1, 1]
RANDOM walk for 1000005 steps (2 resets) in 1235 ms. (809 steps per ms)
BEST_FIRST walk for 5000003 steps (10 resets) in 4821 ms. (1036 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[7, 1, 1, 1, 1]
[2024-06-01 23:09:35] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:09:35] [INFO ] Invariant cache hit.
[2024-06-01 23:09:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:09:35] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2024-06-01 23:09:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:09:35] [INFO ] [Real]Added 147 Read/Feed constraints in 243 ms returned sat
[2024-06-01 23:09:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:09:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:09:36] [INFO ] [Nat]Absence check using state equation in 402 ms returned sat
[2024-06-01 23:09:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:09:45] [INFO ] [Nat]Added 147 Read/Feed constraints in 9064 ms returned unknown
[2024-06-01 23:09:45] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-06-01 23:09:45] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2024-06-01 23:09:46] [INFO ] [Real]Added 147 Read/Feed constraints in 166 ms returned sat
[2024-06-01 23:09:46] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:09:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:09:46] [INFO ] [Nat]Absence check using state equation in 389 ms returned sat
[2024-06-01 23:09:51] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:09:51] [INFO ] [Nat]Added 147 Read/Feed constraints in 4684 ms returned sat
[2024-06-01 23:09:51] [INFO ] Deduced a trap composed of 37 places in 518 ms of which 2 ms to minimize.
[2024-06-01 23:09:52] [INFO ] Deduced a trap composed of 78 places in 511 ms of which 2 ms to minimize.
[2024-06-01 23:09:53] [INFO ] Deduced a trap composed of 84 places in 499 ms of which 2 ms to minimize.
[2024-06-01 23:09:53] [INFO ] Deduced a trap composed of 137 places in 555 ms of which 3 ms to minimize.
[2024-06-01 23:09:54] [INFO ] Deduced a trap composed of 136 places in 505 ms of which 2 ms to minimize.
[2024-06-01 23:09:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3149 ms
[2024-06-01 23:09:54] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 331 ms.
[2024-06-01 23:09:55] [INFO ] Added : 0 causal constraints over 0 iterations in 500 ms. Result :sat
Minimization took 4909 ms.
[2024-06-01 23:10:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:10:00] [INFO ] [Real]Absence check using state equation in 370 ms returned sat
[2024-06-01 23:10:00] [INFO ] [Real]Added 147 Read/Feed constraints in 87 ms returned sat
[2024-06-01 23:10:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:10:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:10:01] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2024-06-01 23:10:05] [INFO ] [Nat]Added 147 Read/Feed constraints in 4053 ms returned sat
[2024-06-01 23:10:05] [INFO ] Deduced a trap composed of 134 places in 567 ms of which 3 ms to minimize.
[2024-06-01 23:10:06] [INFO ] Deduced a trap composed of 137 places in 511 ms of which 3 ms to minimize.
[2024-06-01 23:10:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1273 ms
[2024-06-01 23:10:06] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 338 ms.
[2024-06-01 23:10:06] [INFO ] Added : 0 causal constraints over 0 iterations in 495 ms. Result :sat
Minimization took 5135 ms.
[2024-06-01 23:10:12] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:10:12] [INFO ] [Real]Absence check using state equation in 403 ms returned sat
[2024-06-01 23:10:12] [INFO ] [Real]Added 147 Read/Feed constraints in 87 ms returned sat
[2024-06-01 23:10:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:10:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:10:13] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2024-06-01 23:10:15] [INFO ] [Nat]Added 147 Read/Feed constraints in 2000 ms returned sat
[2024-06-01 23:10:15] [INFO ] Deduced a trap composed of 136 places in 531 ms of which 3 ms to minimize.
[2024-06-01 23:10:16] [INFO ] Deduced a trap composed of 144 places in 543 ms of which 3 ms to minimize.
[2024-06-01 23:10:16] [INFO ] Deduced a trap composed of 134 places in 520 ms of which 3 ms to minimize.
[2024-06-01 23:10:17] [INFO ] Deduced a trap composed of 137 places in 558 ms of which 3 ms to minimize.
[2024-06-01 23:10:17] [INFO ] Deduced a trap composed of 132 places in 518 ms of which 3 ms to minimize.
[2024-06-01 23:10:18] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3031 ms
[2024-06-01 23:10:18] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 335 ms.
[2024-06-01 23:10:18] [INFO ] Added : 0 causal constraints over 0 iterations in 499 ms. Result :sat
Minimization took 5102 ms.
[2024-06-01 23:10:23] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:10:24] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2024-06-01 23:10:24] [INFO ] [Real]Added 147 Read/Feed constraints in 94 ms returned sat
[2024-06-01 23:10:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:10:24] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2024-06-01 23:10:24] [INFO ] [Nat]Absence check using state equation in 371 ms returned sat
[2024-06-01 23:10:25] [INFO ] [Nat]Added 147 Read/Feed constraints in 815 ms returned sat
[2024-06-01 23:10:26] [INFO ] Deduced a trap composed of 97 places in 567 ms of which 4 ms to minimize.
[2024-06-01 23:10:26] [INFO ] Deduced a trap composed of 136 places in 524 ms of which 2 ms to minimize.
[2024-06-01 23:10:27] [INFO ] Deduced a trap composed of 136 places in 503 ms of which 2 ms to minimize.
[2024-06-01 23:10:27] [INFO ] Deduced a trap composed of 153 places in 500 ms of which 2 ms to minimize.
[2024-06-01 23:10:28] [INFO ] Deduced a trap composed of 38 places in 482 ms of which 3 ms to minimize.
[2024-06-01 23:10:28] [INFO ] Deduced a trap composed of 50 places in 504 ms of which 4 ms to minimize.
[2024-06-01 23:10:29] [INFO ] Deduced a trap composed of 50 places in 498 ms of which 2 ms to minimize.
[2024-06-01 23:10:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4092 ms
[2024-06-01 23:10:29] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 322 ms.
[2024-06-01 23:10:30] [INFO ] Added : 2 causal constraints over 1 iterations in 558 ms. Result :sat
Minimization took 5095 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[7, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[7, 1, 1, 1, 1]
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 288 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 303 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 220 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:10:35] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:10:35] [INFO ] Invariant cache hit.
[2024-06-01 23:10:36] [INFO ] Implicit Places using invariants in 657 ms returned []
[2024-06-01 23:10:36] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:10:36] [INFO ] Invariant cache hit.
[2024-06-01 23:10:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:10:51] [INFO ] Implicit Places using invariants and state equation in 15266 ms returned []
Implicit Place search using SMT with State Equation took 15926 ms to find 0 implicit places.
[2024-06-01 23:10:52] [INFO ] Redundant transitions in 939 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:10:52] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:10:52] [INFO ] Invariant cache hit.
[2024-06-01 23:10:52] [INFO ] State equation strengthened by 147 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/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30175 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:11:53] [INFO ] Deduced a trap composed of 138 places in 415 ms of which 2 ms to minimize.
[2024-06-01 23:11:55] [INFO ] Deduced a trap composed of 36 places in 413 ms of which 2 ms to minimize.
[2024-06-01 23:11:55] [INFO ] Deduced a trap composed of 49 places in 381 ms of which 2 ms to minimize.
[2024-06-01 23:11:56] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 2 ms to minimize.
[2024-06-01 23:11:56] [INFO ] Deduced a trap composed of 42 places in 291 ms of which 2 ms to minimize.
[2024-06-01 23:11:56] [INFO ] Deduced a trap composed of 42 places in 279 ms of which 2 ms to minimize.
[2024-06-01 23:11:56] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 2 ms to minimize.
[2024-06-01 23:11:57] [INFO ] Deduced a trap composed of 57 places in 415 ms of which 2 ms to minimize.
[2024-06-01 23:11:58] [INFO ] Deduced a trap composed of 57 places in 452 ms of which 2 ms to minimize.
[2024-06-01 23:11:58] [INFO ] Deduced a trap composed of 62 places in 432 ms of which 2 ms to minimize.
[2024-06-01 23:11:58] [INFO ] Deduced a trap composed of 70 places in 426 ms of which 2 ms to minimize.
[2024-06-01 23:11:59] [INFO ] Deduced a trap composed of 75 places in 443 ms of which 2 ms to minimize.
[2024-06-01 23:11:59] [INFO ] Deduced a trap composed of 102 places in 429 ms of which 2 ms to minimize.
[2024-06-01 23:12:00] [INFO ] Deduced a trap composed of 72 places in 267 ms of which 2 ms to minimize.
[2024-06-01 23:12:00] [INFO ] Deduced a trap composed of 101 places in 395 ms of which 4 ms to minimize.
[2024-06-01 23:12:01] [INFO ] Deduced a trap composed of 114 places in 369 ms of which 2 ms to minimize.
[2024-06-01 23:12:01] [INFO ] Deduced a trap composed of 78 places in 328 ms of which 2 ms to minimize.
[2024-06-01 23:12:01] [INFO ] Deduced a trap composed of 134 places in 266 ms of which 1 ms to minimize.
[2024-06-01 23:12:02] [INFO ] Deduced a trap composed of 137 places in 306 ms of which 2 ms to minimize.
[2024-06-01 23:12:02] [INFO ] Deduced a trap composed of 195 places in 234 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:12:07] [INFO ] Deduced a trap composed of 111 places in 376 ms of which 3 ms to minimize.
[2024-06-01 23:12:10] [INFO ] Deduced a trap composed of 195 places in 481 ms of which 2 ms to minimize.
[2024-06-01 23:12:11] [INFO ] Deduced a trap composed of 204 places in 479 ms of which 3 ms to minimize.
[2024-06-01 23:12:11] [INFO ] Deduced a trap composed of 209 places in 518 ms of which 2 ms to minimize.
[2024-06-01 23:12:12] [INFO ] Deduced a trap composed of 116 places in 476 ms of which 2 ms to minimize.
[2024-06-01 23:12:12] [INFO ] Deduced a trap composed of 136 places in 456 ms of which 2 ms to minimize.
[2024-06-01 23:12:13] [INFO ] Deduced a trap composed of 139 places in 448 ms of which 2 ms to minimize.
[2024-06-01 23:12:13] [INFO ] Deduced a trap composed of 208 places in 359 ms of which 2 ms to minimize.
[2024-06-01 23:12:15] [INFO ] Deduced a trap composed of 116 places in 326 ms of which 2 ms to minimize.
[2024-06-01 23:12:16] [INFO ] Deduced a trap composed of 146 places in 356 ms of which 2 ms to minimize.
[2024-06-01 23:12:16] [INFO ] Deduced a trap composed of 209 places in 339 ms of which 1 ms to minimize.
[2024-06-01 23:12:16] [INFO ] Deduced a trap composed of 208 places in 343 ms of which 1 ms to minimize.
[2024-06-01 23:12:17] [INFO ] Deduced a trap composed of 144 places in 250 ms of which 1 ms to minimize.
[2024-06-01 23:12:19] [INFO ] Deduced a trap composed of 64 places in 363 ms of which 2 ms to minimize.
[2024-06-01 23:12:20] [INFO ] Deduced a trap composed of 77 places in 441 ms of which 2 ms to minimize.
SMT process timed out in 87273ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 87381ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104522 ms. Remains : 305/305 places, 7808/7808 transitions.
[2024-06-01 23:12:20] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:12:20] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[7, 1, 1, 1, 1]
RANDOM walk for 1000005 steps (2 resets) in 1450 ms. (689 steps per ms)
BEST_FIRST walk for 5000004 steps (10 resets) in 3997 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[7, 1, 1, 1, 1]
[2024-06-01 23:12:25] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:12:25] [INFO ] Invariant cache hit.
[2024-06-01 23:12:25] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:12:26] [INFO ] [Real]Absence check using state equation in 406 ms returned sat
[2024-06-01 23:12:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:12:26] [INFO ] [Real]Added 147 Read/Feed constraints in 204 ms returned sat
[2024-06-01 23:12:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:12:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:12:26] [INFO ] [Nat]Absence check using state equation in 382 ms returned sat
[2024-06-01 23:12:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:12:35] [INFO ] [Nat]Added 147 Read/Feed constraints in 8397 ms returned sat
[2024-06-01 23:12:35] [INFO ] Deduced a trap composed of 31 places in 594 ms of which 2 ms to minimize.
[2024-06-01 23:12:35] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 649 ms
[2024-06-01 23:12:35] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:12:36] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2024-06-01 23:12:36] [INFO ] [Real]Added 147 Read/Feed constraints in 155 ms returned sat
[2024-06-01 23:12:36] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:12:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:12:36] [INFO ] [Nat]Absence check using state equation in 360 ms returned sat
[2024-06-01 23:12:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:12:42] [INFO ] [Nat]Added 147 Read/Feed constraints in 5210 ms returned sat
[2024-06-01 23:12:42] [INFO ] Deduced a trap composed of 37 places in 560 ms of which 2 ms to minimize.
[2024-06-01 23:12:43] [INFO ] Deduced a trap composed of 100 places in 557 ms of which 2 ms to minimize.
[2024-06-01 23:12:43] [INFO ] Deduced a trap composed of 124 places in 569 ms of which 2 ms to minimize.
[2024-06-01 23:12:44] [INFO ] Deduced a trap composed of 85 places in 512 ms of which 2 ms to minimize.
[2024-06-01 23:12:45] [INFO ] Deduced a trap composed of 142 places in 569 ms of which 2 ms to minimize.
[2024-06-01 23:12:45] [INFO ] Deduced a trap composed of 138 places in 528 ms of which 2 ms to minimize.
[2024-06-01 23:12:46] [INFO ] Deduced a trap composed of 74 places in 507 ms of which 2 ms to minimize.
[2024-06-01 23:12:46] [INFO ] Deduced a trap composed of 140 places in 414 ms of which 2 ms to minimize.
[2024-06-01 23:12:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4767 ms
[2024-06-01 23:12:47] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 353 ms.
[2024-06-01 23:12:47] [INFO ] Added : 0 causal constraints over 0 iterations in 519 ms. Result :sat
Minimization took 4912 ms.
[2024-06-01 23:12:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:12:52] [INFO ] [Real]Absence check using state equation in 384 ms returned sat
[2024-06-01 23:12:52] [INFO ] [Real]Added 147 Read/Feed constraints in 89 ms returned sat
[2024-06-01 23:12:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:12:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:12:53] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2024-06-01 23:12:57] [INFO ] [Nat]Added 147 Read/Feed constraints in 3859 ms returned sat
[2024-06-01 23:12:57] [INFO ] Deduced a trap composed of 134 places in 576 ms of which 2 ms to minimize.
[2024-06-01 23:12:58] [INFO ] Deduced a trap composed of 137 places in 571 ms of which 3 ms to minimize.
[2024-06-01 23:12:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1347 ms
[2024-06-01 23:12:58] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 368 ms.
[2024-06-01 23:12:59] [INFO ] Added : 0 causal constraints over 0 iterations in 530 ms. Result :sat
Minimization took 5051 ms.
[2024-06-01 23:13:04] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:13:04] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2024-06-01 23:13:04] [INFO ] [Real]Added 147 Read/Feed constraints in 82 ms returned sat
[2024-06-01 23:13:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:13:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:13:05] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2024-06-01 23:13:07] [INFO ] [Nat]Added 147 Read/Feed constraints in 1899 ms returned sat
[2024-06-01 23:13:07] [INFO ] Deduced a trap composed of 136 places in 544 ms of which 2 ms to minimize.
[2024-06-01 23:13:08] [INFO ] Deduced a trap composed of 144 places in 572 ms of which 2 ms to minimize.
[2024-06-01 23:13:08] [INFO ] Deduced a trap composed of 134 places in 559 ms of which 3 ms to minimize.
[2024-06-01 23:13:09] [INFO ] Deduced a trap composed of 137 places in 555 ms of which 2 ms to minimize.
[2024-06-01 23:13:10] [INFO ] Deduced a trap composed of 132 places in 523 ms of which 2 ms to minimize.
[2024-06-01 23:13:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3127 ms
[2024-06-01 23:13:10] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 362 ms.
[2024-06-01 23:13:10] [INFO ] Added : 0 causal constraints over 0 iterations in 517 ms. Result :sat
Minimization took 4913 ms.
[2024-06-01 23:13:15] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:13:16] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2024-06-01 23:13:16] [INFO ] [Real]Added 147 Read/Feed constraints in 89 ms returned sat
[2024-06-01 23:13:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:13:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:13:16] [INFO ] [Nat]Absence check using state equation in 374 ms returned sat
[2024-06-01 23:13:17] [INFO ] [Nat]Added 147 Read/Feed constraints in 792 ms returned sat
[2024-06-01 23:13:18] [INFO ] Deduced a trap composed of 97 places in 566 ms of which 2 ms to minimize.
[2024-06-01 23:13:18] [INFO ] Deduced a trap composed of 136 places in 510 ms of which 2 ms to minimize.
[2024-06-01 23:13:19] [INFO ] Deduced a trap composed of 136 places in 564 ms of which 2 ms to minimize.
[2024-06-01 23:13:20] [INFO ] Deduced a trap composed of 153 places in 567 ms of which 2 ms to minimize.
[2024-06-01 23:13:20] [INFO ] Deduced a trap composed of 38 places in 490 ms of which 2 ms to minimize.
[2024-06-01 23:13:21] [INFO ] Deduced a trap composed of 50 places in 489 ms of which 2 ms to minimize.
[2024-06-01 23:13:21] [INFO ] Deduced a trap composed of 50 places in 452 ms of which 1 ms to minimize.
[2024-06-01 23:13:21] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4129 ms
[2024-06-01 23:13:22] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 325 ms.
[2024-06-01 23:13:22] [INFO ] Added : 2 causal constraints over 1 iterations in 551 ms. Result :sat
Minimization took 4912 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[6, 0, 0, 0, 0] Max Struct:[6, 1, 1, 1, 1]
FORMULA Szymanski-PT-b06-UpperBounds-03 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7808/7808 transitions.
[2024-06-01 23:13:27] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:13:27] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000004 steps (2 resets) in 1332 ms. (750 steps per ms)
FORMULA Szymanski-PT-b06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000002 steps (8 resets) in 3302 ms. (1211 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 23:13:32] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:13:32] [INFO ] Invariant cache hit.
[2024-06-01 23:13:32] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:13:32] [INFO ] [Real]Absence check using state equation in 409 ms returned sat
[2024-06-01 23:13:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:13:32] [INFO ] [Real]Added 147 Read/Feed constraints in 176 ms returned sat
[2024-06-01 23:13:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:13:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:13:33] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2024-06-01 23:13:37] [INFO ] [Nat]Added 147 Read/Feed constraints in 4437 ms returned sat
[2024-06-01 23:13:38] [INFO ] Deduced a trap composed of 37 places in 560 ms of which 3 ms to minimize.
[2024-06-01 23:13:38] [INFO ] Deduced a trap composed of 78 places in 556 ms of which 2 ms to minimize.
[2024-06-01 23:13:39] [INFO ] Deduced a trap composed of 84 places in 556 ms of which 2 ms to minimize.
[2024-06-01 23:13:40] [INFO ] Deduced a trap composed of 137 places in 575 ms of which 2 ms to minimize.
[2024-06-01 23:13:40] [INFO ] Deduced a trap composed of 137 places in 558 ms of which 2 ms to minimize.
[2024-06-01 23:13:41] [INFO ] Deduced a trap composed of 136 places in 579 ms of which 2 ms to minimize.
[2024-06-01 23:13:42] [INFO ] Deduced a trap composed of 133 places in 561 ms of which 3 ms to minimize.
[2024-06-01 23:13:42] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4617 ms
[2024-06-01 23:13:42] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 302 ms.
[2024-06-01 23:13:42] [INFO ] Added : 0 causal constraints over 0 iterations in 456 ms. Result :sat
Minimization took 4914 ms.
[2024-06-01 23:13:47] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:13:48] [INFO ] [Real]Absence check using state equation in 407 ms returned sat
[2024-06-01 23:13:48] [INFO ] [Real]Added 147 Read/Feed constraints in 94 ms returned sat
[2024-06-01 23:13:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:13:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:13:48] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2024-06-01 23:13:50] [INFO ] [Nat]Added 147 Read/Feed constraints in 2051 ms returned sat
[2024-06-01 23:13:51] [INFO ] Deduced a trap composed of 136 places in 574 ms of which 2 ms to minimize.
[2024-06-01 23:13:52] [INFO ] Deduced a trap composed of 144 places in 593 ms of which 2 ms to minimize.
[2024-06-01 23:13:52] [INFO ] Deduced a trap composed of 134 places in 568 ms of which 2 ms to minimize.
[2024-06-01 23:13:53] [INFO ] Deduced a trap composed of 137 places in 565 ms of which 2 ms to minimize.
[2024-06-01 23:13:53] [INFO ] Deduced a trap composed of 132 places in 530 ms of which 2 ms to minimize.
[2024-06-01 23:13:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3178 ms
[2024-06-01 23:13:54] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 317 ms.
[2024-06-01 23:13:54] [INFO ] Added : 0 causal constraints over 0 iterations in 482 ms. Result :sat
Minimization took 4916 ms.
[2024-06-01 23:13:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:13:59] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-06-01 23:13:59] [INFO ] [Real]Added 147 Read/Feed constraints in 99 ms returned sat
[2024-06-01 23:14:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:14:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:14:00] [INFO ] [Nat]Absence check using state equation in 370 ms returned sat
[2024-06-01 23:14:01] [INFO ] [Nat]Added 147 Read/Feed constraints in 834 ms returned sat
[2024-06-01 23:14:01] [INFO ] Deduced a trap composed of 97 places in 595 ms of which 2 ms to minimize.
[2024-06-01 23:14:02] [INFO ] Deduced a trap composed of 136 places in 572 ms of which 2 ms to minimize.
[2024-06-01 23:14:03] [INFO ] Deduced a trap composed of 136 places in 587 ms of which 3 ms to minimize.
[2024-06-01 23:14:03] [INFO ] Deduced a trap composed of 153 places in 564 ms of which 2 ms to minimize.
[2024-06-01 23:14:04] [INFO ] Deduced a trap composed of 38 places in 567 ms of which 2 ms to minimize.
[2024-06-01 23:14:05] [INFO ] Deduced a trap composed of 50 places in 544 ms of which 2 ms to minimize.
[2024-06-01 23:14:05] [INFO ] Deduced a trap composed of 50 places in 502 ms of which 2 ms to minimize.
[2024-06-01 23:14:05] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4463 ms
[2024-06-01 23:14:06] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 355 ms.
[2024-06-01 23:14:06] [INFO ] Added : 2 causal constraints over 1 iterations in 596 ms. Result :sat
Minimization took 5196 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 211 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 305/305 places, 7808/7808 transitions.
[2024-06-01 23:14:11] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:14:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000003 steps (2 resets) in 1579 ms. (632 steps per ms)
BEST_FIRST walk for 3000002 steps (6 resets) in 2978 ms. (1007 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-01 23:14:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:14:16] [INFO ] Invariant cache hit.
[2024-06-01 23:14:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:14:16] [INFO ] [Real]Absence check using state equation in 399 ms returned sat
[2024-06-01 23:14:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:14:17] [INFO ] [Real]Added 147 Read/Feed constraints in 166 ms returned sat
[2024-06-01 23:14:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:14:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:14:17] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-06-01 23:14:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:14:22] [INFO ] [Nat]Added 147 Read/Feed constraints in 5062 ms returned sat
[2024-06-01 23:14:23] [INFO ] Deduced a trap composed of 53 places in 581 ms of which 3 ms to minimize.
[2024-06-01 23:14:23] [INFO ] Deduced a trap composed of 50 places in 547 ms of which 2 ms to minimize.
[2024-06-01 23:14:24] [INFO ] Deduced a trap composed of 84 places in 574 ms of which 2 ms to minimize.
[2024-06-01 23:14:25] [INFO ] Deduced a trap composed of 78 places in 516 ms of which 2 ms to minimize.
[2024-06-01 23:14:25] [INFO ] Deduced a trap composed of 142 places in 559 ms of which 2 ms to minimize.
[2024-06-01 23:14:26] [INFO ] Deduced a trap composed of 140 places in 553 ms of which 2 ms to minimize.
[2024-06-01 23:14:26] [INFO ] Deduced a trap composed of 134 places in 557 ms of which 2 ms to minimize.
[2024-06-01 23:14:27] [INFO ] Deduced a trap composed of 134 places in 568 ms of which 3 ms to minimize.
[2024-06-01 23:14:27] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4994 ms
[2024-06-01 23:14:27] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 320 ms.
[2024-06-01 23:14:28] [INFO ] Added : 0 causal constraints over 0 iterations in 487 ms. Result :sat
Minimization took 5197 ms.
[2024-06-01 23:14:33] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:14:33] [INFO ] [Real]Absence check using state equation in 410 ms returned sat
[2024-06-01 23:14:33] [INFO ] [Real]Added 147 Read/Feed constraints in 92 ms returned sat
[2024-06-01 23:14:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:14:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:14:34] [INFO ] [Nat]Absence check using state equation in 393 ms returned sat
[2024-06-01 23:14:36] [INFO ] [Nat]Added 147 Read/Feed constraints in 1898 ms returned sat
[2024-06-01 23:14:36] [INFO ] Deduced a trap composed of 136 places in 579 ms of which 2 ms to minimize.
[2024-06-01 23:14:37] [INFO ] Deduced a trap composed of 144 places in 550 ms of which 2 ms to minimize.
[2024-06-01 23:14:38] [INFO ] Deduced a trap composed of 134 places in 533 ms of which 2 ms to minimize.
[2024-06-01 23:14:38] [INFO ] Deduced a trap composed of 137 places in 533 ms of which 2 ms to minimize.
[2024-06-01 23:14:39] [INFO ] Deduced a trap composed of 132 places in 541 ms of which 2 ms to minimize.
[2024-06-01 23:14:39] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3077 ms
[2024-06-01 23:14:39] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 326 ms.
[2024-06-01 23:14:39] [INFO ] Added : 0 causal constraints over 0 iterations in 490 ms. Result :sat
Minimization took 5122 ms.
[2024-06-01 23:14:45] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:14:45] [INFO ] [Real]Absence check using state equation in 341 ms returned sat
[2024-06-01 23:14:45] [INFO ] [Real]Added 147 Read/Feed constraints in 89 ms returned sat
[2024-06-01 23:14:45] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:14:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:14:45] [INFO ] [Nat]Absence check using state equation in 376 ms returned sat
[2024-06-01 23:14:46] [INFO ] [Nat]Added 147 Read/Feed constraints in 810 ms returned sat
[2024-06-01 23:14:47] [INFO ] Deduced a trap composed of 97 places in 530 ms of which 2 ms to minimize.
[2024-06-01 23:14:47] [INFO ] Deduced a trap composed of 136 places in 527 ms of which 3 ms to minimize.
[2024-06-01 23:14:48] [INFO ] Deduced a trap composed of 136 places in 520 ms of which 2 ms to minimize.
[2024-06-01 23:14:49] [INFO ] Deduced a trap composed of 153 places in 514 ms of which 3 ms to minimize.
[2024-06-01 23:14:49] [INFO ] Deduced a trap composed of 38 places in 533 ms of which 2 ms to minimize.
[2024-06-01 23:14:50] [INFO ] Deduced a trap composed of 50 places in 520 ms of which 2 ms to minimize.
[2024-06-01 23:14:50] [INFO ] Deduced a trap composed of 50 places in 502 ms of which 3 ms to minimize.
[2024-06-01 23:14:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4159 ms
[2024-06-01 23:14:51] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2593 transitions) in 328 ms.
[2024-06-01 23:14:51] [INFO ] Added : 2 causal constraints over 1 iterations in 559 ms. Result :sat
Minimization took 5085 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:14:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:14:56] [INFO ] Invariant cache hit.
[2024-06-01 23:14:57] [INFO ] Implicit Places using invariants in 611 ms returned []
[2024-06-01 23:14:57] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:14:57] [INFO ] Invariant cache hit.
[2024-06-01 23:14:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:15:16] [INFO ] Implicit Places using invariants and state equation in 18483 ms returned []
Implicit Place search using SMT with State Equation took 19098 ms to find 0 implicit places.
[2024-06-01 23:15:16] [INFO ] Redundant transitions in 872 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:15:17] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:15:17] [INFO ] Invariant cache hit.
[2024-06-01 23:15:17] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30116 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:16:18] [INFO ] Deduced a trap composed of 138 places in 417 ms of which 1 ms to minimize.
[2024-06-01 23:16:20] [INFO ] Deduced a trap composed of 36 places in 426 ms of which 2 ms to minimize.
[2024-06-01 23:16:20] [INFO ] Deduced a trap composed of 49 places in 379 ms of which 2 ms to minimize.
[2024-06-01 23:16:20] [INFO ] Deduced a trap composed of 42 places in 315 ms of which 2 ms to minimize.
[2024-06-01 23:16:21] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 2 ms to minimize.
[2024-06-01 23:16:21] [INFO ] Deduced a trap composed of 42 places in 296 ms of which 2 ms to minimize.
[2024-06-01 23:16:21] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 1 ms to minimize.
[2024-06-01 23:16:22] [INFO ] Deduced a trap composed of 57 places in 391 ms of which 2 ms to minimize.
[2024-06-01 23:16:22] [INFO ] Deduced a trap composed of 57 places in 444 ms of which 2 ms to minimize.
[2024-06-01 23:16:23] [INFO ] Deduced a trap composed of 62 places in 411 ms of which 2 ms to minimize.
[2024-06-01 23:16:23] [INFO ] Deduced a trap composed of 70 places in 432 ms of which 2 ms to minimize.
[2024-06-01 23:16:24] [INFO ] Deduced a trap composed of 75 places in 367 ms of which 1 ms to minimize.
[2024-06-01 23:16:24] [INFO ] Deduced a trap composed of 102 places in 390 ms of which 2 ms to minimize.
[2024-06-01 23:16:24] [INFO ] Deduced a trap composed of 72 places in 261 ms of which 2 ms to minimize.
[2024-06-01 23:16:25] [INFO ] Deduced a trap composed of 101 places in 380 ms of which 2 ms to minimize.
[2024-06-01 23:16:25] [INFO ] Deduced a trap composed of 114 places in 404 ms of which 2 ms to minimize.
[2024-06-01 23:16:26] [INFO ] Deduced a trap composed of 78 places in 306 ms of which 2 ms to minimize.
[2024-06-01 23:16:26] [INFO ] Deduced a trap composed of 134 places in 279 ms of which 2 ms to minimize.
[2024-06-01 23:16:27] [INFO ] Deduced a trap composed of 137 places in 311 ms of which 2 ms to minimize.
[2024-06-01 23:16:27] [INFO ] Deduced a trap composed of 195 places in 241 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:16:31] [INFO ] Deduced a trap composed of 111 places in 355 ms of which 2 ms to minimize.
[2024-06-01 23:16:35] [INFO ] Deduced a trap composed of 195 places in 484 ms of which 3 ms to minimize.
[2024-06-01 23:16:35] [INFO ] Deduced a trap composed of 204 places in 485 ms of which 3 ms to minimize.
[2024-06-01 23:16:36] [INFO ] Deduced a trap composed of 209 places in 481 ms of which 2 ms to minimize.
[2024-06-01 23:16:36] [INFO ] Deduced a trap composed of 116 places in 462 ms of which 2 ms to minimize.
[2024-06-01 23:16:37] [INFO ] Deduced a trap composed of 136 places in 466 ms of which 2 ms to minimize.
[2024-06-01 23:16:37] [INFO ] Deduced a trap composed of 139 places in 476 ms of which 2 ms to minimize.
[2024-06-01 23:16:38] [INFO ] Deduced a trap composed of 208 places in 364 ms of which 1 ms to minimize.
[2024-06-01 23:16:39] [INFO ] Deduced a trap composed of 116 places in 312 ms of which 1 ms to minimize.
[2024-06-01 23:16:40] [INFO ] Deduced a trap composed of 146 places in 305 ms of which 1 ms to minimize.
[2024-06-01 23:16:40] [INFO ] Deduced a trap composed of 209 places in 335 ms of which 1 ms to minimize.
[2024-06-01 23:16:41] [INFO ] Deduced a trap composed of 208 places in 340 ms of which 1 ms to minimize.
[2024-06-01 23:16:41] [INFO ] Deduced a trap composed of 144 places in 234 ms of which 1 ms to minimize.
[2024-06-01 23:16:43] [INFO ] Deduced a trap composed of 64 places in 316 ms of which 1 ms to minimize.
[2024-06-01 23:16:44] [INFO ] Deduced a trap composed of 77 places in 415 ms of which 2 ms to minimize.
[2024-06-01 23:16:44] [INFO ] Deduced a trap composed of 72 places in 405 ms of which 2 ms to minimize.
[2024-06-01 23:16:44] [INFO ] Deduced a trap composed of 85 places in 367 ms of which 2 ms to minimize.
SMT process timed out in 87952ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 88021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108204 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40009 steps (8 resets) in 763 ms. (52 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 110 ms. (360 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 128108 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 6
Probabilistic random walk after 128108 steps, saw 67065 distinct states, run finished after 3005 ms. (steps per millisecond=42 ) properties seen :0
[2024-06-01 23:16:48] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:16:48] [INFO ] Invariant cache hit.
[2024-06-01 23:16:48] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 23:16:49] [INFO ] Deduced a trap composed of 72 places in 464 ms of which 2 ms to minimize.
[2024-06-01 23:16:49] [INFO ] Deduced a trap composed of 75 places in 457 ms of which 2 ms to minimize.
[2024-06-01 23:16:50] [INFO ] Deduced a trap composed of 130 places in 443 ms of which 2 ms to minimize.
[2024-06-01 23:16:50] [INFO ] Deduced a trap composed of 78 places in 454 ms of which 2 ms to minimize.
[2024-06-01 23:16:51] [INFO ] Deduced a trap composed of 135 places in 455 ms of which 2 ms to minimize.
[2024-06-01 23:16:51] [INFO ] Deduced a trap composed of 132 places in 410 ms of which 2 ms to minimize.
[2024-06-01 23:16:52] [INFO ] Deduced a trap composed of 144 places in 400 ms of which 2 ms to minimize.
[2024-06-01 23:16:52] [INFO ] Deduced a trap composed of 45 places in 438 ms of which 2 ms to minimize.
[2024-06-01 23:16:52] [INFO ] Deduced a trap composed of 154 places in 438 ms of which 2 ms to minimize.
[2024-06-01 23:16:53] [INFO ] Deduced a trap composed of 50 places in 362 ms of which 2 ms to minimize.
[2024-06-01 23:16:53] [INFO ] Deduced a trap composed of 138 places in 418 ms of which 2 ms to minimize.
SMT process timed out in 5224ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40006 steps (8 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 129394 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 6
Probabilistic random walk after 129394 steps, saw 67922 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 23:16:57] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:16:57] [INFO ] Invariant cache hit.
[2024-06-01 23:16:57] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 23:16:58] [INFO ] Deduced a trap composed of 72 places in 494 ms of which 2 ms to minimize.
[2024-06-01 23:16:58] [INFO ] Deduced a trap composed of 75 places in 435 ms of which 2 ms to minimize.
[2024-06-01 23:16:58] [INFO ] Deduced a trap composed of 130 places in 423 ms of which 2 ms to minimize.
[2024-06-01 23:16:59] [INFO ] Deduced a trap composed of 78 places in 467 ms of which 2 ms to minimize.
[2024-06-01 23:16:59] [INFO ] Deduced a trap composed of 135 places in 426 ms of which 2 ms to minimize.
[2024-06-01 23:17:00] [INFO ] Deduced a trap composed of 132 places in 456 ms of which 2 ms to minimize.
[2024-06-01 23:17:00] [INFO ] Deduced a trap composed of 144 places in 461 ms of which 2 ms to minimize.
[2024-06-01 23:17:01] [INFO ] Deduced a trap composed of 45 places in 453 ms of which 2 ms to minimize.
[2024-06-01 23:17:01] [INFO ] Deduced a trap composed of 154 places in 457 ms of which 2 ms to minimize.
[2024-06-01 23:17:02] [INFO ] Deduced a trap composed of 50 places in 359 ms of which 1 ms to minimize.
[2024-06-01 23:17:02] [INFO ] Deduced a trap composed of 138 places in 393 ms of which 2 ms to minimize.
[2024-06-01 23:17:03] [INFO ] Deduced a trap composed of 50 places in 395 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 23:17:03] [INFO ] Deduced a trap composed of 147 places in 520 ms of which 2 ms to minimize.
[2024-06-01 23:17:04] [INFO ] Deduced a trap composed of 148 places in 319 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 2604/2909 variables, 305/322 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 147/469 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 23:17:06] [INFO ] Deduced a trap composed of 84 places in 565 ms of which 2 ms to minimize.
[2024-06-01 23:17:07] [INFO ] Deduced a trap composed of 144 places in 563 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 2/471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 471 constraints, problems are : Problem set: 0 solved, 6 unsolved in 12657 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 16/16 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 253/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 23:17:10] [INFO ] Deduced a trap composed of 64 places in 370 ms of which 2 ms to minimize.
[2024-06-01 23:17:10] [INFO ] Deduced a trap composed of 137 places in 386 ms of which 2 ms to minimize.
[2024-06-01 23:17:11] [INFO ] Deduced a trap composed of 64 places in 389 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 4/22 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 23:17:12] [INFO ] Deduced a trap composed of 58 places in 501 ms of which 2 ms to minimize.
[2024-06-01 23:17:12] [INFO ] Deduced a trap composed of 88 places in 525 ms of which 2 ms to minimize.
[2024-06-01 23:17:13] [INFO ] Deduced a trap composed of 241 places in 564 ms of which 2 ms to minimize.
[2024-06-01 23:17:13] [INFO ] Deduced a trap composed of 248 places in 547 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 23:17:14] [INFO ] Deduced a trap composed of 252 places in 518 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 23:17:15] [INFO ] Deduced a trap composed of 74 places in 444 ms of which 2 ms to minimize.
[2024-06-01 23:17:15] [INFO ] Deduced a trap composed of 85 places in 394 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/305 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/305 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2604/2909 variables, 305/334 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2909 variables, 147/481 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2909 variables, 6/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2909 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/2909 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 487 constraints, problems are : Problem set: 0 solved, 6 unsolved in 9865 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 26/26 constraints]
After SMT, in 22548ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 2 properties in 731 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7808/7808 transitions.
RANDOM walk for 40006 steps (8 resets) in 118 ms. (336 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 130406 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 4
Probabilistic random walk after 130406 steps, saw 68614 distinct states, run finished after 3001 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 23:17:23] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:17:23] [INFO ] Invariant cache hit.
[2024-06-01 23:17:23] [INFO ] State equation strengthened by 147 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:17:24] [INFO ] Deduced a trap composed of 31 places in 464 ms of which 2 ms to minimize.
[2024-06-01 23:17:25] [INFO ] Deduced a trap composed of 36 places in 446 ms of which 2 ms to minimize.
[2024-06-01 23:17:25] [INFO ] Deduced a trap composed of 36 places in 444 ms of which 2 ms to minimize.
[2024-06-01 23:17:25] [INFO ] Deduced a trap composed of 78 places in 442 ms of which 2 ms to minimize.
[2024-06-01 23:17:26] [INFO ] Deduced a trap composed of 42 places in 418 ms of which 2 ms to minimize.
[2024-06-01 23:17:26] [INFO ] Deduced a trap composed of 37 places in 412 ms of which 2 ms to minimize.
[2024-06-01 23:17:27] [INFO ] Deduced a trap composed of 133 places in 460 ms of which 2 ms to minimize.
[2024-06-01 23:17:27] [INFO ] Deduced a trap composed of 141 places in 420 ms of which 2 ms to minimize.
[2024-06-01 23:17:28] [INFO ] Deduced a trap composed of 74 places in 352 ms of which 2 ms to minimize.
[2024-06-01 23:17:28] [INFO ] Deduced a trap composed of 44 places in 439 ms of which 2 ms to minimize.
[2024-06-01 23:17:28] [INFO ] Deduced a trap composed of 131 places in 433 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 19/305 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 2604/2909 variables, 305/319 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2909 variables, 147/466 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:17:31] [INFO ] Deduced a trap composed of 50 places in 593 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2909 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:17:32] [INFO ] Deduced a trap composed of 88 places in 557 ms of which 2 ms to minimize.
[2024-06-01 23:17:32] [INFO ] Deduced a trap composed of 84 places in 552 ms of which 2 ms to minimize.
[2024-06-01 23:17:33] [INFO ] Deduced a trap composed of 136 places in 558 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2909 variables, 3/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2909 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2909/2909 variables, and 470 constraints, problems are : Problem set: 0 solved, 4 unsolved in 10762 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 254/256 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/256 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 30/286 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/286 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:17:35] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 2 ms to minimize.
[2024-06-01 23:17:35] [INFO ] Deduced a trap composed of 130 places in 434 ms of which 2 ms to minimize.
[2024-06-01 23:17:36] [INFO ] Deduced a trap composed of 138 places in 444 ms of which 2 ms to minimize.
[2024-06-01 23:17:36] [INFO ] Deduced a trap composed of 141 places in 429 ms of which 1 ms to minimize.
[2024-06-01 23:17:37] [INFO ] Deduced a trap composed of 130 places in 440 ms of which 2 ms to minimize.
[2024-06-01 23:17:37] [INFO ] Deduced a trap composed of 185 places in 428 ms of which 2 ms to minimize.
[2024-06-01 23:17:37] [INFO ] Deduced a trap composed of 129 places in 425 ms of which 2 ms to minimize.
[2024-06-01 23:17:38] [INFO ] Deduced a trap composed of 154 places in 406 ms of which 2 ms to minimize.
[2024-06-01 23:17:38] [INFO ] Deduced a trap composed of 74 places in 432 ms of which 2 ms to minimize.
[2024-06-01 23:17:39] [INFO ] Deduced a trap composed of 131 places in 430 ms of which 3 ms to minimize.
[2024-06-01 23:17:39] [INFO ] Deduced a trap composed of 132 places in 397 ms of which 2 ms to minimize.
[2024-06-01 23:17:40] [INFO ] Deduced a trap composed of 129 places in 402 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/286 variables, 12/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 19/305 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/305 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 23:17:40] [INFO ] Deduced a trap composed of 171 places in 463 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/305 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/305 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 2604/2909 variables, 305/336 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2909 variables, 147/483 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2909 variables, 4/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2909 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/2909 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2909/2909 variables, and 487 constraints, problems are : Problem set: 0 solved, 4 unsolved in 9506 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 305/305 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 28/28 constraints]
After SMT, in 20295ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 744 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2024-06-01 23:17:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:17:45] [INFO ] Invariant cache hit.
[2024-06-01 23:17:45] [INFO ] Implicit Places using invariants in 594 ms returned []
[2024-06-01 23:17:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:17:45] [INFO ] Invariant cache hit.
[2024-06-01 23:17:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:18:00] [INFO ] Implicit Places using invariants and state equation in 14573 ms returned []
Implicit Place search using SMT with State Equation took 15169 ms to find 0 implicit places.
[2024-06-01 23:18:01] [INFO ] Redundant transitions in 612 ms returned []
Running 7806 sub problems to find dead transitions.
[2024-06-01 23:18:01] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:18:01] [INFO ] Invariant cache hit.
[2024-06-01 23:18:01] [INFO ] State equation strengthened by 147 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/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 305/2909 variables, and 3 constraints, problems are : Problem set: 0 solved, 7806 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7806/7806 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7806 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/305 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:19:03] [INFO ] Deduced a trap composed of 138 places in 379 ms of which 3 ms to minimize.
[2024-06-01 23:19:05] [INFO ] Deduced a trap composed of 36 places in 378 ms of which 2 ms to minimize.
[2024-06-01 23:19:05] [INFO ] Deduced a trap composed of 49 places in 383 ms of which 3 ms to minimize.
[2024-06-01 23:19:05] [INFO ] Deduced a trap composed of 42 places in 299 ms of which 2 ms to minimize.
[2024-06-01 23:19:06] [INFO ] Deduced a trap composed of 42 places in 320 ms of which 2 ms to minimize.
[2024-06-01 23:19:06] [INFO ] Deduced a trap composed of 42 places in 307 ms of which 2 ms to minimize.
[2024-06-01 23:19:06] [INFO ] Deduced a trap composed of 47 places in 269 ms of which 2 ms to minimize.
[2024-06-01 23:19:07] [INFO ] Deduced a trap composed of 57 places in 434 ms of which 2 ms to minimize.
[2024-06-01 23:19:08] [INFO ] Deduced a trap composed of 57 places in 446 ms of which 2 ms to minimize.
[2024-06-01 23:19:08] [INFO ] Deduced a trap composed of 62 places in 440 ms of which 2 ms to minimize.
[2024-06-01 23:19:08] [INFO ] Deduced a trap composed of 70 places in 484 ms of which 2 ms to minimize.
[2024-06-01 23:19:09] [INFO ] Deduced a trap composed of 75 places in 405 ms of which 2 ms to minimize.
[2024-06-01 23:19:09] [INFO ] Deduced a trap composed of 102 places in 401 ms of which 2 ms to minimize.
[2024-06-01 23:19:10] [INFO ] Deduced a trap composed of 72 places in 285 ms of which 1 ms to minimize.
[2024-06-01 23:19:10] [INFO ] Deduced a trap composed of 101 places in 432 ms of which 2 ms to minimize.
[2024-06-01 23:19:11] [INFO ] Deduced a trap composed of 114 places in 411 ms of which 2 ms to minimize.
[2024-06-01 23:19:11] [INFO ] Deduced a trap composed of 78 places in 320 ms of which 2 ms to minimize.
[2024-06-01 23:19:11] [INFO ] Deduced a trap composed of 134 places in 266 ms of which 2 ms to minimize.
[2024-06-01 23:19:12] [INFO ] Deduced a trap composed of 137 places in 302 ms of which 2 ms to minimize.
[2024-06-01 23:19:12] [INFO ] Deduced a trap composed of 195 places in 241 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/305 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 7806 unsolved
[2024-06-01 23:19:17] [INFO ] Deduced a trap composed of 111 places in 338 ms of which 5 ms to minimize.
[2024-06-01 23:19:20] [INFO ] Deduced a trap composed of 195 places in 441 ms of which 2 ms to minimize.
[2024-06-01 23:19:21] [INFO ] Deduced a trap composed of 204 places in 448 ms of which 2 ms to minimize.
[2024-06-01 23:19:21] [INFO ] Deduced a trap composed of 209 places in 466 ms of which 2 ms to minimize.
[2024-06-01 23:19:22] [INFO ] Deduced a trap composed of 116 places in 478 ms of which 2 ms to minimize.
[2024-06-01 23:19:22] [INFO ] Deduced a trap composed of 136 places in 440 ms of which 2 ms to minimize.
[2024-06-01 23:19:23] [INFO ] Deduced a trap composed of 139 places in 449 ms of which 2 ms to minimize.
[2024-06-01 23:19:23] [INFO ] Deduced a trap composed of 208 places in 378 ms of which 2 ms to minimize.
[2024-06-01 23:19:24] [INFO ] Deduced a trap composed of 116 places in 335 ms of which 2 ms to minimize.
[2024-06-01 23:19:25] [INFO ] Deduced a trap composed of 146 places in 360 ms of which 2 ms to minimize.
[2024-06-01 23:19:26] [INFO ] Deduced a trap composed of 209 places in 324 ms of which 2 ms to minimize.
[2024-06-01 23:19:26] [INFO ] Deduced a trap composed of 208 places in 310 ms of which 1 ms to minimize.
[2024-06-01 23:19:27] [INFO ] Deduced a trap composed of 144 places in 248 ms of which 1 ms to minimize.
[2024-06-01 23:19:28] [INFO ] Deduced a trap composed of 64 places in 314 ms of which 2 ms to minimize.
[2024-06-01 23:19:29] [INFO ] Deduced a trap composed of 77 places in 386 ms of which 2 ms to minimize.
[2024-06-01 23:19:29] [INFO ] Deduced a trap composed of 72 places in 414 ms of which 2 ms to minimize.
[2024-06-01 23:19:30] [INFO ] Deduced a trap composed of 85 places in 381 ms of which 2 ms to minimize.
SMT process timed out in 88985ms, After SMT, problems are : Problem set: 0 solved, 7806 unsolved
Search for dead transitions found 0 dead transitions in 89054ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105067 ms. Remains : 305/305 places, 7808/7808 transitions.
FORMULA Szymanski-PT-b06-UpperBounds-06 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0, 0] Max Struct:[1, 1]
Starting property specific reduction for Szymanski-PT-b06-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:19:30] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:19:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 10003 steps (2 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 12 ms. (769 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:19:30] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2024-06-01 23:19:30] [INFO ] Invariant cache hit.
[2024-06-01 23:19:30] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:19:30] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-06-01 23:19:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:19:30] [INFO ] [Real]Added 147 Read/Feed constraints in 92 ms returned sat
[2024-06-01 23:19:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:19:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:19:31] [INFO ] [Nat]Absence check using state equation in 390 ms returned sat
[2024-06-01 23:19:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-06-01 23:19:32] [INFO ] [Nat]Added 147 Read/Feed constraints in 1039 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p151) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 305/305 places, 7807/7807 transitions.
[2024-06-01 23:19:32] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
// Phase 1: matrix 2603 rows 305 cols
[2024-06-01 23:19:32] [INFO ] Computed 3 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000004 steps (2 resets) in 1273 ms. (784 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 869 ms. (1149 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-06-01 23:19:34] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:19:34] [INFO ] Invariant cache hit.
[2024-06-01 23:19:34] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-06-01 23:19:35] [INFO ] [Real]Absence check using state equation in 376 ms returned sat
[2024-06-01 23:19:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:19:35] [INFO ] [Real]Added 147 Read/Feed constraints in 68 ms returned sat
[2024-06-01 23:19:35] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 23:19:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-06-01 23:19:35] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2024-06-01 23:19:36] [INFO ] [Nat]Added 147 Read/Feed constraints in 1029 ms returned sat
[2024-06-01 23:19:37] [INFO ] Deduced a trap composed of 78 places in 572 ms of which 3 ms to minimize.
[2024-06-01 23:19:38] [INFO ] Deduced a trap composed of 129 places in 513 ms of which 2 ms to minimize.
[2024-06-01 23:19:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1276 ms
[2024-06-01 23:19:38] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 2592 transitions) in 324 ms.
[2024-06-01 23:19:38] [INFO ] Added : 0 causal constraints over 0 iterations in 488 ms. Result :sat
Minimization took 5018 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 305/305 places, 7807/7807 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7807/7807 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7807/7807 (removed 0) transitions.
[2024-06-01 23:19:44] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:19:44] [INFO ] Invariant cache hit.
[2024-06-01 23:19:44] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-06-01 23:19:44] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:19:44] [INFO ] Invariant cache hit.
[2024-06-01 23:19:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 23:20:06] [INFO ] Implicit Places using invariants and state equation in 22007 ms returned []
Implicit Place search using SMT with State Equation took 22612 ms to find 0 implicit places.
[2024-06-01 23:20:07] [INFO ] Redundant transitions in 630 ms returned []
Running 7805 sub problems to find dead transitions.
[2024-06-01 23:20:07] [INFO ] Flow matrix only has 2603 transitions (discarded 5204 similar events)
[2024-06-01 23:20:07] [INFO ] Invariant cache hit.
[2024-06-01 23:20:07] [INFO ] State equation strengthened by 147 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 1.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 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)
(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 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 304/2908 variables, and 2 constraints, problems are : Problem set: 0 solved, 7805 unsolved in 30112 ms.
Refiners :[Positive P Invariants (semi-flows): 2/3 constraints, State Equation: 0/305 constraints, ReadFeed: 0/147 constraints, PredecessorRefiner: 7805/7805 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7805 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7805 unsolved
[2024-06-01 23:21:10] [INFO ] Deduced a trap composed of 92 places in 475 ms of which 5 ms to minimize.
[2024-06-01 23:21:10] [INFO ] Deduced a trap composed of 93 places in 402 ms of which 1 ms to minimize.
[2024-06-01 23:21:11] [INFO ] Deduced a trap composed of 81 places in 351 ms of which 1 ms to minimize.
[2024-06-01 23:21:12] [INFO ] Deduced a trap composed of 31 places in 469 ms of which 1 ms to minimize.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-00
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-01
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-02
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-03
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-04
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-05
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-06
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-07
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-08
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-09
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-10
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-11
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-12
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-13
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-14
Could not compute solution for formula : Szymanski-PT-b06-UpperBounds-15

BK_STOP 1717284073122

--------------------
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 UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name Szymanski-PT-b06-UpperBounds-00
ub formula formula --maxsum=/tmp/1636/ub_0_
ub formula name Szymanski-PT-b06-UpperBounds-01
ub formula formula --maxsum=/tmp/1636/ub_1_
ub formula name Szymanski-PT-b06-UpperBounds-02
ub formula formula --maxsum=/tmp/1636/ub_2_
ub formula name Szymanski-PT-b06-UpperBounds-03
ub formula formula --maxsum=/tmp/1636/ub_3_
ub formula name Szymanski-PT-b06-UpperBounds-04
ub formula formula --maxsum=/tmp/1636/ub_4_
ub formula name Szymanski-PT-b06-UpperBounds-05
ub formula formula --maxsum=/tmp/1636/ub_5_
ub formula name Szymanski-PT-b06-UpperBounds-06
ub formula formula --maxsum=/tmp/1636/ub_6_
ub formula name Szymanski-PT-b06-UpperBounds-07
ub formula formula --maxsum=/tmp/1636/ub_7_
ub formula name Szymanski-PT-b06-UpperBounds-08
ub formula formula --maxsum=/tmp/1636/ub_8_
ub formula name Szymanski-PT-b06-UpperBounds-09
ub formula formula --maxsum=/tmp/1636/ub_9_
ub formula name Szymanski-PT-b06-UpperBounds-10
ub formula formula --maxsum=/tmp/1636/ub_10_
ub formula name Szymanski-PT-b06-UpperBounds-11
ub formula formula --maxsum=/tmp/1636/ub_11_
ub formula name Szymanski-PT-b06-UpperBounds-12
ub formula formula --maxsum=/tmp/1636/ub_12_
ub formula name Szymanski-PT-b06-UpperBounds-13
ub formula formula --maxsum=/tmp/1636/ub_13_
ub formula name Szymanski-PT-b06-UpperBounds-14
ub formula formula --maxsum=/tmp/1636/ub_14_
ub formula name Szymanski-PT-b06-UpperBounds-15
ub formula formula --maxsum=/tmp/1636/ub_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="Szymanski-PT-b06"
export BK_EXAMINATION="UpperBounds"
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 Szymanski-PT-b06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r536-tall-171690533300877"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-b06.tgz
mv Szymanski-PT-b06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;