fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654445500253
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBLF-PT-S02J06T08

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3509.479 322259.00 382904.00 125.00 0 0 1 1 8 1 1 10 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445500253.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBLF-PT-S02J06T08, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500253
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 24K Apr 11 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K Apr 11 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 30K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 163K Apr 11 17:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 13K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 251K Apr 11 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 58K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 295K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 807K 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 PolyORBLF-PT-S02J06T08-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T08-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716862741051

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-PT-S02J06T08
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:19:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 02:19:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:19:02] [INFO ] Load time of PNML (sax parser for PT used): 125 ms
[2024-05-28 02:19:02] [INFO ] Transformed 690 places.
[2024-05-28 02:19:02] [INFO ] Transformed 1434 transitions.
[2024-05-28 02:19:02] [INFO ] Parsed PT model containing 690 places and 1434 transitions and 6564 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Ensure Unique test removed 128 transitions
Reduce redundant transitions removed 128 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 1, 1, 0, 0, 9, 1, 0, 1, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 1, 1, 0, 0, 9, 1, 0, 1, 1, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 02:19:03] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
// Phase 1: matrix 1290 rows 690 cols
[2024-05-28 02:19:03] [INFO ] Computed 54 invariants in 112 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 1, 1, 0, 0, 9, 1, 0, 1, 1, 0, 0, 0, 0] Max Struct:[2464, 108, 1, 1, 8, 72, 64, 18, 1, 1, 1, 16, 8, 8, 8, 1]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (3 resets) in 88 ms. (112 steps per ms)
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 100006 steps (24 resets) in 398 ms. (250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 7, 1, 1, 10, 1, 1, 1, 1] Max Struct:[2464, 108, 8, 72, 64, 18, 16, 8, 8, 8]
[2024-05-28 02:19:03] [INFO ] Flow matrix only has 1290 transitions (discarded 16 similar events)
[2024-05-28 02:19:03] [INFO ] Invariant cache hit.
[2024-05-28 02:19:03] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2024-05-28 02:19:04] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 37 ms returned sat
[2024-05-28 02:19:05] [INFO ] [Real]Absence check using state equation in 979 ms returned sat
[2024-05-28 02:19:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:19:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-28 02:19:05] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 33 ms returned sat
[2024-05-28 02:19:07] [INFO ] [Nat]Absence check using state equation in 2445 ms returned sat
[2024-05-28 02:19:07] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:19:08] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 02:19:08] [INFO ] [Nat]Added 96 Read/Feed constraints in 1027 ms returned unknown
[2024-05-28 02:19:08] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-28 02:19:08] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 38 ms returned sat
[2024-05-28 02:19:09] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2024-05-28 02:19:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:19:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-28 02:19:10] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 29 ms returned sat
[2024-05-28 02:19:11] [INFO ] [Nat]Absence check using state equation in 1521 ms returned unknown
[2024-05-28 02:19:11] [INFO ] [Real]Absence check using 13 positive place invariants in 18 ms returned sat
[2024-05-28 02:19:11] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 30 ms returned sat
[2024-05-28 02:19:14] [INFO ] [Real]Absence check using state equation in 2431 ms returned sat
[2024-05-28 02:19:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:19:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 02:19:14] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 37 ms returned sat
[2024-05-28 02:19:17] [INFO ] [Nat]Absence check using state equation in 2617 ms returned unknown
[2024-05-28 02:19:17] [INFO ] [Real]Absence check using 13 positive place invariants in 12 ms returned sat
[2024-05-28 02:19:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 13 ms returned unsat
[2024-05-28 02:19:17] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 02:19:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 12 ms returned unsat
[2024-05-28 02:19:17] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-28 02:19:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 31 ms returned unsat
[2024-05-28 02:19:17] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 02:19:17] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 35 ms returned sat
[2024-05-28 02:19:19] [INFO ] [Real]Absence check using state equation in 1983 ms returned sat
[2024-05-28 02:19:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:19:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2024-05-28 02:19:19] [INFO ] [Nat]Absence check using 13 positive and 41 generalized place invariants in 51 ms returned sat
[2024-05-28 02:19:21] [INFO ] [Nat]Absence check using state equation in 2086 ms returned sat
[2024-05-28 02:19:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 02:19:22] [INFO ] [Nat]Added 96 Read/Feed constraints in 1037 ms returned unknown
[2024-05-28 02:19:23] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 02:19:23] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 13 ms returned unsat
[2024-05-28 02:19:23] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-28 02:19:23] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 13 ms returned unsat
[2024-05-28 02:19:23] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-28 02:19:23] [INFO ] [Real]Absence check using 13 positive and 41 generalized place invariants in 10 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 7, 1, 1, 10, 1, 1, 1, 1] Max Struct:[2464, 108, 8, 1, 1, 10, 16, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 7, 1] Max Struct:[2464, 108, 8, 16]
Support contains 4 out of 690 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 690/690 places, 1306/1306 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 688 transition count 1234
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 146 place count 616 transition count 1234
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 146 place count 616 transition count 1154
Deduced a syphon composed of 80 places in 3 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 306 place count 536 transition count 1154
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 2 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 432 place count 473 transition count 1091
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 2 with 16 rules applied. Total rules applied 448 place count 473 transition count 1075
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 464 place count 457 transition count 1075
Applied a total of 464 rules in 324 ms. Remains 457 /690 variables (removed 233) and now considering 1075/1306 (removed 231) transitions.
Running 1073 sub problems to find dead transitions.
[2024-05-28 02:19:23] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
// Phase 1: matrix 1059 rows 457 cols
[2024-05-28 02:19:23] [INFO ] Computed 52 invariants in 29 ms
[2024-05-28 02:19:23] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
[2024-05-28 02:19:34] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 26 ms to minimize.
[2024-05-28 02:19:34] [INFO ] Deduced a trap composed of 45 places in 123 ms of which 2 ms to minimize.
[2024-05-28 02:19:34] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 2 ms to minimize.
[2024-05-28 02:19:34] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-28 02:19:34] [INFO ] Deduced a trap composed of 44 places in 44 ms of which 1 ms to minimize.
[2024-05-28 02:19:35] [INFO ] Deduced a trap composed of 44 places in 317 ms of which 0 ms to minimize.
[2024-05-28 02:19:35] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:19:35] [INFO ] Deduced a trap composed of 46 places in 43 ms of which 1 ms to minimize.
[2024-05-28 02:19:35] [INFO ] Deduced a trap composed of 170 places in 199 ms of which 3 ms to minimize.
[2024-05-28 02:19:37] [INFO ] Deduced a trap composed of 88 places in 275 ms of which 3 ms to minimize.
[2024-05-28 02:19:37] [INFO ] Deduced a trap composed of 67 places in 203 ms of which 4 ms to minimize.
[2024-05-28 02:19:42] [INFO ] Deduced a trap composed of 179 places in 231 ms of which 4 ms to minimize.
[2024-05-28 02:19:42] [INFO ] Deduced a trap composed of 167 places in 293 ms of which 14 ms to minimize.
[2024-05-28 02:19:43] [INFO ] Deduced a trap composed of 19 places in 248 ms of which 3 ms to minimize.
[2024-05-28 02:19:43] [INFO ] Deduced a trap composed of 151 places in 241 ms of which 3 ms to minimize.
[2024-05-28 02:19:44] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 7 ms to minimize.
[2024-05-28 02:19:44] [INFO ] Deduced a trap composed of 54 places in 150 ms of which 2 ms to minimize.
[2024-05-28 02:19:44] [INFO ] Deduced a trap composed of 189 places in 328 ms of which 3 ms to minimize.
[2024-05-28 02:19:45] [INFO ] Deduced a trap composed of 180 places in 266 ms of which 4 ms to minimize.
[2024-05-28 02:19:45] [INFO ] Deduced a trap composed of 209 places in 257 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/1516 variables, and 70 constraints, problems are : Problem set: 0 solved, 1073 unsolved in 20039 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/457 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1073/1073 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1073 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 37/50 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/455 variables, 20/70 constraints. Problems are: Problem set: 0 solved, 1073 unsolved
[2024-05-28 02:20:00] [INFO ] Deduced a trap composed of 31 places in 188 ms of which 3 ms to minimize.
[2024-05-28 02:20:01] [INFO ] Deduced a trap composed of 166 places in 371 ms of which 4 ms to minimize.
[2024-05-28 02:20:01] [INFO ] Deduced a trap composed of 155 places in 320 ms of which 3 ms to minimize.
[2024-05-28 02:20:02] [INFO ] Deduced a trap composed of 269 places in 302 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 455/1516 variables, and 74 constraints, problems are : Problem set: 0 solved, 1073 unsolved in 20024 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/457 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1073 constraints, Known Traps: 24/24 constraints]
After SMT, in 42607ms problems are : Problem set: 0 solved, 1073 unsolved
Search for dead transitions found 0 dead transitions in 42663ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43028 ms. Remains : 457/690 places, 1075/1306 transitions.
[2024-05-28 02:20:06] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-05-28 02:20:06] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 7, 1] Max Struct:[2464, 108, 8, 16]
RANDOM walk for 1000000 steps (448 resets) in 5320 ms. (187 steps per ms)
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-04 8 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 3000003 steps (361 resets) in 6438 ms. (465 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
[2024-05-28 02:20:18] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-05-28 02:20:18] [INFO ] Invariant cache hit.
[2024-05-28 02:20:18] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-28 02:20:18] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 27 ms returned sat
[2024-05-28 02:20:19] [INFO ] [Real]Absence check using state equation in 1012 ms returned sat
[2024-05-28 02:20:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:20:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 30 ms returned sat
[2024-05-28 02:20:19] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 42 ms returned sat
[2024-05-28 02:20:22] [INFO ] [Nat]Absence check using state equation in 2717 ms returned sat
[2024-05-28 02:20:22] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:20:22] [INFO ] [Nat]Added 96 Read/Feed constraints in 284 ms returned sat
[2024-05-28 02:20:22] [INFO ] Deduced a trap composed of 224 places in 338 ms of which 4 ms to minimize.
[2024-05-28 02:20:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 536 ms
[2024-05-28 02:20:23] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 159 ms.
[2024-05-28 02:20:23] [INFO ] Added : 19 causal constraints over 4 iterations in 725 ms. Result :sat
Minimization took 4533 ms.
[2024-05-28 02:20:28] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2024-05-28 02:20:28] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 31 ms returned sat
[2024-05-28 02:20:29] [INFO ] [Real]Absence check using state equation in 1073 ms returned sat
[2024-05-28 02:20:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:20:29] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 02:20:29] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 26 ms returned sat
[2024-05-28 02:20:35] [INFO ] [Nat]Absence check using state equation in 5657 ms returned sat
[2024-05-28 02:20:36] [INFO ] [Nat]Added 96 Read/Feed constraints in 662 ms returned sat
[2024-05-28 02:20:36] [INFO ] Deduced a trap composed of 166 places in 370 ms of which 3 ms to minimize.
[2024-05-28 02:20:37] [INFO ] Deduced a trap composed of 194 places in 440 ms of which 4 ms to minimize.
[2024-05-28 02:20:37] [INFO ] Deduced a trap composed of 39 places in 280 ms of which 5 ms to minimize.
[2024-05-28 02:20:37] [INFO ] Deduced a trap composed of 204 places in 332 ms of which 3 ms to minimize.
[2024-05-28 02:20:38] [INFO ] Deduced a trap composed of 179 places in 350 ms of which 3 ms to minimize.
[2024-05-28 02:20:38] [INFO ] Deduced a trap composed of 19 places in 314 ms of which 3 ms to minimize.
[2024-05-28 02:20:39] [INFO ] Deduced a trap composed of 44 places in 361 ms of which 3 ms to minimize.
[2024-05-28 02:20:39] [INFO ] Deduced a trap composed of 45 places in 294 ms of which 4 ms to minimize.
[2024-05-28 02:20:40] [INFO ] Deduced a trap composed of 183 places in 371 ms of which 4 ms to minimize.
[2024-05-28 02:20:40] [INFO ] Deduced a trap composed of 175 places in 341 ms of which 5 ms to minimize.
[2024-05-28 02:20:41] [INFO ] Deduced a trap composed of 179 places in 303 ms of which 4 ms to minimize.
[2024-05-28 02:20:41] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5363 ms
[2024-05-28 02:20:41] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 93 ms.
[2024-05-28 02:20:53] [INFO ] Added : 10 causal constraints over 2 iterations in 11782 ms. Result :unknown
[2024-05-28 02:20:53] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 02:20:53] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 30 ms returned sat
[2024-05-28 02:20:55] [INFO ] [Real]Absence check using state equation in 2385 ms returned sat
[2024-05-28 02:20:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:20:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 02:20:56] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 31 ms returned sat
[2024-05-28 02:20:57] [INFO ] [Nat]Absence check using state equation in 1140 ms returned sat
[2024-05-28 02:20:57] [INFO ] [Nat]Added 96 Read/Feed constraints in 659 ms returned sat
[2024-05-28 02:20:57] [INFO ] Deduced a trap composed of 45 places in 70 ms of which 1 ms to minimize.
[2024-05-28 02:20:58] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 2 ms to minimize.
[2024-05-28 02:20:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 702 ms
[2024-05-28 02:20:58] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 81 ms.
[2024-05-28 02:20:59] [INFO ] Added : 41 causal constraints over 9 iterations in 919 ms. Result :sat
Minimization took 4680 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1075/1075 transitions.
Applied a total of 0 rules in 42 ms. Remains 457 /457 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 457/457 places, 1075/1075 transitions.
[2024-05-28 02:21:04] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-05-28 02:21:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
RANDOM walk for 1000000 steps (424 resets) in 4899 ms. (204 steps per ms)
BEST_FIRST walk for 3000001 steps (353 resets) in 6356 ms. (471 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
[2024-05-28 02:21:15] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-05-28 02:21:15] [INFO ] Invariant cache hit.
[2024-05-28 02:21:15] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 02:21:16] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 30 ms returned sat
[2024-05-28 02:21:17] [INFO ] [Real]Absence check using state equation in 1043 ms returned sat
[2024-05-28 02:21:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:21:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 02:21:17] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 29 ms returned sat
[2024-05-28 02:21:20] [INFO ] [Nat]Absence check using state equation in 2866 ms returned sat
[2024-05-28 02:21:20] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:21:20] [INFO ] [Nat]Added 96 Read/Feed constraints in 298 ms returned sat
[2024-05-28 02:21:20] [INFO ] Deduced a trap composed of 224 places in 285 ms of which 4 ms to minimize.
[2024-05-28 02:21:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 500 ms
[2024-05-28 02:21:20] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 76 ms.
[2024-05-28 02:21:21] [INFO ] Added : 19 causal constraints over 4 iterations in 432 ms. Result :sat
Minimization took 4502 ms.
[2024-05-28 02:21:25] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 02:21:25] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 30 ms returned sat
[2024-05-28 02:21:27] [INFO ] [Real]Absence check using state equation in 1062 ms returned sat
[2024-05-28 02:21:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:21:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2024-05-28 02:21:27] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 27 ms returned sat
[2024-05-28 02:21:32] [INFO ] [Nat]Absence check using state equation in 5664 ms returned sat
[2024-05-28 02:21:33] [INFO ] [Nat]Added 96 Read/Feed constraints in 937 ms returned sat
[2024-05-28 02:21:34] [INFO ] Deduced a trap composed of 44 places in 316 ms of which 5 ms to minimize.
[2024-05-28 02:21:34] [INFO ] Deduced a trap composed of 44 places in 332 ms of which 3 ms to minimize.
[2024-05-28 02:21:35] [INFO ] Deduced a trap composed of 44 places in 346 ms of which 4 ms to minimize.
[2024-05-28 02:21:35] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1350 ms
[2024-05-28 02:21:35] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 81 ms.
[2024-05-28 02:21:44] [INFO ] Added : 5 causal constraints over 1 iterations in 9126 ms. Result :unknown
[2024-05-28 02:21:44] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2024-05-28 02:21:44] [INFO ] [Real]Absence check using 13 positive and 39 generalized place invariants in 28 ms returned sat
[2024-05-28 02:21:46] [INFO ] [Real]Absence check using state equation in 2125 ms returned sat
[2024-05-28 02:21:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:21:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-05-28 02:21:46] [INFO ] [Nat]Absence check using 13 positive and 39 generalized place invariants in 18 ms returned sat
[2024-05-28 02:21:47] [INFO ] [Nat]Absence check using state equation in 998 ms returned sat
[2024-05-28 02:21:48] [INFO ] [Nat]Added 96 Read/Feed constraints in 655 ms returned sat
[2024-05-28 02:21:48] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
[2024-05-28 02:21:48] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 3 ms to minimize.
[2024-05-28 02:21:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 668 ms
[2024-05-28 02:21:49] [INFO ] Computed and/alt/rep : 417/1527/409 causal constraints (skipped 648 transitions) in 93 ms.
[2024-05-28 02:21:49] [INFO ] Added : 41 causal constraints over 9 iterations in 985 ms. Result :sat
Minimization took 4669 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Support contains 3 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1075/1075 transitions.
Applied a total of 0 rules in 45 ms. Remains 457 /457 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 457/457 places, 1075/1075 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1075/1075 transitions.
Applied a total of 0 rules in 36 ms. Remains 457 /457 variables (removed 0) and now considering 1075/1075 (removed 0) transitions.
[2024-05-28 02:21:54] [INFO ] Flow matrix only has 1059 transitions (discarded 16 similar events)
[2024-05-28 02:21:54] [INFO ] Invariant cache hit.
[2024-05-28 02:21:55] [INFO ] Implicit Places using invariants in 672 ms returned [43, 194, 231, 309, 325, 382, 387]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 683 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 450/457 places, 1075/1075 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 447 transition count 1072
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 447 transition count 1072
Applied a total of 6 rules in 61 ms. Remains 447 /450 variables (removed 3) and now considering 1072/1075 (removed 3) transitions.
[2024-05-28 02:21:55] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
// Phase 1: matrix 1056 rows 447 cols
[2024-05-28 02:21:55] [INFO ] Computed 45 invariants in 21 ms
[2024-05-28 02:21:56] [INFO ] Implicit Places using invariants in 627 ms returned []
[2024-05-28 02:21:56] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-05-28 02:21:56] [INFO ] Invariant cache hit.
[2024-05-28 02:21:57] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:22:03] [INFO ] Implicit Places using invariants and state equation in 7724 ms returned []
Implicit Place search using SMT with State Equation took 8356 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 447/457 places, 1072/1075 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 9136 ms. Remains : 447/457 places, 1072/1075 transitions.
[2024-05-28 02:22:03] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-05-28 02:22:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
RANDOM walk for 1000000 steps (443 resets) in 4708 ms. (212 steps per ms)
BEST_FIRST walk for 3000001 steps (364 resets) in 5949 ms. (504 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
[2024-05-28 02:22:14] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-05-28 02:22:14] [INFO ] Invariant cache hit.
[2024-05-28 02:22:14] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-28 02:22:14] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 22 ms returned sat
[2024-05-28 02:22:15] [INFO ] [Real]Absence check using state equation in 533 ms returned sat
[2024-05-28 02:22:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:22:15] [INFO ] [Nat]Absence check using 12 positive place invariants in 6 ms returned sat
[2024-05-28 02:22:15] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 22 ms returned sat
[2024-05-28 02:22:18] [INFO ] [Nat]Absence check using state equation in 2904 ms returned sat
[2024-05-28 02:22:18] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:22:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 02:22:27] [INFO ] [Nat]Added 96 Read/Feed constraints in 9012 ms returned unknown
[2024-05-28 02:22:27] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 02:22:27] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 21 ms returned sat
[2024-05-28 02:22:27] [INFO ] [Real]Absence check using state equation in 476 ms returned sat
[2024-05-28 02:22:27] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:22:27] [INFO ] [Nat]Absence check using 12 positive place invariants in 5 ms returned sat
[2024-05-28 02:22:27] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 20 ms returned sat
[2024-05-28 02:22:33] [INFO ] [Nat]Absence check using state equation in 5582 ms returned sat
[2024-05-28 02:22:33] [INFO ] [Nat]Added 96 Read/Feed constraints in 267 ms returned sat
[2024-05-28 02:22:33] [INFO ] Computed and/alt/rep : 411/1496/403 causal constraints (skipped 651 transitions) in 71 ms.
[2024-05-28 02:22:35] [INFO ] Deduced a trap composed of 153 places in 320 ms of which 4 ms to minimize.
[2024-05-28 02:22:35] [INFO ] Deduced a trap composed of 197 places in 317 ms of which 4 ms to minimize.
[2024-05-28 02:22:36] [INFO ] Deduced a trap composed of 186 places in 330 ms of which 3 ms to minimize.
[2024-05-28 02:22:36] [INFO ] Deduced a trap composed of 189 places in 359 ms of which 4 ms to minimize.
[2024-05-28 02:22:37] [INFO ] Deduced a trap composed of 184 places in 307 ms of which 3 ms to minimize.
[2024-05-28 02:22:38] [INFO ] Deduced a trap composed of 183 places in 282 ms of which 4 ms to minimize.
[2024-05-28 02:22:38] [INFO ] Deduced a trap composed of 177 places in 323 ms of which 3 ms to minimize.
[2024-05-28 02:22:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4945 ms
[2024-05-28 02:22:41] [INFO ] Deduced a trap composed of 45 places in 80 ms of which 2 ms to minimize.
[2024-05-28 02:22:41] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 1 ms to minimize.
[2024-05-28 02:22:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 345 ms
[2024-05-28 02:22:41] [INFO ] Added : 122 causal constraints over 26 iterations in 7839 ms. Result :sat
Minimization took 5073 ms.
[2024-05-28 02:22:46] [INFO ] [Real]Absence check using 12 positive place invariants in 8 ms returned sat
[2024-05-28 02:22:46] [INFO ] [Real]Absence check using 12 positive and 33 generalized place invariants in 30 ms returned sat
[2024-05-28 02:22:48] [INFO ] [Real]Absence check using state equation in 1227 ms returned sat
[2024-05-28 02:22:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:22:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 7 ms returned sat
[2024-05-28 02:22:48] [INFO ] [Nat]Absence check using 12 positive and 33 generalized place invariants in 28 ms returned sat
[2024-05-28 02:22:50] [INFO ] [Nat]Absence check using state equation in 2300 ms returned sat
[2024-05-28 02:22:50] [INFO ] [Nat]Added 96 Read/Feed constraints in 386 ms returned sat
[2024-05-28 02:22:51] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 2 ms to minimize.
[2024-05-28 02:22:51] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 02:22:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 478 ms
[2024-05-28 02:22:51] [INFO ] Computed and/alt/rep : 411/1496/403 causal constraints (skipped 651 transitions) in 79 ms.
[2024-05-28 02:22:53] [INFO ] Deduced a trap composed of 19 places in 305 ms of which 9 ms to minimize.
[2024-05-28 02:22:53] [INFO ] Deduced a trap composed of 185 places in 243 ms of which 3 ms to minimize.
[2024-05-28 02:22:54] [INFO ] Deduced a trap composed of 163 places in 298 ms of which 4 ms to minimize.
[2024-05-28 02:22:55] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 1 ms to minimize.
[2024-05-28 02:22:55] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-28 02:22:55] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
[2024-05-28 02:22:56] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 02:22:56] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3787 ms
[2024-05-28 02:22:56] [INFO ] Added : 87 causal constraints over 18 iterations in 5384 ms. Result :sat
Minimization took 4883 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[2464, 108, 16]
Support contains 3 out of 447 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1072/1072 transitions.
Applied a total of 0 rules in 51 ms. Remains 447 /447 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 447/447 places, 1072/1072 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 447/447 places, 1072/1072 transitions.
Applied a total of 0 rules in 35 ms. Remains 447 /447 variables (removed 0) and now considering 1072/1072 (removed 0) transitions.
[2024-05-28 02:23:01] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-05-28 02:23:01] [INFO ] Invariant cache hit.
[2024-05-28 02:23:02] [INFO ] Implicit Places using invariants in 600 ms returned []
[2024-05-28 02:23:02] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-05-28 02:23:02] [INFO ] Invariant cache hit.
[2024-05-28 02:23:03] [INFO ] State equation strengthened by 96 read => feed constraints.
[2024-05-28 02:23:10] [INFO ] Implicit Places using invariants and state equation in 8245 ms returned []
Implicit Place search using SMT with State Equation took 8847 ms to find 0 implicit places.
[2024-05-28 02:23:10] [INFO ] Redundant transitions in 81 ms returned []
Running 1070 sub problems to find dead transitions.
[2024-05-28 02:23:10] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-05-28 02:23:10] [INFO ] Invariant cache hit.
[2024-05-28 02:23:10] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-05-28 02:23:20] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 4 ms to minimize.
[2024-05-28 02:23:20] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-28 02:23:20] [INFO ] Deduced a trap composed of 45 places in 41 ms of which 1 ms to minimize.
[2024-05-28 02:23:20] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-28 02:23:20] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:23:20] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 02:23:20] [INFO ] Deduced a trap composed of 44 places in 242 ms of which 1 ms to minimize.
[2024-05-28 02:23:20] [INFO ] Deduced a trap composed of 45 places in 54 ms of which 2 ms to minimize.
[2024-05-28 02:23:21] [INFO ] Deduced a trap composed of 151 places in 282 ms of which 3 ms to minimize.
[2024-05-28 02:23:21] [INFO ] Deduced a trap composed of 173 places in 294 ms of which 4 ms to minimize.
[2024-05-28 02:23:23] [INFO ] Deduced a trap composed of 19 places in 169 ms of which 3 ms to minimize.
[2024-05-28 02:23:24] [INFO ] Deduced a trap composed of 64 places in 292 ms of which 4 ms to minimize.
[2024-05-28 02:23:26] [INFO ] Deduced a trap composed of 269 places in 294 ms of which 3 ms to minimize.
[2024-05-28 02:23:28] [INFO ] Deduced a trap composed of 185 places in 279 ms of which 3 ms to minimize.
[2024-05-28 02:23:28] [INFO ] Deduced a trap composed of 197 places in 301 ms of which 4 ms to minimize.
[2024-05-28 02:23:29] [INFO ] Deduced a trap composed of 197 places in 282 ms of which 4 ms to minimize.
[2024-05-28 02:23:29] [INFO ] Deduced a trap composed of 135 places in 193 ms of which 3 ms to minimize.
[2024-05-28 02:23:30] [INFO ] Deduced a trap composed of 191 places in 222 ms of which 3 ms to minimize.
[2024-05-28 02:23:30] [INFO ] Deduced a trap composed of 171 places in 288 ms of which 4 ms to minimize.
[2024-05-28 02:23:31] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-05-28 02:23:32] [INFO ] Deduced a trap composed of 55 places in 104 ms of which 2 ms to minimize.
[2024-05-28 02:23:39] [INFO ] Deduced a trap composed of 170 places in 303 ms of which 3 ms to minimize.
[2024-05-28 02:23:42] [INFO ] Deduced a trap composed of 207 places in 298 ms of which 4 ms to minimize.
[2024-05-28 02:23:42] [INFO ] Deduced a trap composed of 200 places in 265 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 445/1503 variables, and 67 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/447 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 1070/1070 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1070 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 31/43 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/445 variables, 24/67 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
[2024-05-28 02:24:02] [INFO ] Deduced a trap composed of 208 places in 204 ms of which 3 ms to minimize.
[2024-05-28 02:24:02] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 3 ms to minimize.
[2024-05-28 02:24:03] [INFO ] Deduced a trap composed of 180 places in 280 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/445 variables, 3/70 constraints. Problems are: Problem set: 0 solved, 1070 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 445/1503 variables, and 70 constraints, problems are : Problem set: 0 solved, 1070 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 31/33 constraints, State Equation: 0/447 constraints, ReadFeed: 0/96 constraints, PredecessorRefiner: 0/1070 constraints, Known Traps: 27/27 constraints]
After SMT, in 61938ms problems are : Problem set: 0 solved, 1070 unsolved
Search for dead transitions found 0 dead transitions in 61952ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70930 ms. Remains : 447/447 places, 1072/1072 transitions.
RANDOM walk for 40000 steps (19 resets) in 1963 ms. (20 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (12 resets) in 456 ms. (87 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 334 ms. (119 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (10 resets) in 285 ms. (139 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (10 resets) in 372 ms. (107 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 257 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 266 ms. (149 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 137136 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :0 out of 6
Probabilistic random walk after 137136 steps, saw 84456 distinct states, run finished after 3004 ms. (steps per millisecond=45 ) properties seen :0
[2024-05-28 02:24:17] [INFO ] Flow matrix only has 1056 transitions (discarded 16 similar events)
[2024-05-28 02:24:17] [INFO ] Invariant cache hit.
[2024-05-28 02:24:17] [INFO ] State equation strengthened by 96 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 248/251 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 64/315 variables, 8/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/14 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 1/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem MAX2 is UNSAT
At refinement iteration 7 (OVERLAPS) 126/443 variables, 27/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 0/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 2/445 variables, 2/44 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/44 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 1056/1501 variables, 445/489 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1501 variables, 96/585 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 0/585 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 2/1503 variables, 2/587 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1503 variables, 1/588 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1503 variables, 0/588 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/1503 variables, 0/588 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1503/1503 variables, and 588 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1885 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 447/447 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 248/251 variables, 6/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 64/315 variables, 8/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/14 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 2/317 variables, 1/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/15 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 126/443 variables, 27/42 constraints. Problems are: Problem set: 3 solved, 3 unsolved
[2024-05-28 02:24:19] [INFO ] Deduced a trap composed of 44 places in 171 ms of which 2 ms to minimize.
[2024-05-28 02:24:19] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2024-05-28 02:24:19] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-05-28 02:24:19] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2024-05-28 02:24:19] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2024-05-28 02:24:19] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 6/48 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/48 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 2/445 variables, 2/50 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/445 variables, 0/50 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1056/1501 variables, 445/495 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1501 variables, 96/591 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem MIN1 is UNSAT
At refinement iteration 14 (INCLUDED_ONLY) 0/1501 variables, 3/594 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-28 02:24:23] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 3 ms to minimize.
[2024-05-28 02:24:23] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 0 ms to minimize.
Problem MIN2 is UNSAT
Solver is answering 'unknown', stopping.
Problem MIN0 is UNSAT
After SMT solving in domain Int declared 1501/1503 variables, and 596 constraints, problems are : Problem set: 5 solved, 1 unsolved in 4241 ms.
Refiners :[Positive P Invariants (semi-flows): 11/12 constraints, Generalized P Invariants (flows): 33/33 constraints, State Equation: 445/447 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 8/8 constraints]
After SMT, in 6143ms problems are : Problem set: 5 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-11 1 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-01 0 TECHNIQUES REACHABILITY_MIN
FORMULA PolyORBLF-PT-S02J06T08-UpperBounds-00 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 3 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 320476 ms.
ITS solved all properties within timeout

BK_STOP 1716863063310

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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

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="PolyORBLF-PT-S02J06T08"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is PolyORBLF-PT-S02J06T08, 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 r289-tajo-171654445500253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 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 ;