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.r139-smll-167819421500014.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 smartxred
Input is Dekker-PT-015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819421500014
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.8K Feb 26 01:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 01:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 01:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 01:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 141K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678295640373

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-015
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-08 17:14:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 17:14:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 17:14:04] [INFO ] Load time of PNML (sax parser for PT used): 100 ms
[2023-03-08 17:14:04] [INFO ] Transformed 75 places.
[2023-03-08 17:14:04] [INFO ] Transformed 255 transitions.
[2023-03-08 17:14:04] [INFO ] Found NUPN structural information;
[2023-03-08 17:14:04] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Dekker-PT-015-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1014 ms. (steps per millisecond=9 ) properties (out of 9) seen :4
FORMULA Dekker-PT-015-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Dekker-PT-015-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-08 17:14:05] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2023-03-08 17:14:05] [INFO ] Computed 45 place invariants in 11 ms
[2023-03-08 17:14:06] [INFO ] After 295ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-08 17:14:06] [INFO ] [Nat]Absence check using 30 positive place invariants in 20 ms returned sat
[2023-03-08 17:14:06] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 4 ms returned sat
[2023-03-08 17:14:06] [INFO ] After 139ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-08 17:14:06] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 17:14:06] [INFO ] After 107ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-08 17:14:06] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 12 ms to minimize.
[2023-03-08 17:14:06] [INFO ] Deduced a trap composed of 4 places in 60 ms of which 1 ms to minimize.
[2023-03-08 17:14:06] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-08 17:14:06] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 3 ms to minimize.
[2023-03-08 17:14:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 283 ms
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 6 places in 56 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 0 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 0 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 277 ms
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 178 ms
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2023-03-08 17:14:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 246 ms
[2023-03-08 17:14:07] [INFO ] After 1226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-08 17:14:07] [INFO ] After 1614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 61 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 34 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 75/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 347 ms. (steps per millisecond=28 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 741136 steps, run timeout after 3001 ms. (steps per millisecond=246 ) properties seen :{2=1}
Probabilistic random walk after 741136 steps, saw 72476 distinct states, run finished after 3002 ms. (steps per millisecond=246 ) properties seen :1
FORMULA Dekker-PT-015-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 4 properties.
[2023-03-08 17:14:11] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 17:14:11] [INFO ] Invariant cache hit.
[2023-03-08 17:14:11] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 17:14:11] [INFO ] [Nat]Absence check using 30 positive place invariants in 12 ms returned sat
[2023-03-08 17:14:11] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 8 ms returned sat
[2023-03-08 17:14:11] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 17:14:11] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 17:14:11] [INFO ] After 90ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 17:14:11] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2023-03-08 17:14:11] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-08 17:14:11] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-08 17:14:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 2 ms to minimize.
[2023-03-08 17:14:12] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2023-03-08 17:14:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 230 ms
[2023-03-08 17:14:12] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-08 17:14:12] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 17:14:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
[2023-03-08 17:14:12] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 0 ms to minimize.
[2023-03-08 17:14:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-08 17:14:12] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-08 17:14:12] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-08 17:14:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2023-03-08 17:14:12] [INFO ] After 646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 99 ms.
[2023-03-08 17:14:12] [INFO ] After 983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 58 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 34 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 75/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 745200 steps, run timeout after 3001 ms. (steps per millisecond=248 ) properties seen :{}
Probabilistic random walk after 745200 steps, saw 74416 distinct states, run finished after 3002 ms. (steps per millisecond=248 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 17:14:16] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 17:14:16] [INFO ] Invariant cache hit.
[2023-03-08 17:14:16] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 17:14:16] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2023-03-08 17:14:16] [INFO ] [Nat]Absence check using 30 positive and 15 generalized place invariants in 7 ms returned sat
[2023-03-08 17:14:16] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 17:14:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 17:14:16] [INFO ] After 96ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 17:14:16] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 4 ms to minimize.
[2023-03-08 17:14:16] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2023-03-08 17:14:16] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 1 ms to minimize.
[2023-03-08 17:14:16] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-08 17:14:16] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-08 17:14:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 253 ms
[2023-03-08 17:14:16] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 2 ms to minimize.
[2023-03-08 17:14:16] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-08 17:14:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 94 ms
[2023-03-08 17:14:17] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2023-03-08 17:14:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-08 17:14:17] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2023-03-08 17:14:17] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 17:14:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 98 ms
[2023-03-08 17:14:17] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-08 17:14:17] [INFO ] After 1048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1 ms.
Support contains 58 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 25 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 75/75 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 20 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 17:14:17] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 17:14:17] [INFO ] Invariant cache hit.
[2023-03-08 17:14:17] [INFO ] Implicit Places using invariants in 125 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 135 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 74/75 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 171 ms. Remains : 74/75 places, 255/255 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 444 ms. (steps per millisecond=22 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 748496 steps, run timeout after 3001 ms. (steps per millisecond=249 ) properties seen :{}
Probabilistic random walk after 748496 steps, saw 75604 distinct states, run finished after 3002 ms. (steps per millisecond=249 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 17:14:21] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 74 cols
[2023-03-08 17:14:21] [INFO ] Computed 44 place invariants in 3 ms
[2023-03-08 17:14:21] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 17:14:21] [INFO ] [Nat]Absence check using 30 positive place invariants in 13 ms returned sat
[2023-03-08 17:14:21] [INFO ] [Nat]Absence check using 30 positive and 14 generalized place invariants in 6 ms returned sat
[2023-03-08 17:14:21] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 17:14:21] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 17:14:21] [INFO ] After 85ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 17:14:21] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2023-03-08 17:14:21] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
[2023-03-08 17:14:21] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2023-03-08 17:14:21] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 0 ms to minimize.
[2023-03-08 17:14:21] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-08 17:14:21] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 0 ms to minimize.
[2023-03-08 17:14:21] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
[2023-03-08 17:14:21] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 17:14:21] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 0 ms to minimize.
[2023-03-08 17:14:21] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 390 ms
[2023-03-08 17:14:22] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2023-03-08 17:14:22] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2023-03-08 17:14:22] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2023-03-08 17:14:22] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2023-03-08 17:14:22] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2023-03-08 17:14:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 246 ms
[2023-03-08 17:14:22] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2023-03-08 17:14:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-08 17:14:22] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 0 ms to minimize.
[2023-03-08 17:14:22] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2023-03-08 17:14:22] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2023-03-08 17:14:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 119 ms
[2023-03-08 17:14:22] [INFO ] After 978ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-08 17:14:22] [INFO ] After 1284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1 ms.
Support contains 58 out of 74 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 74/74 places, 255/255 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 74/74 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 74 /74 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2023-03-08 17:14:22] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 17:14:22] [INFO ] Invariant cache hit.
[2023-03-08 17:14:22] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 17:14:22] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 17:14:22] [INFO ] Invariant cache hit.
[2023-03-08 17:14:22] [INFO ] State equation strengthened by 15 read => feed constraints.
[2023-03-08 17:14:22] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-08 17:14:22] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-08 17:14:22] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2023-03-08 17:14:22] [INFO ] Invariant cache hit.
[2023-03-08 17:14:23] [INFO ] Dead Transitions using invariants and state equation in 359 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 648 ms. Remains : 74/74 places, 255/255 transitions.
Ensure Unique test removed 1 places
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Iterating post reduction 0 with 196 rules applied. Total rules applied 196 place count 73 transition count 60
Free-agglomeration rule applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 199 place count 73 transition count 57
Ensure Unique test removed 3 places
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 208 place count 67 transition count 54
Applied a total of 208 rules in 19 ms. Remains 67 /74 variables (removed 7) and now considering 54/255 (removed 201) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 54 rows 67 cols
[2023-03-08 17:14:23] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-08 17:14:23] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 17:14:23] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2023-03-08 17:14:23] [INFO ] [Nat]Absence check using 30 positive and 10 generalized place invariants in 5 ms returned sat
[2023-03-08 17:14:23] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 17:14:23] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-08 17:14:23] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-08 17:14:23] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-08 17:14:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 74 places, 255 transitions and 1814 arcs took 5 ms.
[2023-03-08 17:14:24] [INFO ] Flatten gal took : 133 ms
Total runtime 20049 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Dekker (PT), instance 015
Examination ReachabilityCardinality
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Cardinality.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

