Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r597-smll-171734926400051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is MedleyA-PT-11, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r597-smll-171734926400051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 160K Jun 2 16:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717362291864

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-11
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-06-02 21:04:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 21:04:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:04:54] [INFO ] Load time of PNML (sax parser for PT used): 132 ms
[2024-06-02 21:04:54] [INFO ] Transformed 150 places.
[2024-06-02 21:04:54] [INFO ] Transformed 478 transitions.
[2024-06-02 21:04:54] [INFO ] Found NUPN structural information;
[2024-06-02 21:04:54] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
Normalized transition count is 397 out of 469 initially.
// Phase 1: matrix 397 rows 150 cols
[2024-06-02 21:04:55] [INFO ] Computed 23 invariants in 36 ms
Incomplete random walk after 10000 steps, including 786 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 16) seen :9
FORMULA MedleyA-PT-11-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 135 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 132 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :1
FORMULA MedleyA-PT-11-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 138 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 135 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
[2024-06-02 21:04:55] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2024-06-02 21:04:55] [INFO ] Computed 23 invariants in 13 ms
[2024-06-02 21:04:55] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2024-06-02 21:04:55] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 9 ms returned sat
[2024-06-02 21:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:55] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2024-06-02 21:04:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:04:56] [INFO ] [Nat]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 21:04:56] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 8 ms returned sat
[2024-06-02 21:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:56] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2024-06-02 21:04:56] [INFO ] State equation strengthened by 171 read => feed constraints.
[2024-06-02 21:04:56] [INFO ] [Nat]Added 171 Read/Feed constraints in 119 ms returned sat
[2024-06-02 21:04:56] [INFO ] Deduced a trap composed of 15 places in 133 ms of which 5 ms to minimize.
[2024-06-02 21:04:56] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2024-06-02 21:04:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 335 ms
[2024-06-02 21:04:56] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 85 ms.
[2024-06-02 21:04:57] [INFO ] Added : 19 causal constraints over 4 iterations in 332 ms. Result :sat
Minimization took 119 ms.
[2024-06-02 21:04:57] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 21:04:57] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:04:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:57] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2024-06-02 21:04:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:04:57] [INFO ] [Nat]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 21:04:57] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:04:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:57] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2024-06-02 21:04:57] [INFO ] [Nat]Added 171 Read/Feed constraints in 48 ms returned sat
[2024-06-02 21:04:57] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 68 ms.
[2024-06-02 21:04:58] [INFO ] Added : 17 causal constraints over 4 iterations in 259 ms. Result :sat
Minimization took 88 ms.
[2024-06-02 21:04:58] [INFO ] [Real]Absence check using 9 positive place invariants in 13 ms returned sat
[2024-06-02 21:04:58] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:04:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:58] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2024-06-02 21:04:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:04:58] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 21:04:58] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 6 ms returned sat
[2024-06-02 21:04:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:58] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2024-06-02 21:04:58] [INFO ] [Nat]Added 171 Read/Feed constraints in 49 ms returned sat
[2024-06-02 21:04:58] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:04:58] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-02 21:04:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2024-06-02 21:04:58] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 44 ms.
[2024-06-02 21:04:59] [INFO ] Added : 23 causal constraints over 5 iterations in 305 ms. Result :sat
Minimization took 99 ms.
[2024-06-02 21:04:59] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2024-06-02 21:04:59] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:04:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:59] [INFO ] [Real]Absence check using state equation in 122 ms returned sat
[2024-06-02 21:04:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:04:59] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 21:04:59] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:04:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:04:59] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-06-02 21:04:59] [INFO ] [Nat]Added 171 Read/Feed constraints in 45 ms returned sat
[2024-06-02 21:04:59] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:04:59] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-06-02 21:04:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 198 ms
[2024-06-02 21:04:59] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 39 ms.
[2024-06-02 21:05:00] [INFO ] Added : 24 causal constraints over 5 iterations in 285 ms. Result :sat
Minimization took 87 ms.
[2024-06-02 21:05:00] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 21:05:00] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:05:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:05:00] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2024-06-02 21:05:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:05:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 21:05:00] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:05:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:05:00] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2024-06-02 21:05:00] [INFO ] [Nat]Added 171 Read/Feed constraints in 44 ms returned sat
[2024-06-02 21:05:00] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 39 ms.
[2024-06-02 21:05:01] [INFO ] Added : 14 causal constraints over 3 iterations in 199 ms. Result :sat
Minimization took 85 ms.
[2024-06-02 21:05:01] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 21:05:01] [INFO ] [Real]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:05:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-06-02 21:05:01] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-06-02 21:05:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 21:05:01] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 21:05:01] [INFO ] [Nat]Absence check using 9 positive and 14 generalized place invariants in 7 ms returned sat
[2024-06-02 21:05:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-06-02 21:05:01] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-06-02 21:05:01] [INFO ] [Nat]Added 171 Read/Feed constraints in 157 ms returned sat
[2024-06-02 21:05:01] [INFO ] Computed and/alt/rep : 211/1037/211 causal constraints (skipped 185 transitions) in 44 ms.
[2024-06-02 21:05:01] [INFO ] Added : 13 causal constraints over 3 iterations in 218 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0]
FORMULA MedleyA-PT-11-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 37 place count 111 transition count 412
Iterating global reduction 0 with 36 rules applied. Total rules applied 73 place count 111 transition count 412
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 84 place count 100 transition count 351
Iterating global reduction 0 with 11 rules applied. Total rules applied 95 place count 100 transition count 351
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 100 place count 95 transition count 331
Iterating global reduction 0 with 5 rules applied. Total rules applied 105 place count 95 transition count 331
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 107 place count 94 transition count 330
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 115 place count 90 transition count 355
Drop transitions removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 0 with 15 rules applied. Total rules applied 130 place count 90 transition count 340
Free-agglomeration rule (complex) applied 16 times.
Iterating global reduction 0 with 16 rules applied. Total rules applied 146 place count 90 transition count 545
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 32 rules applied. Total rules applied 178 place count 74 transition count 529
Applied a total of 178 rules in 178 ms. Remains 74 /150 variables (removed 76) and now considering 529/469 (removed -60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 74/150 places, 529/469 transitions.
Successfully produced net in file /tmp/petri1000_7526210984423745815.dot
Successfully produced net in file /tmp/petri1001_12442385594111295600.dot
Successfully produced net in file /tmp/petri1002_18257609142047288435.dot
Successfully produced net in file /tmp/petri1003_3881786081461403627.dot
Successfully produced net in file /tmp/petri1004_16344862623482917587.dot
Successfully produced net in file /tmp/petri1005_1534109117247538550.dot
Successfully produced net in file /tmp/petri1006_1206865040567312727.dot
Successfully produced net in file /tmp/petri1007_7342225871006852172.dot
Successfully produced net in file /tmp/petri1008_3711475238021940531.dot
Successfully produced net in file /tmp/petri1009_528963291663992872.dot
Successfully produced net in file /tmp/petri1010_8148712967930114978.dot
Successfully produced net in file /tmp/petri1011_11172277499888039224.dot
Successfully produced net in file /tmp/petri1012_856308322174901307.dot
Successfully produced net in file /tmp/petri1013_6739615980241367718.dot
Successfully produced net in file /tmp/petri1014_2291600348093213620.dot
Successfully produced net in file /tmp/petri1015_5194311086703771224.dot
Successfully produced net in file /tmp/petri1016_2072602130988572261.dot
Successfully produced net in file /tmp/petri1017_13255286716561385644.dot
Successfully produced net in file /tmp/petri1018_18253673076919553557.dot
Successfully produced net in file /tmp/petri1019_17302637687379360194.dot
Successfully produced net in file /tmp/petri1020_153719982648962633.dot
Successfully produced net in file /tmp/petri1021_4735629226492434114.dot
Successfully produced net in file /tmp/petri1022_5751893641364112360.dot
Successfully produced net in file /tmp/petri1023_4371663649307608084.dot
Successfully produced net in file /tmp/petri1024_16842287549101868586.dot
Successfully produced net in file /tmp/petri1025_2388317055786620133.dot
Successfully produced net in file /tmp/petri1026_16594863858558364261.dot
Successfully produced net in file /tmp/petri1027_2634505662160758632.dot
Successfully produced net in file /tmp/petri1028_6371166751846736891.dot
Successfully produced net in file /tmp/petri1029_11894640778263111666.dot
Successfully produced net in file /tmp/petri1030_1812047470206767115.dot
Successfully produced net in file /tmp/petri1031_15210642533910272414.dot
Successfully produced net in file /tmp/petri1032_13055963793213996370.dot
Successfully produced net in file /tmp/petri1033_15937150787801503205.dot
Successfully produced net in file /tmp/petri1034_2034926837474189385.dot
Successfully produced net in file /tmp/petri1035_6006350401750554654.dot
Successfully produced net in file /tmp/petri1036_6465394894873468060.dot
Successfully produced net in file /tmp/petri1037_12761063810943946273.dot
Successfully produced net in file /tmp/petri1038_17180785746440856611.dot
Successfully produced net in file /tmp/petri1039_7935077109706453557.dot
Successfully produced net in file /tmp/petri1040_7428386479243449070.dot
Successfully produced net in file /tmp/petri1041_2454049353219012184.dot
Successfully produced net in file /tmp/petri1042_8573333317049823569.dot
Successfully produced net in file /tmp/petri1043_15166745576193918208.dot
Successfully produced net in file /tmp/petri1044_6697995597961004256.dot
Successfully produced net in file /tmp/petri1045_10138544857255758888.dot
Successfully produced net in file /tmp/petri1046_18116640068713984780.dot
Successfully produced net in file /tmp/petri1047_16561527641709124666.dot
Successfully produced net in file /tmp/petri1048_3700873704451717942.dot
Successfully produced net in file /tmp/petri1049_15855702249903995332.dot
Successfully produced net in file /tmp/petri1050_1018749662456722503.dot
Successfully produced net in file /tmp/petri1051_1639739862683722836.dot
Successfully produced net in file /tmp/petri1052_4891595104319899102.dot
Successfully produced net in file /tmp/petri1053_4399255651637712835.dot
Drop transitions removed 54 transitions
Dominated transitions for bounds rules discarded 54 transitions
Normalized transition count is 365 out of 475 initially.
// Phase 1: matrix 365 rows 74 cols
[2024-06-02 21:05:02] [INFO ] Computed 23 invariants in 4 ms
Incomplete random walk after 1000000 steps, including 186180 resets, run finished after 7733 ms. (steps per millisecond=129 ) properties (out of 5) seen :5
FORMULA MedleyA-PT-11-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15790 ms.

BK_STOP 1717362311545

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-11"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is MedleyA-PT-11, 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 r597-smll-171734926400051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-11.tgz
mv MedleyA-PT-11 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;