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

About the Execution of Marcie+red for SmallOperatingSystem-PT-MT0256DC0128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13108.760 203192.00 209815.00 2865.00 FFFFFTFTTFTFFTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r458-smll-167912649800065.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SmallOperatingSystem-PT-MT0256DC0128, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649800065
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 12:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 12:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 25 12:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Feb 25 12:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679232046440

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SmallOperatingSystem-PT-MT0256DC0128
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:20:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 13:20:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:20:50] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-19 13:20:50] [INFO ] Transformed 9 places.
[2023-03-19 13:20:50] [INFO ] Transformed 8 transitions.
[2023-03-19 13:20:50] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 19 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 13:20:50] [INFO ] Computed 4 place invariants in 5 ms
[2023-03-19 13:20:50] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-19 13:20:50] [INFO ] Invariant cache hit.
[2023-03-19 13:20:50] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
[2023-03-19 13:20:50] [INFO ] Invariant cache hit.
[2023-03-19 13:20:50] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:20:51] [INFO ] Flatten gal took : 28 ms
[2023-03-19 13:20:51] [INFO ] Flatten gal took : 10 ms
[2023-03-19 13:20:51] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10060 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 78) seen :55
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=13 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=15 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-19 13:20:52] [INFO ] Invariant cache hit.
[2023-03-19 13:20:52] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-19 13:20:52] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :11 sat :1 real:11
[2023-03-19 13:20:52] [INFO ] After 18ms SMT Verify possible using trap constraints in real domain returned unsat :11 sat :1 real:11
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-19 13:20:52] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :11 sat :1 real:11
[2023-03-19 13:20:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-19 13:20:52] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :22 sat :1
[2023-03-19 13:20:52] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :22 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-19 13:20:52] [INFO ] After 108ms SMT Verify possible using all constraints in natural domain returned unsat :22 sat :1
Fused 23 Parikh solutions to 1 different solutions.
Finished Parikh walk after 573 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=143 )
Parikh walk visited 1 properties in 5 ms.
Successfully simplified 22 atomic propositions for a total of 16 simplifications.
[2023-03-19 13:20:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:20:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 2 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Applied a total of 0 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 0 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 1 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 7 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5 place count 5 transition count 6
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 8 place count 3 transition count 5
Graph (trivial) has 3 edges and 3 vertex of which 2 / 3 are part of one of the 1 SCC in 13 ms
Free SCC test removed 1 places
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 2 transition count 5
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 11 place count 2 transition count 3
Applied a total of 11 rules in 20 ms. Remains 2 /9 variables (removed 7) and now considering 3/8 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 2/9 places, 3/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 0 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:20:52] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:20:52] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-19 13:20:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 0 ms.
Total runtime 2878 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 9 NrTr: 8 NrArc: 27)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 3.531sec


RS generation: 0m 9.035sec


-> reachability set: #nodes 18057 (1.8e+04) #states 7,890,709,281 (9)



starting MCC model checker
--------------------------

checking: AX [E [0<=0 U AG [AF [AX [1<=0]]]]]
normalized: ~ [EX [~ [E [0<=0 U ~ [E [true U EG [EX [~ [1<=0]]]]]]]]]

abstracting: (1<=0)
states: 0
.
EG iterations: 0
abstracting: (0<=0)
states: 7,890,709,281 (9)
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.521sec

checking: AG [[~ [34<=p5] & EG [EX [0<=0]]]]
normalized: ~ [E [true U ~ [[EG [EX [0<=0]] & ~ [34<=p5]]]]]

abstracting: (34<=p5)
states: 4,290,070,096 (9)
abstracting: (0<=0)
states: 7,890,709,281 (9)
.
EG iterations: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.846sec

checking: A [EX [0<=0] U AG [p5<=97]]
normalized: [~ [EG [E [true U ~ [p5<=97]]]] & ~ [E [E [true U ~ [p5<=97]] U [~ [EX [0<=0]] & E [true U ~ [p5<=97]]]]]]

abstracting: (p5<=97)
states: 6,994,976,625 (9)
abstracting: (0<=0)
states: 7,890,709,281 (9)
.abstracting: (p5<=97)
states: 6,994,976,625 (9)
abstracting: (p5<=97)
states: 6,994,976,625 (9)

EG iterations: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.019sec

checking: EX [EX [EG [AG [~ [33<=p8]]]]]
normalized: EX [EX [EG [~ [E [true U 33<=p8]]]]]

