fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r138-smll-167819419800173
Last Updated
May 14, 2023

About the Execution of Marcie+red for Diffusion2D-PT-D20N100

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
995.600 232244.00 250691.00 1266.60 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 100 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.r138-smll-167819419800173.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 marciexred
Input is Diffusion2D-PT-D20N100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819419800173
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 11K Feb 26 04:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 04:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 04:17 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 04:17 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 15:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 04:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 26 04:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 04:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 04:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.2M 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 Diffusion2D-PT-D20N100-UpperBounds-00
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-01
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-02
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-03
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-04
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-05
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-06
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-07
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-08
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-09
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-10
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-11
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-12
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-13
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-14
FORMULA_NAME Diffusion2D-PT-D20N100-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678609803675

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D20N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 08:30:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-12 08:30:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 08:30:07] [INFO ] Load time of PNML (sax parser for PT used): 377 ms
[2023-03-12 08:30:07] [INFO ] Transformed 400 places.
[2023-03-12 08:30:07] [INFO ] Transformed 2964 transitions.
[2023-03-12 08:30:07] [INFO ] Parsed PT model containing 400 places and 2964 transitions and 5928 arcs in 542 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
// Phase 1: matrix 2964 rows 400 cols
[2023-03-12 08:30:07] [INFO ] Computed 1 place invariants in 61 ms
Incomplete random walk after 10004 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 16) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 16) seen :0
[2023-03-12 08:30:08] [INFO ] Invariant cache hit.
[2023-03-12 08:30:08] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2023-03-12 08:30:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:09] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2023-03-12 08:30:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-12 08:30:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:10] [INFO ] [Nat]Absence check using state equation in 746 ms returned sat
[2023-03-12 08:30:11] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 413 ms.
Minimization took 492 ms.
[2023-03-12 08:30:11] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:12] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2023-03-12 08:30:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:14] [INFO ] [Nat]Absence check using state equation in 963 ms returned sat
[2023-03-12 08:30:14] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 345 ms.
Minimization took 511 ms.
[2023-03-12 08:30:15] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-12 08:30:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:16] [INFO ] [Real]Absence check using state equation in 856 ms returned sat
[2023-03-12 08:30:16] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 273 ms.
Minimization took 578 ms.
[2023-03-12 08:30:17] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 08:30:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:18] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2023-03-12 08:30:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-12 08:30:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:19] [INFO ] [Nat]Absence check using state equation in 870 ms returned sat
[2023-03-12 08:30:19] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 235 ms.
Minimization took 307 ms.
[2023-03-12 08:30:20] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:20] [INFO ] [Real]Absence check using state equation in 704 ms returned sat
[2023-03-12 08:30:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 08:30:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:21] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2023-03-12 08:30:22] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 339 ms.
Minimization took 535 ms.
[2023-03-12 08:30:23] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:23] [INFO ] [Real]Absence check using state equation in 844 ms returned sat
[2023-03-12 08:30:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-12 08:30:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:24] [INFO ] [Nat]Absence check using state equation in 720 ms returned sat
[2023-03-12 08:30:25] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 289 ms.
Minimization took 286 ms.
[2023-03-12 08:30:25] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:26] [INFO ] [Real]Absence check using state equation in 835 ms returned sat
[2023-03-12 08:30:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 08:30:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:27] [INFO ] [Nat]Absence check using state equation in 805 ms returned sat
[2023-03-12 08:30:27] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 203 ms.
Minimization took 400 ms.
[2023-03-12 08:30:28] [INFO ] [Real]Absence check using 1 positive place invariants in 8 ms returned sat
[2023-03-12 08:30:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:29] [INFO ] [Real]Absence check using state equation in 717 ms returned sat
[2023-03-12 08:30:29] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 243 ms.
Minimization took 563 ms.
[2023-03-12 08:30:30] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:31] [INFO ] [Real]Absence check using state equation in 816 ms returned sat
[2023-03-12 08:30:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 08:30:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:32] [INFO ] [Nat]Absence check using state equation in 882 ms returned sat
[2023-03-12 08:30:32] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 292 ms.
Minimization took 438 ms.
[2023-03-12 08:30:33] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2023-03-12 08:30:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:33] [INFO ] [Real]Absence check using state equation in 709 ms returned sat
[2023-03-12 08:30:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 08:30:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:34] [INFO ] [Nat]Absence check using state equation in 755 ms returned sat
[2023-03-12 08:30:35] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 236 ms.
Minimization took 405 ms.
[2023-03-12 08:30:35] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:36] [INFO ] [Real]Absence check using state equation in 784 ms returned sat
[2023-03-12 08:30:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 08:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:37] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2023-03-12 08:30:37] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 204 ms.
Minimization took 365 ms.
[2023-03-12 08:30:38] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:39] [INFO ] [Real]Absence check using state equation in 863 ms returned sat
[2023-03-12 08:30:39] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 302 ms.
Minimization took 536 ms.
[2023-03-12 08:30:40] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:41] [INFO ] [Real]Absence check using state equation in 887 ms returned sat
[2023-03-12 08:30:41] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 205 ms.
Minimization took 416 ms.
[2023-03-12 08:30:42] [INFO ] [Real]Absence check using 1 positive place invariants in 7 ms returned sat
[2023-03-12 08:30:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:43] [INFO ] [Real]Absence check using state equation in 823 ms returned sat
[2023-03-12 08:30:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 10 ms returned sat
[2023-03-12 08:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:44] [INFO ] [Nat]Absence check using state equation in 942 ms returned sat
[2023-03-12 08:30:44] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 212 ms.
Minimization took 369 ms.
[2023-03-12 08:30:45] [INFO ] [Real]Absence check using 1 positive place invariants in 9 ms returned sat
[2023-03-12 08:30:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:46] [INFO ] [Real]Absence check using state equation in 789 ms returned sat
[2023-03-12 08:30:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 08:30:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:47] [INFO ] [Nat]Absence check using state equation in 759 ms returned sat
[2023-03-12 08:30:47] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 204 ms.
Minimization took 378 ms.
[2023-03-12 08:30:47] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 08:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:48] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2023-03-12 08:30:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 08:30:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 6 ms returned sat
[2023-03-12 08:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 08:30:49] [INFO ] [Nat]Absence check using state equation in 776 ms returned sat
[2023-03-12 08:30:49] [INFO ] Computed and/alt/rep : 2956/22508/2956 causal constraints (skipped 0 transitions) in 201 ms.
Minimization took 321 ms.
Current structural bounds on expressions (after SMT) : [100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100, 100] Max seen :[0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0]
FORMULA Diffusion2D-PT-D20N100-UpperBounds-15 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-14 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-13 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-11 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-07 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-06 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-05 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-03 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-10 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-02 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-01 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-12 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-04 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-09 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-08 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Diffusion2D-PT-D20N100-UpperBounds-00 100 TECHNIQUES TOPOLOGICAL PARIKH_WALK
All properties solved without resorting to model-checking.
Total runtime 227548 ms.
ITS solved all properties within timeout

BK_STOP 1678610035919

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="Diffusion2D-PT-D20N100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is Diffusion2D-PT-D20N100, 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 r138-smll-167819419800173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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