Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r092-tall-171624189300453.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DBSingleClientW-PT-d0m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189300453
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 12:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Apr 12 12:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Apr 12 12:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Apr 12 12:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 119K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716317607866

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m06
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 18:53:28] [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]
[2024-05-21 18:53:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:53:29] [INFO ] Load time of PNML (sax parser for PT used): 134 ms
[2024-05-21 18:53:29] [INFO ] Transformed 553 places.
[2024-05-21 18:53:29] [INFO ] Transformed 150 transitions.
[2024-05-21 18:53:29] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 259 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0] Max Struct:[+inf, +inf]
// Phase 1: matrix 150 rows 109 cols
[2024-05-21 18:53:29] [INFO ] Computed 6 invariants in 50 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[6, 341]
RANDOM walk for 10000 steps (2319 resets) in 40 ms. (243 steps per ms)
BEST_FIRST walk for 20001 steps (2086 resets) in 48 ms. (408 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 1] Max Struct:[6, 341]
[2024-05-21 18:53:29] [INFO ] Invariant cache hit.
[2024-05-21 18:53:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 18:53:29] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 18:53:29] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2024-05-21 18:53:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:53:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 18:53:29] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-21 18:53:29] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2024-05-21 18:53:29] [INFO ] State equation strengthened by 74 read => feed constraints.
[2024-05-21 18:53:29] [INFO ] [Nat]Added 74 Read/Feed constraints in 31 ms returned sat
[2024-05-21 18:53:29] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 26 ms.
[2024-05-21 18:53:29] [INFO ] Added : 1 causal constraints over 1 iterations in 80 ms. Result :sat
Minimization took 81 ms.
[2024-05-21 18:53:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-21 18:53:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[3, 1] Max Struct:[6, 1]
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[6]
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.1 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 38 place count 77 transition count 95
Iterating global reduction 1 with 24 rules applied. Total rules applied 62 place count 77 transition count 95
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 77 transition count 94
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 75 place count 65 transition count 82
Iterating global reduction 2 with 12 rules applied. Total rules applied 87 place count 65 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 65 transition count 80
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 92 place count 62 transition count 74
Iterating global reduction 3 with 3 rules applied. Total rules applied 95 place count 62 transition count 74
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 96 place count 62 transition count 73
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 98 place count 60 transition count 70
Iterating global reduction 4 with 2 rules applied. Total rules applied 100 place count 60 transition count 70
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 102 place count 58 transition count 68
Iterating global reduction 4 with 2 rules applied. Total rules applied 104 place count 58 transition count 68
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 106 place count 58 transition count 66
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 107 place count 57 transition count 65
Iterating global reduction 5 with 1 rules applied. Total rules applied 108 place count 57 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 110 place count 57 transition count 63
Applied a total of 110 rules in 101 ms. Remains 57 /109 variables (removed 52) and now considering 63/150 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 57/109 places, 63/150 transitions.
// Phase 1: matrix 63 rows 57 cols
[2024-05-21 18:53:30] [INFO ] Computed 2 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[6]
RANDOM walk for 1000000 steps (229026 resets) in 847 ms. (1179 steps per ms)
BEST_FIRST walk for 1000000 steps (101211 resets) in 342 ms. (2915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[6]
[2024-05-21 18:53:31] [INFO ] Invariant cache hit.
[2024-05-21 18:53:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 18:53:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 18:53:31] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 18:53:31] [INFO ] [Real]Added 19 Read/Feed constraints in 5 ms returned sat
[2024-05-21 18:53:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:53:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 18:53:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-21 18:53:31] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:53:31] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 9 ms to minimize.
[2024-05-21 18:53:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-21 18:53:31] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 16 ms.
[2024-05-21 18:53:31] [INFO ] Added : 1 causal constraints over 1 iterations in 30 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[6]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 9 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:53:31] [INFO ] Invariant cache hit.
[2024-05-21 18:53:31] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-21 18:53:31] [INFO ] Invariant cache hit.
[2024-05-21 18:53:31] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 18:53:31] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-21 18:53:31] [INFO ] Redundant transitions in 0 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-21 18:53:31] [INFO ] Invariant cache hit.
[2024-05-21 18:53:31] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 78 constraints, problems are : Problem set: 0 solved, 62 unsolved in 856 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 62/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 140 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1897 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2844ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2852ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3026 ms. Remains : 57/57 places, 63/63 transitions.
[2024-05-21 18:53:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[4] Max Struct:[6]
RANDOM walk for 1000000 steps (229131 resets) in 604 ms. (1652 steps per ms)
BEST_FIRST walk for 1000001 steps (100837 resets) in 315 ms. (3164 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4] Max Struct:[6]
[2024-05-21 18:53:35] [INFO ] Invariant cache hit.
[2024-05-21 18:53:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 18:53:35] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-21 18:53:35] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 18:53:35] [INFO ] [Real]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:53:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:53:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 18:53:35] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-21 18:53:35] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:53:35] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 1 ms to minimize.
[2024-05-21 18:53:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-21 18:53:35] [INFO ] Computed and/alt/rep : 18/35/18 causal constraints (skipped 44 transitions) in 6 ms.
[2024-05-21 18:53:35] [INFO ] Added : 1 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[4] Max Struct:[6]
Support contains 1 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 57/57 places, 63/63 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-21 18:53:35] [INFO ] Invariant cache hit.
[2024-05-21 18:53:36] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-21 18:53:36] [INFO ] Invariant cache hit.
[2024-05-21 18:53:36] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-21 18:53:36] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 18:53:36] [INFO ] Redundant transitions in 0 ms returned []
Running 62 sub problems to find dead transitions.
[2024-05-21 18:53:36] [INFO ] Invariant cache hit.
[2024-05-21 18:53:36] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 0/120 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 78 constraints, problems are : Problem set: 0 solved, 62 unsolved in 781 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 1/57 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 63/120 variables, 57/59 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 19/78 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 62/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 140 constraints, problems are : Problem set: 0 solved, 62 unsolved in 1377 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
After SMT, in 2206ms problems are : Problem set: 0 solved, 62 unsolved
Search for dead transitions found 0 dead transitions in 2207ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2407 ms. Remains : 57/57 places, 63/63 transitions.
RANDOM walk for 40000 steps (9208 resets) in 662 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4086 resets) in 73 ms. (540 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4104 resets) in 217 ms. (183 steps per ms) remains 2/2 properties
[2024-05-21 18:53:38] [INFO ] Flatten gal took : 179 ms
[2024-05-21 18:53:38] [INFO ] Flatten gal took : 39 ms
[2024-05-21 18:53:39] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3226774104280859335.gal : 20 ms
[2024-05-21 18:53:39] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16746991103819155838.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/ReachabilityCardinality3226774104280859335.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16746991103819155838.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/ReachabilityCardinality16746991103819155838.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :7 after 22
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :22 after 48
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :48 after 98
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :98 after 204
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :204 after 358
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :358 after 2625
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :2625 after 6068
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :6068 after 18446
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :18446 after 56308
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :115616 after 129434
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,133286,0.34689,14068,2,4537,17,39972,8,0,295,37711,0
Total reachable state count : 133286

Verifying 2 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.351759,14068,1,0,17,39972,8,0,296,37711,0
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.352599,14328,1,0,17,39972,8,0,296,37711,0
ITS tools runner thread asked to quit. Dying gracefully.
Probably explored full state space saw : 133243 states, properties seen :0
Probabilistic random walk after 332150 steps, saw 133243 distinct states, run finished after 1176 ms. (steps per millisecond=282 ) properties seen :0
Explored full state space saw : 133286 states, properties seen :0
Exhaustive walk after 332203 steps, saw 133286 distinct states, run finished after 786 ms. (steps per millisecond=422 ) properties seen :0
FORMULA DBSingleClientW-PT-d0m06-UpperBounds-08 4 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 11813 ms.

BK_STOP 1716317620788

--------------------
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="DBSingleClientW-PT-d0m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d0m06, 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 r092-tall-171624189300453"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m06.tgz
mv DBSingleClientW-PT-d0m06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;