About the Execution of 2024-gold for DNAwalker-PT-08ringLL
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15685.690 | 139905.00 | 158324.00 | 436.80 | 1 2 1 2 2 2 2 2 2 1 2 1 2 2 2 2 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r083-tall-174860079700052.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
Input is DNAwalker-PT-08ringLL, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700052
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 9 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 112K May 29 14:32 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
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-00
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-01
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-02
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-03
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-04
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-05
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-06
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-07
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-08
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-09
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-10
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-11
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-12
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-13
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-14
FORMULA_NAME DNAwalker-PT-08ringLL-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748730678289
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-08ringLL
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:31:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-31 22:31:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:31:19] [INFO ] Load time of PNML (sax parser for PT used): 69 ms
[2025-05-31 22:31:19] [INFO ] Transformed 27 places.
[2025-05-31 22:31:19] [INFO ] Transformed 260 transitions.
[2025-05-31 22:31:19] [INFO ] Parsed PT model containing 27 places and 260 transitions and 760 arcs in 159 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 22:31:19] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
// Phase 1: matrix 259 rows 27 cols
[2025-05-31 22:31:19] [INFO ] Computed 0 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (806 resets) in 65 ms. (151 steps per ms)
BEST_FIRST walk for 160014 steps (1071 resets) in 183 ms. (869 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 22:31:19] [INFO ] Flow matrix only has 259 transitions (discarded 1 similar events)
[2025-05-31 22:31:19] [INFO ] Invariant cache hit.
[2025-05-31 22:31:20] [INFO ] [Real]Absence check using state equation in 64 ms returned unsat
[2025-05-31 22:31:20] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-05-31 22:31:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:20] [INFO ] [Nat]Absence check using state equation in 542 ms returned unknown
[2025-05-31 22:31:20] [INFO ] [Real]Absence check using state equation in 31 ms returned unsat
[2025-05-31 22:31:20] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2025-05-31 22:31:20] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:21] [INFO ] [Nat]Absence check using state equation in 534 ms returned unknown
[2025-05-31 22:31:21] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-31 22:31:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:22] [INFO ] [Nat]Absence check using state equation in 538 ms returned unknown
[2025-05-31 22:31:22] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-31 22:31:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:22] [INFO ] [Nat]Absence check using state equation in 536 ms returned unknown
[2025-05-31 22:31:22] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-31 22:31:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:23] [INFO ] [Nat]Absence check using state equation in 531 ms returned unknown
[2025-05-31 22:31:23] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-05-31 22:31:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:24] [INFO ] [Nat]Absence check using state equation in 534 ms returned unknown
[2025-05-31 22:31:24] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-05-31 22:31:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:24] [INFO ] [Nat]Absence check using state equation in 531 ms returned unknown
[2025-05-31 22:31:24] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2025-05-31 22:31:24] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-05-31 22:31:24] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:25] [INFO ] [Nat]Absence check using state equation in 529 ms returned unknown
[2025-05-31 22:31:25] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2025-05-31 22:31:25] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:31:25] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:25] [INFO ] [Nat]Absence check using state equation in 532 ms returned unknown
[2025-05-31 22:31:26] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-31 22:31:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:26] [INFO ] [Nat]Absence check using state equation in 539 ms returned unknown
[2025-05-31 22:31:26] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-31 22:31:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:27] [INFO ] [Nat]Absence check using state equation in 536 ms returned unknown
[2025-05-31 22:31:27] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-31 22:31:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:31:27] [INFO ] [Nat]Absence check using state equation in 531 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 2, 1, 2, 2, 2, 2, 2, 2, 1, 2, 1, 2, 2, 2, 2] Max Struct:[1, +inf, 1, +inf, +inf, +inf, +inf, +inf, +inf, 1, +inf, 1, +inf, +inf, +inf, +inf]
FORMULA DNAwalker-PT-08ringLL-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-08ringLL-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-08ringLL-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-08ringLL-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 12 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 260/260 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 27 transition count 252
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 11 place count 24 transition count 249
Applied a total of 11 rules in 40 ms. Remains 24 /27 variables (removed 3) and now considering 249/260 (removed 11) transitions.
Running 229 sub problems to find dead transitions.
// Phase 1: matrix 249 rows 24 cols
[2025-05-31 22:31:27] [INFO ] Computed 0 invariants in 7 ms
[2025-05-31 22:31:27] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 249/270 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 3/273 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/273 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 57 constraints, problems are : Problem set: 0 solved, 229 unsolved in 5414 ms.
Refiners :[State Equation: 24/24 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 249/270 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 229/283 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 3/273 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 286 constraints, problems are : Problem set: 0 solved, 229 unsolved in 20013 ms.
Refiners :[State Equation: 24/24 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 25701ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 25714ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25772 ms. Remains : 24/27 places, 249/260 transitions.
When looking for a positive semi flow solution, solver replied unsat
[2025-05-31 22:31:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (97297 resets) in 2931 ms. (341 steps per ms)
BEST_FIRST walk for 12000011 steps (142755 resets) in 6502 ms. (1845 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 22:32:03] [INFO ] Invariant cache hit.
[2025-05-31 22:32:03] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-05-31 22:32:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:07] [INFO ] [Nat]Absence check using state equation in 4530 ms returned unknown
[2025-05-31 22:32:07] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-31 22:32:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:12] [INFO ] [Nat]Absence check using state equation in 4526 ms returned unknown
[2025-05-31 22:32:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:32:12] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:16] [INFO ] [Nat]Absence check using state equation in 4528 ms returned unknown
[2025-05-31 22:32:16] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2025-05-31 22:32:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:21] [INFO ] [Nat]Absence check using state equation in 4531 ms returned unknown
[2025-05-31 22:32:21] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:32:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:26] [INFO ] [Nat]Absence check using state equation in 4528 ms returned unknown
[2025-05-31 22:32:26] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2025-05-31 22:32:26] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:30] [INFO ] [Nat]Absence check using state equation in 4529 ms returned unknown
[2025-05-31 22:32:30] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 22:32:30] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:35] [INFO ] [Nat]Absence check using state equation in 4531 ms returned unknown
[2025-05-31 22:32:35] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:32:35] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:39] [INFO ] [Nat]Absence check using state equation in 4531 ms returned unknown
[2025-05-31 22:32:40] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2025-05-31 22:32:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:44] [INFO ] [Nat]Absence check using state equation in 4530 ms returned unknown
[2025-05-31 22:32:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:32:44] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:49] [INFO ] [Nat]Absence check using state equation in 4526 ms returned unknown
[2025-05-31 22:32:49] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2025-05-31 22:32:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:53] [INFO ] [Nat]Absence check using state equation in 4533 ms returned unknown
[2025-05-31 22:32:53] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-05-31 22:32:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:58] [INFO ] [Nat]Absence check using state equation in 4530 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 12 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 249/249 transitions.
Applied a total of 0 rules in 15 ms. Remains 24 /24 variables (removed 0) and now considering 249/249 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 24/24 places, 249/249 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 249/249 transitions.
Applied a total of 0 rules in 6 ms. Remains 24 /24 variables (removed 0) and now considering 249/249 (removed 0) transitions.
[2025-05-31 22:32:58] [INFO ] Invariant cache hit.
[2025-05-31 22:32:58] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-05-31 22:32:58] [INFO ] Invariant cache hit.
[2025-05-31 22:32:58] [INFO ] State equation strengthened by 33 read => feed constraints.
[2025-05-31 22:32:58] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2025-05-31 22:32:58] [INFO ] Redundant transitions in 13 ms returned []
Running 229 sub problems to find dead transitions.
[2025-05-31 22:32:58] [INFO ] Invariant cache hit.
[2025-05-31 22:32:58] [INFO ] State equation strengthened by 33 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 249/270 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (OVERLAPS) 3/273 variables, 3/57 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/273 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 6 (OVERLAPS) 0/273 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 229 unsolved
No progress, stopping.
After SMT solving in domain Real declared 273/273 variables, and 57 constraints, problems are : Problem set: 0 solved, 229 unsolved in 5273 ms.
Refiners :[State Equation: 24/24 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 229 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 249/270 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 33/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 229/283 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 5 (OVERLAPS) 3/273 variables, 3/286 constraints. Problems are: Problem set: 0 solved, 229 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 273/273 variables, and 286 constraints, problems are : Problem set: 0 solved, 229 unsolved in 30018 ms.
Refiners :[State Equation: 24/24 constraints, ReadFeed: 33/33 constraints, PredecessorRefiner: 229/229 constraints, Known Traps: 0/0 constraints]
After SMT, in 35470ms problems are : Problem set: 0 solved, 229 unsolved
Search for dead transitions found 0 dead transitions in 35473ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35670 ms. Remains : 24/24 places, 249/249 transitions.
When looking for a positive semi flow solution, solver replied unsat
[2025-05-31 22:33:34] [INFO ] Flatten gal took : 46 ms
[2025-05-31 22:33:34] [INFO ] Flatten gal took : 50 ms
[2025-05-31 22:33:34] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15245121144343842571.gal : 21 ms
[2025-05-31 22:33:34] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7625845933473996729.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15245121144343842571.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7625845933473996729.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality7625845933473996729.prop.
SDD proceeding with computation,12 properties remain. new max is 4
SDD size :1 after 32
SDD proceeding with computation,12 properties remain. new max is 8
SDD size :32 after 48
SDD proceeding with computation,12 properties remain. new max is 16
SDD size :48 after 91
SDD proceeding with computation,12 properties remain. new max is 32
SDD size :91 after 186
SDD proceeding with computation,12 properties remain. new max is 64
SDD size :186 after 420
SDD proceeding with computation,12 properties remain. new max is 128
SDD size :420 after 2417
SDD proceeding with computation,12 properties remain. new max is 256
SDD size :2417 after 5149
RANDOM walk for 40000 steps (3899 resets) in 1915 ms. (20 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :5149 after 53324
SDD proceeding with computation,12 properties remain. new max is 1024
SDD size :53324 after 192341
BEST_FIRST walk for 40004 steps (1332 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 2048
SDD size :192341 after 488011
BEST_FIRST walk for 40002 steps (269 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (314 resets) in 102 ms. (388 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (331 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (267 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (317 resets) in 99 ms. (400 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 4096
SDD size :488011 after 1.07766e+06
BEST_FIRST walk for 40004 steps (1332 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (296 resets) in 79 ms. (500 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (295 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (322 resets) in 73 ms. (540 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (300 resets) in 81 ms. (487 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (292 resets) in 72 ms. (548 steps per ms) remains 12/12 properties
SDD proceeding with computation,12 properties remain. new max is 8192
SDD size :1.07766e+06 after 7.73527e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8.85447e+06,0.791815,24588,2,2276,17,81732,18,0,393,103243,0
Total reachable state count : 8854466
Verifying 12 reachability properties.
Invariant property MIN0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.793385,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN1 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.794159,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN2 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,0,0.794424,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN3 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,0,0.79541,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,0,0.795756,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,0,0.796637,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN6 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,0,0.79684,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN7 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,0,0.79765,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN8 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,0,0.797957,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN9 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN9,0,0.798175,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN10 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN10,0,0.799196,24588,1,0,17,81732,18,0,394,103243,0
Invariant property MIN11 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN11,0,0.799923,24588,1,0,17,81732,18,0,394,103243,0
Interrupted probabilistic random walk after 768320 steps, run timeout after 3001 ms. (steps per millisecond=256 ) properties seen :0 out of 12
Probabilistic random walk after 768320 steps, saw 139226 distinct states, run finished after 3004 ms. (steps per millisecond=255 ) properties seen :0
FORMULA DNAwalker-PT-08ringLL-UpperBounds-15 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-14 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-10 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-08 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-07 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-06 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-04 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-08ringLL-UpperBounds-01 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 12 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 138672 ms.
BK_STOP 1748730818194
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="DNAwalker-PT-08ringLL"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is DNAwalker-PT-08ringLL, 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 r083-tall-174860079700052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-08ringLL.tgz
mv DNAwalker-PT-08ringLL 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.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 ;