About the Execution of 2024-gold for DNAwalker-PT-12ringLLLarge
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15694.320 | 333765.00 | 375024.00 | 821.60 | 2 1 2 2 2 2 1 2 2 2 2 2 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-174860079700054.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-12ringLLLarge, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r083-tall-174860079700054
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 648K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K 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 102K 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.8K 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 14 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 135K 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-12ringLLLarge-UpperBounds-00
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-01
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-02
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-03
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-04
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-05
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-06
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-07
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-08
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-09
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-10
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-11
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-12
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-13
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-14
FORMULA_NAME DNAwalker-PT-12ringLLLarge-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748730771150
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-12ringLLLarge
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-31 22:32:52] [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:32:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 22:32:52] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2025-05-31 22:32:52] [INFO ] Transformed 33 places.
[2025-05-31 22:32:52] [INFO ] Transformed 312 transitions.
[2025-05-31 22:32:52] [INFO ] Parsed PT model containing 33 places and 312 transitions and 916 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 2] 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, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-31 22:32:52] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2025-05-31 22:32:52] [INFO ] Computed 0 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 10000 steps (764 resets) in 66 ms. (149 steps per ms)
BEST_FIRST walk for 160012 steps (945 resets) in 181 ms. (879 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 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:32:52] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2025-05-31 22:32:52] [INFO ] Invariant cache hit.
[2025-05-31 22:32:53] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2025-05-31 22:32:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:53] [INFO ] [Nat]Absence check using state equation in 547 ms returned unknown
[2025-05-31 22:32:53] [INFO ] [Real]Absence check using state equation in 63 ms returned unsat
[2025-05-31 22:32:53] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2025-05-31 22:32:53] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:54] [INFO ] [Nat]Absence check using state equation in 542 ms returned unknown
[2025-05-31 22:32:54] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:32:54] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:55] [INFO ] [Nat]Absence check using state equation in 537 ms returned unknown
[2025-05-31 22:32:55] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2025-05-31 22:32:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:55] [INFO ] [Nat]Absence check using state equation in 542 ms returned unknown
[2025-05-31 22:32:55] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-05-31 22:32:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:56] [INFO ] [Nat]Absence check using state equation in 544 ms returned unknown
[2025-05-31 22:32:56] [INFO ] [Real]Absence check using state equation in 38 ms returned unsat
[2025-05-31 22:32:56] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-05-31 22:32:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:57] [INFO ] [Nat]Absence check using state equation in 537 ms returned unknown
[2025-05-31 22:32:57] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2025-05-31 22:32:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:57] [INFO ] [Nat]Absence check using state equation in 537 ms returned unknown
[2025-05-31 22:32:57] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-05-31 22:32:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:58] [INFO ] [Nat]Absence check using state equation in 536 ms returned unknown
[2025-05-31 22:32:58] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:32:58] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:59] [INFO ] [Nat]Absence check using state equation in 542 ms returned unknown
[2025-05-31 22:32:59] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-05-31 22:32:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:32:59] [INFO ] [Nat]Absence check using state equation in 534 ms returned unknown
[2025-05-31 22:32:59] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:32:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:00] [INFO ] [Nat]Absence check using state equation in 536 ms returned unknown
[2025-05-31 22:33:00] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2025-05-31 22:33:00] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:00] [INFO ] [Nat]Absence check using state equation in 539 ms returned unknown
[2025-05-31 22:33:01] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-31 22:33:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:01] [INFO ] [Nat]Absence check using state equation in 538 ms returned unknown
[2025-05-31 22:33:01] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:33:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:02] [INFO ] [Nat]Absence check using state equation in 538 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2] Max Struct:[+inf, 1, +inf, +inf, +inf, +inf, 1, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-01 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, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 14 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 312/312 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 33 transition count 304
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 31 transition count 302
Applied a total of 10 rules in 44 ms. Remains 31 /33 variables (removed 2) and now considering 302/312 (removed 10) transitions.
Running 278 sub problems to find dead transitions.
// Phase 1: matrix 302 rows 31 cols
[2025-05-31 22:33:02] [INFO ] Computed 0 invariants in 2 ms
[2025-05-31 22:33:02] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 302/329 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 48/75 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (OVERLAPS) 4/333 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 6 (OVERLAPS) 0/333 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 278 unsolved
No progress, stopping.
After SMT solving in domain Real declared 333/333 variables, and 79 constraints, problems are : Problem set: 0 solved, 278 unsolved in 8407 ms.
Refiners :[State Equation: 31/31 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 278 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 1 (OVERLAPS) 302/329 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/329 variables, 48/75 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/329 variables, 278/353 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/329 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 278 unsolved
At refinement iteration 5 (OVERLAPS) 4/333 variables, 4/357 constraints. Problems are: Problem set: 0 solved, 278 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 333/333 variables, and 357 constraints, problems are : Problem set: 0 solved, 278 unsolved in 20021 ms.
Refiners :[State Equation: 31/31 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 278/278 constraints, Known Traps: 0/0 constraints]
After SMT, in 28765ms problems are : Problem set: 0 solved, 278 unsolved
Search for dead transitions found 0 dead transitions in 28781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28846 ms. Remains : 31/33 places, 302/312 transitions.
When looking for a positive semi flow solution, solver replied unsat
[2025-05-31 22:33:31] [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, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (86672 resets) in 3033 ms. (329 steps per ms)
BEST_FIRST walk for 14000013 steps (115530 resets) in 9071 ms. (1543 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 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, +inf, +inf]
[2025-05-31 22:33:43] [INFO ] Invariant cache hit.
[2025-05-31 22:33:43] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-31 22:33:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:33:52] [INFO ] [Nat]Absence check using state equation in 9036 ms returned unknown
[2025-05-31 22:33:52] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2025-05-31 22:33:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:34:01] [INFO ] [Nat]Absence check using state equation in 9038 ms returned unknown
[2025-05-31 22:34:01] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-31 22:34:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:34:10] [INFO ] [Nat]Absence check using state equation in 9043 ms returned unknown
[2025-05-31 22:34:10] [INFO ] [Real]Absence check using state equation in 34 ms returned sat
[2025-05-31 22:34:10] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:34:19] [INFO ] [Nat]Absence check using state equation in 9035 ms returned unknown
[2025-05-31 22:34:19] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-05-31 22:34:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:34:28] [INFO ] [Nat]Absence check using state equation in 9031 ms returned unknown
[2025-05-31 22:34:28] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-31 22:34:28] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:34:38] [INFO ] [Nat]Absence check using state equation in 9038 ms returned unknown
[2025-05-31 22:34:38] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:34:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:34:47] [INFO ] [Nat]Absence check using state equation in 9041 ms returned unknown
[2025-05-31 22:34:47] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-31 22:34:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:34:56] [INFO ] [Nat]Absence check using state equation in 9036 ms returned unknown
[2025-05-31 22:34:56] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-05-31 22:34:56] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:35:05] [INFO ] [Nat]Absence check using state equation in 9039 ms returned unknown
[2025-05-31 22:35:05] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:35:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:35:14] [INFO ] [Nat]Absence check using state equation in 9035 ms returned unknown
[2025-05-31 22:35:14] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-31 22:35:14] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:35:23] [INFO ] [Nat]Absence check using state equation in 9048 ms returned unknown
[2025-05-31 22:35:23] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-31 22:35:23] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:35:32] [INFO ] [Nat]Absence check using state equation in 9039 ms returned unknown
[2025-05-31 22:35:32] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-31 22:35:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:35:42] [INFO ] [Nat]Absence check using state equation in 9035 ms returned unknown
[2025-05-31 22:35:42] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-05-31 22:35:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:35:51] [INFO ] [Nat]Absence check using state equation in 9033 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 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, +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, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 14 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 302/302 transitions.
Applied a total of 0 rules in 14 ms. Remains 31 /31 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 31/31 places, 302/302 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 302/302 transitions.
Applied a total of 0 rules in 7 ms. Remains 31 /31 variables (removed 0) and now considering 302/302 (removed 0) transitions.
[2025-05-31 22:35:51] [INFO ] Invariant cache hit.
[2025-05-31 22:35:51] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-05-31 22:35:51] [INFO ] Invariant cache hit.
[2025-05-31 22:35:51] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-31 22:35:51] [INFO ] Implicit Places using invariants and state equation in 238 ms returned [11]
Discarding 1 places :
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Implicit Place search using SMT with State Equation took 291 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 30/31 places, 295/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 308 ms. Remains : 30/31 places, 295/302 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 295 rows 30 cols
[2025-05-31 22:35:51] [INFO ] Computed 0 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 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, +inf, +inf]
RANDOM walk for 1000000 steps (75815 resets) in 3180 ms. (314 steps per ms)
BEST_FIRST walk for 14000013 steps (110487 resets) in 9432 ms. (1484 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 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, +inf, +inf]
[2025-05-31 22:36:04] [INFO ] Invariant cache hit.
[2025-05-31 22:36:04] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-31 22:36:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:08] [INFO ] [Nat]Absence check using state equation in 4536 ms returned unknown
[2025-05-31 22:36:08] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2025-05-31 22:36:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:13] [INFO ] [Nat]Absence check using state equation in 4541 ms returned unknown
[2025-05-31 22:36:13] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-31 22:36:13] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:18] [INFO ] [Nat]Absence check using state equation in 4538 ms returned unknown
[2025-05-31 22:36:18] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:36:18] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:22] [INFO ] [Nat]Absence check using state equation in 4542 ms returned unknown
[2025-05-31 22:36:22] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-31 22:36:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:27] [INFO ] [Nat]Absence check using state equation in 4535 ms returned unknown
[2025-05-31 22:36:27] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2025-05-31 22:36:27] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:32] [INFO ] [Nat]Absence check using state equation in 4546 ms returned unknown
[2025-05-31 22:36:32] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-05-31 22:36:32] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:36] [INFO ] [Nat]Absence check using state equation in 4543 ms returned unknown
[2025-05-31 22:36:36] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2025-05-31 22:36:36] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:41] [INFO ] [Nat]Absence check using state equation in 4535 ms returned unknown
[2025-05-31 22:36:41] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2025-05-31 22:36:41] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:45] [INFO ] [Nat]Absence check using state equation in 4539 ms returned unknown
[2025-05-31 22:36:46] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-05-31 22:36:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:50] [INFO ] [Nat]Absence check using state equation in 4534 ms returned unknown
[2025-05-31 22:36:50] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2025-05-31 22:36:50] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:55] [INFO ] [Nat]Absence check using state equation in 4540 ms returned unknown
[2025-05-31 22:36:55] [INFO ] [Real]Absence check using state equation in 40 ms returned sat
[2025-05-31 22:36:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:36:59] [INFO ] [Nat]Absence check using state equation in 4535 ms returned unknown
[2025-05-31 22:36:59] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2025-05-31 22:36:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:04] [INFO ] [Nat]Absence check using state equation in 4533 ms returned unknown
[2025-05-31 22:37:04] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2025-05-31 22:37:04] [INFO ] Solution in real domain found non-integer solution.
[2025-05-31 22:37:09] [INFO ] [Nat]Absence check using state equation in 4533 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 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, +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, 2, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Support contains 14 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 295/295 transitions.
Applied a total of 0 rules in 24 ms. Remains 30 /30 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 30/30 places, 295/295 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 295/295 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 295/295 (removed 0) transitions.
[2025-05-31 22:37:09] [INFO ] Invariant cache hit.
[2025-05-31 22:37:09] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-05-31 22:37:09] [INFO ] Invariant cache hit.
[2025-05-31 22:37:09] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-05-31 22:37:09] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 247 ms to find 0 implicit places.
[2025-05-31 22:37:09] [INFO ] Redundant transitions in 15 ms returned []
Running 271 sub problems to find dead transitions.
[2025-05-31 22:37:09] [INFO ] Invariant cache hit.
[2025-05-31 22:37:09] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 295/321 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 48/74 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 4/325 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/325 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 78 constraints, problems are : Problem set: 0 solved, 271 unsolved in 8024 ms.
Refiners :[State Equation: 30/30 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 295/321 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 48/74 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 271/345 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 4/325 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 349 constraints, problems are : Problem set: 0 solved, 271 unsolved in 30021 ms.
Refiners :[State Equation: 30/30 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
After SMT, in 38439ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 38448ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38729 ms. Remains : 30/30 places, 295/295 transitions.
When looking for a positive semi flow solution, solver replied unsat
[2025-05-31 22:37:48] [INFO ] Flatten gal took : 111 ms
[2025-05-31 22:37:48] [INFO ] Flatten gal took : 46 ms
RANDOM walk for 40000 steps (3031 resets) in 1581 ms. (25 steps per ms) remains 14/14 properties
[2025-05-31 22:37:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17901961165965619672.gal : 23 ms
[2025-05-31 22:37:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7408382477639941156.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/ReachabilityCardinality17901961165965619672.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7408382477639941156.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (285 resets) in 277 ms. (143 steps per ms) remains 14/14 properties
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
BEST_FIRST walk for 40004 steps (1024 resets) in 125 ms. (317 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality7408382477639941156.prop.
BEST_FIRST walk for 40004 steps (272 resets) in 105 ms. (377 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :4 after 47
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :47 after 86
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :86 after 173
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :173 after 371
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :371 after 1600
BEST_FIRST walk for 40002 steps (273 resets) in 103 ms. (384 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :1600 after 9469
BEST_FIRST walk for 40004 steps (292 resets) in 96 ms. (412 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :9469 after 46237
BEST_FIRST walk for 40004 steps (257 resets) in 92 ms. (430 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :46237 after 105078
BEST_FIRST walk for 40003 steps (215 resets) in 107 ms. (370 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (295 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :105078 after 315299
BEST_FIRST walk for 40004 steps (256 resets) in 112 ms. (354 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (272 resets) in 86 ms. (459 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :315299 after 670927
BEST_FIRST walk for 40004 steps (243 resets) in 71 ms. (555 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (243 resets) in 58 ms. (678 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (275 resets) in 70 ms. (563 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (210 resets) in 44 ms. (888 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :670927 after 3.69777e+06
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :3.69777e+06 after 8.47217e+06
SDD proceeding with computation,14 properties remain. new max is 32768
SDD size :8.47217e+06 after 3.15951e+07
Interrupted probabilistic random walk after 383676 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :0 out of 14
Probabilistic random walk after 383676 steps, saw 87962 distinct states, run finished after 3004 ms. (steps per millisecond=127 ) properties seen :0
[2025-05-31 22:37:52] [INFO ] Invariant cache hit.
[2025-05-31 22:37:52] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 237/251 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 74/325 variables, 16/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 0/325 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 78 constraints, problems are : Problem set: 0 solved, 14 unsolved in 382 ms.
Refiners :[State Equation: 30/30 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 237/251 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/251 variables, 48/62 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/251 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/251 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 65536
SDD size :3.15951e+07 after 1.27736e+08
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 79 constraints, problems are : Problem set: 0 solved, 14 unsolved in 5009 ms.
Refiners :[State Equation: 30/30 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 1/14 constraints, Known Traps: 0/0 constraints]
After SMT, in 5403ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 14 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 295/295 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 295/295 (removed 0) transitions.
Running 271 sub problems to find dead transitions.
[2025-05-31 22:37:57] [INFO ] Invariant cache hit.
[2025-05-31 22:37:57] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 1 (OVERLAPS) 295/321 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 48/74 constraints. Problems are: Problem set: 0 solved, 271 unsolved
SDD proceeding with computation,14 properties remain. new max is 131072
SDD size :1.27736e+08 after 3.86749e+08
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (OVERLAPS) 4/325 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/325 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 6 (OVERLAPS) 0/325 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 271 unsolved
No progress, stopping.
After SMT solving in domain Real declared 325/325 variables, and 78 constraints, problems are : Problem set: 0 solved, 271 unsolved in 7186 ms.
Refiners :[State Equation: 30/30 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 271 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 271 unsolved
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.78973e+08,16.3661,318820,2,19719,21,1.08329e+06,20,0,470,1.6996e+06,0
Total reachable state count : 878972573
Verifying 14 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,16.3676,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.3685,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.3688,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.3689,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.3692,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.3712,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.3744,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.3746,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.381,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.3888,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.395,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,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,16.3962,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,0
Invariant property MIN12 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
MIN12,0,16.4054,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,0
Invariant property MIN13 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
MIN13,0,16.4102,318820,1,0,21,1.08329e+06,20,0,471,1.6996e+06,0
ITS tools runner thread asked to quit. Dying gracefully.
At refinement iteration 1 (OVERLAPS) 295/321 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 48/74 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/321 variables, 271/345 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/321 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 271 unsolved
At refinement iteration 5 (OVERLAPS) 4/325 variables, 4/349 constraints. Problems are: Problem set: 0 solved, 271 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/325 variables, and 349 constraints, problems are : Problem set: 0 solved, 271 unsolved in 20013 ms.
Refiners :[State Equation: 30/30 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 271/271 constraints, Known Traps: 0/0 constraints]
After SMT, in 27381ms problems are : Problem set: 0 solved, 271 unsolved
Search for dead transitions found 0 dead transitions in 27384ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27388 ms. Remains : 30/30 places, 295/295 transitions.
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-15 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-14 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-13 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-12 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-11 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-10 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-09 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-08 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-07 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-04 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-02 2 TECHNIQUES REACHABILITY_MIN
FORMULA DNAwalker-PT-12ringLLLarge-UpperBounds-00 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 14 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 332481 ms.
BK_STOP 1748731104915
--------------------
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-12ringLLLarge"
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-12ringLLLarge, 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-174860079700054"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-12ringLLLarge.tgz
mv DNAwalker-PT-12ringLLLarge 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 ;