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.r091-tall-171624188200669.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DES-PT-10a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624188200669
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 12 08:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K Apr 12 08:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 43K 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 DES-PT-10a-UpperBounds-00
FORMULA_NAME DES-PT-10a-UpperBounds-01
FORMULA_NAME DES-PT-10a-UpperBounds-02
FORMULA_NAME DES-PT-10a-UpperBounds-03
FORMULA_NAME DES-PT-10a-UpperBounds-04
FORMULA_NAME DES-PT-10a-UpperBounds-05
FORMULA_NAME DES-PT-10a-UpperBounds-06
FORMULA_NAME DES-PT-10a-UpperBounds-07
FORMULA_NAME DES-PT-10a-UpperBounds-08
FORMULA_NAME DES-PT-10a-UpperBounds-09
FORMULA_NAME DES-PT-10a-UpperBounds-10
FORMULA_NAME DES-PT-10a-UpperBounds-11
FORMULA_NAME DES-PT-10a-UpperBounds-12
FORMULA_NAME DES-PT-10a-UpperBounds-13
FORMULA_NAME DES-PT-10a-UpperBounds-14
FORMULA_NAME DES-PT-10a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716315199973

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 18:13:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 18:13:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 18:13:21] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-05-21 18:13:21] [INFO ] Transformed 155 places.
[2024-05-21 18:13:21] [INFO ] Transformed 112 transitions.
[2024-05-21 18:13:21] [INFO ] Found NUPN structural information;
[2024-05-21 18:13:21] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 98 rows 155 cols
[2024-05-21 18:13:21] [INFO ] Computed 59 invariants in 18 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (218 resets) in 59 ms. (166 steps per ms)
FORMULA DES-PT-10a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-10a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (139 resets) in 41 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-05-21 18:13:21] [INFO ] Invariant cache hit.
[2024-05-21 18:13:21] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2024-05-21 18:13:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 11 ms returned sat
[2024-05-21 18:13:21] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-21 18:13:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:13:21] [INFO ] [Nat]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 18:13:21] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 8 ms returned sat
[2024-05-21 18:13:22] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2024-05-21 18:13:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 18:13:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-21 18:13:22] [INFO ] Computed and/alt/rep : 90/273/90 causal constraints (skipped 7 transitions) in 10 ms.
[2024-05-21 18:13:22] [INFO ] Added : 59 causal constraints over 12 iterations in 193 ms. Result :sat
Minimization took 53 ms.
[2024-05-21 18:13:22] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 18:13:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:13:22] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-21 18:13:22] [INFO ] [Real]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-21 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:13:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 7 ms returned sat
[2024-05-21 18:13:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:13:22] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2024-05-21 18:13:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2024-05-21 18:13:22] [INFO ] Computed and/alt/rep : 90/273/90 causal constraints (skipped 7 transitions) in 10 ms.
[2024-05-21 18:13:22] [INFO ] Added : 80 causal constraints over 16 iterations in 195 ms. Result :sat
Minimization took 51 ms.
[2024-05-21 18:13:22] [INFO ] [Real]Absence check using 34 positive place invariants in 9 ms returned sat
[2024-05-21 18:13:22] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 6 ms returned sat
[2024-05-21 18:13:22] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-21 18:13:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:13:23] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2024-05-21 18:13:23] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 12 ms returned sat
[2024-05-21 18:13:23] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-21 18:13:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 8 ms returned sat
[2024-05-21 18:13:23] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 12 ms to minimize.
[2024-05-21 18:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2024-05-21 18:13:23] [INFO ] Computed and/alt/rep : 90/273/90 causal constraints (skipped 7 transitions) in 33 ms.
[2024-05-21 18:13:23] [INFO ] Added : 51 causal constraints over 11 iterations in 206 ms. Result :sat
Minimization took 42 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
FORMULA DES-PT-10a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 98/98 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 155 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 154 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 154 transition count 95
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 154 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 153 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 152 transition count 94
Applied a total of 12 rules in 112 ms. Remains 152 /155 variables (removed 3) and now considering 94/98 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 152/155 places, 94/98 transitions.
// Phase 1: matrix 94 rows 152 cols
[2024-05-21 18:13:23] [INFO ] Computed 60 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (13685 resets) in 1836 ms. (544 steps per ms)
FORMULA DES-PT-10a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000001 steps (2303 resets) in 957 ms. (1043 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:13:26] [INFO ] Invariant cache hit.
[2024-05-21 18:13:26] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2024-05-21 18:13:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 7 ms returned sat
[2024-05-21 18:13:26] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-21 18:13:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:13:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 7 ms returned sat
[2024-05-21 18:13:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2024-05-21 18:13:27] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-21 18:13:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:13:27] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2024-05-21 18:13:27] [INFO ] Computed and/alt/rep : 85/173/85 causal constraints (skipped 6 transitions) in 35 ms.
[2024-05-21 18:13:27] [INFO ] Deduced a trap composed of 10 places in 96 ms of which 2 ms to minimize.
[2024-05-21 18:13:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-21 18:13:27] [INFO ] Added : 80 causal constraints over 17 iterations in 441 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 152 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place p3) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 93/93 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 151 transition count 92
Applied a total of 1 rules in 20 ms. Remains 151 /152 variables (removed 1) and now considering 92/93 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 151/152 places, 92/93 transitions.
// Phase 1: matrix 92 rows 151 cols
[2024-05-21 18:13:27] [INFO ] Computed 61 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (13617 resets) in 1730 ms. (577 steps per ms)
BEST_FIRST walk for 1000001 steps (2240 resets) in 821 ms. (1216 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-21 18:13:30] [INFO ] Invariant cache hit.
[2024-05-21 18:13:30] [INFO ] [Real]Absence check using 36 positive place invariants in 11 ms returned sat
[2024-05-21 18:13:30] [INFO ] [Real]Absence check using 36 positive and 25 generalized place invariants in 5 ms returned sat
[2024-05-21 18:13:30] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-21 18:13:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:13:30] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-21 18:13:30] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 2 ms to minimize.
[2024-05-21 18:13:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 18:13:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-21 18:13:30] [INFO ] [Nat]Absence check using 36 positive and 25 generalized place invariants in 21 ms returned sat
[2024-05-21 18:13:30] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-21 18:13:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-21 18:13:30] [INFO ] Deduced a trap composed of 17 places in 64 ms of which 0 ms to minimize.
[2024-05-21 18:13:30] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 18:13:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 138 ms
[2024-05-21 18:13:30] [INFO ] Computed and/alt/rep : 83/167/83 causal constraints (skipped 6 transitions) in 7 ms.
[2024-05-21 18:13:30] [INFO ] Deduced a trap composed of 10 places in 33 ms of which 0 ms to minimize.
[2024-05-21 18:13:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2024-05-21 18:13:30] [INFO ] Added : 80 causal constraints over 16 iterations in 210 ms. Result :sat
Minimization took 35 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 92/92 transitions.
Applied a total of 0 rules in 13 ms. Remains 151 /151 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 151/151 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 92/92 transitions.
Applied a total of 0 rules in 9 ms. Remains 151 /151 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-21 18:13:31] [INFO ] Invariant cache hit.
[2024-05-21 18:13:31] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-21 18:13:31] [INFO ] Invariant cache hit.
[2024-05-21 18:13:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-21 18:13:31] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-05-21 18:13:31] [INFO ] Redundant transitions in 2 ms returned []
Running 89 sub problems to find dead transitions.
[2024-05-21 18:13:31] [INFO ] Invariant cache hit.
[2024-05-21 18:13:31] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (OVERLAPS) 1/148 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 18:13:32] [INFO ] Deduced a trap composed of 20 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (OVERLAPS) 2/150 variables, 8/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/150 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 8 (OVERLAPS) 92/242 variables, 150/212 constraints. Problems are: Problem set: 0 solved, 89 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/242 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/242 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 1/243 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/243 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 18:13:37] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/243 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/243 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 15 (OVERLAPS) 0/243 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 216 constraints, problems are : Problem set: 0 solved, 89 unsolved in 7597 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 151/151 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 89 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 4 (OVERLAPS) 1/148 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 7 (OVERLAPS) 2/150 variables, 8/63 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 18:13:40] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-21 18:13:40] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/150 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 18:13:40] [INFO ] Deduced a trap composed of 11 places in 38 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/150 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/150 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 11 (OVERLAPS) 92/242 variables, 150/216 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/242 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/242 variables, 89/307 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 18:13:42] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 2 ms to minimize.
[2024-05-21 18:13:42] [INFO ] Deduced a trap composed of 17 places in 96 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/242 variables, 2/309 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 18:13:44] [INFO ] Deduced a trap composed of 17 places in 41 ms of which 1 ms to minimize.
[2024-05-21 18:13:44] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 12 ms to minimize.
[2024-05-21 18:13:44] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 12 ms to minimize.
[2024-05-21 18:13:45] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 0 ms to minimize.
[2024-05-21 18:13:45] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/242 variables, 5/314 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 18:13:47] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 14 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/242 variables, 1/315 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 18:13:50] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-21 18:13:50] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/242 variables, 2/317 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/242 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 19 (OVERLAPS) 1/243 variables, 1/318 constraints. Problems are: Problem set: 0 solved, 89 unsolved
[2024-05-21 18:13:57] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/243 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 89 unsolved
At refinement iteration 22 (OVERLAPS) 0/243 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 89 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 319 constraints, problems are : Problem set: 0 solved, 89 unsolved in 26310 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 151/151 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 89/89 constraints, Known Traps: 16/16 constraints]
After SMT, in 34012ms problems are : Problem set: 0 solved, 89 unsolved
Search for dead transitions found 0 dead transitions in 34027ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34374 ms. Remains : 151/151 places, 92/92 transitions.
RANDOM walk for 40000 steps (546 resets) in 1052 ms. (37 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (87 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (89 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1184490 steps, run timeout after 3001 ms. (steps per millisecond=394 ) properties seen :0 out of 2
Probabilistic random walk after 1184490 steps, saw 165887 distinct states, run finished after 3004 ms. (steps per millisecond=394 ) properties seen :0
[2024-05-21 18:14:08] [INFO ] Invariant cache hit.
[2024-05-21 18:14:08] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/65 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/98 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/130 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 79/209 variables, 130/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 12/221 variables, 8/196 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/221 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/221 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 1/222 variables, 1/200 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/222 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/222 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 12/234 variables, 3/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/234 variables, 1/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/234 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 9/243 variables, 9/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/243 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 0/243 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 243/243 variables, and 214 constraints, problems are : Problem set: 0 solved, 2 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 151/151 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 56/65 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 33/98 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 25/123 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 7/130 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 79/209 variables, 130/186 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/209 variables, 2/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/209 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 18:14:09] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/209 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/209 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/221 variables, 8/199 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/221 variables, 3/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/221 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 1/222 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/222 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/222 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 12/234 variables, 3/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/234 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/234 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (OVERLAPS) 9/243 variables, 9/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/243 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 0/243 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 243/243 variables, and 217 constraints, problems are : Problem set: 0 solved, 2 unsolved in 419 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 151/151 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 903ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 497 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=165 )
Parikh walk visited 2 properties in 15 ms.
FORMULA DES-PT-10a-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 48732 ms.
ITS solved all properties within timeout

BK_STOP 1716315249975

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DES-PT-10a, 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 r091-tall-171624188200669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10a.tgz
mv DES-PT-10a 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 ;