abstracting: (33<=p8)
states: 3,478,562,784 (9)
.
EG iterations: 1
..-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.377sec

checking: EF [AG [E [EG [116<=p1] U AF [p1<=171]]]]
normalized: E [true U ~ [E [true U ~ [E [EG [116<=p1] U ~ [EG [~ [p1<=171]]]]]]]]

abstracting: (p1<=171)
states: 7,849,201,639 (9)
.
EG iterations: 1
abstracting: (116<=p1)
states: 498,006,951 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.704sec

checking: AG [E [AX [[183<=p5 | p3<=23]] U EF [p4<=77]]]
normalized: ~ [E [true U ~ [E [~ [EX [~ [[183<=p5 | p3<=23]]]] U E [true U p4<=77]]]]]

abstracting: (p4<=77)
states: 6,313,024,575 (9)
abstracting: (p3<=23)
states: 3,458,290,290 (9)
abstracting: (183<=p5)
states: 21,111,090 (7)
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.751sec

checking: EF [[p8<=p3 & AX [p0<=167]]]
normalized: E [true U [p8<=p3 & ~ [EX [~ [p0<=167]]]]]

abstracting: (p0<=167)
states: 2,422,936,698 (9)
.abstracting: (p8<=p3)
states: 3,989,341,473 (9)
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.670sec

checking: E [[~ [EX [[p1<=p4 | 197<=p3]]] | p8<=49] U ~ [117<=p1]]
normalized: E [[p8<=49 | ~ [EX [[p1<=p4 | 197<=p3]]]] U ~ [117<=p1]]

abstracting: (117<=p1)
states: 480,876,396 (8)
abstracting: (197<=p3)
states: 0
abstracting: (p1<=p4)
states: 3,977,579,073 (9)
.abstracting: (p8<=49)
states: 5,802,871,685 (9)
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.781sec

checking: AX [AG [E [103<=p8 U [AG [p6<=165] | [EX [p6<=p5] | 207<=p1]]]]]
normalized: ~ [EX [E [true U ~ [E [103<=p8 U [[207<=p1 | EX [p6<=p5]] | ~ [E [true U ~ [p6<=165]]]]]]]]]

abstracting: (p6<=165)
states: 1,102,495,576 (9)
abstracting: (p6<=p5)
states: 257
.abstracting: (207<=p1)
states: 3,162,510 (6)
abstracting: (103<=p8)
states: 155,803,050 (8)
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.228sec

checking: AF [[AX [AG [~ [p0<=p8]]] | [p3<=p5 & p1<=p7]]]
normalized: ~ [EG [~ [[[p3<=p5 & p1<=p7] | ~ [EX [E [true U p0<=p8]]]]]]]

abstracting: (p0<=p8)
states: 366,145 (5)
.abstracting: (p1<=p7)
states: 3,977,579,073 (9)
abstracting: (p3<=p5)
states: 4,593,289,025 (9)
..
EG iterations: 2
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.027sec

checking: EF [[[AG [p8<=p3] & EG [[p8<=8 & p2<=86]]] & [EX [110<=p7] & [[p5<=p8 | 229<=p0] & [214<=p3 | p6<=200]]]]]
normalized: E [true U [[[[214<=p3 | p6<=200] & [p5<=p8 | 229<=p0]] & EX [110<=p7]] & [EG [[p8<=8 & p2<=86]] & ~ [E [true U ~ [p8<=p3]]]]]]

abstracting: (p8<=p3)
states: 3,989,341,473 (9)
abstracting: (p2<=86)
states: 6,033,118,182 (9)
abstracting: (p8<=8)
states: 1,468,655,577 (9)
..
EG iterations: 2
abstracting: (110<=p7)
states: 611,061,906 (8)
.abstracting: (229<=p0)
states: 937,611,731 (8)
abstracting: (p5<=p8)
states: 3,379,445,121 (9)
abstracting: (p6<=200)
states: 2,697,140,901 (9)
abstracting: (214<=p3)
states: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.569sec

