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

About the Execution of 2022-gold for GPPP-PT-C0100N0000001000

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
385.500 94599.00 102536.00 760.00 2000 200 10 1592 4007 1104 796 10 10 2000 10 10 400 700 700 1000 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.r191-tall-167838876300108.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 GPPP-PT-C0100N0000001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r191-tall-167838876300108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 26 10:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 26 10:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0100N0000001000-UpperBounds-00
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-01
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-02
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-03
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-04
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-05
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-06
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-07
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-08
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-09
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-10
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-11
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-12
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-13
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-14
FORMULA_NAME GPPP-PT-C0100N0000001000-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678575539929

Running Version 202205111006
[2023-03-11 22:59:01] [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-11 22:59:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 22:59:01] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-11 22:59:01] [INFO ] Transformed 33 places.
[2023-03-11 22:59:01] [INFO ] Transformed 22 transitions.
[2023-03-11 22:59:01] [INFO ] Parsed PT model containing 33 places and 22 transitions in 169 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 22:59:01] [INFO ] Computed 12 place invariants in 10 ms
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-15 1000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-09 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-01 200 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-00 2000 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10139 steps, including 3 resets, run finished after 30 ms. (steps per millisecond=337 ) properties (out of 12) seen :9342
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-14 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-13 700 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :5371
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 :5606
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 :5109
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 :5650
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 :5734
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :5381
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :5352
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 :5401
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :5323
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 10) seen :5104
// Phase 1: matrix 22 rows 33 cols
[2023-03-11 22:59:01] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-11 22:59:01] [INFO ] [Real]Absence check using 6 positive place invariants in 9 ms returned sat
[2023-03-11 22:59:01] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 22:59:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:01] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 22:59:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:02] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 161 ms returned sat
[2023-03-11 22:59:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:06] [INFO ] [Nat]Absence check using state equation in 4807 ms returned unknown
[2023-03-11 22:59:06] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 22:59:06] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 22:59:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:07] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-11 22:59:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:07] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:07] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 22:59:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:10] [INFO ] [Nat]Absence check using state equation in 3669 ms returned sat
[2023-03-11 22:59:10] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-11 22:59:10] [INFO ] Added : 20 causal constraints over 4 iterations in 96 ms. Result :sat
Minimization took 718 ms.
[2023-03-11 22:59:11] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:11] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-11 22:59:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-11 22:59:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:12] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 647 ms returned sat
[2023-03-11 22:59:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:12] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2023-03-11 22:59:12] [INFO ] Computed and/alt/rep : 21/47/21 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 22:59:12] [INFO ] Added : 18 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 44 ms.
[2023-03-11 22:59:12] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:12] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-11 22:59:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:12] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 22:59:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:15] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 22:59:16] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 3255 ms returned sat
[2023-03-11 22:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:16] [INFO ] [Nat]Absence check using state equation in 54 ms returned unsat
[2023-03-11 22:59:16] [INFO ] [Real]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-11 22:59:16] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:16] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-11 22:59:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:16] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-11 22:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:16] [INFO ] [Nat]Absence check using state equation in 238 ms returned unsat
[2023-03-11 22:59:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:16] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:16] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-11 22:59:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:16] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 144 ms returned sat
[2023-03-11 22:59:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:21] [INFO ] [Nat]Absence check using state equation in 4838 ms returned unknown
[2023-03-11 22:59:21] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:21] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 22:59:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:21] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-11 22:59:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:24] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 22:59:26] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4972 ms returned unknown
[2023-03-11 22:59:26] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:26] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-11 22:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:26] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-11 22:59:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:26] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-11 22:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:26] [INFO ] [Nat]Absence check using state equation in 52 ms returned unsat
[2023-03-11 22:59:26] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:26] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 22:59:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:26] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-11 22:59:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:26] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:26] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 144 ms returned sat
[2023-03-11 22:59:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:31] [INFO ] [Nat]Absence check using state equation in 4837 ms returned unknown
[2023-03-11 22:59:31] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:31] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:31] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-11 22:59:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:31] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:31] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
Current structural bounds on expressions (after SMT) : [700, 2000, 5400, 1104, 796, 700, 700, 10, 700, 400] Max seen :[10, 1592, 4000, 1104, 796, 10, 10, 10, 10, 400]
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-12 400 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-10 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-06 796 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-05 1104 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 6 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
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 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
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 2 with 2 rules applied. Total rules applied 7 place count 29 transition count 17
Applied a total of 7 rules in 41 ms. Remains 29 /33 variables (removed 4) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 29 cols
[2023-03-11 22:59:33] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-11 22:59:33] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 29/33 places, 17/22 transitions.
// Phase 1: matrix 17 rows 29 cols
[2023-03-11 22:59:33] [INFO ] Computed 12 place invariants in 1 ms
Incomplete random walk after 1000546 steps, including 348 resets, run finished after 345 ms. (steps per millisecond=2900 ) properties (out of 6) seen :5632
Incomplete Best-First random walk after 1000001 steps, including 58 resets, run finished after 422 ms. (steps per millisecond=2369 ) properties (out of 6) seen :4194
Incomplete Best-First random walk after 1000001 steps, including 83 resets, run finished after 354 ms. (steps per millisecond=2824 ) properties (out of 6) seen :5621
Incomplete Best-First random walk after 1000000 steps, including 110 resets, run finished after 371 ms. (steps per millisecond=2695 ) properties (out of 6) seen :4026
Incomplete Best-First random walk after 1000001 steps, including 58 resets, run finished after 368 ms. (steps per millisecond=2717 ) properties (out of 6) seen :4212
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 333 ms. (steps per millisecond=3003 ) properties (out of 6) seen :4250
Incomplete Best-First random walk after 1000001 steps, including 57 resets, run finished after 364 ms. (steps per millisecond=2747 ) properties (out of 6) seen :4245
// Phase 1: matrix 17 rows 29 cols
[2023-03-11 22:59:35] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-11 22:59:35] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:35] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:35] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-11 22:59:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:35] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-03-11 22:59:35] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 112 ms returned sat
[2023-03-11 22:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:36] [INFO ] [Nat]Absence check using state equation in 683 ms returned unsat
[2023-03-11 22:59:36] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:36] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 14 ms returned sat
[2023-03-11 22:59:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:36] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 22:59:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:36] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:37] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 456 ms returned sat
[2023-03-11 22:59:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:37] [INFO ] [Nat]Absence check using state equation in 175 ms returned unsat
[2023-03-11 22:59:37] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:37] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:37] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-11 22:59:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:37] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:43] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 22:59:46] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9003 ms returned unknown
[2023-03-11 22:59:46] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:46] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 14 ms returned sat
[2023-03-11 22:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:46] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-11 22:59:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:46] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 94 ms returned sat
[2023-03-11 22:59:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:46] [INFO ] [Nat]Absence check using state equation in 348 ms returned unsat
[2023-03-11 22:59:46] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:46] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 22:59:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:46] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 22:59:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:46] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-11 22:59:55] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9004 ms returned unknown
[2023-03-11 22:59:55] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-11 22:59:55] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 22:59:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 22:59:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2023-03-11 22:59:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 22:59:56] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-11 22:59:56] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 103 ms returned sat
[2023-03-11 22:59:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:02] [INFO ] [Nat]Absence check using state equation in 6050 ms returned unknown
Current structural bounds on expressions (after SMT) : [10, 1592, 5400, 10, 700, 700] Max seen :[10, 1592, 4007, 10, 10, 10]
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-03 1592 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 29/29 places, 17/17 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 29 transition count 16
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 28 transition count 16
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 26 transition count 15
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 8 place count 24 transition count 14
Applied a total of 8 rules in 7 ms. Remains 24 /29 variables (removed 5) and now considering 14/17 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/29 places, 14/17 transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 23:00:02] [INFO ] Computed 10 place invariants in 1 ms
Incomplete random walk after 1000097 steps, including 793 resets, run finished after 255 ms. (steps per millisecond=3921 ) properties (out of 3) seen :4020
Incomplete Best-First random walk after 1000000 steps, including 335 resets, run finished after 364 ms. (steps per millisecond=2747 ) properties (out of 3) seen :4019
Incomplete Best-First random walk after 1000001 steps, including 201 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 3) seen :4014
Incomplete Best-First random walk after 1000001 steps, including 164 resets, run finished after 347 ms. (steps per millisecond=2881 ) properties (out of 3) seen :4024
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 23:00:03] [INFO ] Computed 10 place invariants in 1 ms
[2023-03-11 23:00:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:03] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 23:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:03] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-11 23:00:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:00:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:03] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-11 23:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:03] [INFO ] [Nat]Absence check using state equation in 10 ms returned unsat
[2023-03-11 23:00:03] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:03] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-11 23:00:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-11 23:00:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:00:03] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:03] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-11 23:00:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:08] [INFO ] [Nat]Absence check using state equation in 5187 ms returned sat
[2023-03-11 23:00:08] [INFO ] Computed and/alt/rep : 13/26/13 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-11 23:00:08] [INFO ] Added : 13 causal constraints over 3 iterations in 29 ms. Result :sat
Minimization took 3006 ms.
[2023-03-11 23:00:11] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:11] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 23:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-11 23:00:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:00:11] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:11] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 23:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:17] [INFO ] [Nat]Absence check using state equation in 6005 ms returned unknown
Current structural bounds on expressions (after SMT) : [4007, 700, 700] Max seen :[4007, 10, 10]
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-04 4007 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 14/14 transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 23:00:17] [INFO ] Computed 10 place invariants in 4 ms
Incomplete random walk after 1000016 steps, including 793 resets, run finished after 233 ms. (steps per millisecond=4291 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 202 resets, run finished after 294 ms. (steps per millisecond=3401 ) properties (out of 2) seen :11
Incomplete Best-First random walk after 1000001 steps, including 164 resets, run finished after 321 ms. (steps per millisecond=3115 ) properties (out of 2) seen :20
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 23:00:18] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-11 23:00:18] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:18] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-11 23:00:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:18] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-11 23:00:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:00:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:18] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 1 ms returned sat
[2023-03-11 23:00:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:24] [INFO ] [Nat]Absence check using state equation in 5372 ms returned sat
[2023-03-11 23:00:24] [INFO ] Computed and/alt/rep : 13/26/13 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 23:00:24] [INFO ] Added : 13 causal constraints over 3 iterations in 51 ms. Result :sat
Minimization took 3004 ms.
[2023-03-11 23:00:27] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:27] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 23:00:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:27] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2023-03-11 23:00:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:00:27] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:27] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 23:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:33] [INFO ] [Nat]Absence check using state equation in 6007 ms returned unknown
Current structural bounds on expressions (after SMT) : [700, 700] Max seen :[10, 10]
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 5 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 14/14 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 24/24 places, 14/14 transitions.
Applied a total of 0 rules in 4 ms. Remains 24 /24 variables (removed 0) and now considering 14/14 (removed 0) transitions.
// Phase 1: matrix 14 rows 24 cols
[2023-03-11 23:00:33] [INFO ] Computed 10 place invariants in 0 ms
[2023-03-11 23:00:33] [INFO ] Implicit Places using invariants in 47 ms returned [1, 2, 3, 13]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 50 ms to find 4 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 20/24 places, 14/14 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 20 transition count 12
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 18 transition count 12
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 0 with 2 rules applied. Total rules applied 6 place count 17 transition count 11
Applied a total of 6 rules in 2 ms. Remains 17 /20 variables (removed 3) and now considering 11/14 (removed 3) transitions.
// Phase 1: matrix 11 rows 17 cols
[2023-03-11 23:00:33] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 23:00:33] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 11 rows 17 cols
[2023-03-11 23:00:33] [INFO ] Computed 6 place invariants in 0 ms
[2023-03-11 23:00:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-11 23:00:33] [INFO ] Implicit Places using invariants and state equation in 40 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 69 ms to find 1 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 16/24 places, 11/14 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 11/11 (removed 0) transitions.
Finished structural reductions, in 3 iterations. Remains : 16/24 places, 11/14 transitions.
// Phase 1: matrix 11 rows 16 cols
[2023-03-11 23:00:33] [INFO ] Computed 5 place invariants in 1 ms
Incomplete random walk after 1000006 steps, including 1187 resets, run finished after 194 ms. (steps per millisecond=5154 ) properties (out of 2) seen :20
Incomplete Best-First random walk after 1000001 steps, including 399 resets, run finished after 243 ms. (steps per millisecond=4115 ) properties (out of 2) seen :11
Incomplete Best-First random walk after 1000001 steps, including 303 resets, run finished after 251 ms. (steps per millisecond=3984 ) properties (out of 2) seen :20
// Phase 1: matrix 11 rows 16 cols
[2023-03-11 23:00:34] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 23:00:34] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2023-03-11 23:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:34] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-11 23:00:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:00:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-11 23:00:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 22 ms returned sat
[2023-03-11 23:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:34] [INFO ] [Nat]Absence check using state equation in 62 ms returned unsat
[2023-03-11 23:00:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 23:00:34] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 23:00:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:34] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2023-03-11 23:00:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 23:00:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-11 23:00:34] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 27 ms returned sat
[2023-03-11 23:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 23:00:34] [INFO ] [Nat]Absence check using state equation in 53 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 10] Max seen :[10, 10]
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0100N0000001000-UpperBounds-08 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 93239 ms.

BK_STOP 1678575634528

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="GPPP-PT-C0100N0000001000"
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 GPPP-PT-C0100N0000001000, 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 r191-tall-167838876300108"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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