About the Execution of Marcie+red for Referendum-COL-0100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.523 | 7930.00 | 10654.00 | 289.00 | FTTTFTFFTTTTFFFT | 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.r330-tall-167889203300434.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 Referendum-COL-0100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r330-tall-167889203300434
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Feb 26 17:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 17:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 17:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 26 17:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 105K Feb 26 17:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 6.7K 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 Referendum-COL-0100-CTLFireability-00
FORMULA_NAME Referendum-COL-0100-CTLFireability-01
FORMULA_NAME Referendum-COL-0100-CTLFireability-02
FORMULA_NAME Referendum-COL-0100-CTLFireability-03
FORMULA_NAME Referendum-COL-0100-CTLFireability-04
FORMULA_NAME Referendum-COL-0100-CTLFireability-05
FORMULA_NAME Referendum-COL-0100-CTLFireability-06
FORMULA_NAME Referendum-COL-0100-CTLFireability-07
FORMULA_NAME Referendum-COL-0100-CTLFireability-08
FORMULA_NAME Referendum-COL-0100-CTLFireability-09
FORMULA_NAME Referendum-COL-0100-CTLFireability-10
FORMULA_NAME Referendum-COL-0100-CTLFireability-11
FORMULA_NAME Referendum-COL-0100-CTLFireability-12
FORMULA_NAME Referendum-COL-0100-CTLFireability-13
FORMULA_NAME Referendum-COL-0100-CTLFireability-14
FORMULA_NAME Referendum-COL-0100-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679161404881
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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-COL-0100
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 17:43:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 17:43:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 17:43:26] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-18 17:43:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 17:43:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 369 ms
[2023-03-18 17:43:26] [INFO ] Imported 4 HL places and 3 HL transitions for a total of 301 PT places and 201.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
[2023-03-18 17:43:26] [INFO ] Built PT skeleton of HLPN with 4 places and 3 transitions 6 arcs in 3 ms.
[2023-03-18 17:43:26] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 9 formulas.
FORMULA Referendum-COL-0100-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-COL-0100-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Incomplete random walk after 10093 steps, including 97 resets, run finished after 19 ms. (steps per millisecond=531 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 4 cols
[2023-03-18 17:43:26] [INFO ] Computed 1 place invariants in 5 ms
[2023-03-18 17:43:27] [INFO ] After 307ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 4 simplifications.
[2023-03-18 17:43:27] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 11 ms
FORMULA Referendum-COL-0100-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Voters
Arc [0:1*[0]] contains constants of sort Voters
Arc [0:1*[1]] contains constants of sort Voters
Arc [0:1*[2]] contains constants of sort Voters
Arc [0:1*[3]] contains constants of sort Voters
Arc [0:1*[4]] contains constants of sort Voters
Arc [0:1*[5]] contains constants of sort Voters
Arc [0:1*[6]] contains constants of sort Voters
Arc [0:1*[7]] contains constants of sort Voters
Arc [0:1*[8]] contains constants of sort Voters
Arc [0:1*[9]] contains constants of sort Voters
Arc [0:1*[10]] contains constants of sort Voters
Arc [0:1*[11]] contains constants of sort Voters
Arc [0:1*[12]] contains constants of sort Voters
Arc [0:1*[13]] contains constants of sort Voters
Arc [0:1*[14]] contains constants of sort Voters
Arc [0:1*[15]] contains constants of sort Voters
Arc [0:1*[16]] contains constants of sort Voters
Arc [0:1*[17]] contains constants of sort Voters
Arc [0:1*[18]] contains constants of sort Voters
Arc [0:1*[19]] contains constants of sort Voters
Arc [0:1*[20]] contains constants of sort Voters
Arc [0:1*[21]] contains constants of sort Voters
Arc [0:1*[22]] contains constants of sort Voters
Arc [0:1*[23]] contains constants of sort Voters
Arc [0:1*[24]] contains constants of sort Voters
Arc [0:1*[25]] contains constants of sort Voters
Arc [0:1*[26]] contains constants of sort Voters
Arc [0:1*[27]] contains constants of sort Voters
Arc [0:1*[28]] contains constants of sort Voters
Arc [0:1*[29]] contains constants of sort Voters
Arc [0:1*[30]] contains constants of sort Voters
Arc [0:1*[31]] contains constants of sort Voters
Arc [0:1*[32]] contains constants of sort Voters
Arc [0:1*[33]] contains constants of sort Voters
Arc [0:1*[34]] contains constants of sort Voters
Arc [0:1*[35]] contains constants of sort Voters
Arc [0:1*[36]] contains constants of sort Voters
Arc [0:1*[37]] contains constants of sort Voters
Arc [0:1*[38]] contains constants of sort Voters
Arc [0:1*[39]] contains constants of sort Voters
Arc [0:1*[40]] contains constants of sort Voters
Arc [0:1*[41]] contains constants of sort Voters
Arc [0:1*[42]] contains constants of sort Voters
Arc [0:1*[43]] contains constants of sort Voters
Arc [0:1*[44]] contains constants of sort Voters
Arc [0:1*[45]] contains constants of sort Voters
Arc [0:1*[46]] contains constants of sort Voters
Arc [0:1*[47]] contains constants of sort Voters
Arc [0:1*[48]] contains constants of sort Voters
Arc [0:1*[49]] contains constants of sort Voters
Arc [0:1*[50]] contains constants of sort Voters
Arc [0:1*[51]] contains constants of sort Voters
Arc [0:1*[52]] contains constants of sort Voters
Arc [0:1*[53]] contains constants of sort Voters
Arc [0:1*[54]] contains constants of sort Voters
Arc [0:1*[55]] contains constants of sort Voters
Arc [0:1*[56]] contains constants of sort Voters
Arc [0:1*[57]] contains constants of sort Voters
Arc [0:1*[58]] contains constants of sort Voters
Arc [0:1*[59]] contains constants of sort Voters
Arc [0:1*[60]] contains constants of sort Voters
Arc [0:1*[61]] contains constants of sort Voters
Arc [0:1*[62]] contains constants of sort Voters
Arc [0:1*[63]] contains constants of sort Voters
Arc [0:1*[64]] contains constants of sort Voters
Arc [0:1*[65]] contains constants of sort Voters
Arc [0:1*[66]] contains constants of sort Voters
Arc [0:1*[67]] contains constants of sort Voters
Arc [0:1*[68]] contains constants of sort Voters
Arc [0:1*[69]] contains constants of sort Voters
Arc [0:1*[70]] contains constants of sort Voters
Arc [0:1*[71]] contains constants of sort Voters
Arc [0:1*[72]] contains constants of sort Voters
Arc [0:1*[73]] contains constants of sort Voters
Arc [0:1*[74]] contains constants of sort Voters
Arc [0:1*[75]] contains constants of sort Voters
Arc [0:1*[76]] contains constants of sort Voters
Arc [0:1*[77]] contains constants of sort Voters
Arc [0:1*[78]] contains constants of sort Voters
Arc [0:1*[79]] contains constants of sort Voters
Arc [0:1*[80]] contains constants of sort Voters
Arc [0:1*[81]] contains constants of sort Voters
Arc [0:1*[82]] contains constants of sort Voters
Arc [0:1*[83]] contains constants of sort Voters
Arc [0:1*[84]] contains constants of sort Voters
Arc [0:1*[85]] contains constants of sort Voters
Arc [0:1*[86]] contains constants of sort Voters
Arc [0:1*[87]] contains constants of sort Voters
Arc [0:1*[88]] contains constants of sort Voters
Arc [0:1*[89]] contains constants of sort Voters
Arc [0:1*[90]] contains constants of sort Voters
Arc [0:1*[91]] contains constants of sort Voters
Arc [0:1*[92]] contains constants of sort Voters
Arc [0:1*[93]] contains constants of sort Voters
Arc [0:1*[94]] contains constants of sort Voters
Arc [0:1*[95]] contains constants of sort Voters
Arc [0:1*[96]] contains constants of sort Voters
Arc [0:1*[97]] contains constants of sort Voters
Arc [0:1*[98]] contains constants of sort Voters
Arc [0:1*[99]] contains constants of sort Voters
Transition start : constants on arcs in [[0:1*[0]], [0:1*[1]], [0:1*[2]], [0:1*[3]], [0:1*[4]], [0:1*[5]], [0:1*[6]], [0:1*[7]], [0:1*[8]], [0:1*[9]], [0:1*[10]], [0:1*[11]], [0:1*[12]], [0:1*[13]], [0:1*[14]], [0:1*[15]], [0:1*[16]], [0:1*[17]], [0:1*[18]], [0:1*[19]], [0:1*[20]], [0:1*[21]], [0:1*[22]], [0:1*[23]], [0:1*[24]], [0:1*[25]], [0:1*[26]], [0:1*[27]], [0:1*[28]], [0:1*[29]], [0:1*[30]], [0:1*[31]], [0:1*[32]], [0:1*[33]], [0:1*[34]], [0:1*[35]], [0:1*[36]], [0:1*[37]], [0:1*[38]], [0:1*[39]], [0:1*[40]], [0:1*[41]], [0:1*[42]], [0:1*[43]], [0:1*[44]], [0:1*[45]], [0:1*[46]], [0:1*[47]], [0:1*[48]], [0:1*[49]], [0:1*[50]], [0:1*[51]], [0:1*[52]], [0:1*[53]], [0:1*[54]], [0:1*[55]], [0:1*[56]], [0:1*[57]], [0:1*[58]], [0:1*[59]], [0:1*[60]], [0:1*[61]], [0:1*[62]], [0:1*[63]], [0:1*[64]], [0:1*[65]], [0:1*[66]], [0:1*[67]], [0:1*[68]], [0:1*[69]], [0:1*[70]], [0:1*[71]], [0:1*[72]], [0:1*[73]], [0:1*[74]], [0:1*[75]], [0:1*[76]], [0:1*[77]], [0:1*[78]], [0:1*[79]], [0:1*[80]], [0:1*[81]], [0:1*[82]], [0:1*[83]], [0:1*[84]], [0:1*[85]], [0:1*[86]], [0:1*[87]], [0:1*[88]], [0:1*[89]], [0:1*[90]], [0:1*[91]], [0:1*[92]], [0:1*[93]], [0:1*[94]], [0:1*[95]], [0:1*[96]], [0:1*[97]], [0:1*[98]], [0:1*[99]]] introduces in Voters(100) partition with 1 elements that refines current partition to 1 subsets.
Symmetric sort wr.t. initial detected :Voters
Symmetric sort wr.t. initial and guards detected :Voters
Applying symmetric unfolding of full symmetric sort :Voters domain size was 100
[2023-03-18 17:43:27] [INFO ] Unfolded HLPN to a Petri net with 4 places and 3 transitions 6 arcs in 8 ms.
[2023-03-18 17:43:27] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2 transition count 2
Applied a total of 3 rules in 4 ms. Remains 2 /4 variables (removed 2) and now considering 2/3 (removed 1) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-18 17:43:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-18 17:43:27] [INFO ] Implicit Places using invariants in 13 ms returned []
[2023-03-18 17:43:27] [INFO ] Invariant cache hit.
[2023-03-18 17:43:27] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2023-03-18 17:43:27] [INFO ] Invariant cache hit.
[2023-03-18 17:43:27] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2/4 places, 2/3 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 2/4 places, 2/3 transitions.
Support contains 2 out of 2 places after structural reductions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 4 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 2 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Incomplete random walk after 10093 steps, including 97 resets, run finished after 20 ms. (steps per millisecond=504 ) properties (out of 9) seen :4
Incomplete Best-First random walk after 10093 steps, including 97 resets, run finished after 24 ms. (steps per millisecond=420 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10093 steps, including 97 resets, run finished after 16 ms. (steps per millisecond=630 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10093 steps, including 97 resets, run finished after 15 ms. (steps per millisecond=672 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10093 steps, including 97 resets, run finished after 14 ms. (steps per millisecond=720 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10093 steps, including 97 resets, run finished after 13 ms. (steps per millisecond=776 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-18 17:43:27] [INFO ] Invariant cache hit.
[2023-03-18 17:43:27] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 3 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2/2 places, 2/2 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 2/2 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 2/2 places, 2/2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 0 ms
[2023-03-18 17:43:27] [INFO ] Input system was already deterministic with 2 transitions.
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Flatten gal took : 1 ms
[2023-03-18 17:43:27] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-18 17:43:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2 places, 2 transitions and 3 arcs took 0 ms.
Total runtime 1329 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=CTLFireability.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 2 NrTr: 2 NrArc: 3)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.692sec
RS generation: 0m 0.000sec
-> reachability set: #nodes 3 (3.0e+00) #states 102
starting MCC model checker
--------------------------
checking: AF [EX [1<=p1]]
normalized: ~ [EG [~ [EX [1<=p1]]]]
abstracting: (1<=p1)
states: 1
.
EG iterations: 0
-> the formula is FALSE
FORMULA Referendum-COL-0100-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [~ [E [EF [1<=p0] U 1<=p0]]]
normalized: ~ [EG [E [E [true U 1<=p0] U 1<=p0]]]
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
......................................................................................................
EG iterations: 102
-> the formula is TRUE
FORMULA Referendum-COL-0100-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [E [p0<=0 U EG [1<=p1]]]]
normalized: ~ [E [true U E [p0<=0 U EG [1<=p1]]]]
abstracting: (1<=p1)
states: 1
..
EG iterations: 2
abstracting: (p0<=0)
states: 2
-> the formula is TRUE
FORMULA Referendum-COL-0100-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [[1<=p0 & AF [EF [p0<=0]]]]
normalized: ~ [EG [~ [[~ [EG [~ [E [true U p0<=0]]]] & 1<=p0]]]]
abstracting: (1<=p0)
states: 100
abstracting: (p0<=0)
states: 2
.
EG iterations: 1
..
EG iterations: 2
-> the formula is TRUE
FORMULA Referendum-COL-0100-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [~ [E [EG [~ [EF [1<=p0]]] U AG [A [1<=p0 U 1<=p0]]]]]
normalized: ~ [E [true U E [EG [~ [E [true U 1<=p0]]] U ~ [E [true U ~ [[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p0] & ~ [1<=p0]]]]]]]]]]]
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
abstracting: (1<=p0)
states: 100
.
EG iterations: 1
-> the formula is TRUE
FORMULA Referendum-COL-0100-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [[p0<=0 | [AF [1<=p0] & EG [1<=p0]]]]
normalized: ~ [E [true U ~ [[[EG [1<=p0] & ~ [EG [~ [1<=p0]]]] | p0<=0]]]]
abstracting: (p0<=0)
states: 2
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
abstracting: (1<=p0)
states: 100
.....................................................................................................
EG iterations: 101
-> the formula is FALSE
FORMULA Referendum-COL-0100-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [[EF [[AX [p0<=0] | AX [p1<=0]]] | AF [[AG [p1<=0] | 1<=p0]]]]
normalized: EG [[E [true U [~ [EX [~ [p1<=0]]] | ~ [EX [~ [p0<=0]]]]] | ~ [EG [~ [[~ [E [true U ~ [p1<=0]]] | 1<=p0]]]]]]
abstracting: (1<=p0)
states: 100
abstracting: (p1<=0)
states: 101
..
EG iterations: 2
abstracting: (p0<=0)
states: 2
.abstracting: (p1<=0)
states: 101
.
EG iterations: 0
-> the formula is TRUE
FORMULA Referendum-COL-0100-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [[AF [1<=p0] & AG [[p0<=0 | ~ [A [1<=p0 U 1<=p0]]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [[~ [[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p0] & ~ [1<=p0]]]]]] | p0<=0]]]] & ~ [EG [~ [1<=p0]]]]]]]
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
abstracting: (p0<=0)
states: 2
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
EG iterations: 0
-> the formula is FALSE
FORMULA Referendum-COL-0100-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [A [p1<=0 U [AX [1<=p0] | [AF [1<=p0] & [AX [1<=p0] | EF [1<=p0]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[[E [true U 1<=p0] | ~ [EX [~ [1<=p0]]]] & ~ [EG [~ [1<=p0]]]] | ~ [EX [~ [1<=p0]]]]]]] & ~ [E [~ [[[[E [true U 1<=p0] | ~ [EX [~ [1<=p0]]]] & ~ [EG [~ [1<=p0]]]] | ~ [EX [~ [1<=p0]]]]] U [~ [[[[E [true U 1<=p0] | ~ [EX [~ [1<=p0]]]] & ~ [EG [~ [1<=p0]]]] | ~ [EX [~ [1<=p0]]]]] & ~ [p1<=0]]]]]]]]
abstracting: (p1<=0)
states: 101
abstracting: (1<=p0)
states: 100
.abstracting: (1<=p0)
states: 100
..
EG iterations: 2
abstracting: (1<=p0)
states: 100
.abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
.abstracting: (1<=p0)
states: 100
..
EG iterations: 2
abstracting: (1<=p0)
states: 100
.abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
.abstracting: (1<=p0)
states: 100
..
EG iterations: 2
abstracting: (1<=p0)
states: 100
.abstracting: (1<=p0)
states: 100
.
EG iterations: 1
-> the formula is TRUE
FORMULA Referendum-COL-0100-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [[EG [p1<=0] | [[AX [1<=0] & 1<=p0] | A [1<=p0 U ~ [[A [1<=p0 U 1<=p1] & 1<=p0]]]]]]
normalized: EX [[[[~ [EG [[[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p0] & ~ [1<=p1]]]]] & 1<=p0]]] & ~ [E [[[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p0] & ~ [1<=p1]]]]] & 1<=p0] U [~ [1<=p0] & [[~ [EG [~ [1<=p1]]] & ~ [E [~ [1<=p1] U [~ [1<=p0] & ~ [1<=p1]]]]] & 1<=p0]]]]] | [~ [EX [~ [1<=0]]] & 1<=p0]] | EG [p1<=0]]]
abstracting: (p1<=0)
states: 101
.
EG iterations: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=0)
states: 0
.abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is TRUE
FORMULA Referendum-COL-0100-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.022sec
checking: [AX [[[EF [p0<=0] & AF [1<=p0]] & [AF [1<=p0] & p1<=0]]] | EX [~ [E [[EG [1<=p0] | p0<=0] U [1<=p0 | EG [1<=p0]]]]]]
normalized: [EX [~ [E [[EG [1<=p0] | p0<=0] U [EG [1<=p0] | 1<=p0]]]] | ~ [EX [~ [[[~ [EG [~ [1<=p0]]] & p1<=0] & [~ [EG [~ [1<=p0]]] & E [true U p0<=0]]]]]]]
abstracting: (p0<=0)
states: 2
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
abstracting: (p1<=0)
states: 101
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
.abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
.....................................................................................................
EG iterations: 101
abstracting: (p0<=0)
states: 2
abstracting: (1<=p0)
states: 100
.....................................................................................................
EG iterations: 101
.-> the formula is TRUE
FORMULA Referendum-COL-0100-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: A [~ [[EX [1<=p1] | EX [[1<=p1 & E [1<=p0 U 1<=p0]]]]] U ~ [[[1<=p0 & EX [AX [1<=p0]]] | A [1<=p1 U 1<=p0]]]]
normalized: [~ [EG [[[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p1] & ~ [1<=p0]]]]] | [EX [~ [EX [~ [1<=p0]]]] & 1<=p0]]]] & ~ [E [[[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p1] & ~ [1<=p0]]]]] | [EX [~ [EX [~ [1<=p0]]]] & 1<=p0]] U [[EX [[E [1<=p0 U 1<=p0] & 1<=p1]] | EX [1<=p1]] & [[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p1] & ~ [1<=p0]]]]] | [EX [~ [EX [~ [1<=p0]]]] & 1<=p0]]]]]]
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
..abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
abstracting: (1<=p1)
states: 1
.abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
.abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
..abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
..abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
......................................................................................................
EG iterations: 102
-> the formula is TRUE
FORMULA Referendum-COL-0100-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [A [p1<=0 U ~ [EG [[[1<=p0 & [1<=p1 & 1<=p1]] | ~ [[1<=p1 | 1<=p0]]]]]] & EX [[[p1<=0 & p0<=0] | [EG [1<=p0] | [~ [A [1<=p0 U 1<=p0]] & 1<=p0]]]]]
normalized: [EX [[[[~ [[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p0] & ~ [1<=p0]]]]]] & 1<=p0] | EG [1<=p0]] | [p1<=0 & p0<=0]]] & [~ [EG [EG [[~ [[1<=p1 | 1<=p0]] | [[1<=p1 & 1<=p1] & 1<=p0]]]]] & ~ [E [EG [[~ [[1<=p1 | 1<=p0]] | [[1<=p1 & 1<=p1] & 1<=p0]]] U [~ [p1<=0] & EG [[~ [[1<=p1 | 1<=p0]] | [[1<=p1 & 1<=p1] & 1<=p0]]]]]]]]
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (p1<=0)
states: 101
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
abstracting: (1<=p1)
states: 1
abstracting: (1<=p0)
states: 100
abstracting: (1<=p1)
states: 1
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p0<=0)
states: 2
abstracting: (p1<=0)
states: 101
abstracting: (1<=p0)
states: 100
.....................................................................................................
EG iterations: 101
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
abstracting: (1<=p0)
states: 100
..
EG iterations: 2
.-> the formula is FALSE
FORMULA Referendum-COL-0100-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
totally nodes used: 722 (7.2e+02)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1407 1586 2993
used/not used/entry size/cache size: 1545 67107319 16 1024MB
basic ops cache: hits/miss/sum: 3177 859 4036
used/not used/entry size/cache size: 1797 16775419 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: 109 8 117
used/not used/entry size/cache size: 8 8388600 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 67108741
1 16
2 103
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 4
Total processing time: 0m 4.228sec
BK_STOP 1679161412811
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -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:203 (101), effective:101 (50)
initing FirstDep: 0m 0.000sec
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:202 (101), effective:100 (50)
iterations count:2 (1), effective:0 (0)
iterations count:202 (101), effective:100 (50)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:2 (1), effective:0 (0)
iterations count:2 (1), effective:0 (0)
iterations count:2 (1), effective:0 (0)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:3 (1), effective:1 (0)
iterations count:202 (101), effective:100 (50)
iterations count:202 (101), effective:100 (50)
iterations count:202 (101), effective:100 (50)
iterations count:202 (101), effective:100 (50)
iterations count:3 (1), effective:1 (0)
iterations count:2 (1), effective:0 (0)
iterations count:2 (1), effective:0 (0)
iterations count:2 (1), effective:0 (0)
iterations count:2 (1), effective:0 (0)
iterations count:2 (1), effective:0 (0)
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="Referendum-COL-0100"
export BK_EXAMINATION="CTLFireability"
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 Referendum-COL-0100, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r330-tall-167889203300434"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Referendum-COL-0100.tgz
mv Referendum-COL-0100 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;