GOT IT HERE. BS
Petri model created: 74 places, 255 transitions, 1814 arcs.
Final Score: 1937.585
Took : 22 seconds
Reachability Cardinality file is: ReachabilityCardinality.xml
READY TO PARSE. BS
PROPERTY: Dekker-PT-015-ReachabilityCardinality-00 (reachable & potential(( ( ( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) ) & ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) ) & ( ( ( (tk(P66)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P66)) ) ) & ( ( ( (tk(P64)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P64)) ) ) & ( ( ( ( (tk(P62)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P62)) ) ) | ( ( ( (tk(P12)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P12)) ) ) | ( ( (tk(P35)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P35)) ) ) ) ) | ( ( ( ( (tk(P44)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P44)) ) ) | ( ( (tk(P19)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P19)) ) ) ) | ( ( ( ( ( (tk(P38)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P38)) ) ) & ( ( (tk(P29)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P29)) ) ) ) & ( ( ( (tk(P5)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P5)) ) ) & ( ( (tk(P69)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P69)) ) ) ) ) | ( ( ( (tk(P6)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P6)) ) ) & ( ( (tk(P68)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P68)) ) ) ) ) ) ) ) ) )))
PROPERTY: Dekker-PT-015-ReachabilityCardinality-03 (reachable &!potential( ( ( ( ( (tk(P39)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P39)) ) ) | ( ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) | ( ( (tk(P8)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P8)) ) ) ) ) | ( ( ( ( (tk(P72)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P72)) ) ) | ( ( (tk(P55)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P55)) ) ) ) | ( ( ( ( (tk(P15)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P15)) ) ) & ( ( ( (tk(P58)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P58)) ) ) & ( ( ( ( (tk(P8)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P8)) ) ) | ( ( (tk(P56)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P56)) ) ) ) | ( ( ( (tk(P30)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P30)) ) ) | ( ( (tk(P27)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P27)) ) ) ) ) ) ) | ( ( ( ( (tk(P44)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P44)) ) ) | ( ( (tk(P1)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1)) ) ) ) & ( ( ( ( (tk(P51)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P51)) ) ) & ( ( (tk(P33)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P33)) ) ) ) | ( ( ( ( ( (tk(P14)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P14)) ) ) & ( ( (tk(P48)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P48)) ) ) ) & ( ( ( (tk(P3)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P3)) ) ) & ( ( ( (tk(P69)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P69)) ) ) | ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) & ( ( (tk(P58)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P58)) ) ) ) ) ) ) | ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) & ( ( (tk(P31)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P31)) ) ) ) ) ) ) ) ) )))
PROPERTY: Dekker-PT-015-ReachabilityCardinality-08 (reachable &!potential( ( ( ( ( (tk(P57)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P57)) ) ) | ( ( ( (tk(P15)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P15)) ) ) | ( ( (tk(P34)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P34)) ) ) ) ) | ( ( ( (tk(P42)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P42)) ) ) | ( ( ( ( (tk(P42)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P42)) ) ) & ( ( (tk(P43)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P43)) ) ) ) | ( ( ( (tk(P57)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P57)) ) ) & ( ( (tk(P45)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P45)) ) ) ) ) ) )))
PROPERTY: Dekker-PT-015-ReachabilityCardinality-15 (reachable &!potential( ( ( ( ( (tk(P57)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P57)) ) ) | ( ( ( ( (tk(P48)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P48)) ) ) | ( ( ( ( (tk(P41)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P41)) ) ) & ( ( (tk(P11)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P11)) ) ) ) | ( ( ( (tk(P21)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P21)) ) ) & ( ( ( ( ( (tk(P37)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P37)) ) ) | ( ( (tk(P47)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P47)) ) ) ) | ( ( ( (tk(P22)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P22)) ) ) | ( ( (tk(P23)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P23)) ) ) ) ) & ( ( ( ( (tk(P49)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P49)) ) ) | ( ( (tk(P44)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P44)) ) ) ) | ( ( ( (tk(P34)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P34)) ) ) | ( ( (tk(P1)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P1)) ) ) ) ) ) ) ) ) & ( ( ( ( ( (tk(P6)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P6)) ) ) & ( ( (tk(P9)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P9)) ) ) ) & ( ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) & ( ( ( ( (tk(P61)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P61)) ) ) & ( ( (tk(P52)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P52)) ) ) ) | ( ( ( (tk(P48)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P48)) ) ) & ( ( (tk(P69)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P69)) ) ) ) ) ) ) | ( ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) & ( ( (tk(P44)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P44)) ) ) ) | ( ( ( ( (tk(P33)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P33)) ) ) | ( ( (tk(P4)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P4)) ) ) ) & ( ( ( (tk(P46)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P46)) ) ) | ( ( (tk(P41)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P41)) ) ) ) ) ) ) ) ) | ( ( ( ( (tk(P68)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P68)) ) ) & ( ( ( ( (tk(P40)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P40)) ) ) | ( ( (tk(P30)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P30)) ) ) ) | ( ( ( (tk(P31)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P31)) ) ) | ( ( ( (tk(P62)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P62)) ) ) & ( ( (tk(P55)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P55)) ) ) ) ) ) ) | ( ( ( (tk(P63)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P63)) ) ) & ( ( ( ( ( ( (tk(P60)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P60)) ) ) | ( ( (tk(P32)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P32)) ) ) ) & ( ( ( (tk(P72)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P72)) ) ) | ( ( (tk(P39)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P39)) ) ) ) ) & ( ( ( ( (tk(P24)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P24)) ) ) | ( ( (tk(P59)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P59)) ) ) ) & ( ( ( ( (tk(P19)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P19)) ) ) & ( ( ( (tk(P25)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P25)) ) ) & ( ( (tk(P51)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P51)) ) ) ) ) | ( ( ( (tk(P32)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P32)) ) ) & ( ( ( (tk(P2)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P2)) ) ) | ( ( (tk(P41)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P41)) ) ) ) ) ) ) ) | ( ( ( ( (tk(P7)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P7)) ) ) | ( ( (tk(P13)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P13)) ) ) ) & ( ( ( ( (tk(P18)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P18)) ) ) | ( ( (tk(P62)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P62)) ) ) ) | ( ( ( (tk(P18)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P18)) ) ) | ( ( ( (tk(P33)) <= ( 0 ) ) & ( ( 0 ) <= (tk(P33)) ) ) | ( ( (tk(P39)) <= ( 1 ) ) & ( ( 1 ) <= (tk(P39)) ) ) ) ) ) ) ) ) ) )))
FORMULA Dekker-PT-015-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Dekker-PT-015-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Dekker-PT-015-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA Dekker-PT-015-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678295689456

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Dekker-PT-015"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is Dekker-PT-015, 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 r139-smll-167819421500014"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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