About the Execution of GreatSPN+red for DoubleLock-PT-p1s3
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16163.840 | 3600000.00 | 9709346.00 | 7502.40 | 1 1 1 1 10 1 1 1 1 1 0 1 ? 0 1 1 | 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-171631131400605.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-p1s3, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131400605
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.8M
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 19 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 11K Apr 12 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Apr 12 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K 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 3.4M 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 positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-00
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-01
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-02
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-03
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-04
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-05
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-06
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-07
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-08
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-09
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-10
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-11
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-12
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-13
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-14
FORMULA_NAME DoubleLock-PT-p1s3-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716393812231
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleLock-PT-p1s3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 16:03:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-22 16:03:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 16:03:33] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2024-05-22 16:03:33] [INFO ] Transformed 570 places.
[2024-05-22 16:03:33] [INFO ] Transformed 7568 transitions.
[2024-05-22 16:03:33] [INFO ] Parsed PT model containing 570 places and 7568 transitions and 30656 arcs in 463 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 132 places in 38 ms
Reduce places removed 132 places and 256 transitions.
FORMULA DoubleLock-PT-p1s3-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleLock-PT-p1s3-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+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, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-22 16:03:33] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
// Phase 1: matrix 4971 rows 438 cols
[2024-05-22 16:03:34] [INFO ] Computed 4 invariants in 94 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 10, 1, 1, 1, 1, 1, 1, +inf, 1, 1]
RANDOM walk for 10000 steps (91 resets) in 94 ms. (105 steps per ms)
FORMULA DoubleLock-PT-p1s3-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-04 10 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (54 resets) in 97 ms. (408 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 1, 0, 0] Max Struct:[1, +inf, 1, 1]
[2024-05-22 16:03:34] [INFO ] Flow matrix only has 4971 transitions (discarded 2341 similar events)
[2024-05-22 16:03:34] [INFO ] Invariant cache hit.
[2024-05-22 16:03:34] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2024-05-22 16:03:34] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:03:35] [INFO ] [Real]Absence check using state equation in 1064 ms returned sat
[2024-05-22 16:03:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:03:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 16:03:35] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-22 16:03:36] [INFO ] [Nat]Absence check using state equation in 866 ms returned sat
[2024-05-22 16:03:36] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:03:37] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:03:37] [INFO ] [Nat]Added 400 Read/Feed constraints in 1084 ms returned unknown
[2024-05-22 16:03:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 16:03:37] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:03:38] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2024-05-22 16:03:39] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:03:39] [INFO ] [Real]Added 400 Read/Feed constraints in 736 ms returned sat
[2024-05-22 16:03:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:03:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 16:03:39] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:03:40] [INFO ] [Nat]Absence check using state equation in 798 ms returned sat
[2024-05-22 16:03:41] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:03:41] [INFO ] [Nat]Added 400 Read/Feed constraints in 1072 ms returned unknown
[2024-05-22 16:03:41] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 16:03:41] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:03:42] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2024-05-22 16:03:43] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:03:43] [INFO ] [Real]Added 400 Read/Feed constraints in 603 ms returned sat
[2024-05-22 16:03:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:03:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 16:03:43] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-22 16:03:44] [INFO ] [Nat]Absence check using state equation in 861 ms returned sat
[2024-05-22 16:03:44] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:03:45] [INFO ] [Nat]Added 400 Read/Feed constraints in 1073 ms returned unknown
[2024-05-22 16:03:45] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 16:03:45] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-22 16:03:46] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2024-05-22 16:03:47] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:03:48] [INFO ] [Real]Added 400 Read/Feed constraints in 2201 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 1, 0, 0] Max Struct:[1, +inf, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 1, 0, 0] Max Struct:[1, +inf, 1, 1]
Support contains 4 out of 438 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 438/438 places, 7312/7312 transitions.
Graph (complete) has 12297 edges and 438 vertex of which 434 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.19 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 129 place count 434 transition count 7184
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 130 place count 433 transition count 7056
Iterating global reduction 1 with 1 rules applied. Total rules applied 131 place count 433 transition count 7056
Applied a total of 131 rules in 508 ms. Remains 433 /438 variables (removed 5) and now considering 7056/7312 (removed 256) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 433/438 places, 7056/7312 transitions.
[2024-05-22 16:03:49] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 127 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 4) seen :[0, 2, 0, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[0, 2, 0, 1] Max Struct:[1, +inf, 1, 1]
[2024-05-22 16:04:02] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
// Phase 1: matrix 4715 rows 433 cols
[2024-05-22 16:04:02] [INFO ] Computed 3 invariants in 53 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 2, 0, 1] Max Struct:[1, +inf, 1, 1]
FORMULA DoubleLock-PT-p1s3-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 1000000 steps (9344 resets) in 3433 ms. (291 steps per ms)
FORMULA DoubleLock-PT-p1s3-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DoubleLock-PT-p1s3-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (1432 resets) in 965 ms. (1035 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 16:04:07] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:04:07] [INFO ] Invariant cache hit.
[2024-05-22 16:04:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 16:04:08] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2024-05-22 16:04:08] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:04:09] [INFO ] [Real]Added 400 Read/Feed constraints in 803 ms returned sat
[2024-05-22 16:04:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:04:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 16:04:10] [INFO ] [Nat]Absence check using state equation in 1000 ms returned sat
[2024-05-22 16:04:14] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:04:19] [INFO ] [Nat]Added 400 Read/Feed constraints in 9064 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 230 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 433/433 places, 7056/7056 transitions.
[2024-05-22 16:04:19] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 127 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-22 16:04:32] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:04:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (9281 resets) in 3271 ms. (305 steps per ms)
BEST_FIRST walk for 1000001 steps (1405 resets) in 971 ms. (1028 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 16:04:37] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:04:37] [INFO ] Invariant cache hit.
[2024-05-22 16:04:37] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 16:04:38] [INFO ] [Real]Absence check using state equation in 996 ms returned sat
[2024-05-22 16:04:38] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:04:40] [INFO ] [Real]Added 400 Read/Feed constraints in 2240 ms returned sat
[2024-05-22 16:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:04:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 16:04:41] [INFO ] [Nat]Absence check using state equation in 938 ms returned sat
[2024-05-22 16:04:46] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:04:50] [INFO ] [Nat]Added 400 Read/Feed constraints in 9071 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 200 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 328 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2024-05-22 16:04:51] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:04:51] [INFO ] Invariant cache hit.
[2024-05-22 16:04:52] [INFO ] Implicit Places using invariants in 988 ms returned []
[2024-05-22 16:04:52] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:04:52] [INFO ] Invariant cache hit.
[2024-05-22 16:04:53] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:05:23] [INFO ] Performed 113/433 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-22 16:05:53] [INFO ] Performed 430/433 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2024-05-22 16:05:54] [INFO ] Implicit Places using invariants and state equation in 61869 ms returned []
Implicit Place search using SMT with State Equation took 62864 ms to find 0 implicit places.
[2024-05-22 16:05:55] [INFO ] Redundant transitions in 854 ms returned []
Running 7054 sub problems to find dead transitions.
[2024-05-22 16:05:55] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:05:55] [INFO ] Invariant cache hit.
[2024-05-22 16:05:55] [INFO ] State equation strengthened by 400 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30182 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 7054/7054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30101 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/7054 constraints, Known Traps: 0/0 constraints]
After SMT, in 92248ms problems are : Problem set: 0 solved, 7054 unsolved
Search for dead transitions found 0 dead transitions in 92416ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156561 ms. Remains : 433/433 places, 7056/7056 transitions.
[2024-05-22 16:07:27] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 125 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 16:07:40] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:07:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 1000003 steps (9343 resets) in 3924 ms. (254 steps per ms)
BEST_FIRST walk for 1000001 steps (1417 resets) in 1178 ms. (848 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[5] Max Struct:[+inf]
[2024-05-22 16:07:45] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:07:45] [INFO ] Invariant cache hit.
[2024-05-22 16:07:45] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2024-05-22 16:07:46] [INFO ] [Real]Absence check using state equation in 993 ms returned sat
[2024-05-22 16:07:47] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:07:49] [INFO ] [Real]Added 400 Read/Feed constraints in 2258 ms returned sat
[2024-05-22 16:07:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:07:49] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 16:07:50] [INFO ] [Nat]Absence check using state equation in 1004 ms returned sat
[2024-05-22 16:07:55] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:07:59] [INFO ] [Nat]Added 400 Read/Feed constraints in 9074 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[5] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[5] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 200 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 200 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 186 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2024-05-22 16:07:59] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:07:59] [INFO ] Invariant cache hit.
[2024-05-22 16:08:00] [INFO ] Implicit Places using invariants in 875 ms returned []
[2024-05-22 16:08:00] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:08:00] [INFO ] Invariant cache hit.
[2024-05-22 16:08:01] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:08:33] [INFO ] Performed 103/433 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-22 16:09:03] [INFO ] Performed 425/433 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-22 16:09:04] [INFO ] Implicit Places using invariants and state equation in 64096 ms returned []
Implicit Place search using SMT with State Equation took 64975 ms to find 0 implicit places.
[2024-05-22 16:09:05] [INFO ] Redundant transitions in 549 ms returned []
Running 7054 sub problems to find dead transitions.
[2024-05-22 16:09:05] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:09:05] [INFO ] Invariant cache hit.
[2024-05-22 16:09:05] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30099 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 7054/7054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30107 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/7054 constraints, Known Traps: 0/0 constraints]
After SMT, in 93620ms problems are : Problem set: 0 solved, 7054 unsolved
Search for dead transitions found 0 dead transitions in 93687ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159424 ms. Remains : 433/433 places, 7056/7056 transitions.
[2024-05-22 16:10:39] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 125 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[5] Max Struct:[+inf]
RANDOM walk for 40012 steps (366 resets) in 410 ms. (97 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (56 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 172224 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 1
Probabilistic random walk after 172224 steps, saw 132631 distinct states, run finished after 3004 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-22 16:10:55] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:10:55] [INFO ] Invariant cache hit.
[2024-05-22 16:10:56] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4166/4433 variables, 130/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4433 variables, 128/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4433 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 275/4708 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4708 variables, 128/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4708 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 440/5148 variables, 174/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5148 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5148/5148 variables, and 836 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4166/4433 variables, 130/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4433 variables, 128/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4433 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4433 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 275/4708 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4708 variables, 128/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4708 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 440/5148 variables, 174/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5148 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5148/5148 variables, and 837 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2097 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 4184ms problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 168 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 433/433 places, 7056/7056 transitions.
RANDOM walk for 40009 steps (374 resets) in 184 ms. (216 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (52 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 174594 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :0 out of 1
Probabilistic random walk after 174594 steps, saw 134395 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
[2024-05-22 16:11:03] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:11:03] [INFO ] Invariant cache hit.
[2024-05-22 16:11:03] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4166/4433 variables, 130/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4433 variables, 128/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4433 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 275/4708 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/4708 variables, 128/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4708 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 440/5148 variables, 174/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/5148 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5148 variables, 272/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5148 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/5148 variables, 0/836 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 5148/5148 variables, and 836 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2239 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 266/267 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 4166/4433 variables, 130/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4433 variables, 128/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4433 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/4433 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 275/4708 variables, 2/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/4708 variables, 128/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/4708 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 440/5148 variables, 174/564 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/5148 variables, 1/565 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/5148 variables, 272/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/5148 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/5148 variables, 0/837 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 5148/5148 variables, and 837 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3835 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 400/400 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 6113ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 356 ms.
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 183 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 183 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 176 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2024-05-22 16:11:10] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:11:10] [INFO ] Invariant cache hit.
[2024-05-22 16:11:11] [INFO ] Implicit Places using invariants in 862 ms returned []
[2024-05-22 16:11:11] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:11:11] [INFO ] Invariant cache hit.
[2024-05-22 16:11:12] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:11:43] [INFO ] Performed 103/433 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-22 16:12:14] [INFO ] Performed 422/433 implicitness test of which 0 returned IMPLICIT in 62 seconds.
[2024-05-22 16:12:16] [INFO ] Implicit Places using invariants and state equation in 65578 ms returned []
Implicit Place search using SMT with State Equation took 66444 ms to find 0 implicit places.
[2024-05-22 16:12:17] [INFO ] Redundant transitions in 736 ms returned []
Running 7054 sub problems to find dead transitions.
[2024-05-22 16:12:17] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:12:17] [INFO ] Invariant cache hit.
[2024-05-22 16:12:17] [INFO ] State equation strengthened by 400 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 7054/7054 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7054 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 7054 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 433/5148 variables, and 3 constraints, problems are : Problem set: 0 solved, 7054 unsolved in 30109 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/433 constraints, ReadFeed: 0/400 constraints, PredecessorRefiner: 0/7054 constraints, Known Traps: 0/0 constraints]
After SMT, in 92333ms problems are : Problem set: 0 solved, 7054 unsolved
Search for dead transitions found 0 dead transitions in 92410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 159824 ms. Remains : 433/433 places, 7056/7056 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[5] Max Struct:[+inf]
Starting property specific reduction for DoubleLock-PT-p1s3-UpperBounds-12
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:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-22 16:13:49] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:13:49] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10008 steps (89 resets) in 41 ms. (238 steps per ms)
BEST_FIRST walk for 10001 steps (15 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 16:13:49] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:13:49] [INFO ] Invariant cache hit.
[2024-05-22 16:13:50] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 16:13:51] [INFO ] [Real]Absence check using state equation in 994 ms returned sat
[2024-05-22 16:13:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:13:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 16:13:52] [INFO ] [Nat]Absence check using state equation in 951 ms returned sat
[2024-05-22 16:13:52] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:13:52] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:13:53] [INFO ] [Nat]Added 400 Read/Feed constraints in 1065 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 191 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 433/433 places, 7056/7056 transitions.
[2024-05-22 16:13:53] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
Found an invariant !
This invariant on transitions {22=1, 39=1, 3010=1, 3011=1, 4686=2}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {22=1, 39=1, 3022=1, 3023=1, 4697=2}
Produces a positive solution
Incomplete random walk after 10000 steps, including 119 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-22 16:14:07] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:14:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (9317 resets) in 3312 ms. (301 steps per ms)
BEST_FIRST walk for 1000001 steps (1376 resets) in 937 ms. (1066 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[+inf]
[2024-05-22 16:14:11] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:14:11] [INFO ] Invariant cache hit.
[2024-05-22 16:14:11] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2024-05-22 16:14:12] [INFO ] [Real]Absence check using state equation in 934 ms returned sat
[2024-05-22 16:14:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 16:14:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 5 ms returned sat
[2024-05-22 16:14:13] [INFO ] [Nat]Absence check using state equation in 970 ms returned sat
[2024-05-22 16:14:13] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:14:18] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-22 16:14:22] [INFO ] [Nat]Added 400 Read/Feed constraints in 9064 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[+inf]
Support contains 1 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 168 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 433/433 places, 7056/7056 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 7056/7056 transitions.
Applied a total of 0 rules in 167 ms. Remains 433 /433 variables (removed 0) and now considering 7056/7056 (removed 0) transitions.
[2024-05-22 16:14:23] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:14:23] [INFO ] Invariant cache hit.
[2024-05-22 16:14:24] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-05-22 16:14:24] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:14:24] [INFO ] Invariant cache hit.
[2024-05-22 16:14:25] [INFO ] State equation strengthened by 400 read => feed constraints.
[2024-05-22 16:14:56] [INFO ] Performed 103/433 implicitness test of which 0 returned IMPLICIT in 31 seconds.
[2024-05-22 16:15:26] [INFO ] Performed 422/433 implicitness test of which 0 returned IMPLICIT in 61 seconds.
[2024-05-22 16:15:29] [INFO ] Implicit Places using invariants and state equation in 64925 ms returned []
Implicit Place search using SMT with State Equation took 65800 ms to find 0 implicit places.
[2024-05-22 16:15:29] [INFO ] Redundant transitions in 529 ms returned []
Running 7054 sub problems to find dead transitions.
[2024-05-22 16:15:29] [INFO ] Flow matrix only has 4715 transitions (discarded 2341 similar events)
[2024-05-22 16:15:29] [INFO ] Invariant cache hit.
[2024-05-22 16:15:29] [INFO ] State equation strengthened by 400 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running DoubleLock-PT-p1s3
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 570
TRANSITIONS: 7568
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.167s, Sys 0.007s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.023s, 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: 713
MODEL NAME: /home/mcc/execution/model
570 places, 7568 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.
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
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-p1s3"
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 DoubleLock-PT-p1s3, 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 r135-tall-171631131400605"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DoubleLock-PT-p1s3.tgz
mv DoubleLock-PT-p1s3 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 ;