Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r027-smll-174853774300041.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is BridgeAndVehicles-PT-V04P05N02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r027-smll-174853774300041
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 10 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 37K May 29 14:32 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

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-00
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-01
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-02
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-03
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-04
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-05
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-06
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-07
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-08
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-09
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-10
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-11
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-12
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-13
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-14
FORMULA_NAME BridgeAndVehicles-PT-V04P05N02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748547357354

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V04P05N02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-29 19:36:00] [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]
[2025-05-29 19:36:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 19:36:00] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2025-05-29 19:36:00] [INFO ] Transformed 28 places.
[2025-05-29 19:36:00] [INFO ] Transformed 52 transitions.
[2025-05-29 19:36:00] [INFO ] Parsed PT model containing 28 places and 52 transitions and 326 arcs in 353 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
Reduction of identical properties reduced properties to check from 16 to 14
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 4, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 4, 0, 1, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2025-05-29 19:36:00] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 28 cols
[2025-05-29 19:36:00] [INFO ] Computed 7 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 5, 0, 0, 0, 0, 0, 4, 0, 1, 0] Max Struct:[4, 4, 4, 2, 5, 4, 2, 4, 1, 1, 4, 1, 1, 4]
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-13 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-04 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (229 resets) in 98 ms. (101 steps per ms)
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-08 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (413 resets) in 234 ms. (170 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 1, 2, 1] Max Struct:[4, 2, 4, 2]
[2025-05-29 19:36:01] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2025-05-29 19:36:01] [INFO ] Invariant cache hit.
[2025-05-29 19:36:01] [INFO ] [Real]Absence check using 7 positive place invariants in 9 ms returned sat
[2025-05-29 19:36:01] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2025-05-29 19:36:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2025-05-29 19:36:01] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2025-05-29 19:36:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-05-29 19:36:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 21 ms returned sat
[2025-05-29 19:36:01] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 19 ms.
[2025-05-29 19:36:02] [INFO ] Deduced a trap composed of 6 places in 84 ms of which 13 ms to minimize.
[2025-05-29 19:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 110 ms
[2025-05-29 19:36:02] [INFO ] Added : 16 causal constraints over 4 iterations in 217 ms. Result :sat
Minimization took 35 ms.
[2025-05-29 19:36:02] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2025-05-29 19:36:02] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 19:36:02] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-05-29 19:36:02] [INFO ] [Real]Added 6 Read/Feed constraints in 4 ms returned sat
[2025-05-29 19:36:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:02] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-05-29 19:36:02] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-05-29 19:36:02] [INFO ] [Nat]Added 6 Read/Feed constraints in 3 ms returned sat
[2025-05-29 19:36:02] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 ms to minimize.
[2025-05-29 19:36:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2025-05-29 19:36:02] [INFO ] Computed and/alt/rep : 25/123/25 causal constraints (skipped 6 transitions) in 13 ms.
[2025-05-29 19:36:02] [INFO ] Added : 12 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 37 ms.
[2025-05-29 19:36:02] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 1, 2, 1] Max Struct:[4, 1, 4, 1]
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[4, 4]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 28/28 places, 52/52 transitions.
Graph (complete) has 146 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 24 ms. Remains 26 /28 variables (removed 2) and now considering 52/52 (removed 0) transitions.
Running 49 sub problems to find dead transitions.
[2025-05-29 19:36:02] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2025-05-29 19:36:02] [INFO ] Computed 5 invariants in 2 ms
[2025-05-29 19:36:02] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2025-05-29 19:36:03] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 3 ms to minimize.
[2025-05-29 19:36:03] [INFO ] Deduced a trap composed of 7 places in 33 ms of which 1 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD45 is UNSAT
[2025-05-29 19:36:03] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD33 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 8 solved, 41 unsolved
Problem TDEAD4 is UNSAT
Problem TDEAD17 is UNSAT
At refinement iteration 3 (OVERLAPS) 34/60 variables, 26/34 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/40 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 0/40 constraints. Problems are: Problem set: 10 solved, 39 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/60 variables, 0/40 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 40 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1372 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 10 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 5/5 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 3/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/8 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 34/60 variables, 26/34 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 6/40 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 39/79 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/79 constraints. Problems are: Problem set: 10 solved, 39 unsolved
At refinement iteration 7 (OVERLAPS) 0/60 variables, 0/79 constraints. Problems are: Problem set: 10 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 79 constraints, problems are : Problem set: 10 solved, 39 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 26/26 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 39/49 constraints, Known Traps: 3/3 constraints]
After SMT, in 2588ms problems are : Problem set: 10 solved, 39 unsolved
Search for dead transitions found 10 dead transitions in 2610ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 26/28 places, 42/52 transitions.
Applied a total of 0 rules in 6 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2667 ms. Remains : 26/28 places, 42/52 transitions.
[2025-05-29 19:36:05] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 26 cols
[2025-05-29 19:36:05] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[4, 4]
RANDOM walk for 1000000 steps (22974 resets) in 1749 ms. (571 steps per ms)
BEST_FIRST walk for 2000000 steps (19491 resets) in 1198 ms. (1668 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[4, 4]
[2025-05-29 19:36:08] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-05-29 19:36:08] [INFO ] Invariant cache hit.
[2025-05-29 19:36:08] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-05-29 19:36:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-29 19:36:08] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-05-29 19:36:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2025-05-29 19:36:08] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 2 ms to minimize.
[2025-05-29 19:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-05-29 19:36:08] [INFO ] Computed and/alt/rep : 23/111/23 causal constraints (skipped 4 transitions) in 7 ms.
[2025-05-29 19:36:08] [INFO ] Added : 18 causal constraints over 4 iterations in 62 ms. Result :sat
Minimization took 40 ms.
[2025-05-29 19:36:08] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Real]Absence check using 6 positive and 1 generalized place invariants in 2 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2025-05-29 19:36:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:08] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Nat]Absence check using 6 positive and 1 generalized place invariants in 1 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-05-29 19:36:08] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2025-05-29 19:36:08] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 2 ms to minimize.
[2025-05-29 19:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-05-29 19:36:08] [INFO ] Computed and/alt/rep : 23/111/23 causal constraints (skipped 4 transitions) in 6 ms.
[2025-05-29 19:36:08] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 2 ms to minimize.
[2025-05-29 19:36:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2025-05-29 19:36:08] [INFO ] Added : 12 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 31 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[4, 4]
Support contains 2 out of 26 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 26/26 places, 42/42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 26/26 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 26 /26 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2025-05-29 19:36:08] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-05-29 19:36:08] [INFO ] Invariant cache hit.
[2025-05-29 19:36:08] [INFO ] Implicit Places using invariants in 85 ms returned [6, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 89 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 24/26 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 99 ms. Remains : 24/26 places, 42/42 transitions.
[2025-05-29 19:36:08] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
// Phase 1: matrix 30 rows 24 cols
[2025-05-29 19:36:08] [INFO ] Computed 5 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2] Max Struct:[4, 4]
RANDOM walk for 1000000 steps (22972 resets) in 1231 ms. (811 steps per ms)
BEST_FIRST walk for 2000002 steps (19510 resets) in 930 ms. (2148 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2] Max Struct:[4, 4]
[2025-05-29 19:36:11] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-05-29 19:36:11] [INFO ] Invariant cache hit.
[2025-05-29 19:36:11] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:36:11] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-05-29 19:36:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:36:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-29 19:36:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-29 19:36:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2025-05-29 19:36:11] [INFO ] Computed and/alt/rep : 23/79/23 causal constraints (skipped 4 transitions) in 6 ms.
[2025-05-29 19:36:11] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2025-05-29 19:36:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2025-05-29 19:36:11] [INFO ] Added : 9 causal constraints over 2 iterations in 76 ms. Result :sat
Minimization took 24 ms.
[2025-05-29 19:36:11] [INFO ] [Real]Absence check using 5 positive place invariants in 4 ms returned sat
[2025-05-29 19:36:11] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-05-29 19:36:11] [INFO ] [Real]Added 4 Read/Feed constraints in 3 ms returned sat
[2025-05-29 19:36:11] [INFO ] Solution in real domain found non-integer solution.
[2025-05-29 19:36:11] [INFO ] [Nat]Absence check using 5 positive place invariants in 3 ms returned sat
[2025-05-29 19:36:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-05-29 19:36:11] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2025-05-29 19:36:11] [INFO ] Computed and/alt/rep : 23/79/23 causal constraints (skipped 4 transitions) in 6 ms.
[2025-05-29 19:36:11] [INFO ] Added : 16 causal constraints over 4 iterations in 44 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2] Max Struct:[4, 4]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 2] Max Struct:[4, 4]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 42/42 transitions.
Applied a total of 0 rules in 7 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 24/24 places, 42/42 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 24 /24 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2025-05-29 19:36:11] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-05-29 19:36:11] [INFO ] Invariant cache hit.
[2025-05-29 19:36:11] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-05-29 19:36:11] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-05-29 19:36:11] [INFO ] Invariant cache hit.
[2025-05-29 19:36:11] [INFO ] State equation strengthened by 4 read => feed constraints.
[2025-05-29 19:36:11] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2025-05-29 19:36:11] [INFO ] Redundant transitions in 0 ms returned []
Running 39 sub problems to find dead transitions.
[2025-05-29 19:36:11] [INFO ] Flow matrix only has 30 transitions (discarded 12 similar events)
[2025-05-29 19:36:11] [INFO ] Invariant cache hit.
[2025-05-29 19:36:11] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-05-29 19:36:12] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 0/54 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 54/54 variables, and 34 constraints, problems are : Problem set: 0 solved, 39 unsolved in 975 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 30/54 variables, 24/30 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 39/73 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-05-29 19:36:13] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/54 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 39 unsolved
[2025-05-29 19:36:13] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/54 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (OVERLAPS) 0/54 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 54/54 variables, and 75 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1444 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 24/24 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 3/3 constraints]
After SMT, in 2465ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 2467ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2666 ms. Remains : 24/24 places, 42/42 transitions.
RANDOM walk for 40000 steps (917 resets) in 1611 ms. (24 steps per ms) remains 4/4 properties
[2025-05-29 19:36:14] [INFO ] Flatten gal took : 78 ms
[2025-05-29 19:36:14] [INFO ] Flatten gal took : 25 ms
[2025-05-29 19:36:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2476159239757237576.gal : 21 ms
[2025-05-29 19:36:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17860851022168966071.prop : 2 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2476159239757237576.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17860851022168966071.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40000 steps (393 resets) in 405 ms. (98 steps per ms) remains 4/4 properties
Loading property file /tmp/ReachabilityCardinality17860851022168966071.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 17
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :17 after 31
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :31 after 56
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :144 after 183
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :670 after 686
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :2610 after 2786
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,2874,0.118203,6336,2,1489,16,8408,10,0,144,10209,0
Total reachable state count : 2874

Verifying 4 reachability properties.
Reachability property MAX0 does not hold.
No reachable states exhibit your property : MAX0

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,0,0.119649,6336,1,0,16,8408,10,0,145,10209,0
Invariant property MIN0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,0,0.120075,6596,1,0,16,8408,10,0,145,10209,0
Reachability property MAX1 does not hold.
No reachable states exhibit your property : MAX1

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,0,0.120278,6596,1,0,16,8408,10,0,145,10209,0
Invariant property MIN1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,0,0.120489,6596,1,0,16,8408,10,0,145,10209,0
BEST_FIRST walk for 40002 steps (392 resets) in 320 ms. (124 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (386 resets) in 134 ms. (296 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (386 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 104 ms. (steps per millisecond=96 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 78 ms. (steps per millisecond=128 ) properties seen :0
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-05 2 TECHNIQUES REACHABILITY_MIN
FORMULA BridgeAndVehicles-PT-V04P05N02-UpperBounds-02 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 15503 ms.

BK_STOP 1748547375676

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-V04P05N02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is BridgeAndVehicles-PT-V04P05N02, 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 r027-smll-174853774300041"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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