About the Execution of GreatSPN+red for DoubleLock-PT-p3s2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15093.544 | 1244425.00 | 3375133.00 | 1786.10 | TTTFFTFFFFTFT?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131500639.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DoubleLock-PT-p3s2, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131500639
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 764K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 330K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-00
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-01
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-02
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-03
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-04
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-05
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2023-06
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-07
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-08
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-09
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-10
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-11
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-12
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-13
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2024-14
FORMULA_NAME DoubleLock-PT-p3s2-ReachabilityFireability-2023-15
=== Now, execution of the tool begins
BK_START 1716398670146
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p3s2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 17:24:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 17:24:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 17:24:31] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2024-05-22 17:24:31] [INFO ] Transformed 112 places.
[2024-05-22 17:24:31] [INFO ] Transformed 744 transitions.
[2024-05-22 17:24:31] [INFO ] Parsed PT model containing 112 places and 744 transitions and 3008 arcs in 210 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 32 transitions.
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40015 steps (463 resets) in 1543 ms. (25 steps per ms) remains 11/14 properties
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (87 resets) in 309 ms. (129 steps per ms) remains 10/11 properties
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (94 resets) in 1173 ms. (34 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (85 resets) in 222 ms. (179 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (94 resets) in 164 ms. (242 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (100 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (101 resets) in 194 ms. (205 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (100 resets) in 55 ms. (714 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (76 resets) in 105 ms. (377 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (94 resets) in 133 ms. (298 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (107 resets) in 104 ms. (380 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (101 resets) in 50 ms. (784 steps per ms) remains 10/10 properties
[2024-05-22 17:24:32] [INFO ] Flow matrix only has 515 transitions (discarded 197 similar events)
// Phase 1: matrix 515 rows 92 cols
[2024-05-22 17:24:32] [INFO ] Computed 4 invariants in 17 ms
[2024-05-22 17:24:33] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-02 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-12 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 16/90 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/91 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 515/606 variables, 91/95 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/606 variables, 47/142 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 1/607 variables, 1/143 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/607 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/607 variables, 0/143 constraints. Problems are: Problem set: 2 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 607/607 variables, and 143 constraints, problems are : Problem set: 2 solved, 8 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 23/90 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 8 unsolved
[2024-05-22 17:24:34] [INFO ] Deduced a trap composed of 44 places in 275 ms of which 30 ms to minimize.
[2024-05-22 17:24:35] [INFO ] Deduced a trap composed of 31 places in 254 ms of which 16 ms to minimize.
[2024-05-22 17:24:35] [INFO ] Deduced a trap composed of 38 places in 112 ms of which 2 ms to minimize.
[2024-05-22 17:24:35] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 1 ms to minimize.
[2024-05-22 17:24:35] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 1 ms to minimize.
[2024-05-22 17:24:35] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 1 ms to minimize.
[2024-05-22 17:24:35] [INFO ] Deduced a trap composed of 50 places in 87 ms of which 1 ms to minimize.
[2024-05-22 17:24:35] [INFO ] Deduced a trap composed of 56 places in 99 ms of which 1 ms to minimize.
[2024-05-22 17:24:35] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2024-05-22 17:24:35] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-01 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-03 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-22 17:24:36] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 1 ms to minimize.
[2024-05-22 17:24:36] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 5 ms to minimize.
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2023-06 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2023-06 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-22 17:24:36] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2024-05-22 17:24:36] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 4 ms to minimize.
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-07 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-22 17:24:36] [INFO ] Deduced a trap composed of 47 places in 83 ms of which 1 ms to minimize.
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-11 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2024-14 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
Problem DoubleLock-PT-p3s2-ReachabilityFireability-2023-15 is UNSAT
FORMULA DoubleLock-PT-p3s2-ReachabilityFireability-2023-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 15/18 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/90 variables, 0/18 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/91 variables, 1/19 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/19 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 515/606 variables, 91/110 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 47/157 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/606 variables, 0/157 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/607 variables, 1/158 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/607 variables, 1/159 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/607 variables, 0/159 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/607 variables, 0/159 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 607/607 variables, and 159 constraints, problems are : Problem set: 9 solved, 1 unsolved in 2598 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 92/92 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/10 constraints, Known Traps: 15/15 constraints]
After SMT, in 3995ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 22 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 712/712 transitions.
Graph (complete) has 1229 edges and 92 vertex of which 89 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 89 transition count 708
Applied a total of 5 rules in 47 ms. Remains 89 /92 variables (removed 3) and now considering 708/712 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 89/92 places, 708/712 transitions.
RANDOM walk for 40010 steps (465 resets) in 92 ms. (430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (94 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 838254 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :0 out of 1
Probabilistic random walk after 838254 steps, saw 622397 distinct states, run finished after 3007 ms. (steps per millisecond=278 ) properties seen :0
[2024-05-22 17:24:40] [INFO ] Flow matrix only has 511 transitions (discarded 197 similar events)
// Phase 1: matrix 511 rows 89 cols
[2024-05-22 17:24:40] [INFO ] Computed 2 invariants in 9 ms
[2024-05-22 17:24:40] [INFO ] State equation strengthened by 47 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 502/558 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/600 variables, 33/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 9/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 138 constraints, problems are : Problem set: 0 solved, 1 unsolved in 447 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/56 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 502/558 variables, 56/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 38/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/558 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 42/600 variables, 33/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/600 variables, 9/138 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/600 variables, 1/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/600 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/600 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 600/600 variables, and 139 constraints, problems are : Problem set: 0 solved, 1 unsolved in 420 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 963ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 22 out of 89 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 708/708 transitions.
Applied a total of 0 rules in 16 ms. Remains 89 /89 variables (removed 0) and now considering 708/708 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 89/89 places, 708/708 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 89/89 places, 708/708 transitions.
Applied a total of 0 rules in 15 ms. Remains 89 /89 variables (removed 0) and now considering 708/708 (removed 0) transitions.
[2024-05-22 17:24:41] [INFO ] Flow matrix only has 511 transitions (discarded 197 similar events)
[2024-05-22 17:24:41] [INFO ] Invariant cache hit.
[2024-05-22 17:24:41] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-22 17:24:41] [INFO ] Flow matrix only has 511 transitions (discarded 197 similar events)
[2024-05-22 17:24:41] [INFO ] Invariant cache hit.
[2024-05-22 17:24:41] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-22 17:24:41] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2024-05-22 17:24:41] [INFO ] Redundant transitions in 34 ms returned []
Running 706 sub problems to find dead transitions.
[2024-05-22 17:24:41] [INFO ] Flow matrix only has 511 transitions (discarded 197 similar events)
[2024-05-22 17:24:41] [INFO ] Invariant cache hit.
[2024-05-22 17:24:41] [INFO ] State equation strengthened by 47 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (OVERLAPS) 511/600 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 706 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/600 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 706 unsolved
No progress, stopping.
After SMT solving in domain Real declared 600/600 variables, and 138 constraints, problems are : Problem set: 0 solved, 706 unsolved in 23073 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 706 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 3 (OVERLAPS) 511/600 variables, 89/91 constraints. Problems are: Problem set: 0 solved, 706 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 47/138 constraints. Problems are: Problem set: 0 solved, 706 unsolved
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
Problem TDEAD471 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD477 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD482 is UNSAT
Problem TDEAD486 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD495 is UNSAT
Problem TDEAD499 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD503 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD505 is UNSAT
Problem TDEAD506 is UNSAT
Problem TDEAD507 is UNSAT
Problem TDEAD508 is UNSAT
Problem TDEAD509 is UNSAT
Problem TDEAD510 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD512 is UNSAT
Problem TDEAD513 is UNSAT
Problem TDEAD514 is UNSAT
Problem TDEAD515 is UNSAT
Problem TDEAD516 is UNSAT
Problem TDEAD517 is UNSAT
Problem TDEAD518 is UNSAT
Problem TDEAD519 is UNSAT
Problem TDEAD520 is UNSAT
Problem TDEAD521 is UNSAT
Problem TDEAD522 is UNSAT
Problem TDEAD523 is UNSAT
Problem TDEAD524 is UNSAT
Problem TDEAD525 is UNSAT
Problem TDEAD526 is UNSAT
Problem TDEAD530 is UNSAT
Problem TDEAD531 is UNSAT
Problem TDEAD535 is UNSAT
Problem TDEAD536 is UNSAT
Problem TDEAD540 is UNSAT
Problem TDEAD543 is UNSAT
Problem TDEAD544 is UNSAT
Problem TDEAD548 is UNSAT
Problem TDEAD549 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD554 is UNSAT
Problem TDEAD556 is UNSAT
Problem TDEAD557 is UNSAT
Problem TDEAD558 is UNSAT
Problem TDEAD559 is UNSAT
Problem TDEAD560 is UNSAT
Problem TDEAD561 is UNSAT
Problem TDEAD562 is UNSAT
Problem TDEAD563 is UNSAT
Problem TDEAD564 is UNSAT
Problem TDEAD565 is UNSAT
Problem TDEAD566 is UNSAT
Problem TDEAD567 is UNSAT
Problem TDEAD568 is UNSAT
Problem TDEAD569 is UNSAT
Problem TDEAD570 is UNSAT
Problem TDEAD571 is UNSAT
Problem TDEAD572 is UNSAT
Problem TDEAD573 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD575 is UNSAT
Problem TDEAD576 is UNSAT
Problem TDEAD577 is UNSAT
Problem TDEAD578 is UNSAT
Problem TDEAD579 is UNSAT
Problem TDEAD580 is UNSAT
Problem TDEAD584 is UNSAT
Problem TDEAD585 is UNSAT
Problem TDEAD589 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD594 is UNSAT
Problem TDEAD597 is UNSAT
Problem TDEAD598 is UNSAT
Problem TDEAD602 is UNSAT
Problem TDEAD603 is UNSAT
Problem TDEAD607 is UNSAT
Problem TDEAD608 is UNSAT
Problem TDEAD610 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD612 is UNSAT
Problem TDEAD613 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD615 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD618 is UNSAT
Problem TDEAD619 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD621 is UNSAT
Problem TDEAD622 is UNSAT
Problem TDEAD623 is UNSAT
Problem TDEAD624 is UNSAT
Problem TDEAD625 is UNSAT
Problem TDEAD626 is UNSAT
Problem TDEAD627 is UNSAT
Problem TDEAD628 is UNSAT
Problem TDEAD629 is UNSAT
Problem TDEAD630 is UNSAT
Problem TDEAD631 is UNSAT
Problem TDEAD632 is UNSAT
Problem TDEAD633 is UNSAT
Problem TDEAD634 is UNSAT
Problem TDEAD638 is UNSAT
Problem TDEAD639 is UNSAT
Problem TDEAD643 is UNSAT
Problem TDEAD644 is UNSAT
Problem TDEAD648 is UNSAT
Problem TDEAD651 is UNSAT
Problem TDEAD652 is UNSAT
Problem TDEAD656 is UNSAT
Problem TDEAD657 is UNSAT
Problem TDEAD661 is UNSAT
Problem TDEAD662 is UNSAT
Problem TDEAD664 is UNSAT
Problem TDEAD665 is UNSAT
Problem TDEAD666 is UNSAT
Problem TDEAD667 is UNSAT
Problem TDEAD668 is UNSAT
Problem TDEAD669 is UNSAT
Problem TDEAD670 is UNSAT
Problem TDEAD671 is UNSAT
Problem TDEAD672 is UNSAT
Problem TDEAD673 is UNSAT
Problem TDEAD674 is UNSAT
Problem TDEAD675 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/600 variables, 706/844 constraints. Problems are: Problem set: 144 solved, 562 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/600 variables, 0/844 constraints. Problems are: Problem set: 144 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 600/600 variables, and 844 constraints, problems are : Problem set: 144 solved, 562 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 89/89 constraints, ReadFeed: 47/47 constraints, PredecessorRefiner: 706/706 constraints, Known Traps: 0/0 constraints]
After SMT, in 53816ms problems are : Problem set: 144 solved, 562 unsolved
Search for dead transitions found 144 dead transitions in 53824ms
Found 144 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 144 transitions
Dead transitions reduction (with SMT) removed 144 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 89/89 places, 564/708 transitions.
Graph (complete) has 966 edges and 89 vertex of which 83 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 83 /89 variables (removed 6) and now considering 564/564 (removed 0) transitions.
[2024-05-22 17:25:35] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
// Phase 1: matrix 385 rows 83 cols
[2024-05-22 17:25:35] [INFO ] Computed 1 invariants in 3 ms
[2024-05-22 17:25:35] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-05-22 17:25:35] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-05-22 17:25:35] [INFO ] Invariant cache hit.
[2024-05-22 17:25:35] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:25:35] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 83/89 places, 564/708 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 54530 ms. Remains : 83/89 places, 564/708 transitions.
RANDOM walk for 40014 steps (475 resets) in 56 ms. (702 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (92 resets) in 58 ms. (678 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1063117 steps, run timeout after 3001 ms. (steps per millisecond=354 ) properties seen :0 out of 1
Probabilistic random walk after 1063117 steps, saw 798877 distinct states, run finished after 3001 ms. (steps per millisecond=354 ) properties seen :0
[2024-05-22 17:25:38] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-05-22 17:25:38] [INFO ] Invariant cache hit.
[2024-05-22 17:25:38] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 323/351 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 24/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 117/468 variables, 55/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 17/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/468 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 125 constraints, problems are : Problem set: 0 solved, 1 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 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/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/28 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 323/351 variables, 28/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 24/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 117/468 variables, 55/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 17/125 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 1/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/468 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 468/468 variables, and 126 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 22 out of 83 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 564/564 transitions.
Applied a total of 0 rules in 11 ms. Remains 83 /83 variables (removed 0) and now considering 564/564 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 83/83 places, 564/564 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 83/83 places, 564/564 transitions.
Applied a total of 0 rules in 12 ms. Remains 83 /83 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2024-05-22 17:25:39] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-05-22 17:25:39] [INFO ] Invariant cache hit.
[2024-05-22 17:25:39] [INFO ] Implicit Places using invariants in 63 ms returned []
[2024-05-22 17:25:39] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-05-22 17:25:39] [INFO ] Invariant cache hit.
[2024-05-22 17:25:39] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-22 17:25:39] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2024-05-22 17:25:39] [INFO ] Redundant transitions in 5 ms returned []
Running 562 sub problems to find dead transitions.
[2024-05-22 17:25:39] [INFO ] Flow matrix only has 385 transitions (discarded 179 similar events)
[2024-05-22 17:25:39] [INFO ] Invariant cache hit.
[2024-05-22 17:25:39] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (OVERLAPS) 385/466 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 5 (OVERLAPS) 2/468 variables, 2/125 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 7 (OVERLAPS) 0/468 variables, 0/125 constraints. Problems are: Problem set: 0 solved, 562 unsolved
No progress, stopping.
After SMT solving in domain Real declared 468/468 variables, and 125 constraints, problems are : Problem set: 0 solved, 562 unsolved in 19920 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (OVERLAPS) 385/466 variables, 81/82 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 41/123 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 397/520 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 6 (OVERLAPS) 2/468 variables, 2/522 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 165/687 constraints. Problems are: Problem set: 0 solved, 562 unsolved
(s80 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/468 variables, and 687 constraints, problems are : Problem set: 0 solved, 562 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 83/83 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 0/0 constraints]
After SMT, in 50316ms problems are : Problem set: 0 solved, 562 unsolved
Search for dead transitions found 0 dead transitions in 50322ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50589 ms. Remains : 83/83 places, 564/564 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 179 transitions
Reduce isomorphic transitions removed 179 transitions.
Iterating post reduction 0 with 179 rules applied. Total rules applied 179 place count 83 transition count 385
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 6 Pre rules applied. Total rules applied 179 place count 83 transition count 379
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 191 place count 77 transition count 379
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 192 place count 77 transition count 378
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 193 place count 76 transition count 378
Applied a total of 193 rules in 22 ms. Remains 76 /83 variables (removed 7) and now considering 378/564 (removed 186) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 378 rows 76 cols
[2024-05-22 17:26:29] [INFO ] Computed 1 invariants in 6 ms
[2024-05-22 17:26:29] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2024-05-22 17:26:30] [INFO ] After 170ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 17:26:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-22 17:26:30] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-22 17:26:30] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-22 17:26:30] [INFO ] After 432ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 661 ms.
[2024-05-22 17:26:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-22 17:26:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 83 places, 564 transitions and 2240 arcs took 9 ms.
[2024-05-22 17:26:30] [INFO ] Flatten gal took : 75 ms
Total runtime 119526 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleLock-PT-p3s2
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 83
TRANSITIONS: 564
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.009s, Sys 0.003s]
SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 655
MODEL NAME: /home/mcc/execution/411/model
83 places, 564 transitions.
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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------
BK_STOP 1716399914571
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
MEDDLY ERROR: Insufficient memory
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="DoubleLock-PT-p3s2"
export BK_EXAMINATION="ReachabilityFireability"
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 DoubleLock-PT-p3s2, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131500639"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p3s2.tgz
mv DoubleLock-PT-p3s2 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;