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.r352-tall-167889221000083.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 RERS17pb114-PT-8, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r352-tall-167889221000083
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 6.2K Feb 26 05:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 26 05:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 05:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 05:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 05:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Feb 26 05:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 05:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 05:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 73M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1679140817832

Running Version 202205111006
[2023-03-18 12:00:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -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, 1800]
[2023-03-18 12:00:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 12:00:21] [INFO ] Load time of PNML (sax parser for PT used): 2567 ms
[2023-03-18 12:00:21] [INFO ] Transformed 1446 places.
[2023-03-18 12:00:22] [INFO ] Transformed 151085 transitions.
[2023-03-18 12:00:22] [INFO ] Parsed PT model containing 1446 places and 151085 transitions in 3186 ms.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1826 ms. (steps per millisecond=5 ) properties (out of 1446) seen :950
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=3 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=5 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=7 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=4 ) properties (out of 496) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 496) seen :0
Running SMT prover for 496 properties.
[2023-03-18 12:00:26] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2023-03-18 12:00:26] [INFO ] Computed 35 place invariants in 469 ms
[2023-03-18 12:00:40] [INFO ] After 14226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:496
[2023-03-18 12:00:52] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2023-03-18 12:00:52] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 27 ms returned sat
[2023-03-18 12:01:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 12:01:05] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:496
Fused 496 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 496 out of 1446 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1446/1446 places, 151085/151085 transitions.
Ensure Unique test removed 17 places
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 529 rules applied. Total rules applied 529 place count 1429 transition count 150573
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 530 place count 1428 transition count 150572
Applied a total of 530 rules in 2905 ms. Remains 1428 /1446 variables (removed 18) and now considering 150572/151085 (removed 513) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1446 places, 150572/151085 transitions.
Interrupted random walk after 226668 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=7 ) properties seen 478
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 489 ms. (steps per millisecond=204 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 535 ms. (steps per millisecond=186 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 464 ms. (steps per millisecond=215 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 503 ms. (steps per millisecond=198 ) properties (out of 17) seen :2
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 522 ms. (steps per millisecond=191 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=196 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 564 ms. (steps per millisecond=177 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 484 ms. (steps per millisecond=206 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 472 ms. (steps per millisecond=211 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 469 ms. (steps per millisecond=213 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 468 ms. (steps per millisecond=213 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 511 ms. (steps per millisecond=195 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 100001 steps, including 2 resets, run finished after 508 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
[2023-03-18 12:01:46] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:01:47] [INFO ] Computed 18 place invariants in 299 ms
[2023-03-18 12:01:47] [INFO ] After 468ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-18 12:01:48] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-18 12:02:26] [INFO ] After 38426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-18 12:02:28] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 12:02:56] [INFO ] After 27477ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-18 12:03:07] [INFO ] Deduced a trap composed of 40 places in 9756 ms of which 10 ms to minimize.
[2023-03-18 12:03:18] [INFO ] Deduced a trap composed of 64 places in 8970 ms of which 2 ms to minimize.
[2023-03-18 12:03:28] [INFO ] Deduced a trap composed of 40 places in 8982 ms of which 3 ms to minimize.
[2023-03-18 12:03:38] [INFO ] Deduced a trap composed of 96 places in 8618 ms of which 1 ms to minimize.
[2023-03-18 12:03:47] [INFO ] Deduced a trap composed of 64 places in 7953 ms of which 1 ms to minimize.
[2023-03-18 12:03:56] [INFO ] Deduced a trap composed of 64 places in 7509 ms of which 1 ms to minimize.
[2023-03-18 12:04:05] [INFO ] Deduced a trap composed of 96 places in 7472 ms of which 1 ms to minimize.
[2023-03-18 12:04:13] [INFO ] Deduced a trap composed of 64 places in 6551 ms of which 1 ms to minimize.
[2023-03-18 12:04:21] [INFO ] Deduced a trap composed of 64 places in 6408 ms of which 0 ms to minimize.
[2023-03-18 12:04:28] [INFO ] Deduced a trap composed of 96 places in 6113 ms of which 1 ms to minimize.
[2023-03-18 12:04:35] [INFO ] Deduced a trap composed of 96 places in 5548 ms of which 0 ms to minimize.
[2023-03-18 12:04:41] [INFO ] Deduced a trap composed of 64 places in 4800 ms of which 1 ms to minimize.
[2023-03-18 12:04:46] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 110347 ms
[2023-03-18 12:05:46] [INFO ] Deduced a trap composed of 4 places in 13332 ms of which 4 ms to minimize.
[2023-03-18 12:05:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 12:05:46] [INFO ] After 238365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:14
Fused 14 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 14 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1431 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 265386 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 11
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3519 ms. (steps per millisecond=284 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3483 ms. (steps per millisecond=287 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 3542 ms. (steps per millisecond=282 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-18 12:06:28] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:06:28] [INFO ] Computed 18 place invariants in 314 ms
[2023-03-18 12:06:29] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 12:06:29] [INFO ] [Nat]Absence check using 18 positive place invariants in 17 ms returned sat
[2023-03-18 12:06:54] [INFO ] After 24693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 12:06:55] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 12:07:06] [INFO ] After 11086ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-18 12:07:18] [INFO ] Deduced a trap composed of 64 places in 10707 ms of which 2 ms to minimize.
[2023-03-18 12:07:29] [INFO ] Deduced a trap composed of 64 places in 9618 ms of which 2 ms to minimize.
[2023-03-18 12:07:39] [INFO ] Deduced a trap composed of 40 places in 9010 ms of which 1 ms to minimize.
[2023-03-18 12:07:49] [INFO ] Deduced a trap composed of 64 places in 8807 ms of which 1 ms to minimize.
[2023-03-18 12:07:59] [INFO ] Deduced a trap composed of 40 places in 8562 ms of which 2 ms to minimize.
[2023-03-18 12:08:09] [INFO ] Deduced a trap composed of 96 places in 8497 ms of which 1 ms to minimize.
[2023-03-18 12:08:18] [INFO ] Deduced a trap composed of 128 places in 7807 ms of which 2 ms to minimize.
[2023-03-18 12:08:27] [INFO ] Deduced a trap composed of 64 places in 7569 ms of which 1 ms to minimize.
[2023-03-18 12:08:36] [INFO ] Deduced a trap composed of 64 places in 7333 ms of which 2 ms to minimize.
[2023-03-18 12:08:44] [INFO ] Deduced a trap composed of 96 places in 6992 ms of which 0 ms to minimize.
[2023-03-18 12:08:51] [INFO ] Deduced a trap composed of 64 places in 5487 ms of which 0 ms to minimize.
[2023-03-18 12:08:58] [INFO ] Deduced a trap composed of 128 places in 5146 ms of which 1 ms to minimize.
[2023-03-18 12:09:03] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 116665 ms
[2023-03-18 12:09:15] [INFO ] After 139979ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 4084 ms.
[2023-03-18 12:09:19] [INFO ] After 170241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1346 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 328806 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=10 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3406 ms. (steps per millisecond=293 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3357 ms. (steps per millisecond=297 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 12:09:57] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:09:58] [INFO ] Computed 18 place invariants in 297 ms
[2023-03-18 12:09:58] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 12:09:58] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2023-03-18 12:10:21] [INFO ] After 22739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 12:10:22] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 12:10:31] [INFO ] After 9579ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 12:10:44] [INFO ] Deduced a trap composed of 40 places in 11015 ms of which 1 ms to minimize.
[2023-03-18 12:10:55] [INFO ] Deduced a trap composed of 64 places in 10576 ms of which 1 ms to minimize.
[2023-03-18 12:11:07] [INFO ] Deduced a trap composed of 96 places in 9799 ms of which 1 ms to minimize.
[2023-03-18 12:11:17] [INFO ] Deduced a trap composed of 40 places in 8698 ms of which 1 ms to minimize.
[2023-03-18 12:11:27] [INFO ] Deduced a trap composed of 64 places in 8505 ms of which 1 ms to minimize.
[2023-03-18 12:11:36] [INFO ] Deduced a trap composed of 64 places in 8307 ms of which 1 ms to minimize.
[2023-03-18 12:11:45] [INFO ] Deduced a trap composed of 64 places in 7666 ms of which 1 ms to minimize.
[2023-03-18 12:11:55] [INFO ] Deduced a trap composed of 96 places in 8561 ms of which 2 ms to minimize.
[2023-03-18 12:12:04] [INFO ] Deduced a trap composed of 128 places in 7613 ms of which 19 ms to minimize.
[2023-03-18 12:12:12] [INFO ] Deduced a trap composed of 64 places in 6900 ms of which 1 ms to minimize.
[2023-03-18 12:12:20] [INFO ] Deduced a trap composed of 64 places in 5973 ms of which 0 ms to minimize.
[2023-03-18 12:12:27] [INFO ] Deduced a trap composed of 96 places in 5755 ms of which 0 ms to minimize.
[2023-03-18 12:12:32] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 120620 ms
[2023-03-18 12:12:38] [INFO ] After 136594ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2796 ms.
[2023-03-18 12:12:41] [INFO ] After 163011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1382 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 286438 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3700 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3801 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 163724 steps, run timeout after 111003 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 163724 steps, saw 151028 distinct states, run finished after 111006 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-18 12:15:11] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:15:12] [INFO ] Computed 18 place invariants in 346 ms
[2023-03-18 12:15:12] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 12:15:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 24 ms returned sat
[2023-03-18 12:15:35] [INFO ] After 22998ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 12:15:36] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 12:15:46] [INFO ] After 9754ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 12:15:59] [INFO ] Deduced a trap composed of 40 places in 11776 ms of which 2 ms to minimize.
[2023-03-18 12:16:12] [INFO ] Deduced a trap composed of 64 places in 11945 ms of which 2 ms to minimize.
[2023-03-18 12:16:25] [INFO ] Deduced a trap composed of 96 places in 11038 ms of which 2 ms to minimize.
[2023-03-18 12:16:35] [INFO ] Deduced a trap composed of 40 places in 8840 ms of which 1 ms to minimize.
[2023-03-18 12:16:45] [INFO ] Deduced a trap composed of 64 places in 8740 ms of which 1 ms to minimize.
[2023-03-18 12:16:55] [INFO ] Deduced a trap composed of 64 places in 8981 ms of which 1 ms to minimize.
[2023-03-18 12:17:05] [INFO ] Deduced a trap composed of 64 places in 8350 ms of which 1 ms to minimize.
[2023-03-18 12:17:15] [INFO ] Deduced a trap composed of 96 places in 8343 ms of which 1 ms to minimize.
[2023-03-18 12:17:24] [INFO ] Deduced a trap composed of 128 places in 7259 ms of which 1 ms to minimize.
[2023-03-18 12:17:32] [INFO ] Deduced a trap composed of 64 places in 6675 ms of which 1 ms to minimize.
[2023-03-18 12:17:39] [INFO ] Deduced a trap composed of 64 places in 5970 ms of which 1 ms to minimize.
[2023-03-18 12:17:46] [INFO ] Deduced a trap composed of 96 places in 5551 ms of which 3 ms to minimize.
[2023-03-18 12:17:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 125330 ms
[2023-03-18 12:17:57] [INFO ] After 141667ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2886 ms.
[2023-03-18 12:18:00] [INFO ] After 168456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1598 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1471 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-18 12:18:03] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:18:04] [INFO ] Computed 18 place invariants in 306 ms
[2023-03-18 12:18:13] [INFO ] Implicit Places using invariants in 9322 ms returned []
Implicit Place search using SMT only with invariants took 9324 ms to find 0 implicit places.
[2023-03-18 12:18:13] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:18:13] [INFO ] Computed 18 place invariants in 348 ms
[2023-03-18 12:18:43] [INFO ] Performed 86524/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-18 12:19:06] [INFO ] Dead Transitions using invariants and state equation in 52801 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 10921 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 12:19:17] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:19:18] [INFO ] Computed 18 place invariants in 394 ms
[2023-03-18 12:19:18] [INFO ] After 205ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 12:19:18] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-18 12:19:42] [INFO ] After 23932ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 12:19:43] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 12:19:53] [INFO ] After 10049ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 12:20:07] [INFO ] Deduced a trap composed of 40 places in 12337 ms of which 3 ms to minimize.
[2023-03-18 12:20:19] [INFO ] Deduced a trap composed of 64 places in 10952 ms of which 1 ms to minimize.
[2023-03-18 12:20:31] [INFO ] Deduced a trap composed of 96 places in 10939 ms of which 1 ms to minimize.
[2023-03-18 12:20:42] [INFO ] Deduced a trap composed of 40 places in 8731 ms of which 2 ms to minimize.
[2023-03-18 12:20:52] [INFO ] Deduced a trap composed of 64 places in 8886 ms of which 2 ms to minimize.
[2023-03-18 12:21:03] [INFO ] Deduced a trap composed of 64 places in 9183 ms of which 2 ms to minimize.
[2023-03-18 12:21:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-18 12:21:03] [INFO ] After 104936ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Interrupted random walk after 276285 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=9 ) properties seen 1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3544 ms. (steps per millisecond=282 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 12:21:36] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:21:37] [INFO ] Computed 18 place invariants in 386 ms
[2023-03-18 12:21:37] [INFO ] After 174ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 12:21:37] [INFO ] [Nat]Absence check using 18 positive place invariants in 15 ms returned sat
[2023-03-18 12:22:00] [INFO ] After 22586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 12:22:01] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 12:22:09] [INFO ] After 8541ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 12:22:23] [INFO ] Deduced a trap composed of 40 places in 12534 ms of which 2 ms to minimize.
[2023-03-18 12:22:36] [INFO ] Deduced a trap composed of 40 places in 11552 ms of which 4 ms to minimize.
[2023-03-18 12:22:49] [INFO ] Deduced a trap composed of 64 places in 11425 ms of which 3 ms to minimize.
[2023-03-18 12:23:01] [INFO ] Deduced a trap composed of 64 places in 10558 ms of which 4 ms to minimize.
[2023-03-18 12:23:13] [INFO ] Deduced a trap composed of 96 places in 10433 ms of which 1 ms to minimize.
[2023-03-18 12:23:25] [INFO ] Deduced a trap composed of 64 places in 10260 ms of which 1 ms to minimize.
[2023-03-18 12:23:36] [INFO ] Deduced a trap composed of 64 places in 9766 ms of which 2 ms to minimize.
[2023-03-18 12:23:47] [INFO ] Deduced a trap composed of 64 places in 9602 ms of which 1 ms to minimize.
[2023-03-18 12:23:57] [INFO ] Deduced a trap composed of 64 places in 8097 ms of which 3 ms to minimize.
[2023-03-18 12:24:06] [INFO ] Deduced a trap composed of 96 places in 7820 ms of which 1 ms to minimize.
[2023-03-18 12:24:15] [INFO ] Deduced a trap composed of 96 places in 7318 ms of which 1 ms to minimize.
[2023-03-18 12:24:21] [INFO ] Deduced a trap composed of 128 places in 5329 ms of which 1 ms to minimize.
[2023-03-18 12:24:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 137382 ms
[2023-03-18 12:24:27] [INFO ] After 146772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1542 ms.
[2023-03-18 12:24:29] [INFO ] After 171922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1463 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Interrupted random walk after 254033 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=8 ) properties seen 0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3888 ms. (steps per millisecond=257 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 131608 steps, run timeout after 99006 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 131608 steps, saw 121067 distinct states, run finished after 99007 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-18 12:26:44] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:26:44] [INFO ] Computed 18 place invariants in 260 ms
[2023-03-18 12:26:44] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-18 12:26:44] [INFO ] [Nat]Absence check using 18 positive place invariants in 18 ms returned sat
[2023-03-18 12:27:07] [INFO ] After 22590ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-18 12:27:08] [INFO ] State equation strengthened by 773 read => feed constraints.
[2023-03-18 12:27:16] [INFO ] After 7952ms SMT Verify possible using 773 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-18 12:27:29] [INFO ] Deduced a trap composed of 40 places in 11935 ms of which 4 ms to minimize.
[2023-03-18 12:27:41] [INFO ] Deduced a trap composed of 40 places in 10854 ms of which 3 ms to minimize.
[2023-03-18 12:27:53] [INFO ] Deduced a trap composed of 64 places in 10490 ms of which 3 ms to minimize.
[2023-03-18 12:28:05] [INFO ] Deduced a trap composed of 64 places in 9916 ms of which 2 ms to minimize.
[2023-03-18 12:28:15] [INFO ] Deduced a trap composed of 96 places in 9493 ms of which 1 ms to minimize.
[2023-03-18 12:28:26] [INFO ] Deduced a trap composed of 64 places in 9150 ms of which 1 ms to minimize.
[2023-03-18 12:28:37] [INFO ] Deduced a trap composed of 64 places in 9875 ms of which 1 ms to minimize.
[2023-03-18 12:28:47] [INFO ] Deduced a trap composed of 64 places in 8634 ms of which 1 ms to minimize.
[2023-03-18 12:28:58] [INFO ] Deduced a trap composed of 64 places in 8947 ms of which 1 ms to minimize.
[2023-03-18 12:29:08] [INFO ] Deduced a trap composed of 96 places in 8295 ms of which 1 ms to minimize.
[2023-03-18 12:29:16] [INFO ] Deduced a trap composed of 96 places in 7096 ms of which 1 ms to minimize.
[2023-03-18 12:29:23] [INFO ] Deduced a trap composed of 128 places in 5229 ms of which 0 ms to minimize.
[2023-03-18 12:29:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 132024 ms
[2023-03-18 12:29:29] [INFO ] After 140793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1426 ms.
[2023-03-18 12:29:30] [INFO ] After 165774ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 1428 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1663 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1428/1428 places, 150572/150572 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1428/1428 places, 150572/150572 transitions.
Applied a total of 0 rules in 1718 ms. Remains 1428 /1428 variables (removed 0) and now considering 150572/150572 (removed 0) transitions.
[2023-03-18 12:29:33] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:29:34] [INFO ] Computed 18 place invariants in 327 ms
[2023-03-18 12:29:43] [INFO ] Implicit Places using invariants in 9176 ms returned []
Implicit Place search using SMT only with invariants took 9178 ms to find 0 implicit places.
[2023-03-18 12:29:43] [INFO ] Flow matrix only has 84689 transitions (discarded 65883 similar events)
// Phase 1: matrix 84689 rows 1428 cols
[2023-03-18 12:29:43] [INFO ] Computed 18 place invariants in 297 ms
[2023-03-18 12:30:13] [INFO ] Performed 88664/150572 'is it Dead' test of which 0 returned DEAD in 30 seconds.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ StableMarking = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution StableMarking -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 StableMarking -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 1800 -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="RERS17pb114-PT-8"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="gold2022"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 RERS17pb114-PT-8, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r352-tall-167889221000083"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RERS17pb114-PT-8.tgz
mv RERS17pb114-PT-8 execution
cd execution
if [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "UpperBounds" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] || [ "StableMarking" = "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 [ "StableMarking" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "StableMarking" != "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 "StableMarking.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "StableMarking.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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
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 ;