Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397800261.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BridgeAndVehicles-PT-V50P50N20, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397800261
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 8.1M
-rw-r--r-- 1 mcc users 19K Apr 13 02:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 02:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 72K Apr 13 02:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 298K Apr 13 02:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 17K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 65K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 209K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 26K Apr 13 03:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 157K Apr 13 03:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 1.1M Apr 13 03:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 4.0M Apr 13 03:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.8K Apr 22 14:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 BridgeAndVehicles-PT-V50P50N20-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N20-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716289114518

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:58:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 10:58:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:58:36] [INFO ] Load time of PNML (sax parser for PT used): 248 ms
[2024-05-21 10:58:36] [INFO ] Transformed 138 places.
[2024-05-21 10:58:36] [INFO ] Transformed 2348 transitions.
[2024-05-21 10:58:36] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 422 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
Reduction of identical properties reduced properties to check from 16 to 14
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 50, 50, 0, 0, 0, 50, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 50, 50, 0, 0, 0, 50, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-21 10:58:36] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 10:58:36] [INFO ] Computed 7 invariants in 35 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 50, 50, 0, 0, 0, 50, 0] Max Struct:[50, 50, 50, 50, 2, 50, 50, 1, 1, 1, 50, 1]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (23 resets) in 231 ms. (43 steps per ms)
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 30003 steps (25 resets) in 162 ms. (184 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[6, 20, 1] Max Struct:[50, 50, 2]
[2024-05-21 10:58:37] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 10:58:37] [INFO ] Invariant cache hit.
[2024-05-21 10:58:37] [INFO ] [Real]Absence check using 7 positive place invariants in 10 ms returned sat
[2024-05-21 10:58:37] [INFO ] [Real]Absence check using state equation in 317 ms returned sat
[2024-05-21 10:58:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:58:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 10:58:38] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-21 10:58:38] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:58:38] [INFO ] [Nat]Added 42 Read/Feed constraints in 55 ms returned sat
[2024-05-21 10:58:38] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 153 ms.
[2024-05-21 10:58:38] [INFO ] Added : 20 causal constraints over 4 iterations in 396 ms. Result :sat
Minimization took 200 ms.
[2024-05-21 10:58:39] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2024-05-21 10:58:39] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-21 10:58:39] [INFO ] [Real]Added 42 Read/Feed constraints in 20 ms returned sat
[2024-05-21 10:58:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:58:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-21 10:58:39] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-21 10:58:39] [INFO ] [Nat]Added 42 Read/Feed constraints in 27 ms returned sat
[2024-05-21 10:58:39] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 76 ms.
[2024-05-21 10:58:39] [INFO ] Added : 22 causal constraints over 20 iterations in 418 ms. Result :sat
Minimization took 230 ms.
[2024-05-21 10:58:40] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[6, 20, 1] Max Struct:[50, 50, 1]
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[6, 20] Max Struct:[50, 50]
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.9 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 383 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 10:58:41] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:58:41] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:58:41] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-05-21 10:59:07] [INFO ] Deduced a trap composed of 5 places in 362 ms of which 35 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20066 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 1/1 constraints]
After SMT, in 57000ms problems are : Problem set: 0 solved, 2345 unsolved
Search for dead transitions found 0 dead transitions in 57066ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57482 ms. Remains : 136/138 places, 2348/2348 transitions.
[2024-05-21 10:59:38] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 10:59:38] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[6, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2315 resets) in 6626 ms. (150 steps per ms)
BEST_FIRST walk for 2000002 steps (1617 resets) in 4068 ms. (491 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 10:59:48] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 10:59:48] [INFO ] Invariant cache hit.
[2024-05-21 10:59:48] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:59:49] [INFO ] [Real]Absence check using state equation in 80 ms returned sat
[2024-05-21 10:59:49] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:59:49] [INFO ] [Real]Added 42 Read/Feed constraints in 47 ms returned sat
[2024-05-21 10:59:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:59:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:59:49] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-21 10:59:49] [INFO ] [Nat]Added 42 Read/Feed constraints in 62 ms returned sat
[2024-05-21 10:59:49] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 173 ms.
[2024-05-21 10:59:50] [INFO ] Deduced a trap composed of 5 places in 645 ms of which 5 ms to minimize.
[2024-05-21 10:59:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 694 ms
[2024-05-21 10:59:50] [INFO ] Added : 20 causal constraints over 4 iterations in 1208 ms. Result :sat
Minimization took 202 ms.
[2024-05-21 10:59:50] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-21 10:59:50] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-21 10:59:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 10:59:50] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 10:59:51] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-21 10:59:51] [INFO ] [Nat]Added 42 Read/Feed constraints in 30 ms returned sat
[2024-05-21 10:59:51] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 52 ms.
[2024-05-21 10:59:51] [INFO ] Added : 22 causal constraints over 20 iterations in 331 ms. Result :sat
Minimization took 217 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 167 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 167 ms. Remains : 136/136 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 382 ms. Remains 136 /136 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-21 10:59:53] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 10:59:53] [INFO ] Invariant cache hit.
[2024-05-21 10:59:53] [INFO ] Implicit Places using invariants in 469 ms returned []
[2024-05-21 10:59:53] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 10:59:53] [INFO ] Invariant cache hit.
[2024-05-21 10:59:54] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:59:55] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1864 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 134/136 places, 2348/2348 transitions.
Applied a total of 0 rules in 345 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2594 ms. Remains : 134/136 places, 2348/2348 transitions.
[2024-05-21 10:59:55] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 134 cols
[2024-05-21 10:59:55] [INFO ] Computed 5 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20, 20] Max Struct:[50, 50]
RANDOM walk for 1000000 steps (2316 resets) in 6335 ms. (157 steps per ms)
BEST_FIRST walk for 2000009 steps (1622 resets) in 4440 ms. (450 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20, 20] Max Struct:[50, 50]
[2024-05-21 11:00:06] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 11:00:06] [INFO ] Invariant cache hit.
[2024-05-21 11:00:06] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2024-05-21 11:00:06] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-21 11:00:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:00:06] [INFO ] [Real]Added 42 Read/Feed constraints in 54 ms returned sat
[2024-05-21 11:00:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:00:06] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:00:06] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2024-05-21 11:00:06] [INFO ] [Nat]Added 42 Read/Feed constraints in 90 ms returned sat
[2024-05-21 11:00:07] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 79 ms.
[2024-05-21 11:00:07] [INFO ] Deduced a trap composed of 5 places in 440 ms of which 1 ms to minimize.
[2024-05-21 11:00:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 482 ms
[2024-05-21 11:00:07] [INFO ] Added : 21 causal constraints over 5 iterations in 786 ms. Result :sat
Minimization took 314 ms.
[2024-05-21 11:00:08] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-21 11:00:08] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2024-05-21 11:00:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:00:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 18 ms returned sat
[2024-05-21 11:00:08] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2024-05-21 11:00:08] [INFO ] [Nat]Added 42 Read/Feed constraints in 40 ms returned sat
[2024-05-21 11:00:08] [INFO ] Deduced a trap composed of 5 places in 337 ms of which 0 ms to minimize.
[2024-05-21 11:00:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 359 ms
[2024-05-21 11:00:09] [INFO ] Computed and/alt/rep : 120/238/120 causal constraints (skipped 167 transitions) in 74 ms.
[2024-05-21 11:00:09] [INFO ] Added : 22 causal constraints over 20 iterations in 466 ms. Result :sat
Minimization took 353 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20, 20] Max Struct:[50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20, 20] Max Struct:[50, 50]
Support contains 2 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 279 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 279 ms. Remains : 134/134 places, 2348/2348 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 2348/2348 transitions.
Applied a total of 0 rules in 296 ms. Remains 134 /134 variables (removed 0) and now considering 2348/2348 (removed 0) transitions.
[2024-05-21 11:00:11] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 11:00:11] [INFO ] Invariant cache hit.
[2024-05-21 11:00:12] [INFO ] Implicit Places using invariants in 429 ms returned []
[2024-05-21 11:00:12] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 11:00:12] [INFO ] Invariant cache hit.
[2024-05-21 11:00:12] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 11:00:13] [INFO ] Implicit Places using invariants and state equation in 963 ms returned []
Implicit Place search using SMT with State Equation took 1410 ms to find 0 implicit places.
[2024-05-21 11:00:13] [INFO ] Redundant transitions in 137 ms returned []
Running 2345 sub problems to find dead transitions.
[2024-05-21 11:00:13] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
[2024-05-21 11:00:13] [INFO ] Invariant cache hit.
[2024-05-21 11:00:13] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P50N20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 138
TRANSITIONS: 2348
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.104s, Sys 0.012s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.017s, Sys 0.004s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 651
MODEL NAME: /home/mcc/execution/model
138 places, 2348 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-00 50 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-02 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-04 50 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-05 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-07 50 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-08 50 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-09 20 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-11 50 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-14 50 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V50P50N20-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716289274967

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

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

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="BridgeAndVehicles-PT-V50P50N20"
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 BridgeAndVehicles-PT-V50P50N20, 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 r047-tajo-171620397800261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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