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-171620414400126.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-V20P20N10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r065-tajo-171620414400126
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 15K Apr 13 01:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 13 01:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 13 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 220K Apr 13 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 26K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Apr 13 01:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 181K Apr 13 01:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 13 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 648K Apr 13 01:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.1K Apr 22 14:29 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 434K 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-V20P20N10-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V20P20N10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716630270686

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-V20P20N10
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-25 09:44:32] [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 09:44:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 09:44:33] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-05-25 09:44:33] [INFO ] Transformed 68 places.
[2024-05-25 09:44:33] [INFO ] Transformed 548 transitions.
[2024-05-25 09:44:33] [INFO ] Parsed PT model containing 68 places and 548 transitions and 4070 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 130 out of 548 initially.
// Phase 1: matrix 130 rows 68 cols
[2024-05-25 09:44:33] [INFO ] Computed 7 invariants in 30 ms
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-15 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-07 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-05 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 56 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 11) seen :91
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-11 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-10 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-08 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-00 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 10000 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :8
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 10005 steps, including 19 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 4) seen :13
[2024-05-25 09:44:33] [INFO ] Flow matrix only has 130 transitions (discarded 418 similar events)
// Phase 1: matrix 130 rows 68 cols
[2024-05-25 09:44:33] [INFO ] Computed 7 invariants in 6 ms
[2024-05-25 09:44:33] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2024-05-25 09:44:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2024-05-25 09:44:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2024-05-25 09:44:33] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 09:44:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:33] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-25 09:44:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:44:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-25 09:44:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:33] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-25 09:44:33] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:44:34] [INFO ] [Nat]Added 22 Read/Feed constraints in 21 ms returned sat
[2024-05-25 09:44:34] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 77 transitions) in 35 ms.
[2024-05-25 09:44:34] [INFO ] Added : 10 causal constraints over 2 iterations in 70 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 20] Max seen :[1, 1, 1, 10]
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 68 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 68/68 places, 548/548 transitions.
Graph (complete) has 562 edges and 68 vertex of which 66 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 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 65 transition count 547
Applied a total of 3 rules in 115 ms. Remains 65 /68 variables (removed 3) and now considering 547/548 (removed 1) transitions.
[2024-05-25 09:44:34] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2024-05-25 09:44:34] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 09:44:34] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 364 ms. Remains : 65/68 places, 547/548 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 65 cols
[2024-05-25 09:44:34] [INFO ] Computed 5 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6490 resets, run finished after 2380 ms. (steps per millisecond=420 ) properties (out of 1) seen :8
Incomplete Best-First random walk after 1000008 steps, including 2546 resets, run finished after 1204 ms. (steps per millisecond=830 ) properties (out of 1) seen :10
[2024-05-25 09:44:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 65 cols
[2024-05-25 09:44:38] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 09:44:38] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2024-05-25 09:44:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:38] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-25 09:44:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:44:38] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:44:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:38] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2024-05-25 09:44:38] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:44:38] [INFO ] [Nat]Added 22 Read/Feed constraints in 11 ms returned sat
[2024-05-25 09:44:38] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 27 ms.
[2024-05-25 09:44:38] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 10 ms to minimize.
[2024-05-25 09:44:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2024-05-25 09:44:38] [INFO ] Added : 11 causal constraints over 3 iterations in 203 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 38 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 65/65 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 547/547 transitions.
Applied a total of 0 rules in 42 ms. Remains 65 /65 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2024-05-25 09:44:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2024-05-25 09:44:38] [INFO ] Invariant cache hit.
[2024-05-25 09:44:38] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-25 09:44:38] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2024-05-25 09:44:38] [INFO ] Invariant cache hit.
[2024-05-25 09:44:39] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:44:39] [INFO ] Implicit Places using invariants and state equation in 317 ms returned [22, 48]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 490 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 63/65 places, 547/547 transitions.
Applied a total of 0 rules in 21 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 554 ms. Remains : 63/65 places, 547/547 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2024-05-25 09:44:39] [INFO ] Computed 5 invariants in 2 ms
Incomplete random walk after 1000000 steps, including 6489 resets, run finished after 2085 ms. (steps per millisecond=479 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000001 steps, including 2552 resets, run finished after 956 ms. (steps per millisecond=1046 ) properties (out of 1) seen :10
[2024-05-25 09:44:42] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2024-05-25 09:44:42] [INFO ] Computed 5 invariants in 3 ms
[2024-05-25 09:44:42] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:42] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2024-05-25 09:44:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:44:42] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:44:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:42] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2024-05-25 09:44:42] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:44:42] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2024-05-25 09:44:42] [INFO ] Deduced a trap composed of 5 places in 94 ms of which 1 ms to minimize.
[2024-05-25 09:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2024-05-25 09:44:42] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 34 ms.
[2024-05-25 09:44:42] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 1 ms to minimize.
[2024-05-25 09:44:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-25 09:44:42] [INFO ] Added : 11 causal constraints over 3 iterations in 187 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 20 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 20 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2024-05-25 09:44:42] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2024-05-25 09:44:42] [INFO ] Invariant cache hit.
[2024-05-25 09:44:43] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-25 09:44:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2024-05-25 09:44:43] [INFO ] Invariant cache hit.
[2024-05-25 09:44:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:44:43] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2024-05-25 09:44:43] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-25 09:44:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2024-05-25 09:44:43] [INFO ] Invariant cache hit.
[2024-05-25 09:44:43] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 633 ms. Remains : 63/63 places, 547/547 transitions.
Starting property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-13
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2024-05-25 09:44:43] [INFO ] Computed 5 invariants in 2 ms
Incomplete random walk after 10000 steps, including 64 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :6
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :10
[2024-05-25 09:44:43] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2024-05-25 09:44:43] [INFO ] Computed 5 invariants in 2 ms
[2024-05-25 09:44:43] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:43] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-25 09:44:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:44:43] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:44:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:43] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-25 09:44:43] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:44:43] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2024-05-25 09:44:43] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 2 ms to minimize.
[2024-05-25 09:44:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-25 09:44:43] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 20 ms.
[2024-05-25 09:44:44] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2024-05-25 09:44:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2024-05-25 09:44:44] [INFO ] Added : 11 causal constraints over 3 iterations in 168 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 17 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2024-05-25 09:44:44] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2024-05-25 09:44:44] [INFO ] Invariant cache hit.
[2024-05-25 09:44:44] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 63/63 places, 547/547 transitions.
Normalized transition count is 129 out of 547 initially.
// Phase 1: matrix 129 rows 63 cols
[2024-05-25 09:44:44] [INFO ] Computed 5 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 6490 resets, run finished after 2352 ms. (steps per millisecond=425 ) properties (out of 1) seen :7
Incomplete Best-First random walk after 1000000 steps, including 2547 resets, run finished after 981 ms. (steps per millisecond=1019 ) properties (out of 1) seen :10
[2024-05-25 09:44:47] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
// Phase 1: matrix 129 rows 63 cols
[2024-05-25 09:44:47] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 09:44:47] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:44:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:47] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-25 09:44:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 09:44:47] [INFO ] [Nat]Absence check using 5 positive place invariants in 2 ms returned sat
[2024-05-25 09:44:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 09:44:47] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-05-25 09:44:47] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:44:47] [INFO ] [Nat]Added 22 Read/Feed constraints in 7 ms returned sat
[2024-05-25 09:44:47] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 1 ms to minimize.
[2024-05-25 09:44:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-25 09:44:47] [INFO ] Computed and/alt/rep : 50/98/50 causal constraints (skipped 76 transitions) in 17 ms.
[2024-05-25 09:44:48] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-25 09:44:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-25 09:44:48] [INFO ] Added : 11 causal constraints over 3 iterations in 154 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : [20] Max seen :[10]
Support contains 1 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 21 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 63/63 places, 547/547 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 547/547 transitions.
Applied a total of 0 rules in 19 ms. Remains 63 /63 variables (removed 0) and now considering 547/547 (removed 0) transitions.
[2024-05-25 09:44:48] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2024-05-25 09:44:48] [INFO ] Invariant cache hit.
[2024-05-25 09:44:48] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-25 09:44:48] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2024-05-25 09:44:48] [INFO ] Invariant cache hit.
[2024-05-25 09:44:48] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-25 09:44:48] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 351 ms to find 0 implicit places.
[2024-05-25 09:44:48] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-25 09:44:48] [INFO ] Flow matrix only has 129 transitions (discarded 418 similar events)
[2024-05-25 09:44:48] [INFO ] Invariant cache hit.
[2024-05-25 09:44:48] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 616 ms. Remains : 63/63 places, 547/547 transitions.
Ending property specific reduction for BridgeAndVehicles-PT-V20P20N10-UpperBounds-13 in 5277 ms.
[2024-05-25 09:44:49] [INFO ] Flatten gal took : 90 ms
[2024-05-25 09:44:49] [INFO ] Applying decomposition
[2024-05-25 09:44:49] [INFO ] Flatten gal took : 36 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/graph15501157916228601134.txt' '-o' '/tmp/graph15501157916228601134.bin' '-w' '/tmp/graph15501157916228601134.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15501157916228601134.bin' '-l' '-1' '-v' '-w' '/tmp/graph15501157916228601134.weights' '-q' '0' '-e' '0.001'
[2024-05-25 09:44:49] [INFO ] Decomposing Gal with order
[2024-05-25 09:44:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 09:44:49] [INFO ] Removed a total of 953 redundant transitions.
[2024-05-25 09:44:49] [INFO ] Flatten gal took : 189 ms
[2024-05-25 09:44:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 137 labels/synchronizations in 9 ms.
[2024-05-25 09:44:49] [INFO ] Time to serialize gal into /tmp/UpperBounds6756476984253036227.gal : 3 ms
[2024-05-25 09:44:49] [INFO ] Time to serialize properties into /tmp/UpperBounds6183782878393351444.prop : 0 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/UpperBounds6756476984253036227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds6183782878393351444.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 ...283
Loading property file /tmp/UpperBounds6183782878393351444.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,4.05339e+06,21.1833,368640,1050,4637,157010,248469,105,922298,186,4.31598e+06,0
Total reachable state count : 4053390

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 10
Bounds property BridgeAndVehicles-PT-V20P20N10-UpperBounds-13 :0 <= u0.SUR_PONT_A <= 10
FORMULA BridgeAndVehicles-PT-V20P20N10-UpperBounds-13 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-V20P20N10-UpperBounds-13,0,21.3791,368640,1,0,157010,248469,132,922298,226,4.31598e+06,168
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 38248 ms.

BK_STOP 1716630311360

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-V20P20N10"
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-V20P20N10, 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-171620414400126"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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