About the Execution of Marcie+red for GlobalResAllocation-COL-05
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5447.768 | 26962.00 | 38484.00 | 593.20 | TFFTTTFFTTTFTTTT | 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.r202-smll-167840348300169.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 GlobalResAllocation-COL-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r202-smll-167840348300169
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.3K Feb 25 19:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 19:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 18:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 18:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 00:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Feb 26 00:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 23:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 23:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 28K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-00
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-01
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-02
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-03
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-04
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-05
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-06
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-07
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-08
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-09
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-10
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-11
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-12
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-13
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-14
FORMULA_NAME GlobalResAllocation-COL-05-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678638981779
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=GlobalResAllocation-COL-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:36:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:36:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:36:25] [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-12 16:36:26] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 16:36:26] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 996 ms
[2023-03-12 16:36:26] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 75 PT places and 56105.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
FORMULA GlobalResAllocation-COL-05-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:36:26] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 7 ms.
[2023-03-12 16:36:26] [INFO ] Skeletonized 15 HLPN properties in 4 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10003 steps, including 2 resets, run finished after 738 ms. (steps per millisecond=13 ) properties (out of 55) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 38) 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 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) 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 38) 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 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) 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 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 38) 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 38) 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 38) 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 38) 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 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) 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 38) 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 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) 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 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 38) seen :0
Running SMT prover for 38 properties.
Normalized transition count is 6 out of 7 initially.
// Phase 1: matrix 6 rows 5 cols
[2023-03-12 16:36:28] [INFO ] Computed 3 place invariants in 6 ms
[2023-03-12 16:36:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 16:36:28] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 16:36:28] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :36 sat :0 real:2
[2023-03-12 16:36:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-12 16:36:28] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-12 16:36:28] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :38 sat :0
Fused 38 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 38 atomic propositions for a total of 15 simplifications.
FORMULA GlobalResAllocation-COL-05-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:36:28] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-12 16:36:28] [INFO ] Flatten gal took : 19 ms
FORMULA GlobalResAllocation-COL-05-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:36:28] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 10
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2023-03-12 16:36:28] [INFO ] Unfolded HLPN to a Petri net with 21 places and 35 transitions 145 arcs in 13 ms.
[2023-03-12 16:36:28] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 35/35 transitions.
Reduce isomorphic (modulo) transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 30
Applied a total of 10 rules in 20 ms. Remains 21 /21 variables (removed 0) and now considering 30/35 (removed 5) transitions.
// Phase 1: matrix 30 rows 21 cols
[2023-03-12 16:36:28] [INFO ] Computed 11 place invariants in 7 ms
[2023-03-12 16:36:28] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
[2023-03-12 16:36:28] [INFO ] Invariant cache hit.
[2023-03-12 16:36:28] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 16:36:28] [INFO ] Invariant cache hit.
[2023-03-12 16:36:28] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-12 16:36:28] [INFO ] Invariant cache hit.
[2023-03-12 16:36:28] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/21 places, 30/35 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 295 ms. Remains : 21/21 places, 30/35 transitions.
Support contains 21 out of 21 places after structural reductions.
[2023-03-12 16:36:28] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:36:28] [INFO ] Flatten gal took : 13 ms
[2023-03-12 16:36:29] [INFO ] Input system was already deterministic with 30 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 563 ms. (steps per millisecond=17 ) properties (out of 34) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Running SMT prover for 22 properties.
[2023-03-12 16:36:29] [INFO ] Invariant cache hit.
[2023-03-12 16:36:29] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 16:36:29] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 2 ms returned sat
[2023-03-12 16:36:29] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :21 sat :0 real:1
[2023-03-12 16:36:30] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 16:36:30] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2023-03-12 16:36:30] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :22 sat :0
Fused 22 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 22 atomic propositions for a total of 11 simplifications.
FORMULA GlobalResAllocation-COL-05-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2023-03-12 16:36:30] [INFO ] Invariant cache hit.
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 21/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2023-03-12 16:36:30] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 16/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 5 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Applied a total of 0 rules in 6 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
[2023-03-12 16:36:30] [INFO ] Invariant cache hit.
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 16/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
[2023-03-12 16:36:30] [INFO ] Invariant cache hit.
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 16/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 1 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
[2023-03-12 16:36:30] [INFO ] Invariant cache hit.
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65 ms. Remains : 16/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 1 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
[2023-03-12 16:36:30] [INFO ] Invariant cache hit.
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 16/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Applied a total of 0 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
[2023-03-12 16:36:30] [INFO ] Invariant cache hit.
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 69 ms. Remains : 16/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2023-03-12 16:36:30] [INFO ] Computed 11 place invariants in 2 ms
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 21/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Applied a total of 0 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2023-03-12 16:36:30] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 16/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Applied a total of 0 rules in 2 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
[2023-03-12 16:36:30] [INFO ] Invariant cache hit.
[2023-03-12 16:36:30] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 16/21 places, 30/30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:36:30] [INFO ] Input system was already deterministic with 30 transitions.
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:36:30] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:36:30] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-12 16:36:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 21 places, 30 transitions and 125 arcs took 1 ms.
Total runtime 5355 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: 21 NrTr: 30 NrArc: 125)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.651sec
RS generation: 0m 0.005sec
-> reachability set: #nodes 411 (4.1e+02) #states 5,754 (3)
starting MCC model checker
--------------------------
checking: AX [EX [0<=0]]
normalized: ~ [EX [~ [EX [0<=0]]]]
abstracting: (0<=0)
states: 5,754 (3)
..-> the formula is TRUE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
checking: EX [EX [0<=0]]
normalized: EX [EX [0<=0]]
abstracting: (0<=0)
states: 5,754 (3)
..-> the formula is TRUE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [EG [EF [p5<=6]]]
normalized: EG [EG [E [true U p5<=6]]]
abstracting: (p5<=6)
states: 5,202 (3)
EG iterations: 0
EG iterations: 0
-> the formula is TRUE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EG [EF [~ [p5<=sum(p4, p3, p2, p1, p0)]]]
normalized: EG [E [true U ~ [p5<=sum(p4, p3, p2, p1, p0)]]]
abstracting: (p5<=sum(p4, p3, p2, p1, p0))
states: 1,461 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: AG [E [p5<=9 U sum(p15, p14, p13, p12, p11)<=p5]]
normalized: ~ [E [true U ~ [E [p5<=9 U sum(p15, p14, p13, p12, p11)<=p5]]]]
abstracting: (sum(p15, p14, p13, p12, p11)<=p5)
states: 1,603 (3)
abstracting: (p5<=9)
states: 5,722 (3)
-> the formula is TRUE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: A [p5<=sum(p10, p9, p8, p7, p6) U ~ [EG [sum(p10, p9, p8, p7, p6)<=6]]]
normalized: [~ [EG [EG [sum(p10, p9, p8, p7, p6)<=6]]] & ~ [E [EG [sum(p10, p9, p8, p7, p6)<=6] U [EG [sum(p10, p9, p8, p7, p6)<=6] & ~ [p5<=sum(p10, p9, p8, p7, p6)]]]]]
abstracting: (p5<=sum(p10, p9, p8, p7, p6))
states: 4,752 (3)
abstracting: (sum(p10, p9, p8, p7, p6)<=6)
states: 2,348 (3)
.
EG iterations: 1
abstracting: (sum(p10, p9, p8, p7, p6)<=6)
states: 2,348 (3)
.
EG iterations: 1
abstracting: (sum(p10, p9, p8, p7, p6)<=6)
states: 2,348 (3)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.102sec
checking: AX [EX [[p5<=sum(p4, p3, p2, p1, p0) | AF [~ [13<=sum(p20, p19, p18, p17, p16)]]]]]
normalized: ~ [EX [~ [EX [[p5<=sum(p4, p3, p2, p1, p0) | ~ [EG [13<=sum(p20, p19, p18, p17, p16)]]]]]]]
abstracting: (13<=sum(p20, p19, p18, p17, p16))
states: 862
.
EG iterations: 1
abstracting: (p5<=sum(p4, p3, p2, p1, p0))
states: 1,461 (3)
..-> the formula is TRUE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.046sec
checking: EF [AG [[EX [[sum(p10, p9, p8, p7, p6)<=5 | sum(p20, p19, p18, p17, p16)<=sum(p15, p14, p13, p12, p11)]] & AX [EX [0<=0]]]]]
normalized: E [true U ~ [E [true U ~ [[EX [[sum(p10, p9, p8, p7, p6)<=5 | sum(p20, p19, p18, p17, p16)<=sum(p15, p14, p13, p12, p11)]] & ~ [EX [~ [EX [0<=0]]]]]]]]]
abstracting: (0<=0)
states: 5,754 (3)
..abstracting: (sum(p20, p19, p18, p17, p16)<=sum(p15, p14, p13, p12, p11))
states: 2,392 (3)
abstracting: (sum(p10, p9, p8, p7, p6)<=5)
states: 1,603 (3)
.-> the formula is FALSE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 7.663sec
checking: ~ [A [AX [sum(p15, p14, p13, p12, p11)<=sum(p20, p19, p18, p17, p16)] U EG [AF [[AX [p5<=sum(p4, p3, p2, p1, p0)] | ~ [p5<=sum(p10, p9, p8, p7, p6)]]]]]]
normalized: ~ [[~ [EG [~ [EG [~ [EG [~ [[~ [p5<=sum(p10, p9, p8, p7, p6)] | ~ [EX [~ [p5<=sum(p4, p3, p2, p1, p0)]]]]]]]]]]] & ~ [E [~ [EG [~ [EG [~ [[~ [p5<=sum(p10, p9, p8, p7, p6)] | ~ [EX [~ [p5<=sum(p4, p3, p2, p1, p0)]]]]]]]]] U [EX [~ [sum(p15, p14, p13, p12, p11)<=sum(p20, p19, p18, p17, p16)]] & ~ [EG [~ [EG [~ [[~ [p5<=sum(p10, p9, p8, p7, p6)] | ~ [EX [~ [p5<=sum(p4, p3, p2, p1, p0)]]]]]]]]]]]]]]
abstracting: (p5<=sum(p4, p3, p2, p1, p0))
states: 1,461 (3)
.abstracting: (p5<=sum(p10, p9, p8, p7, p6))
states: 4,752 (3)
..
EG iterations: 2
.....
EG iterations: 5
abstracting: (sum(p15, p14, p13, p12, p11)<=sum(p20, p19, p18, p17, p16))
states: 4,414 (3)
.abstracting: (p5<=sum(p4, p3, p2, p1, p0))
states: 1,461 (3)
.abstracting: (p5<=sum(p10, p9, p8, p7, p6))
states: 4,752 (3)
..
EG iterations: 2
.....
EG iterations: 5
abstracting: (p5<=sum(p4, p3, p2, p1, p0))
states: 1,461 (3)
.abstracting: (p5<=sum(p10, p9, p8, p7, p6))
states: 4,752 (3)
..
EG iterations: 2
.....
EG iterations: 5
.
EG iterations: 1
-> the formula is FALSE
FORMULA GlobalResAllocation-COL-05-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.021sec
totally nodes used: 50850 (5.1e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 81420 213109 294529
used/not used/entry size/cache size: 256923 66851941 16 1024MB
basic ops cache: hits/miss/sum: 18223 42254 60477
used/not used/entry size/cache size: 78989 16698227 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 4900674 4900674
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 1165 3086 4251
used/not used/entry size/cache size: 3086 8385522 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 67061218
1 45610
2 1627
3 200
4 57
5 56
6 26
7 16
8 15
9 4
>= 10 35
Total processing time: 0m16.804sec
BK_STOP 1678639008741
--------------------
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:439 (14), effective:35 (1)
initing FirstDep: 0m 0.000sec
iterations count:66 (2), effective:11 (0)
iterations count:99 (3), effective:9 (0)
iterations count:224 (7), effective:15 (0)
iterations count:138 (4), effective:8 (0)
iterations count:566 (18), effective:63 (2)
iterations count:325 (10), effective:41 (1)
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="GlobalResAllocation-COL-05"
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 GlobalResAllocation-COL-05, 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 r202-smll-167840348300169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-05.tgz
mv GlobalResAllocation-COL-05 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 '
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 ;