fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r065-tajo-171620414500156
Last Updated
July 7, 2024

About the Execution of 2023-gold for BridgeAndVehicles-PT-V50P50N10

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2819.796 371491.00 396869.00 141.80 50 50 50 1 50 50 1 50 1 50 10 50 50 1 50 50 normal

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.r065-tajo-171620414500156.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 gold2023
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 r065-tajo-171620414500156
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 18K Apr 13 02:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 13 02:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 129K Apr 13 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 529K Apr 13 02:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 7.4K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 77K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 227K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 44K Apr 13 02:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 264K Apr 13 02:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 133K Apr 13 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 514K Apr 13 02:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.7K 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 1.1M 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-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 1716633705579

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=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P50N10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 10:41:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 10:41:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 10:41:47] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-05-25 10:41:47] [INFO ] Transformed 128 places.
[2024-05-25 10:41:47] [INFO ] Transformed 1328 transitions.
[2024-05-25 10:41:47] [INFO ] Parsed PT model containing 128 places and 1328 transitions and 10010 arcs in 288 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 250 out of 1328 initially.
// Phase 1: matrix 250 rows 128 cols
[2024-05-25 10:41:47] [INFO ] Computed 7 invariants in 41 ms
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-15 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-11 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-02 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-00 50 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 22 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 10) seen :331
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-14 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-07 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :208
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-12 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-09 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-04 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-01 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-05-25 10:41:47] [INFO ] Flow matrix only has 250 transitions (discarded 1078 similar events)
// Phase 1: matrix 250 rows 128 cols
[2024-05-25 10:41:47] [INFO ] Computed 7 invariants in 14 ms
[2024-05-25 10:41:48] [INFO ] [Real]Absence check using 7 positive place invariants in 6 ms returned sat
[2024-05-25 10:41:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:41:48] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-25 10:41:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 10:41:48] [INFO ] [Real]Added 22 Read/Feed constraints in 36 ms returned sat
[2024-05-25 10:41:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:41:48] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-05-25 10:41:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:41:48] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2024-05-25 10:41:48] [INFO ] [Nat]Added 22 Read/Feed constraints in 48 ms returned sat
[2024-05-25 10:41:48] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 137 transitions) in 78 ms.
[2024-05-25 10:41:49] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 9 ms to minimize.
[2024-05-25 10:41:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 320 ms
[2024-05-25 10:41:49] [INFO ] Added : 10 causal constraints over 2 iterations in 512 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [50] Max seen :[7]
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.7 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 2 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 240 ms. Remains 125 /128 variables (removed 3) and now considering 1327/1328 (removed 1) transitions.
[2024-05-25 10:41:49] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2024-05-25 10:41:49] [INFO ] Computed 5 invariants in 4 ms
[2024-05-25 10:41:50] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 778 ms. Remains : 125/128 places, 1327/1328 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 125 cols
[2024-05-25 10:41:50] [INFO ] Computed 5 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4368 ms. (steps per millisecond=228 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000005 steps, including 1085 resets, run finished after 2077 ms. (steps per millisecond=481 ) properties (out of 1) seen :10
[2024-05-25 10:41:56] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 125 cols
[2024-05-25 10:41:56] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 10:41:56] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:41:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:41:56] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-25 10:41:56] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 10:41:56] [INFO ] [Real]Added 22 Read/Feed constraints in 15 ms returned sat
[2024-05-25 10:41:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:41:56] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:41:56] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-25 10:41:56] [INFO ] [Nat]Added 22 Read/Feed constraints in 19 ms returned sat
[2024-05-25 10:41:57] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 97 ms.
[2024-05-25 10:41:57] [INFO ] Added : 10 causal constraints over 2 iterations in 289 ms. Result :sat
Minimization took 138 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 178 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 178 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 162 ms. Remains 125 /125 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 10:41:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 10:41:58] [INFO ] Invariant cache hit.
[2024-05-25 10:41:58] [INFO ] Implicit Places using invariants in 344 ms returned []
[2024-05-25 10:41:58] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 10:41:58] [INFO ] Invariant cache hit.
[2024-05-25 10:41:58] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 10:41:59] [INFO ] Implicit Places using invariants and state equation in 604 ms returned [52, 108]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 958 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 65 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 1187 ms. Remains : 123/125 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 10:41:59] [INFO ] Computed 5 invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 4079 ms. (steps per millisecond=245 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1088 resets, run finished after 1562 ms. (steps per millisecond=640 ) properties (out of 1) seen :10
[2024-05-25 10:42:04] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 10:42:04] [INFO ] Computed 5 invariants in 7 ms
[2024-05-25 10:42:04] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:42:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:42:04] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-25 10:42:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:42:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:42:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:42:05] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-05-25 10:42:05] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 10:42:05] [INFO ] [Nat]Added 22 Read/Feed constraints in 144 ms returned sat
[2024-05-25 10:42:05] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 33 ms.
[2024-05-25 10:42:05] [INFO ] Added : 10 causal constraints over 2 iterations in 160 ms. Result :sat
Minimization took 117 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 131 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 131 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 116 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 10:42:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 10:42:06] [INFO ] Invariant cache hit.
[2024-05-25 10:42:06] [INFO ] Implicit Places using invariants in 851 ms returned []
[2024-05-25 10:42:06] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 10:42:06] [INFO ] Invariant cache hit.
[2024-05-25 10:42:07] [INFO ] Implicit Places using invariants and state equation in 434 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
[2024-05-25 10:42:07] [INFO ] Redundant transitions in 74 ms returned []
[2024-05-25 10:42:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 10:42:07] [INFO ] Invariant cache hit.
[2024-05-25 10:42:07] [INFO ] Dead Transitions using invariants and state equation in 425 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1921 ms. Remains : 123/123 places, 1327/1327 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-10
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 10:42:07] [INFO ] Computed 5 invariants in 2 ms
Incomplete random walk after 10000 steps, including 26 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :10
[2024-05-25 10:42:07] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 10:42:07] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 10:42:07] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 10:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:42:08] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-05-25 10:42:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:42:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2024-05-25 10:42:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:42:08] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2024-05-25 10:42:08] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 10:42:08] [INFO ] [Nat]Added 22 Read/Feed constraints in 104 ms returned sat
[2024-05-25 10:42:08] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 42 ms.
[2024-05-25 10:42:08] [INFO ] Added : 10 causal constraints over 2 iterations in 99 ms. Result :sat
Minimization took 113 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 61 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 10:42:08] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 10:42:08] [INFO ] Invariant cache hit.
[2024-05-25 10:42:09] [INFO ] Dead Transitions using invariants and state equation in 420 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 481 ms. Remains : 123/123 places, 1327/1327 transitions.
Normalized transition count is 249 out of 1327 initially.
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 10:42:09] [INFO ] Computed 5 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 2622 resets, run finished after 3838 ms. (steps per millisecond=260 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000001 steps, including 1087 resets, run finished after 1537 ms. (steps per millisecond=650 ) properties (out of 1) seen :10
[2024-05-25 10:42:14] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
// Phase 1: matrix 249 rows 123 cols
[2024-05-25 10:42:14] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 10:42:14] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:42:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 10:42:14] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2024-05-25 10:42:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 10:42:14] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 10:42:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 10:42:14] [INFO ] [Nat]Absence check using state equation in 98 ms returned sat
[2024-05-25 10:42:14] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 10:42:15] [INFO ] [Nat]Added 22 Read/Feed constraints in 104 ms returned sat
[2024-05-25 10:42:15] [INFO ] Computed and/alt/rep : 110/218/110 causal constraints (skipped 136 transitions) in 28 ms.
[2024-05-25 10:42:15] [INFO ] Added : 10 causal constraints over 2 iterations in 62 ms. Result :sat
Minimization took 91 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 57 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 57 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 73 ms. Remains 123 /123 variables (removed 0) and now considering 1327/1327 (removed 0) transitions.
[2024-05-25 10:42:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 10:42:15] [INFO ] Invariant cache hit.
[2024-05-25 10:42:15] [INFO ] Implicit Places using invariants in 204 ms returned []
[2024-05-25 10:42:15] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 10:42:15] [INFO ] Invariant cache hit.
[2024-05-25 10:42:16] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
[2024-05-25 10:42:16] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-25 10:42:16] [INFO ] Flow matrix only has 249 transitions (discarded 1078 similar events)
[2024-05-25 10:42:16] [INFO ] Invariant cache hit.
[2024-05-25 10:42:16] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1199 ms. Remains : 123/123 places, 1327/1327 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V50P50N10-UpperBounds-10 in 8960 ms.
[2024-05-25 10:42:17] [INFO ] Flatten gal took : 160 ms
[2024-05-25 10:42:17] [INFO ] Applying decomposition
[2024-05-25 10:42:17] [INFO ] Flatten gal took : 96 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph17923630513920793507.txt' '-o' '/tmp/graph17923630513920793507.bin' '-w' '/tmp/graph17923630513920793507.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph17923630513920793507.bin' '-l' '-1' '-v' '-w' '/tmp/graph17923630513920793507.weights' '-q' '0' '-e' '0.001'
[2024-05-25 10:42:17] [INFO ] Decomposing Gal with order
[2024-05-25 10:42:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 10:42:17] [INFO ] Removed a total of 3109 redundant transitions.
[2024-05-25 10:42:18] [INFO ] Flatten gal took : 315 ms
[2024-05-25 10:42:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 461 labels/synchronizations in 68 ms.
[2024-05-25 10:42:18] [INFO ] Time to serialize gal into /tmp/UpperBounds9186541759192944831.gal : 10 ms
[2024-05-25 10:42:18] [INFO ] Time to serialize properties into /tmp/UpperBounds13177914899893818820.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9186541759192944831.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds13177914899893818820.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds13177914899893818820.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,2.04953e+08,336.432,2319776,4324,15723,1.70311e+06,2.36631e+06,210,5.95251e+06,360,2.6159e+07,0
Total reachable state count : 204953172

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-PT-V50P50N10-UpperBounds-10 :0 <= i0.u2.SUR_PONT_A <= 10
FORMULA BridgeAndVehicles-PT-V50P50N10-UpperBounds-10 10 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V50P50N10-UpperBounds-10,0,338.151,2319776,1,0,1.70311e+06,2.36631e+06,255,5.95251e+06,414,2.6159e+07,1654
Total runtime 369559 ms.

BK_STOP 1716634077070

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-PT-V50P50N10"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
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 r065-tajo-171620414500156"
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 ;