checking: AF [[[E [p5<=p7 U AG [p7<=p4]] | A [~ [[p3<=p1 & 105<=p6]] U [EG [p3<=p8] & ~ [p3<=126]]]] | [p6<=p8 | 11<=p3]]]
normalized: ~ [EG [~ [[[p6<=p8 | 11<=p3] | [[~ [EG [~ [[~ [p3<=126] & EG [p3<=p8]]]]] & ~ [E [~ [[~ [p3<=126] & EG [p3<=p8]]] U [[p3<=p1 & 105<=p6] & ~ [[~ [p3<=126] & EG [p3<=p8]]]]]]] | E [p5<=p7 U ~ [E [true U ~ [p7<=p4]]]]]]]]]

abstracting: (p7<=p4)
states: 3,977,579,073 (9)
abstracting: (p5<=p7)
states: 3,977,579,073 (9)
abstracting: (p3<=p8)
states: 3,989,341,473 (9)
.
EG iterations: 1
abstracting: (p3<=126)
states: 7,889,602,331 (9)
abstracting: (105<=p6)
states: 7,773,881,010 (9)
abstracting: (p3<=p1)
states: 4,593,289,025 (9)
abstracting: (p3<=p8)
states: 3,989,341,473 (9)
.
EG iterations: 1
abstracting: (p3<=126)
states: 7,889,602,331 (9)
abstracting: (p3<=p8)
states: 3,989,341,473 (9)
.
EG iterations: 1
abstracting: (p3<=126)
states: 7,889,602,331 (9)

EG iterations: 0
abstracting: (11<=p3)
states: 6,125,148,484 (9)
abstracting: (p6<=p8)
states: 129
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.640sec

checking: EF [[[A [EX [0<=0] U ~ [EF [p1<=195]]] & [183<=p5 & AF [~ [p7<=p2]]]] & [AG [[~ [p2<=p3] | ~ [165<=p4]]] & [EX [p7<=p3] & [AG [[~ [11<=p0] | ~ [p6<=221]]] | [EF [~ [p8<=p2]] & AX [~ [p5<=68]]]]]]]]
normalized: E [true U [[[[[~ [EX [p5<=68]] & E [true U ~ [p8<=p2]]] | ~ [E [true U ~ [[~ [p6<=221] | ~ [11<=p0]]]]]] & EX [p7<=p3]] & ~ [E [true U ~ [[~ [165<=p4] | ~ [p2<=p3]]]]]] & [[183<=p5 & ~ [EG [p7<=p2]]] & [~ [EG [E [true U p1<=195]]] & ~ [E [E [true U p1<=195] U [~ [EX [0<=0]] & E [true U p1<=195]]]]]]]]

abstracting: (p1<=195)
states: 7,882,449,393 (9)
abstracting: (0<=0)
states: 7,890,709,281 (9)
.abstracting: (p1<=195)
states: 7,882,449,393 (9)
abstracting: (p1<=195)
states: 7,882,449,393 (9)

EG iterations: 0
abstracting: (p7<=p2)
states: 4,890,891,681 (9)
.
EG iterations: 1
abstracting: (183<=p5)
states: 21,111,090 (7)
abstracting: (p2<=p3)
states: 2,508,847,601 (9)
abstracting: (165<=p4)
states: 61,124,064 (7)
abstracting: (p7<=p3)
states: 3,379,445,121 (9)
.abstracting: (11<=p0)
states: 7,890,709,281 (9)
abstracting: (p6<=221)
states: 4,206,130,656 (9)
abstracting: (p8<=p2)
states: 5,429,771,425 (9)
abstracting: (p5<=68)
states: 5,906,570,085 (9)
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m44.277sec

checking: [EF [[[AG [AF [247<=p4]] | E [p6<=p4 U 240<=p7]] | [229<=p4 | EF [p2<=p5]]]] | ~ [A [[[AF [p1<=26] & EX [p7<=p5]] | [EG [81<=p5] | p7<=223]] U [EF [[p2<=227 & p2<=p3]] | ~ [[p6<=p4 & [p2<=p4 & p5<=62]]]]]]]
normalized: [~ [[~ [EG [~ [[~ [[p6<=p4 & [p2<=p4 & p5<=62]]] | E [true U [p2<=227 & p2<=p3]]]]]] & ~ [E [~ [[~ [[p6<=p4 & [p2<=p4 & p5<=62]]] | E [true U [p2<=227 & p2<=p3]]]] U [~ [[[p7<=223 | EG [81<=p5]] | [EX [p7<=p5] & ~ [EG [~ [p1<=26]]]]]] & ~ [[~ [[p6<=p4 & [p2<=p4 & p5<=62]]] | E [true U [p2<=227 & p2<=p3]]]]]]]]] | E [true U [[229<=p4 | E [true U p2<=p5]] | [E [p6<=p4 U 240<=p7] | ~ [E [true U EG [~ [247<=p4]]]]]]]]

