fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r186-tajo-165281571800118
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for RERS17pb114-PT-6

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16167.044 1900692.00 2685907.00 26536.70 ?TTFFF????TFT??? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281571800118.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RERS17pb114-PT-6, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281571800118
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 73M
-rw-r--r-- 1 mcc users 5.8K Apr 29 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Apr 29 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 17:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 17:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K May 9 08:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 9 08:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 9 08:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 29 17:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 29 17:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 29 17:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 29 17:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 73M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1654445537719

Running Version 202205111006
[2022-06-05 16:12:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -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]
[2022-06-05 16:12:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-05 16:12:21] [INFO ] Load time of PNML (sax parser for PT used): 2199 ms
[2022-06-05 16:12:21] [INFO ] Transformed 1446 places.
[2022-06-05 16:12:22] [INFO ] Transformed 151085 transitions.
[2022-06-05 16:12:22] [INFO ] Parsed PT model containing 1446 places and 151085 transitions in 2884 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2225 ms. (steps per millisecond=4 ) properties (out of 16) seen :4
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 223 ms. (steps per millisecond=44 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2022-06-05 16:12:28] [INFO ] Flow matrix only has 84691 transitions (discarded 66394 similar events)
// Phase 1: matrix 84691 rows 1446 cols
[2022-06-05 16:12:29] [INFO ] Computed 35 place invariants in 639 ms
[2022-06-05 16:12:30] [INFO ] [Real]Absence check using 18 positive place invariants in 27 ms returned sat
[2022-06-05 16:12:30] [INFO ] [Real]Absence check using 18 positive and 17 generalized place invariants in 30 ms returned sat
[2022-06-05 16:12:30] [INFO ] After 907ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2022-06-05 16:12:30] [INFO ] [Nat]Absence check using 18 positive place invariants in 19 ms returned sat
[2022-06-05 16:12:30] [INFO ] [Nat]Absence check using 18 positive and 17 generalized place invariants in 30 ms returned sat
[2022-06-05 16:12:55] [INFO ] After 24513ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :11
[2022-06-05 16:12:58] [INFO ] State equation strengthened by 2342 read => feed constraints.
[2022-06-05 16:12:58] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-05 16:12:58] [INFO ] After 28483ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:12
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 221 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 16 places
Drop transitions removed 512 transitions
Reduce isomorphic transitions removed 512 transitions.
Iterating post reduction 0 with 528 rules applied. Total rules applied 528 place count 1430 transition count 150573
Applied a total of 528 rules in 3463 ms. Remains 1430 /1446 variables (removed 16) and now considering 150573/151085 (removed 512) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1446 places, 150573/151085 transitions.
Interrupted random walk after 134521 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen 1
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 625441 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=125 ) properties seen 0
Interrupted Best-First random walk after 770386 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=154 ) properties seen 1
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 474353 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=94 ) properties seen 0
Interrupted Best-First random walk after 711522 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=142 ) properties seen 0
Interrupted Best-First random walk after 414434 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen 0
Interrupted Best-First random walk after 317985 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=63 ) properties seen 0
Interrupted Best-First random walk after 566384 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=113 ) properties seen 0
Interrupted Best-First random walk after 182579 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=36 ) properties seen 0
Interrupted Best-First random walk after 391124 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=78 ) properties seen 0
Interrupted Best-First random walk after 546391 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=109 ) properties seen 0
Running SMT prover for 9 properties.
[2022-06-05 16:14:23] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1430 cols
[2022-06-05 16:14:23] [INFO ] Computed 19 place invariants in 417 ms
[2022-06-05 16:14:23] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-05 16:14:23] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 41 ms returned sat
[2022-06-05 16:14:23] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2022-06-05 16:14:24] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2022-06-05 16:14:24] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 24 ms returned sat
[2022-06-05 16:14:59] [INFO ] After 34845ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2022-06-05 16:15:00] [INFO ] State equation strengthened by 2341 read => feed constraints.
[2022-06-05 16:15:43] [INFO ] After 42065ms SMT Verify possible using 2341 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2022-06-05 16:15:51] [INFO ] Deduced a trap composed of 41 places in 6258 ms of which 6 ms to minimize.
[2022-06-05 16:15:58] [INFO ] Deduced a trap composed of 67 places in 5617 ms of which 2 ms to minimize.
[2022-06-05 16:16:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 21141 ms
[2022-06-05 16:16:56] [INFO ] After 115772ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 18584 ms.
[2022-06-05 16:17:15] [INFO ] After 171331ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 218 out of 1430 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Applied a total of 0 rules in 1971 ms. Remains 1430 /1430 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1430 places, 150573/150573 transitions.
Interrupted random walk after 175921 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 0
Interrupted Best-First random walk after 618961 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=123 ) properties seen 0
Interrupted Best-First random walk after 448687 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=89 ) properties seen 0
Interrupted Best-First random walk after 763959 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=152 ) properties seen 0
Interrupted Best-First random walk after 457019 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=91 ) properties seen 0
Interrupted Best-First random walk after 325537 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=65 ) properties seen 0
Interrupted Best-First random walk after 601441 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=120 ) properties seen 1
FORMULA RERS17pb114-PT-6-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 164625 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=32 ) properties seen 0
Interrupted Best-First random walk after 353686 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=70 ) properties seen 0
Interrupted Best-First random walk after 498822 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=99 ) properties seen 0
Running SMT prover for 8 properties.
[2022-06-05 16:18:32] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1430 cols
[2022-06-05 16:18:33] [INFO ] Computed 19 place invariants in 573 ms
[2022-06-05 16:18:33] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-05 16:18:33] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 30 ms returned sat
[2022-06-05 16:18:33] [INFO ] After 420ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-05 16:18:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2022-06-05 16:18:34] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 28 ms returned sat
[2022-06-05 16:19:09] [INFO ] After 34603ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-05 16:19:11] [INFO ] State equation strengthened by 2341 read => feed constraints.
[2022-06-05 16:19:46] [INFO ] After 35338ms SMT Verify possible using 2341 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-05 16:19:58] [INFO ] Deduced a trap composed of 129 places in 9801 ms of which 3 ms to minimize.
[2022-06-05 16:20:09] [INFO ] Deduced a trap composed of 73 places in 9016 ms of which 2 ms to minimize.
[2022-06-05 16:20:16] [INFO ] Deduced a trap composed of 65 places in 5326 ms of which 1 ms to minimize.
[2022-06-05 16:20:23] [INFO ] Deduced a trap composed of 67 places in 4533 ms of which 1 ms to minimize.
[2022-06-05 16:20:28] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 41494 ms
[2022-06-05 16:21:10] [INFO ] After 118756ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 13469 ms.
[2022-06-05 16:21:23] [INFO ] After 169552ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 174 out of 1430 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1430/1430 places, 150573/150573 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1429 transition count 150573
Applied a total of 1 rules in 2175 ms. Remains 1429 /1430 variables (removed 1) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1430 places, 150573/150573 transitions.
Interrupted random walk after 128822 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=4 ) properties seen 0
Interrupted Best-First random walk after 566872 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=113 ) properties seen 0
Interrupted Best-First random walk after 439379 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
Interrupted Best-First random walk after 747938 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=149 ) properties seen 0
Interrupted Best-First random walk after 435647 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
Interrupted Best-First random walk after 341960 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen 0
Interrupted Best-First random walk after 227740 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=45 ) properties seen 0
Interrupted Best-First random walk after 484016 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=96 ) properties seen 0
Interrupted Best-First random walk after 598315 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=119 ) properties seen 0
Interrupted probabilistic random walk after 299464 steps, run timeout after 210008 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 299464 steps, saw 277807 distinct states, run finished after 210019 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 8 properties.
[2022-06-05 16:26:06] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:26:07] [INFO ] Computed 18 place invariants in 598 ms
[2022-06-05 16:26:07] [INFO ] [Real]Absence check using 18 positive place invariants in 15 ms returned sat
[2022-06-05 16:26:07] [INFO ] After 444ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-05 16:26:07] [INFO ] [Nat]Absence check using 18 positive place invariants in 16 ms returned sat
[2022-06-05 16:26:40] [INFO ] After 32560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-05 16:26:42] [INFO ] State equation strengthened by 2341 read => feed constraints.
[2022-06-05 16:27:09] [INFO ] After 27140ms SMT Verify possible using 2341 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-05 16:27:18] [INFO ] Deduced a trap composed of 129 places in 7725 ms of which 1 ms to minimize.
[2022-06-05 16:27:27] [INFO ] Deduced a trap composed of 41 places in 6681 ms of which 1 ms to minimize.
[2022-06-05 16:27:35] [INFO ] Deduced a trap composed of 65 places in 6084 ms of which 0 ms to minimize.
[2022-06-05 16:27:41] [INFO ] Deduced a trap composed of 97 places in 4672 ms of which 0 ms to minimize.
[2022-06-05 16:27:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 37103 ms
[2022-06-05 16:28:28] [INFO ] After 106000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 14381 ms.
[2022-06-05 16:28:42] [INFO ] After 155152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 174 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1426 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1429 places, 150573/150573 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1232 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2022-06-05 16:28:45] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:28:45] [INFO ] Computed 18 place invariants in 520 ms
[2022-06-05 16:28:53] [INFO ] Implicit Places using invariants in 8472 ms returned []
Implicit Place search using SMT only with invariants took 8474 ms to find 0 implicit places.
[2022-06-05 16:28:53] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:28:54] [INFO ] Computed 18 place invariants in 581 ms
[2022-06-05 16:29:24] [INFO ] Performed 88333/150573 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-05 16:29:45] [INFO ] Dead Transitions using invariants and state equation in 51445 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1429 places, 150573/150573 transitions.
Interrupted random walk after 166451 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=5 ) properties seen 0
Interrupted Best-First random walk after 741130 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=148 ) properties seen 0
Interrupted Best-First random walk after 588869 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=117 ) properties seen 0
Interrupted Best-First random walk after 918879 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=183 ) properties seen 0
Interrupted Best-First random walk after 512991 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=102 ) properties seen 0
Interrupted Best-First random walk after 463057 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=92 ) properties seen 0
Interrupted Best-First random walk after 248495 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=49 ) properties seen 0
Interrupted Best-First random walk after 594387 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=118 ) properties seen 0
Interrupted Best-First random walk after 719946 steps, including 2 resets, run timeout after 5001 ms. (steps per millisecond=143 ) properties seen 0
Interrupted probabilistic random walk after 339773 steps, run timeout after 210008 ms. (steps per millisecond=1 ) properties seen :{}
Probabilistic random walk after 339773 steps, saw 315046 distinct states, run finished after 210009 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 8 properties.
[2022-06-05 16:34:25] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:34:26] [INFO ] Computed 18 place invariants in 475 ms
[2022-06-05 16:34:26] [INFO ] [Real]Absence check using 18 positive place invariants in 17 ms returned sat
[2022-06-05 16:34:26] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-05 16:34:27] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-06-05 16:35:03] [INFO ] After 35786ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-05 16:35:04] [INFO ] State equation strengthened by 2341 read => feed constraints.
[2022-06-05 16:35:36] [INFO ] After 32424ms SMT Verify possible using 2341 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2022-06-05 16:35:45] [INFO ] Deduced a trap composed of 129 places in 6904 ms of which 1 ms to minimize.
[2022-06-05 16:35:52] [INFO ] Deduced a trap composed of 41 places in 5731 ms of which 1 ms to minimize.
[2022-06-05 16:35:59] [INFO ] Deduced a trap composed of 65 places in 5360 ms of which 0 ms to minimize.
[2022-06-05 16:36:05] [INFO ] Deduced a trap composed of 97 places in 4493 ms of which 0 ms to minimize.
[2022-06-05 16:36:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 33067 ms
[2022-06-05 16:36:51] [INFO ] After 106487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 13998 ms.
[2022-06-05 16:37:05] [INFO ] After 158298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 174 out of 1429 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 1935 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1429 places, 150573/150573 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 1429/1429 places, 150573/150573 transitions.
Applied a total of 0 rules in 2397 ms. Remains 1429 /1429 variables (removed 0) and now considering 150573/150573 (removed 0) transitions.
[2022-06-05 16:37:09] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:37:09] [INFO ] Computed 18 place invariants in 411 ms
[2022-06-05 16:37:16] [INFO ] Implicit Places using invariants in 7361 ms returned []
Implicit Place search using SMT only with invariants took 7365 ms to find 0 implicit places.
[2022-06-05 16:37:16] [INFO ] Flow matrix only has 84690 transitions (discarded 65883 similar events)
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:37:17] [INFO ] Computed 18 place invariants in 433 ms
[2022-06-05 16:37:47] [INFO ] Performed 90549/150573 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2022-06-05 16:38:07] [INFO ] Dead Transitions using invariants and state equation in 50857 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1429/1429 places, 150573/150573 transitions.
Ensure Unique test removed 65883 transitions
Reduce isomorphic transitions removed 65883 transitions.
Iterating post reduction 0 with 65883 rules applied. Total rules applied 65883 place count 1429 transition count 84690
Applied a total of 65883 rules in 2975 ms. Remains 1429 /1429 variables (removed 0) and now considering 84690/150573 (removed 65883) transitions.
Running SMT prover for 8 properties.
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:38:11] [INFO ] Computed 18 place invariants in 438 ms
[2022-06-05 16:38:12] [INFO ] [Real]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-06-05 16:38:12] [INFO ] After 392ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2022-06-05 16:38:12] [INFO ] [Nat]Absence check using 18 positive place invariants in 13 ms returned sat
[2022-06-05 16:38:45] [INFO ] After 32995ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2022-06-05 16:38:50] [INFO ] Deduced a trap composed of 97 places in 3345 ms of which 1 ms to minimize.
[2022-06-05 16:38:54] [INFO ] Deduced a trap composed of 41 places in 2501 ms of which 1 ms to minimize.
[2022-06-05 16:38:57] [INFO ] Deduced a trap composed of 97 places in 1759 ms of which 1 ms to minimize.
[2022-06-05 16:38:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 13866 ms
[2022-06-05 16:39:22] [INFO ] After 70105ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 12179 ms.
[2022-06-05 16:39:34] [INFO ] After 82769ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2022-06-05 16:39:41] [INFO ] Flatten gal took : 4858 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2733449283158545179
[2022-06-05 16:39:44] [INFO ] Too many transitions (150573) to apply POR reductions. Disabling POR matrices.
[2022-06-05 16:39:46] [INFO ] Built C files in 2518ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2733449283158545179
Running compilation step : cd /tmp/ltsmin2733449283158545179;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '90' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-05 16:39:50] [INFO ] Applying decomposition
[2022-06-05 16:39:53] [INFO ] Flatten gal took : 9388 ms
[2022-06-05 16:39:57] [INFO ] Flatten gal took : 6340 ms
[2022-06-05 16:40:00] [INFO ] Input system was already deterministic with 150573 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3649072189152322321.txt' '-o' '/tmp/graph3649072189152322321.bin' '-w' '/tmp/graph3649072189152322321.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3649072189152322321.bin' '-l' '-1' '-v' '-w' '/tmp/graph3649072189152322321.weights' '-q' '0' '-e' '0.001'
[2022-06-05 16:40:09] [INFO ] Decomposing Gal with order
[2022-06-05 16:40:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-05 16:40:24] [INFO ] Removed a total of 456618 redundant transitions.
[2022-06-05 16:40:25] [INFO ] Flatten gal took : 8967 ms
[2022-06-05 16:40:49] [INFO ] Ran tautology test, simplified 0 / 8 in 55506 ms.
[2022-06-05 16:40:49] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-00(UNSAT) depth K=0 took 25 ms
[2022-06-05 16:40:49] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-06(UNSAT) depth K=0 took 1 ms
[2022-06-05 16:40:49] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-07(UNSAT) depth K=0 took 2 ms
[2022-06-05 16:40:49] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-08(UNSAT) depth K=0 took 13 ms
[2022-06-05 16:40:49] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-09(UNSAT) depth K=0 took 1 ms
[2022-06-05 16:40:49] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2022-06-05 16:40:49] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-14(UNSAT) depth K=0 took 1 ms
[2022-06-05 16:40:49] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-15(UNSAT) depth K=0 took 1 ms
[2022-06-05 16:40:50] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-00(UNSAT) depth K=1 took 54 ms
[2022-06-05 16:40:50] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-06(UNSAT) depth K=1 took 2 ms
[2022-06-05 16:40:50] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-07(UNSAT) depth K=1 took 1 ms
[2022-06-05 16:40:50] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-08(UNSAT) depth K=1 took 12 ms
[2022-06-05 16:40:50] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-09(UNSAT) depth K=1 took 4 ms
[2022-06-05 16:40:50] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-13(UNSAT) depth K=1 took 2 ms
[2022-06-05 16:40:50] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-14(UNSAT) depth K=1 took 10 ms
[2022-06-05 16:40:50] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-15(UNSAT) depth K=1 took 2 ms
[2022-06-05 16:41:00] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-00(UNSAT) depth K=2 took 6612 ms
[2022-06-05 16:41:00] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-06(UNSAT) depth K=2 took 35 ms
[2022-06-05 16:41:00] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-07(UNSAT) depth K=2 took 33 ms
[2022-06-05 16:41:01] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-08(UNSAT) depth K=2 took 39 ms
[2022-06-05 16:41:01] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-09(UNSAT) depth K=2 took 31 ms
[2022-06-05 16:41:01] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-13(UNSAT) depth K=2 took 37 ms
[2022-06-05 16:41:01] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-14(UNSAT) depth K=2 took 28 ms
[2022-06-05 16:41:01] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-15(UNSAT) depth K=2 took 28 ms
[2022-06-05 16:41:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 2734 labels/synchronizations in 32113 ms.
[2022-06-05 16:41:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17169827114453834033.gal : 632 ms
[2022-06-05 16:41:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13457742343536450331.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17169827114453834033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13457742343536450331.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2733449283158545179;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '90' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 90 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2733449283158545179;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '90' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 90 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-05 16:41:31] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-00(UNSAT) depth K=3 took 29065 ms
[2022-06-05 16:41:33] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-06(UNSAT) depth K=3 took 1819 ms
[2022-06-05 16:41:35] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-07(UNSAT) depth K=3 took 1373 ms
Loading property file /tmp/ReachabilityCardinality13457742343536450331.prop.
[2022-06-05 16:41:37] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-08(UNSAT) depth K=3 took 1511 ms
[2022-06-05 16:41:40] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-09(UNSAT) depth K=3 took 2900 ms
[2022-06-05 16:41:42] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-13(UNSAT) depth K=3 took 1878 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 84690 out of 150573 initially.
// Phase 1: matrix 84690 rows 1429 cols
[2022-06-05 16:42:03] [INFO ] Computed 18 place invariants in 760 ms
[2022-06-05 16:42:03] [INFO ] Computed 18 place invariants in 767 ms
[2022-06-05 16:43:07] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-14(UNSAT) depth K=3 took 85869 ms
[2022-06-05 16:43:09] [INFO ] BMC solution for property RERS17pb114-PT-6-ReachabilityCardinality-15(UNSAT) depth K=3 took 2032 ms

BK_STOP 1654447438411

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityCardinality -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="RERS17pb114-PT-6"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is RERS17pb114-PT-6, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r186-tajo-165281571800118"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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