fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r255-tall-167856440400077
Last Updated
May 14, 2023

About the Execution of 2022-gold for MAPK-PT-02560

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
543.771 7740.00 13108.00 232.50 1280 1280 1280 2560 640 1920 1280 1280 1280 1920 1920 1920 1920 1280 1920 640 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r255-tall-167856440400077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is MAPK-PT-02560, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r255-tall-167856440400077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 9.7K Feb 26 10:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 10:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 10:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 10:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 25K Mar 5 18:22 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 MAPK-PT-02560-UpperBounds-00
FORMULA_NAME MAPK-PT-02560-UpperBounds-01
FORMULA_NAME MAPK-PT-02560-UpperBounds-02
FORMULA_NAME MAPK-PT-02560-UpperBounds-03
FORMULA_NAME MAPK-PT-02560-UpperBounds-04
FORMULA_NAME MAPK-PT-02560-UpperBounds-05
FORMULA_NAME MAPK-PT-02560-UpperBounds-06
FORMULA_NAME MAPK-PT-02560-UpperBounds-07
FORMULA_NAME MAPK-PT-02560-UpperBounds-08
FORMULA_NAME MAPK-PT-02560-UpperBounds-09
FORMULA_NAME MAPK-PT-02560-UpperBounds-10
FORMULA_NAME MAPK-PT-02560-UpperBounds-11
FORMULA_NAME MAPK-PT-02560-UpperBounds-12
FORMULA_NAME MAPK-PT-02560-UpperBounds-13
FORMULA_NAME MAPK-PT-02560-UpperBounds-14
FORMULA_NAME MAPK-PT-02560-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678751904787

Running Version 202205111006
[2023-03-13 23:58:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-13 23:58:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 23:58:26] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-13 23:58:26] [INFO ] Transformed 22 places.
[2023-03-13 23:58:26] [INFO ] Transformed 30 transitions.
[2023-03-13 23:58:26] [INFO ] Parsed PT model containing 22 places and 30 transitions in 148 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 30 rows 22 cols
[2023-03-13 23:58:26] [INFO ] Computed 7 place invariants in 9 ms
FORMULA MAPK-PT-02560-UpperBounds-09 1920 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-UpperBounds-06 1280 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-UpperBounds-05 1920 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-UpperBounds-04 640 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MAPK-PT-02560-UpperBounds-03 2560 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10258 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=932 ) properties (out of 11) seen :1280
FORMULA MAPK-PT-02560-UpperBounds-15 640 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 10) seen :25
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 10) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 10) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 10) seen :116
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 10) seen :120
// Phase 1: matrix 30 rows 22 cols
[2023-03-13 23:58:26] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned sat
[2023-03-13 23:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-13 23:58:26] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 12 ms.
[2023-03-13 23:58:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 23:58:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:26] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2023-03-13 23:58:26] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 4 ms.
[2023-03-13 23:58:26] [INFO ] Added : 15 causal constraints over 3 iterations in 33 ms. Result :sat
Minimization took 8 ms.
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 23:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-13 23:58:26] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 23:58:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:26] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-13 23:58:26] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 6 ms.
[2023-03-13 23:58:26] [INFO ] Added : 15 causal constraints over 3 iterations in 25 ms. Result :sat
Minimization took 6 ms.
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:58:26] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 23:58:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:58:26] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:26] [INFO ] Added : 9 causal constraints over 3 iterations in 14 ms. Result :sat
Minimization took 4 ms.
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 23:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:58:26] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:26] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:58:26] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:26] [INFO ] Added : 19 causal constraints over 4 iterations in 18 ms. Result :sat
Minimization took 9 ms.
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:26] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-13 23:58:26] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 7 ms.
[2023-03-13 23:58:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 1 ms.
[2023-03-13 23:58:27] [INFO ] Added : 15 causal constraints over 4 iterations in 14 ms. Result :sat
Minimization took 6 ms.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:27] [INFO ] Added : 17 causal constraints over 4 iterations in 14 ms. Result :sat
Minimization took 5 ms.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2023-03-13 23:58:27] [INFO ] Added : 19 causal constraints over 4 iterations in 15 ms. Result :sat
Minimization took 6 ms.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:27] [INFO ] Added : 21 causal constraints over 5 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 2 ms.
[2023-03-13 23:58:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 4 ms.
[2023-03-13 23:58:27] [INFO ] Added : 15 causal constraints over 4 iterations in 26 ms. Result :sat
Minimization took 7 ms.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2023-03-13 23:58:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 23:58:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-13 23:58:27] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2023-03-13 23:58:27] [INFO ] Computed and/alt/rep : 27/54/27 causal constraints (skipped 2 transitions) in 3 ms.
[2023-03-13 23:58:27] [INFO ] Added : 18 causal constraints over 6 iterations in 18 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : [1280, 1280, 1280, 1280, 1280, 1920, 1920, 1920, 1280, 1920] Max seen :[10, 11, 14, 4, 26, 3, 22, 6, 116, 640]
FORMULA MAPK-PT-02560-UpperBounds-14 1920 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-13 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-11 1920 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-01 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-10 1920 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-08 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-07 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-02 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA MAPK-PT-02560-UpperBounds-00 1280 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 22 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 22/22 places, 30/30 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 22 transition count 29
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 29
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 20 transition count 28
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 22 place count 10 transition count 20
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (trivial) has 4 edges and 10 vertex of which 2 / 10 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 9 rules applied. Total rules applied 31 place count 9 transition count 12
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 4 edges and 8 vertex of which 3 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 4 rules applied. Total rules applied 35 place count 6 transition count 10
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 40 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 42 place count 4 transition count 5
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 43 place count 4 transition count 4
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 44 place count 4 transition count 3
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 47 place count 2 transition count 2
Applied a total of 47 rules in 87 ms. Remains 2 /22 variables (removed 20) and now considering 2/30 (removed 28) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/22 places, 2/30 transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-13 23:58:32] [INFO ] Computed 1 place invariants in 1 ms
Incomplete random walk after 1000851 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=5295 ) properties (out of 1) seen :1920
FORMULA MAPK-PT-02560-UpperBounds-12 1920 TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 6502 ms.

BK_STOP 1678751912527

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="MAPK-PT-02560"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is MAPK-PT-02560, 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 r255-tall-167856440400077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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