About the Execution of GreatSPN+red for PolyORBLF-PT-S02J06T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 7994.632 | 3600000.00 | 5475540.00 | 648.40 | 2 1 2 1 ? 1 1 1 0 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-171654445500261.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-S02J06T10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445500261
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 34K Apr 11 17:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 179K Apr 11 17:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 35K Apr 11 17:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 170K 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 14K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 48K Apr 11 17:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 223K Apr 11 17:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Apr 11 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 191K Apr 11 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K 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 1.1M 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-S02J06T10-UpperBounds-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716863368448
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-S02J06T10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 02:29:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 02:29:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:29:30] [INFO ] Load time of PNML (sax parser for PT used): 268 ms
[2024-05-28 02:29:30] [INFO ] Transformed 844 places.
[2024-05-28 02:29:30] [INFO ] Transformed 1812 transitions.
[2024-05-28 02:29:30] [INFO ] Parsed PT model containing 844 places and 1812 transitions and 8302 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+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, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-28 02:29:30] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
// Phase 1: matrix 1632 rows 844 cols
[2024-05-28 02:29:31] [INFO ] Computed 58 invariants in 233 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 10, 1, 1, +inf, 87, 1, +inf, +inf, 87, +inf]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10001 steps (2 resets) in 156 ms. (63 steps per ms)
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 120010 steps (27 resets) in 606 ms. (197 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 2, 1, 0, 1, 0, 1, 1, 1, 1, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, 10, +inf, 87, +inf, +inf, 87, +inf]
[2024-05-28 02:29:32] [INFO ] Flow matrix only has 1632 transitions (discarded 20 similar events)
[2024-05-28 02:29:32] [INFO ] Invariant cache hit.
[2024-05-28 02:29:32] [INFO ] [Real]Absence check using 13 positive place invariants in 19 ms returned sat
[2024-05-28 02:29:32] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 39 ms returned unsat
[2024-05-28 02:29:32] [INFO ] [Real]Absence check using 13 positive place invariants in 32 ms returned sat
[2024-05-28 02:29:32] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 56 ms returned unsat
[2024-05-28 02:29:33] [INFO ] [Real]Absence check using 13 positive place invariants in 28 ms returned sat
[2024-05-28 02:29:33] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 15 ms returned unsat
[2024-05-28 02:29:33] [INFO ] [Real]Absence check using 13 positive place invariants in 30 ms returned sat
[2024-05-28 02:29:33] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 96 ms returned sat
[2024-05-28 02:29:36] [INFO ] [Real]Absence check using state equation in 3196 ms returned sat
[2024-05-28 02:29:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:29:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-28 02:29:37] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 38 ms returned sat
[2024-05-28 02:29:38] [INFO ] [Nat]Absence check using state equation in 1447 ms returned sat
[2024-05-28 02:29:38] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 02:29:38] [INFO ] [Nat]Added 120 Read/Feed constraints in 455 ms returned sat
[2024-05-28 02:29:39] [INFO ] Deduced a trap composed of 140 places in 530 ms of which 36 ms to minimize.
[2024-05-28 02:29:39] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 688 ms
[2024-05-28 02:29:39] [INFO ] [Real]Absence check using 13 positive place invariants in 31 ms returned sat
[2024-05-28 02:29:39] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 64 ms returned sat
[2024-05-28 02:29:41] [INFO ] [Real]Absence check using state equation in 1937 ms returned sat
[2024-05-28 02:29:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:29:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2024-05-28 02:29:42] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 40 ms returned sat
[2024-05-28 02:29:43] [INFO ] [Nat]Absence check using state equation in 1835 ms returned sat
[2024-05-28 02:29:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 02:29:44] [INFO ] [Nat]Added 120 Read/Feed constraints in 1013 ms returned unknown
[2024-05-28 02:29:45] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 02:29:45] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 4 ms returned unsat
[2024-05-28 02:29:45] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2024-05-28 02:29:45] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 43 ms returned sat
[2024-05-28 02:29:46] [INFO ] [Real]Absence check using state equation in 1262 ms returned sat
[2024-05-28 02:29:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 02:29:46] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 02:29:46] [INFO ] [Nat]Absence check using 13 positive and 45 generalized place invariants in 41 ms returned sat
[2024-05-28 02:29:49] [INFO ] [Nat]Absence check using state equation in 2294 ms returned unknown
[2024-05-28 02:29:49] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2024-05-28 02:29:49] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 65 ms returned unsat
[2024-05-28 02:29:49] [INFO ] [Real]Absence check using 13 positive place invariants in 36 ms returned sat
[2024-05-28 02:29:49] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 34 ms returned unsat
[2024-05-28 02:29:49] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2024-05-28 02:29:49] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 16 ms returned unsat
[2024-05-28 02:29:49] [INFO ] [Real]Absence check using 13 positive place invariants in 22 ms returned sat
[2024-05-28 02:29:50] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 57 ms returned unsat
[2024-05-28 02:29:50] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2024-05-28 02:29:50] [INFO ] [Real]Absence check using 13 positive and 45 generalized place invariants in 36 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 2, 1, 0, 1, 0, 1, 1, 1, 1, 1] Max Struct:[2, 1, 2, 1, +inf, 1, +inf, 1, 1, 1, 1, 1]
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-02 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
Support contains 11 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1652/1652 transitions.
Ensure Unique test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 92 rules applied. Total rules applied 92 place count 842 transition count 1562
Reduce places removed 90 places and 0 transitions.
Iterating post reduction 1 with 90 rules applied. Total rules applied 182 place count 752 transition count 1562
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 182 place count 752 transition count 1462
Deduced a syphon composed of 100 places in 3 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 382 place count 652 transition count 1462
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 7 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 542 place count 572 transition count 1382
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 562 place count 572 transition count 1362
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 582 place count 552 transition count 1362
Applied a total of 582 rules in 371 ms. Remains 552 /844 variables (removed 292) and now considering 1362/1652 (removed 290) transitions.
Running 1360 sub problems to find dead transitions.
[2024-05-28 02:29:50] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
// Phase 1: matrix 1342 rows 552 cols
[2024-05-28 02:29:50] [INFO ] Computed 56 invariants in 56 ms
[2024-05-28 02:29:50] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
[2024-05-28 02:30:08] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 17 ms to minimize.
[2024-05-28 02:30:08] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 3 ms to minimize.
[2024-05-28 02:30:09] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 3 ms to minimize.
[2024-05-28 02:30:09] [INFO ] Deduced a trap composed of 44 places in 76 ms of which 2 ms to minimize.
[2024-05-28 02:30:09] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-28 02:30:09] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2024-05-28 02:30:09] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 13 ms to minimize.
[2024-05-28 02:30:09] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2024-05-28 02:30:09] [INFO ] Deduced a trap composed of 44 places in 69 ms of which 1 ms to minimize.
[2024-05-28 02:30:09] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-28 02:30:10] [INFO ] Deduced a trap composed of 44 places in 40 ms of which 1 ms to minimize.
[2024-05-28 02:30:10] [INFO ] Deduced a trap composed of 47 places in 363 ms of which 4 ms to minimize.
[2024-05-28 02:30:11] [INFO ] Deduced a trap composed of 79 places in 348 ms of which 5 ms to minimize.
[2024-05-28 02:30:11] [INFO ] Deduced a trap composed of 186 places in 372 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 550/1894 variables, and 68 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20040 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1360/1360 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 37/54 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/550 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 1360 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 550/1894 variables, and 68 constraints, problems are : Problem set: 0 solved, 1360 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 37/39 constraints, State Equation: 0/552 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1360 constraints, Known Traps: 14/14 constraints]
After SMT, in 43818ms problems are : Problem set: 0 solved, 1360 unsolved
Search for dead transitions found 0 dead transitions in 43888ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44291 ms. Remains : 552/844 places, 1362/1652 transitions.
[2024-05-28 02:30:34] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
When looking for a positive semi flow solution, solver replied unsat
[2024-05-28 03:09:16] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 03:09:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[30, 360]
RANDOM walk for 1000000 steps (350 resets) in 6131 ms. (163 steps per ms)
BEST_FIRST walk for 2000001 steps (268 resets) in 5646 ms. (354 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[30, 360]
[2024-05-28 03:09:28] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 03:09:28] [INFO ] Invariant cache hit.
[2024-05-28 03:09:28] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2024-05-28 03:09:28] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 29 ms returned sat
[2024-05-28 03:09:29] [INFO ] [Real]Absence check using state equation in 1349 ms returned sat
[2024-05-28 03:09:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:09:29] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 03:09:29] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 21 ms returned sat
[2024-05-28 03:09:31] [INFO ] [Nat]Absence check using state equation in 1471 ms returned sat
[2024-05-28 03:09:31] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:09:31] [INFO ] [Nat]Added 120 Read/Feed constraints in 773 ms returned sat
[2024-05-28 03:09:32] [INFO ] Deduced a trap composed of 23 places in 355 ms of which 4 ms to minimize.
[2024-05-28 03:09:32] [INFO ] Deduced a trap composed of 207 places in 327 ms of which 3 ms to minimize.
[2024-05-28 03:09:33] [INFO ] Deduced a trap composed of 277 places in 335 ms of which 3 ms to minimize.
[2024-05-28 03:09:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1629 ms
[2024-05-28 03:09:33] [INFO ] Computed and/alt/rep : 410/928/400 causal constraints (skipped 940 transitions) in 147 ms.
[2024-05-28 03:09:34] [INFO ] Added : 25 causal constraints over 5 iterations in 966 ms. Result :sat
Minimization took 5420 ms.
[2024-05-28 03:09:40] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2024-05-28 03:09:40] [INFO ] [Real]Absence check using 17 positive and 39 generalized place invariants in 21 ms returned sat
[2024-05-28 03:09:40] [INFO ] [Real]Absence check using state equation in 743 ms returned sat
[2024-05-28 03:09:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:09:41] [INFO ] [Nat]Absence check using 17 positive place invariants in 11 ms returned sat
[2024-05-28 03:09:41] [INFO ] [Nat]Absence check using 17 positive and 39 generalized place invariants in 22 ms returned sat
[2024-05-28 03:09:41] [INFO ] [Nat]Absence check using state equation in 800 ms returned sat
[2024-05-28 03:09:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 03:09:50] [INFO ] [Nat]Added 120 Read/Feed constraints in 9016 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[30, 360]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[30, 360]
Support contains 11 out of 552 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 86 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 552/552 places, 1362/1362 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 552/552 places, 1362/1362 transitions.
Applied a total of 0 rules in 64 ms. Remains 552 /552 variables (removed 0) and now considering 1362/1362 (removed 0) transitions.
[2024-05-28 03:09:51] [INFO ] Flow matrix only has 1342 transitions (discarded 20 similar events)
[2024-05-28 03:09:51] [INFO ] Invariant cache hit.
[2024-05-28 03:09:51] [INFO ] Implicit Places using invariants in 793 ms returned [66, 133, 165, 292, 338, 367, 370, 408, 519, 550]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 802 ms to find 10 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 542/552 places, 1362/1362 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 533 transition count 1353
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 533 transition count 1353
Applied a total of 18 rules in 96 ms. Remains 533 /542 variables (removed 9) and now considering 1353/1362 (removed 9) transitions.
[2024-05-28 03:09:51] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
// Phase 1: matrix 1333 rows 533 cols
[2024-05-28 03:09:51] [INFO ] Computed 46 invariants in 34 ms
[2024-05-28 03:09:52] [INFO ] Implicit Places using invariants in 1006 ms returned []
[2024-05-28 03:09:52] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:09:52] [INFO ] Invariant cache hit.
[2024-05-28 03:09:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:10:05] [INFO ] Implicit Places using invariants and state equation in 12256 ms returned []
Implicit Place search using SMT with State Equation took 13281 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 533/552 places, 1353/1362 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 14246 ms. Remains : 533/552 places, 1353/1362 transitions.
[2024-05-28 03:10:05] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:10:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[30, 360]
RANDOM walk for 1000000 steps (329 resets) in 5890 ms. (169 steps per ms)
BEST_FIRST walk for 2000002 steps (266 resets) in 5248 ms. (381 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[30, 360]
[2024-05-28 03:10:16] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:10:16] [INFO ] Invariant cache hit.
[2024-05-28 03:10:16] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-28 03:10:16] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-28 03:10:17] [INFO ] [Real]Absence check using state equation in 975 ms returned sat
[2024-05-28 03:10:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:10:17] [INFO ] [Nat]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-28 03:10:17] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-28 03:10:20] [INFO ] [Nat]Absence check using state equation in 2662 ms returned sat
[2024-05-28 03:10:20] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:10:22] [INFO ] [Nat]Added 120 Read/Feed constraints in 2447 ms returned sat
[2024-05-28 03:10:23] [INFO ] Deduced a trap composed of 23 places in 330 ms of which 4 ms to minimize.
[2024-05-28 03:10:23] [INFO ] Deduced a trap composed of 226 places in 285 ms of which 4 ms to minimize.
[2024-05-28 03:10:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 765 ms
[2024-05-28 03:10:23] [INFO ] Computed and/alt/rep : 401/910/391 causal constraints (skipped 940 transitions) in 85 ms.
[2024-05-28 03:10:24] [INFO ] Added : 30 causal constraints over 6 iterations in 850 ms. Result :sat
Minimization took 4909 ms.
[2024-05-28 03:10:29] [INFO ] [Real]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 03:10:29] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 27 ms returned sat
[2024-05-28 03:10:30] [INFO ] [Real]Absence check using state equation in 805 ms returned sat
[2024-05-28 03:10:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:10:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-28 03:10:30] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 21 ms returned sat
[2024-05-28 03:10:39] [INFO ] [Nat]Absence check using state equation in 9362 ms returned sat
[2024-05-28 03:10:41] [INFO ] [Nat]Added 120 Read/Feed constraints in 1573 ms returned sat
[2024-05-28 03:10:41] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 1 ms to minimize.
[2024-05-28 03:10:41] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 2 ms to minimize.
[2024-05-28 03:10:41] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 1 ms to minimize.
[2024-05-28 03:10:42] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:10:42] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-28 03:10:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 677 ms
[2024-05-28 03:10:42] [INFO ] Computed and/alt/rep : 401/910/391 causal constraints (skipped 940 transitions) in 116 ms.
[2024-05-28 03:10:51] [INFO ] Added : 25 causal constraints over 5 iterations in 9637 ms. Result :unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[30, 360]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[30, 360]
Support contains 11 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 37 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 29 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-28 03:10:52] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:10:52] [INFO ] Invariant cache hit.
[2024-05-28 03:10:52] [INFO ] Implicit Places using invariants in 834 ms returned []
[2024-05-28 03:10:52] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:10:52] [INFO ] Invariant cache hit.
[2024-05-28 03:10:53] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:11:04] [INFO ] Implicit Places using invariants and state equation in 11963 ms returned []
Implicit Place search using SMT with State Equation took 12816 ms to find 0 implicit places.
[2024-05-28 03:11:04] [INFO ] Redundant transitions in 89 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-28 03:11:05] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:11:05] [INFO ] Invariant cache hit.
[2024-05-28 03:11:05] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:11:17] [INFO ] Deduced a trap composed of 44 places in 157 ms of which 2 ms to minimize.
[2024-05-28 03:11:17] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 2 ms to minimize.
[2024-05-28 03:11:18] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-05-28 03:11:18] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-28 03:11:18] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 3 ms to minimize.
[2024-05-28 03:11:18] [INFO ] Deduced a trap composed of 45 places in 57 ms of which 1 ms to minimize.
[2024-05-28 03:11:18] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 1 ms to minimize.
[2024-05-28 03:11:18] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:11:18] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 4 ms to minimize.
[2024-05-28 03:11:18] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 4 ms to minimize.
[2024-05-28 03:11:18] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2024-05-28 03:11:19] [INFO ] Deduced a trap composed of 45 places in 846 ms of which 0 ms to minimize.
[2024-05-28 03:11:20] [INFO ] Deduced a trap composed of 82 places in 258 ms of which 4 ms to minimize.
[2024-05-28 03:11:21] [INFO ] Deduced a trap composed of 186 places in 247 ms of which 3 ms to minimize.
[2024-05-28 03:11:25] [INFO ] Deduced a trap composed of 332 places in 275 ms of which 3 ms to minimize.
[2024-05-28 03:11:29] [INFO ] Deduced a trap composed of 178 places in 297 ms of which 3 ms to minimize.
[2024-05-28 03:11:29] [INFO ] Deduced a trap composed of 188 places in 247 ms of which 3 ms to minimize.
[2024-05-28 03:11:30] [INFO ] Deduced a trap composed of 243 places in 275 ms of which 3 ms to minimize.
[2024-05-28 03:11:30] [INFO ] Deduced a trap composed of 37 places in 130 ms of which 2 ms to minimize.
[2024-05-28 03:11:31] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:11:38] [INFO ] Deduced a trap composed of 200 places in 253 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 63310ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63339ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76290 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (19 resets) in 1417 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (11 resets) in 733 ms. (54 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (11 resets) in 368 ms. (108 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 485 ms. (82 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (11 resets) in 432 ms. (92 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 118406 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :0 out of 4
Probabilistic random walk after 118406 steps, saw 82225 distinct states, run finished after 3004 ms. (steps per millisecond=39 ) properties seen :0
[2024-05-28 03:12:12] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:12:12] [INFO ] Invariant cache hit.
[2024-05-28 03:12:12] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 2 solved, 2 unsolved in 2420 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 03:12:15] [INFO ] Deduced a trap composed of 44 places in 380 ms of which 3 ms to minimize.
[2024-05-28 03:12:15] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-05-28 03:12:16] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 2 ms to minimize.
[2024-05-28 03:12:16] [INFO ] Deduced a trap composed of 44 places in 100 ms of which 1 ms to minimize.
[2024-05-28 03:12:16] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 3 ms to minimize.
[2024-05-28 03:12:16] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 1 ms to minimize.
[2024-05-28 03:12:16] [INFO ] Deduced a trap composed of 44 places in 261 ms of which 1 ms to minimize.
[2024-05-28 03:12:16] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 8/52 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-05-28 03:12:16] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/54 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1864/1866 variables, and 585 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4105 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 531/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 9/9 constraints]
After SMT, in 6542ms problems are : Problem set: 2 solved, 2 unsolved
Parikh walk visited 0 properties in 300 ms.
Support contains 11 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 25 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Running 1351 sub problems to find dead transitions.
[2024-05-28 03:12:19] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:12:19] [INFO ] Invariant cache hit.
[2024-05-28 03:12:19] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:12:32] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 9 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 3 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 1 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 0 ms to minimize.
[2024-05-28 03:12:33] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:12:34] [INFO ] Deduced a trap composed of 82 places in 254 ms of which 3 ms to minimize.
[2024-05-28 03:12:36] [INFO ] Deduced a trap composed of 186 places in 295 ms of which 3 ms to minimize.
[2024-05-28 03:12:40] [INFO ] Deduced a trap composed of 332 places in 260 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 59 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:12:56] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 2 ms to minimize.
[2024-05-28 03:12:56] [INFO ] Deduced a trap composed of 222 places in 323 ms of which 4 ms to minimize.
[2024-05-28 03:12:57] [INFO ] Deduced a trap composed of 23 places in 125 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 62 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 18/18 constraints]
After SMT, in 43681ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 43696ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43740 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (14 resets) in 619 ms. (64 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (14 resets) in 262 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 294 ms. (135 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 128153 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 2
Probabilistic random walk after 128153 steps, saw 88647 distinct states, run finished after 3001 ms. (steps per millisecond=42 ) properties seen :0
[2024-05-28 03:13:06] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:13:06] [INFO ] Invariant cache hit.
[2024-05-28 03:13:06] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 2 unsolved in 978 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/308 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/396 variables, 10/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/406 variables, 5/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/406 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 124/530 variables, 24/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 03:13:08] [INFO ] Deduced a trap composed of 44 places in 172 ms of which 2 ms to minimize.
[2024-05-28 03:13:08] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2024-05-28 03:13:08] [INFO ] Deduced a trap composed of 44 places in 144 ms of which 2 ms to minimize.
[2024-05-28 03:13:08] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 1 ms to minimize.
[2024-05-28 03:13:08] [INFO ] Deduced a trap composed of 44 places in 102 ms of which 1 ms to minimize.
[2024-05-28 03:13:08] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 1 ms to minimize.
[2024-05-28 03:13:08] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2024-05-28 03:13:08] [INFO ] Deduced a trap composed of 45 places in 33 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 8/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-28 03:13:09] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1333/1864 variables, 531/585 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 120/705 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MIN1 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 2/707 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 03:13:12] [INFO ] Deduced a trap composed of 279 places in 341 ms of which 3 ms to minimize.
[2024-05-28 03:13:12] [INFO ] Deduced a trap composed of 251 places in 370 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1864 variables, 2/709 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1864 variables, 0/709 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 2/1866 variables, 2/711 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 1/712 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1866 variables, 0/712 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 712 constraints, problems are : Problem set: 1 solved, 1 unsolved in 5501 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 11/11 constraints]
After SMT, in 6522ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 68 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 68 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (18 resets) in 922 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 179729 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 1
Probabilistic random walk after 179729 steps, saw 122660 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
[2024-05-28 03:13:16] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:13:16] [INFO ] Invariant cache hit.
[2024-05-28 03:13:16] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1127 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:13:18] [INFO ] Deduced a trap composed of 44 places in 310 ms of which 3 ms to minimize.
[2024-05-28 03:13:18] [INFO ] Deduced a trap composed of 44 places in 318 ms of which 4 ms to minimize.
[2024-05-28 03:13:19] [INFO ] Deduced a trap composed of 44 places in 270 ms of which 3 ms to minimize.
[2024-05-28 03:13:19] [INFO ] Deduced a trap composed of 44 places in 284 ms of which 4 ms to minimize.
[2024-05-28 03:13:19] [INFO ] Deduced a trap composed of 44 places in 278 ms of which 3 ms to minimize.
[2024-05-28 03:13:19] [INFO ] Deduced a trap composed of 44 places in 262 ms of which 4 ms to minimize.
[2024-05-28 03:13:20] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 8 ms to minimize.
[2024-05-28 03:13:20] [INFO ] Deduced a trap composed of 248 places in 267 ms of which 3 ms to minimize.
[2024-05-28 03:13:20] [INFO ] Deduced a trap composed of 226 places in 263 ms of which 3 ms to minimize.
[2024-05-28 03:13:21] [INFO ] Deduced a trap composed of 201 places in 285 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1866 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:13:23] [INFO ] Deduced a trap composed of 250 places in 326 ms of which 3 ms to minimize.
[2024-05-28 03:13:25] [INFO ] Deduced a trap composed of 24 places in 378 ms of which 3 ms to minimize.
[2024-05-28 03:13:26] [INFO ] Deduced a trap composed of 23 places in 337 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1866 variables, 3/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1866 variables, 0/713 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 713 constraints, problems are : Problem set: 0 solved, 1 unsolved in 8597 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 9753ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 99 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 27 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 36 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-28 03:13:26] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:13:26] [INFO ] Invariant cache hit.
[2024-05-28 03:13:27] [INFO ] Implicit Places using invariants in 628 ms returned []
[2024-05-28 03:13:27] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:13:27] [INFO ] Invariant cache hit.
[2024-05-28 03:13:28] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:13:45] [INFO ] Implicit Places using invariants and state equation in 17879 ms returned []
Implicit Place search using SMT with State Equation took 18534 ms to find 0 implicit places.
[2024-05-28 03:13:45] [INFO ] Redundant transitions in 65 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-28 03:13:45] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:13:45] [INFO ] Invariant cache hit.
[2024-05-28 03:13:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:13:58] [INFO ] Deduced a trap composed of 44 places in 152 ms of which 3 ms to minimize.
[2024-05-28 03:13:58] [INFO ] Deduced a trap composed of 79 places in 158 ms of which 2 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 35 places in 155 ms of which 3 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 0 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 45 places in 49 ms of which 1 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 0 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:13:59] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-28 03:14:00] [INFO ] Deduced a trap composed of 82 places in 271 ms of which 3 ms to minimize.
[2024-05-28 03:14:02] [INFO ] Deduced a trap composed of 186 places in 261 ms of which 3 ms to minimize.
[2024-05-28 03:14:05] [INFO ] Deduced a trap composed of 332 places in 259 ms of which 3 ms to minimize.
[2024-05-28 03:14:09] [INFO ] Deduced a trap composed of 178 places in 293 ms of which 3 ms to minimize.
[2024-05-28 03:14:09] [INFO ] Deduced a trap composed of 188 places in 262 ms of which 3 ms to minimize.
[2024-05-28 03:14:10] [INFO ] Deduced a trap composed of 243 places in 266 ms of which 3 ms to minimize.
[2024-05-28 03:14:10] [INFO ] Deduced a trap composed of 37 places in 139 ms of which 2 ms to minimize.
[2024-05-28 03:14:11] [INFO ] Deduced a trap composed of 23 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:14:18] [INFO ] Deduced a trap composed of 200 places in 273 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 21/65 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 63525ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63551ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82211 ms. Remains : 533/533 places, 1353/1353 transitions.
FORMULA PolyORBLF-PT-S02J06T10-UpperBounds-08 0 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[0] Max Struct:[30]
Starting property specific reduction for PolyORBLF-PT-S02J06T10-UpperBounds-04
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:[30]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[30]
[2024-05-28 03:14:48] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:14:48] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 10000 steps (6 resets) in 73 ms. (135 steps per ms)
BEST_FIRST walk for 10000 steps (2 resets) in 30 ms. (322 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2024-05-28 03:14:48] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:14:48] [INFO ] Invariant cache hit.
[2024-05-28 03:14:49] [INFO ] [Real]Absence check using 17 positive place invariants in 6 ms returned sat
[2024-05-28 03:14:49] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 22 ms returned sat
[2024-05-28 03:14:49] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2024-05-28 03:14:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:14:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 8 ms returned sat
[2024-05-28 03:14:50] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 29 ms returned sat
[2024-05-28 03:14:53] [INFO ] [Nat]Absence check using state equation in 2931 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 37 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Running 1351 sub problems to find dead transitions.
[2024-05-28 03:14:53] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:14:53] [INFO ] Invariant cache hit.
[2024-05-28 03:14:53] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:15:06] [INFO ] Deduced a trap composed of 44 places in 149 ms of which 3 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 79 places in 180 ms of which 2 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 3 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 1 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 45 places in 55 ms of which 1 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 0 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2024-05-28 03:15:07] [INFO ] Deduced a trap composed of 45 places in 43 ms of which 1 ms to minimize.
[2024-05-28 03:15:08] [INFO ] Deduced a trap composed of 82 places in 348 ms of which 3 ms to minimize.
[2024-05-28 03:15:10] [INFO ] Deduced a trap composed of 186 places in 347 ms of which 3 ms to minimize.
[2024-05-28 03:15:14] [INFO ] Deduced a trap composed of 332 places in 353 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.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 1.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 4.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.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 1.0)
(s60 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 59 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:15:29] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 2 ms to minimize.
[2024-05-28 03:15:30] [INFO ] Deduced a trap composed of 222 places in 424 ms of which 4 ms to minimize.
[2024-05-28 03:15:31] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 62 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 18/18 constraints]
After SMT, in 43875ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 43894ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43935 ms. Remains : 533/533 places, 1353/1353 transitions.
[2024-05-28 03:15:37] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:15:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[30]
RANDOM walk for 1000000 steps (345 resets) in 6086 ms. (164 steps per ms)
BEST_FIRST walk for 1000001 steps (138 resets) in 2557 ms. (390 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[30]
[2024-05-28 03:15:45] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:15:45] [INFO ] Invariant cache hit.
[2024-05-28 03:15:45] [INFO ] [Real]Absence check using 17 positive place invariants in 7 ms returned sat
[2024-05-28 03:15:45] [INFO ] [Real]Absence check using 17 positive and 29 generalized place invariants in 23 ms returned sat
[2024-05-28 03:15:46] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2024-05-28 03:15:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 03:15:46] [INFO ] [Nat]Absence check using 17 positive place invariants in 9 ms returned sat
[2024-05-28 03:15:46] [INFO ] [Nat]Absence check using 17 positive and 29 generalized place invariants in 29 ms returned sat
[2024-05-28 03:15:49] [INFO ] [Nat]Absence check using state equation in 2522 ms returned sat
[2024-05-28 03:15:49] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:15:51] [INFO ] [Nat]Added 120 Read/Feed constraints in 2553 ms returned sat
[2024-05-28 03:15:52] [INFO ] Deduced a trap composed of 23 places in 323 ms of which 4 ms to minimize.
[2024-05-28 03:15:52] [INFO ] Deduced a trap composed of 226 places in 301 ms of which 4 ms to minimize.
[2024-05-28 03:15:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 762 ms
[2024-05-28 03:15:52] [INFO ] Computed and/alt/rep : 401/910/391 causal constraints (skipped 940 transitions) in 79 ms.
[2024-05-28 03:15:53] [INFO ] Added : 30 causal constraints over 6 iterations in 683 ms. Result :sat
Minimization took 4842 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[30]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[30]
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 47 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 36 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-28 03:15:58] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:15:58] [INFO ] Invariant cache hit.
[2024-05-28 03:15:58] [INFO ] Implicit Places using invariants in 730 ms returned []
[2024-05-28 03:15:58] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:15:58] [INFO ] Invariant cache hit.
[2024-05-28 03:16:00] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:16:17] [INFO ] Implicit Places using invariants and state equation in 18561 ms returned []
Implicit Place search using SMT with State Equation took 19293 ms to find 0 implicit places.
[2024-05-28 03:16:17] [INFO ] Redundant transitions in 68 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-28 03:16:17] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:16:17] [INFO ] Invariant cache hit.
[2024-05-28 03:16:17] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:16:31] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 79 places in 156 ms of which 3 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 35 places in 202 ms of which 2 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 2 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 1 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 44 places in 68 ms of which 1 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 03:16:32] [INFO ] Deduced a trap composed of 45 places in 35 ms of which 0 ms to minimize.
[2024-05-28 03:16:33] [INFO ] Deduced a trap composed of 82 places in 238 ms of which 3 ms to minimize.
[2024-05-28 03:16:35] [INFO ] Deduced a trap composed of 186 places in 255 ms of which 3 ms to minimize.
[2024-05-28 03:16:39] [INFO ] Deduced a trap composed of 332 places in 334 ms of which 4 ms to minimize.
[2024-05-28 03:16:44] [INFO ] Deduced a trap composed of 178 places in 326 ms of which 4 ms to minimize.
[2024-05-28 03:16:44] [INFO ] Deduced a trap composed of 188 places in 313 ms of which 3 ms to minimize.
[2024-05-28 03:16:45] [INFO ] Deduced a trap composed of 243 places in 320 ms of which 4 ms to minimize.
[2024-05-28 03:16:45] [INFO ] Deduced a trap composed of 37 places in 180 ms of which 3 ms to minimize.
[2024-05-28 03:16:47] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 64 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:17:11] [INFO ] Deduced a trap composed of 199 places in 249 ms of which 4 ms to minimize.
[2024-05-28 03:17:21] [INFO ] Deduced a trap composed of 168 places in 277 ms of which 3 ms to minimize.
SMT process timed out in 64104ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 64135ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83552 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (21 resets) in 358 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (9 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (11 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 134166 steps, run timeout after 3009 ms. (steps per millisecond=44 ) properties seen :0 out of 2
Probabilistic random walk after 134166 steps, saw 92664 distinct states, run finished after 3009 ms. (steps per millisecond=44 ) properties seen :0
[2024-05-28 03:17:25] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:17:25] [INFO ] Invariant cache hit.
[2024-05-28 03:17:25] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 03:17:25] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 4 ms to minimize.
[2024-05-28 03:17:25] [INFO ] Deduced a trap composed of 44 places in 258 ms of which 3 ms to minimize.
[2024-05-28 03:17:26] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 3 ms to minimize.
[2024-05-28 03:17:26] [INFO ] Deduced a trap composed of 45 places in 243 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/49 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/580 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/700 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 0/700 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/1866 variables, 2/702 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 1/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 0/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1866 variables, 0/703 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 703 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2270 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 4/48 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-28 03:17:27] [INFO ] Deduced a trap composed of 44 places in 316 ms of which 3 ms to minimize.
[2024-05-28 03:17:28] [INFO ] Deduced a trap composed of 44 places in 347 ms of which 3 ms to minimize.
[2024-05-28 03:17:28] [INFO ] Deduced a trap composed of 44 places in 302 ms of which 3 ms to minimize.
[2024-05-28 03:17:28] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 3 ms to minimize.
[2024-05-28 03:17:28] [INFO ] Deduced a trap composed of 45 places in 32 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 5/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1864/1866 variables, and 585 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2683 ms.
Refiners :[Positive P Invariants (semi-flows): 16/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 531/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 9/9 constraints]
After SMT, in 4978ms problems are : Problem set: 1 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 37 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Running 1351 sub problems to find dead transitions.
[2024-05-28 03:17:30] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:17:30] [INFO ] Invariant cache hit.
[2024-05-28 03:17:30] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 3 ms to minimize.
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 2 ms to minimize.
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 35 places in 151 ms of which 2 ms to minimize.
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 45 places in 56 ms of which 0 ms to minimize.
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2024-05-28 03:17:44] [INFO ] Deduced a trap composed of 44 places in 41 ms of which 1 ms to minimize.
[2024-05-28 03:17:45] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2024-05-28 03:17:45] [INFO ] Deduced a trap composed of 45 places in 40 ms of which 1 ms to minimize.
[2024-05-28 03:17:45] [INFO ] Deduced a trap composed of 82 places in 269 ms of which 3 ms to minimize.
[2024-05-28 03:17:47] [INFO ] Deduced a trap composed of 186 places in 237 ms of which 3 ms to minimize.
[2024-05-28 03:17:51] [INFO ] Deduced a trap composed of 332 places in 321 ms of which 4 ms to minimize.
(s161 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.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 1.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 0.0)
(s33 0.0)
(s34 5.0)
(s35 0.0)
(s36 1.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 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 1.0)
(s77 0.0)
(s78 0.0)
(s79 1.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 10.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 3.0)
(s104 1.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 (/ 2.0 3.0))
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 59 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20025 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 15/59 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:18:05] [INFO ] Deduced a trap composed of 55 places in 144 ms of which 2 ms to minimize.
[2024-05-28 03:18:06] [INFO ] Deduced a trap composed of 222 places in 267 ms of which 3 ms to minimize.
[2024-05-28 03:18:08] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 62 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 18/18 constraints]
After SMT, in 43977ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 43994ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44037 ms. Remains : 533/533 places, 1353/1353 transitions.
RANDOM walk for 40000 steps (18 resets) in 378 ms. (105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (10 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 189109 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 1
Probabilistic random walk after 189109 steps, saw 128806 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-28 03:18:17] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:18:17] [INFO ] Invariant cache hit.
[2024-05-28 03:18:17] [INFO ] State equation strengthened by 120 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/531 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1333/1864 variables, 531/576 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1864 variables, 120/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 0/696 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/1866 variables, 2/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1866 variables, 1/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1866 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1866/1866 variables, and 699 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 297/307 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/307 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 88/395 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/395 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 10/405 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/405 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 125/530 variables, 25/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:18:19] [INFO ] Deduced a trap composed of 44 places in 391 ms of which 4 ms to minimize.
[2024-05-28 03:18:19] [INFO ] Deduced a trap composed of 44 places in 323 ms of which 4 ms to minimize.
[2024-05-28 03:18:19] [INFO ] Deduced a trap composed of 44 places in 277 ms of which 6 ms to minimize.
[2024-05-28 03:18:20] [INFO ] Deduced a trap composed of 44 places in 297 ms of which 3 ms to minimize.
[2024-05-28 03:18:20] [INFO ] Deduced a trap composed of 44 places in 305 ms of which 3 ms to minimize.
[2024-05-28 03:18:20] [INFO ] Deduced a trap composed of 44 places in 303 ms of which 3 ms to minimize.
[2024-05-28 03:18:21] [INFO ] Deduced a trap composed of 44 places in 371 ms of which 4 ms to minimize.
[2024-05-28 03:18:21] [INFO ] Deduced a trap composed of 248 places in 266 ms of which 3 ms to minimize.
[2024-05-28 03:18:21] [INFO ] Deduced a trap composed of 226 places in 259 ms of which 3 ms to minimize.
[2024-05-28 03:18:21] [INFO ] Deduced a trap composed of 201 places in 269 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 10/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/531 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/531 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1333/1864 variables, 531/586 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1864 variables, 120/706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1864 variables, 1/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1864 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/1866 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1866 variables, 1/710 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 03:18:25] [INFO ] Deduced a trap composed of 213 places in 389 ms of which 4 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1866 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1866 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1866 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1866/1866 variables, and 711 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7173 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 533/533 constraints, ReadFeed: 120/120 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 8436ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 10 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 36 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 533/533 places, 1353/1353 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 1353/1353 transitions.
Applied a total of 0 rules in 31 ms. Remains 533 /533 variables (removed 0) and now considering 1353/1353 (removed 0) transitions.
[2024-05-28 03:18:25] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:18:25] [INFO ] Invariant cache hit.
[2024-05-28 03:18:26] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-05-28 03:18:26] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:18:26] [INFO ] Invariant cache hit.
[2024-05-28 03:18:27] [INFO ] State equation strengthened by 120 read => feed constraints.
[2024-05-28 03:18:45] [INFO ] Implicit Places using invariants and state equation in 18722 ms returned []
Implicit Place search using SMT with State Equation took 19475 ms to find 0 implicit places.
[2024-05-28 03:18:45] [INFO ] Redundant transitions in 22 ms returned []
Running 1351 sub problems to find dead transitions.
[2024-05-28 03:18:45] [INFO ] Flow matrix only has 1333 transitions (discarded 20 similar events)
[2024-05-28 03:18:45] [INFO ] Invariant cache hit.
[2024-05-28 03:18:45] [INFO ] State equation strengthened by 120 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 44 places in 146 ms of which 3 ms to minimize.
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 3 ms to minimize.
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 2 ms to minimize.
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 1 ms to minimize.
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 2 ms to minimize.
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2024-05-28 03:18:59] [INFO ] Deduced a trap composed of 44 places in 35 ms of which 1 ms to minimize.
[2024-05-28 03:19:00] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2024-05-28 03:19:00] [INFO ] Deduced a trap composed of 45 places in 39 ms of which 0 ms to minimize.
[2024-05-28 03:19:01] [INFO ] Deduced a trap composed of 82 places in 288 ms of which 3 ms to minimize.
[2024-05-28 03:19:02] [INFO ] Deduced a trap composed of 186 places in 261 ms of which 3 ms to minimize.
[2024-05-28 03:19:06] [INFO ] Deduced a trap composed of 332 places in 305 ms of which 3 ms to minimize.
[2024-05-28 03:19:11] [INFO ] Deduced a trap composed of 178 places in 317 ms of which 4 ms to minimize.
[2024-05-28 03:19:11] [INFO ] Deduced a trap composed of 188 places in 324 ms of which 4 ms to minimize.
[2024-05-28 03:19:12] [INFO ] Deduced a trap composed of 243 places in 308 ms of which 4 ms to minimize.
[2024-05-28 03:19:12] [INFO ] Deduced a trap composed of 37 places in 163 ms of which 3 ms to minimize.
[2024-05-28 03:19:13] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/1866 variables, and 64 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 1351/1351 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1351 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 27/44 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/531 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
[2024-05-28 03:19:40] [INFO ] Deduced a trap composed of 199 places in 349 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/1866 variables, and 65 constraints, problems are : Problem set: 0 solved, 1351 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 17/17 constraints, Generalized P Invariants (flows): 27/29 constraints, State Equation: 0/533 constraints, ReadFeed: 0/120 constraints, PredecessorRefiner: 0/1351 constraints, Known Traps: 21/21 constraints]
After SMT, in 63603ms problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 63622ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83164 ms. Remains : 533/533 places, 1353/1353 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[30]
Ending property specific reduction for PolyORBLF-PT-S02J06T10-UpperBounds-04 in 300070 ms.
[2024-05-28 03:19:49] [INFO ] Flatten gal took : 169 ms
[2024-05-28 03:19:49] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-28 03:19:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 533 places, 1353 transitions and 6973 arcs took 10 ms.
Total runtime 3019059 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBLF-PT-S02J06T10
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/421/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 533
TRANSITIONS: 1353
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.040s, Sys 0.005s]
SAVING FILE /home/mcc/execution/421/model (.net / .def) ...
EXPORT TIME: [User 0.006s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1554
MODEL NAME: /home/mcc/execution/421/model
533 places, 1353 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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-S02J06T10"
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-S02J06T10, 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-171654445500261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 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 '
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 ;