About the Execution of 2024-gold for SafeBus-COL-50
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15687.880 | 3600000.00 | 3717088.00 | 12533.30 | 1 1 1 1 1 50 1 ? 50 1 ? 1 1 1 1 ? | normal |
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.r195-tall-174889278300094.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 SafeBus-COL-50, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r195-tall-174889278300094
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 43K 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 SafeBus-COL-50-UpperBounds-00
FORMULA_NAME SafeBus-COL-50-UpperBounds-01
FORMULA_NAME SafeBus-COL-50-UpperBounds-02
FORMULA_NAME SafeBus-COL-50-UpperBounds-03
FORMULA_NAME SafeBus-COL-50-UpperBounds-04
FORMULA_NAME SafeBus-COL-50-UpperBounds-05
FORMULA_NAME SafeBus-COL-50-UpperBounds-06
FORMULA_NAME SafeBus-COL-50-UpperBounds-07
FORMULA_NAME SafeBus-COL-50-UpperBounds-08
FORMULA_NAME SafeBus-COL-50-UpperBounds-09
FORMULA_NAME SafeBus-COL-50-UpperBounds-10
FORMULA_NAME SafeBus-COL-50-UpperBounds-11
FORMULA_NAME SafeBus-COL-50-UpperBounds-12
FORMULA_NAME SafeBus-COL-50-UpperBounds-13
FORMULA_NAME SafeBus-COL-50-UpperBounds-14
FORMULA_NAME SafeBus-COL-50-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748952659186
Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SafeBus-COL-50
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202405141337
[2025-06-03 12:11: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-06-03 12:11:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 12:11:00] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-03 12:11:00] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-03 12:11:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 577 ms
[2025-06-03 12:11:01] [INFO ] Detected 1 constant HL places corresponding to 50 PT places.
[2025-06-03 12:11:01] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 5606 PT places and 6520101.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2025-06-03 12:11:01] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 6 ms.
[2025-06-03 12:11:01] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Reduce places removed 3 places and 0 transitions.
// Phase 1: matrix 14 rows 17 cols
[2025-06-03 12:11:01] [INFO ] Computed 7 invariants in 9 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 1, 0, 0, 0, 50, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0] Max Struct:[1, 1, 1, 3, 1, 50, 5, 50, 50, 1, 50, 1, 1, 1, 1, 50]
FORMULA SafeBus-COL-50-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-05 50 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA SafeBus-COL-50-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2025-06-03 12:11:01] [INFO ] Invariant cache hit.
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 12:11:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2025-06-03 12:11:01] [INFO ] [Real]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 12:11:01] [INFO ] Added : 9 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:11:01] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Minimization took 60 ms.
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:11:01] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:11:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:11:01] [INFO ] Added : 8 causal constraints over 2 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:11:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:11:01] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:11:01] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 12:11:01] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:11:02] [INFO ] Added : 6 causal constraints over 2 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:11:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:11:02] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 12:11:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:11:02] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:11:02] [INFO ] Added : 12 causal constraints over 5 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:11:02] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 12:11:02] [INFO ] Added : 6 causal constraints over 2 iterations in 15 ms. Result :sat
Minimization took 8 ms.
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 0 ms returned sat
[2025-06-03 12:11:02] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:11:02] [INFO ] Added : 8 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 0 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 12:11:02] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2025-06-03 12:11:02] [INFO ] Computed and/alt/rep : 13/32/13 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 12:11:02] [INFO ] Added : 8 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 3, 1, 5, 50, 50, 1, 50, 1, 50]
Domain [It(50), It(50)] of place AMC breaks symmetries in sort It
[2025-06-03 12:11:03] [INFO ] Unfolded HLPN to a Petri net with 5606 places and 140251 transitions 1078454 arcs in 810 ms.
[2025-06-03 12:11:03] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Deduced a syphon composed of 50 places in 194 ms
Reduce places removed 100 places and 100 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 3, 1, 5, 50, 50, 1, 50, 1, 50]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 3, 1, 5, 50, 50, 1, 50, 1, 50]
[2025-06-03 12:11:04] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5506 cols
[2025-06-03 12:11:05] [INFO ] Computed 205 invariants in 1380 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 3, 1, 5, 50, 50, 1, 50, 1, 50]
RANDOM walk for 10000 steps (2 resets) in 5897 ms. (1 steps per ms)
FORMULA SafeBus-COL-50-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SafeBus-COL-50-UpperBounds-08 50 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (10 resets) in 1632 ms. (30 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 49, 25, 8] Max Struct:[3, 5, 50, 50, 50]
[2025-06-03 12:11:13] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2025-06-03 12:11:13] [INFO ] Invariant cache hit.
[2025-06-03 12:11:14] [INFO ] [Real]Absence check using 101 positive place invariants in 139 ms returned sat
[2025-06-03 12:11:14] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 103 ms returned unsat
[2025-06-03 12:11:14] [INFO ] [Real]Absence check using 101 positive place invariants in 126 ms returned sat
[2025-06-03 12:11:15] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 172 ms returned unsat
[2025-06-03 12:11:15] [INFO ] [Real]Absence check using 101 positive place invariants in 124 ms returned sat
[2025-06-03 12:11:15] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 211 ms returned sat
[2025-06-03 12:11:20] [INFO ] [Real]Absence check using state equation in 4167 ms returned unknown
[2025-06-03 12:11:20] [INFO ] [Real]Absence check using 101 positive place invariants in 112 ms returned sat
[2025-06-03 12:11:21] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 406 ms returned sat
[2025-06-03 12:11:25] [INFO ] [Real]Absence check using state equation in 4003 ms returned unknown
[2025-06-03 12:11:25] [INFO ] [Real]Absence check using 101 positive place invariants in 113 ms returned sat
[2025-06-03 12:11:26] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 277 ms returned sat
[2025-06-03 12:11:30] [INFO ] [Real]Absence check using state equation in 4112 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 49, 25, 8] Max Struct:[1, 1, 50, 50, 50]
FORMULA SafeBus-COL-50-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA SafeBus-COL-50-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[49, 25, 8] Max Struct:[50, 50, 50]
Support contains 150 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 24234 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24260 ms. Remains : 5506/5506 places, 140151/140151 transitions.
[2025-06-03 12:11:54] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2025-06-03 12:11:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[49, 25, 8] Max Struct:[50, 50, 50]
RANDOM walk for 58646 steps (0 resets) in 30004 ms. (1 steps per ms)
BEST_FIRST walk for 322737 steps (0 resets) in 15007 ms. (21 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[49, 49, 13] Max Struct:[50, 50, 50]
[2025-06-03 12:12:39] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2025-06-03 12:12:39] [INFO ] Invariant cache hit.
[2025-06-03 12:12:40] [INFO ] [Real]Absence check using 101 positive place invariants in 112 ms returned sat
[2025-06-03 12:12:40] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 214 ms returned sat
[2025-06-03 12:12:57] [INFO ] [Real]Absence check using state equation in 16542 ms returned sat
[2025-06-03 12:12:57] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:12:58] [INFO ] [Nat]Absence check using 101 positive place invariants in 112 ms returned sat
[2025-06-03 12:12:58] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 200 ms returned sat
[2025-06-03 12:13:16] [INFO ] [Nat]Absence check using state equation in 18167 ms returned sat
[2025-06-03 12:13:18] [INFO ] State equation strengthened by 2551 read => feed constraints.
[2025-06-03 12:13:28] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:13:33] [INFO ] [Nat]Added 2551 Read/Feed constraints in 15046 ms returned unknown
[2025-06-03 12:13:33] [INFO ] [Real]Absence check using 101 positive place invariants in 112 ms returned sat
[2025-06-03 12:13:34] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 310 ms returned sat
[2025-06-03 12:13:47] [INFO ] [Real]Absence check using state equation in 13313 ms returned sat
[2025-06-03 12:13:47] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:13:48] [INFO ] [Nat]Absence check using 101 positive place invariants in 110 ms returned sat
[2025-06-03 12:13:48] [INFO ] [Nat]Absence check using 101 positive and 104 generalized place invariants in 307 ms returned sat
[2025-06-03 12:14:02] [INFO ] [Nat]Absence check using state equation in 13513 ms returned sat
[2025-06-03 12:14:12] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:14:17] [INFO ] [Nat]Added 2551 Read/Feed constraints in 14848 ms returned unknown
[2025-06-03 12:14:17] [INFO ] [Real]Absence check using 101 positive place invariants in 111 ms returned sat
[2025-06-03 12:14:17] [INFO ] [Real]Absence check using 101 positive and 104 generalized place invariants in 185 ms returned sat
[2025-06-03 12:14:24] [INFO ] [Real]Absence check using state equation in 6298 ms returned sat
[2025-06-03 12:14:34] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:14:39] [INFO ] [Real]Added 2551 Read/Feed constraints in 14743 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[49, 49, 13] Max Struct:[50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[49, 49, 13] Max Struct:[50, 50, 50]
Support contains 150 out of 5506 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 23936 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23937 ms. Remains : 5506/5506 places, 140151/140151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5506/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 17817 ms. Remains 5506 /5506 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2025-06-03 12:15:21] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2025-06-03 12:15:21] [INFO ] Invariant cache hit.
[2025-06-03 12:15:52] [INFO ] Performed 134/5506 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 12:16:22] [INFO ] Performed 3589/5506 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 12:16:44] [INFO ] Implicit Places using invariants in 82465 ms returned [5151, 5152, 5153, 5154, 5155, 5156, 5157, 5158, 5159, 5160, 5161, 5162, 5163, 5164, 5165, 5166, 5167, 5168, 5169, 5170, 5171, 5172, 5173, 5174, 5175, 5176, 5177, 5178, 5179, 5180, 5181, 5182, 5183, 5184, 5185, 5186, 5187, 5188, 5189, 5190, 5191, 5192, 5193, 5194, 5195, 5196, 5197, 5198, 5199, 5200]
Discarding 50 places :
Implicit Place search using SMT only with invariants took 82575 ms to find 50 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 5456/5506 places, 140151/140151 transitions.
Applied a total of 0 rules in 17219 ms. Remains 5456 /5456 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 117628 ms. Remains : 5456/5506 places, 140151/140151 transitions.
[2025-06-03 12:17:01] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
// Phase 1: matrix 15202 rows 5456 cols
[2025-06-03 12:17:02] [INFO ] Computed 155 invariants in 645 ms
Current structural bounds on expressions (after invariants) : Max Seen:[49, 49, 13] Max Struct:[50, 50, 50]
RANDOM walk for 56500 steps (0 resets) in 30004 ms. (1 steps per ms)
BEST_FIRST walk for 325427 steps (0 resets) in 15004 ms. (21 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[49, 49, 18] Max Struct:[50, 50, 50]
[2025-06-03 12:17:47] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2025-06-03 12:17:47] [INFO ] Invariant cache hit.
[2025-06-03 12:17:47] [INFO ] [Real]Absence check using 54 positive place invariants in 126 ms returned sat
[2025-06-03 12:17:48] [INFO ] [Real]Absence check using 54 positive and 101 generalized place invariants in 133 ms returned sat
[2025-06-03 12:17:59] [INFO ] [Real]Absence check using state equation in 11355 ms returned sat
[2025-06-03 12:17:59] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:18:00] [INFO ] [Nat]Absence check using 54 positive place invariants in 127 ms returned sat
[2025-06-03 12:18:00] [INFO ] [Nat]Absence check using 54 positive and 101 generalized place invariants in 119 ms returned sat
[2025-06-03 12:18:20] [INFO ] [Nat]Absence check using state equation in 19493 ms returned unknown
[2025-06-03 12:18:20] [INFO ] [Real]Absence check using 54 positive place invariants in 126 ms returned sat
[2025-06-03 12:18:20] [INFO ] [Real]Absence check using 54 positive and 101 generalized place invariants in 129 ms returned sat
[2025-06-03 12:18:28] [INFO ] [Real]Absence check using state equation in 8074 ms returned sat
[2025-06-03 12:18:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-03 12:18:29] [INFO ] [Nat]Absence check using 54 positive place invariants in 122 ms returned sat
[2025-06-03 12:18:29] [INFO ] [Nat]Absence check using 54 positive and 101 generalized place invariants in 120 ms returned sat
[2025-06-03 12:18:41] [INFO ] [Nat]Absence check using state equation in 12096 ms returned sat
[2025-06-03 12:18:43] [INFO ] State equation strengthened by 2551 read => feed constraints.
[2025-06-03 12:18:53] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:18:57] [INFO ] [Nat]Added 2551 Read/Feed constraints in 14821 ms returned unknown
[2025-06-03 12:18:58] [INFO ] [Real]Absence check using 54 positive place invariants in 107 ms returned sat
[2025-06-03 12:18:58] [INFO ] [Real]Absence check using 54 positive and 101 generalized place invariants in 138 ms returned sat
[2025-06-03 12:19:05] [INFO ] [Real]Absence check using state equation in 6464 ms returned sat
[2025-06-03 12:19:15] [INFO ] SMT solver returned unknown. Retrying;
[2025-06-03 12:19:20] [INFO ] [Real]Added 2551 Read/Feed constraints in 14814 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[49, 49, 18] Max Struct:[50, 50, 50]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[49, 49, 18] Max Struct:[50, 50, 50]
Support contains 150 out of 5456 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5456/5456 places, 140151/140151 transitions.
Applied a total of 0 rules in 17823 ms. Remains 5456 /5456 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17823 ms. Remains : 5456/5456 places, 140151/140151 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5456/5456 places, 140151/140151 transitions.
Applied a total of 0 rules in 17783 ms. Remains 5456 /5456 variables (removed 0) and now considering 140151/140151 (removed 0) transitions.
[2025-06-03 12:19:56] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2025-06-03 12:19:56] [INFO ] Invariant cache hit.
[2025-06-03 12:20:27] [INFO ] Performed 128/5456 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2025-06-03 12:20:57] [INFO ] Performed 2320/5456 implicitness test of which 0 returned IMPLICIT in 60 seconds.
[2025-06-03 12:21:21] [INFO ] Implicit Places using invariants in 84761 ms returned []
Implicit Place search using SMT only with invariants took 84765 ms to find 0 implicit places.
Running 140101 sub problems to find dead transitions.
[2025-06-03 12:21:23] [INFO ] Flow matrix only has 15202 transitions (discarded 124949 similar events)
[2025-06-03 12:21:23] [INFO ] Invariant cache hit.
[2025-06-03 12:21:26] [INFO ] State equation strengthened by 2551 read => feed constraints.
BK_TIME_CONFINEMENT_REACHED
--------------------
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="SafeBus-COL-50"
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 SafeBus-COL-50, 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 r195-tall-174889278300094"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SafeBus-COL-50.tgz
mv SafeBus-COL-50 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 '
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 ;