Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 22K Feb 25 12:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 25 12:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 247K Feb 25 12:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 950K Feb 25 12:09 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Feb 25 15:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 111K Feb 25 15:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 335K Feb 25 15:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 40K Feb 25 12:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 234K Feb 25 12:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 177K Feb 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 714K Feb 25 12:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Feb 25 15:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:22 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-V50P50N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V50P50N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678618091819

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:48:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 10:48:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:48:13] [INFO ] Load time of PNML (sax parser for PT used): 104 ms
[2023-03-12 10:48:13] [INFO ] Transformed 128 places.
[2023-03-12 10:48:13] [INFO ] Transformed 1328 transitions.
[2023-03-12 10:48:13] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 128 cols
[2023-03-12 10:48:13] [INFO ] Computed 7 place invariants in 30 ms
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 12) seen :252
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-06 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :105
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :11
[2023-03-12 10:48:14] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2023-03-12 10:48:14] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-12 10:48:14] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned unsat
[2023-03-12 10:48:14] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2023-03-12 10:48:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:14] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2023-03-12 10:48:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:14] [INFO ] [Nat]Absence check using 7 positive place invariants in 6 ms returned sat
[2023-03-12 10:48:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:14] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-03-12 10:48:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:14] [INFO ] [Nat]Added 22 Read/Feed constraints in 104 ms returned sat
[2023-03-12 10:48:15] [INFO ] Deduced a trap composed of 6 places in 365 ms of which 8 ms to minimize.
[2023-03-12 10:48:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 420 ms
[2023-03-12 10:48:15] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 96 ms.
[2023-03-12 10:48:15] [INFO ] Added : 2 causal constraints over 1 iterations in 208 ms. Result :sat
Minimization took 203 ms.
Current structural bounds on expressions (after SMT) : [1, 50] Max seen :[1, 10]
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 1328/1328 transitions.
Graph (complete) has 1222 edges and 128 vertex of which 126 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.19 ms
Discarding 2 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 125 transition count 1327
Applied a total of 3 rules in 209 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2023-03-12 10:48:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:48:15] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-12 10:48:16] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 949 ms. Remains : 125/128 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:48:16] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 5487 ms. (steps per millisecond=182 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1028 resets, run finished after 1888 ms. (steps per millisecond=529 ) properties (out of 1) seen :10
[2023-03-12 10:48:24] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2023-03-12 10:48:24] [INFO ] Computed 5 place invariants in 8 ms
[2023-03-12 10:48:24] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:48:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:24] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2023-03-12 10:48:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:24] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 10:48:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:24] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2023-03-12 10:48:24] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:24] [INFO ] [Nat]Added 22 Read/Feed constraints in 25 ms returned sat
[2023-03-12 10:48:24] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 55 ms.
[2023-03-12 10:48:24] [INFO ] Added : 7 causal constraints over 7 iterations in 220 ms. Result :sat
Minimization took 301 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 125 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 89 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 125/125 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 125/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 114 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:25] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:25] [INFO ] Invariant cache hit.
[2023-03-12 10:48:25] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-12 10:48:25] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:25] [INFO ] Invariant cache hit.
[2023-03-12 10:48:25] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:26] [INFO ] Implicit Places using invariants and state equation in 743 ms returned [52, 107]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1069 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 123/125 places, 1327/1327 transitions.
Applied a total of 0 rules in 80 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1266 ms. Remains : 123/125 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:26] [INFO ] Computed 5 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4721 ms. (steps per millisecond=211 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 1029 resets, run finished after 1847 ms. (steps per millisecond=541 ) properties (out of 1) seen :10
[2023-03-12 10:48:32] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:33] [INFO ] Computed 5 place invariants in 6 ms
[2023-03-12 10:48:33] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:33] [INFO ] [Real]Absence check using state equation in 74 ms returned sat
[2023-03-12 10:48:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:33] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:33] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2023-03-12 10:48:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:33] [INFO ] [Nat]Added 22 Read/Feed constraints in 22 ms returned sat
[2023-03-12 10:48:33] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 54 ms.
[2023-03-12 10:48:33] [INFO ] Added : 12 causal constraints over 10 iterations in 243 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 76 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 75 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:34] [INFO ] Invariant cache hit.
[2023-03-12 10:48:34] [INFO ] Implicit Places using invariants in 266 ms returned []
[2023-03-12 10:48:34] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:34] [INFO ] Invariant cache hit.
[2023-03-12 10:48:34] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:35] [INFO ] Implicit Places using invariants and state equation in 733 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2023-03-12 10:48:35] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-12 10:48:35] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:35] [INFO ] Invariant cache hit.
[2023-03-12 10:48:35] [INFO ] Dead Transitions using invariants and state equation in 507 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1682 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-05
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:35] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :10
[2023-03-12 10:48:35] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:35] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-12 10:48:35] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 10:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:35] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-12 10:48:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:35] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2023-03-12 10:48:36] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:36] [INFO ] [Nat]Added 22 Read/Feed constraints in 23 ms returned sat
[2023-03-12 10:48:36] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 50 ms.
[2023-03-12 10:48:36] [INFO ] Added : 12 causal constraints over 10 iterations in 235 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 75 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:36] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:36] [INFO ] Invariant cache hit.
[2023-03-12 10:48:37] [INFO ] Dead Transitions using invariants and state equation in 481 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 563 ms. Remains : 123/123 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:37] [INFO ] Computed 5 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4995 ms. (steps per millisecond=200 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000000 steps, including 1030 resets, run finished after 1661 ms. (steps per millisecond=602 ) properties (out of 1) seen :10
[2023-03-12 10:48:43] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2023-03-12 10:48:43] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-12 10:48:44] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2023-03-12 10:48:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:44] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2023-03-12 10:48:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 10:48:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-12 10:48:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 10:48:44] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2023-03-12 10:48:44] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:44] [INFO ] [Nat]Added 22 Read/Feed constraints in 23 ms returned sat
[2023-03-12 10:48:44] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 44 ms.
[2023-03-12 10:48:44] [INFO ] Added : 12 causal constraints over 10 iterations in 254 ms. Result :sat
Minimization took 53 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[10]
Support contains 1 out of 123 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 79 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 123/123 places, 1327/1327 transitions.
Applied a total of 0 rules in 81 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2023-03-12 10:48:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:45] [INFO ] Invariant cache hit.
[2023-03-12 10:48:45] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-12 10:48:45] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:45] [INFO ] Invariant cache hit.
[2023-03-12 10:48:45] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-12 10:48:46] [INFO ] Implicit Places using invariants and state equation in 723 ms returned []
Implicit Place search using SMT with State Equation took 1004 ms to find 0 implicit places.
[2023-03-12 10:48:46] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-12 10:48:46] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2023-03-12 10:48:46] [INFO ] Invariant cache hit.
[2023-03-12 10:48:46] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1617 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-05 in 10997 ms.
[2023-03-12 10:48:47] [INFO ] Flatten gal took : 163 ms
[2023-03-12 10:48:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-12 10:48:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 123 places, 1327 transitions and 9804 arcs took 11 ms.
Total runtime 33636 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/559/ub_0_
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-05 10 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678619425429

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2023
ub formula name BridgeAndVehicles-PT-V50P50N10-UpperBounds-05
ub formula formula --maxsum=/tmp/559/ub_0_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 123 places, 1327 transitions and 9804 arcs
pnml2lts-sym: Petri net BridgeAndVehicles_PT_V50P50N10 analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.020 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1327->1226 groups
pnml2lts-sym: Regrouping took 0.750 real 0.750 user 0.000 sys
pnml2lts-sym: state vector length is 123; there are 1226 groups
pnml2lts-sym: Computing maximum sum over 1 state variables.
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 53883942 group checks and 0 next state calls
pnml2lts-sym: reachability took 1296.560 real 5176.960 user 4.510 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.050 user 0.000 sys
pnml2lts-sym: state space has 204953172 states, 89939 nodes
pnml2lts-sym: Maximum sum of /tmp/559/ub_0_ is: 10
pnml2lts-sym: group_next: 22428 nodes total
pnml2lts-sym: group_explored: 29279 nodes, 41197 short vectors total
pnml2lts-sym: max token count: 50

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-V50P50N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is BridgeAndVehicles-PT-V50P50N10, 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 r041-tajo-167813694400253"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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