abstracting: (247<=p4)
states: 2,002 (3)
.
EG iterations: 1
abstracting: (240<=p7)
states: 20,349 (4)
abstracting: (p6<=p4)
states: 257
abstracting: (p2<=p5)
states: 3,070,125,825 (9)
abstracting: (229<=p4)
states: 201,376 (5)
abstracting: (p2<=p3)
states: 2,508,847,601 (9)
abstracting: (p2<=227)
states: 7,890,709,281 (9)
abstracting: (p5<=62)
states: 5,596,861,725 (9)
abstracting: (p2<=p4)
states: 3,070,125,825 (9)
abstracting: (p6<=p4)
states: 257
abstracting: (p1<=26)
states: 2,980,037,385 (9)
.
EG iterations: 1
abstracting: (p7<=p5)
states: 3,977,579,073 (9)
.abstracting: (81<=p5)
states: 1,456,789,776 (9)
.
EG iterations: 1
abstracting: (p7<=223)
states: 7,890,273,384 (9)
abstracting: (p2<=p3)
states: 2,508,847,601 (9)
abstracting: (p2<=227)
states: 7,890,709,281 (9)
abstracting: (p5<=62)
states: 5,596,861,725 (9)
abstracting: (p2<=p4)
states: 3,070,125,825 (9)
abstracting: (p6<=p4)
states: 257
abstracting: (p2<=p3)
states: 2,508,847,601 (9)
abstracting: (p2<=227)
states: 7,890,709,281 (9)
abstracting: (p5<=62)
states: 5,596,861,725 (9)
abstracting: (p2<=p4)
states: 3,070,125,825 (9)
abstracting: (p6<=p4)
states: 257
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0256DC0128-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 3.207sec

totally nodes used: 3431123 (3.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1098729001 13990591 1112719592
used/not used/entry size/cache size: 12006490 55102374 16 1024MB
basic ops cache: hits/miss/sum: 296860890 13489768 310350658
used/not used/entry size/cache size: 9741685 7035531 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 18372922 261250 18634172
used/not used/entry size/cache size: 249728 8138880 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 64252615
1 2565079
2 248713
3 28668
4 8857
5 1285
6 503
7 171
8 146
9 157
>= 10 2670

Total processing time: 3m15.365sec


BK_STOP 1679232249632

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:4488 (561), effective:1152 (144)

initing FirstDep: 0m 0.000sec


iterations count:8 (1), effective:0 (0)

iterations count:552 (69), effective:170 (21)

iterations count:1576 (197), effective:490 (61)

iterations count:1576 (197), effective:490 (61)

iterations count:1576 (197), effective:490 (61)

iterations count:602 (75), effective:198 (24)

iterations count:263 (32), effective:85 (10)

iterations count:8 (1), effective:0 (0)

iterations count:724 (90), effective:179 (22)

iterations count:8 (1), effective:0 (0)

iterations count:1794 (224), effective:488 (61)

iterations count:464 (58), effective:164 (20)

iterations count:672 (84), effective:166 (20)

iterations count:8 (1), effective:0 (0)

iterations count:171 (21), effective:53 (6)

iterations count:2312 (289), effective:768 (96)

iterations count:153 (19), effective:133 (16)

iterations count:1045 (130), effective:260 (32)

iterations count:556 (69), effective:233 (29)

iterations count:191 (23), effective:61 (7)

iterations count:191 (23), effective:61 (7)

iterations count:191 (23), effective:61 (7)

iterations count:4201 (525), effective:1401 (175)

iterations count:603 (75), effective:175 (21)

iterations count:1113 (139), effective:325 (40)

iterations count:48 (6), effective:10 (1)

iterations count:1448 (181), effective:240 (30)

iterations count:1416 (177), effective:384 (48)

iterations count:8 (1), effective:0 (0)

iterations count:1480 (185), effective:384 (48)

iterations count:1480 (185), effective:384 (48)

iterations count:1480 (185), effective:384 (48)

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="SmallOperatingSystem-PT-MT0256DC0128"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is SmallOperatingSystem-PT-MT0256DC0128, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r458-smll-167912649800065"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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