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.r138-smll-167819421200585.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 DrinkVendingMachine-COL-16, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r138-smll-167819421200585
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.5K Feb 26 04:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Feb 26 04:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 26 04:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 04:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 26 04:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 170K Feb 26 04:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 04:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 04:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:02 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 25K 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 DrinkVendingMachine-COL-16-CTLCardinality-00
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-01
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-02
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-03
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-04
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-05
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-06
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-07
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-08
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-09
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-10
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-11
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-12
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-13
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-14
FORMULA_NAME DrinkVendingMachine-COL-16-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678993315951

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=DrinkVendingMachine-COL-16
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 19:01:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 19:01:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 19:01:58] [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-16 19:01:58] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 19:01:59] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 685 ms
[2023-03-16 19:01:59] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 192 PT places and 4473952.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 129 ms.
[2023-03-16 19:01:59] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 28 arcs in 14 ms.
[2023-03-16 19:01:59] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 2 formulas.
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 14 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10009 steps, including 2 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 58) seen :24
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Running SMT prover for 34 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-03-16 19:02:00] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-16 19:02:00] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-16 19:02:00] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :33 sat :0 real:1
[2023-03-16 19:02:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-16 19:02:00] [INFO ] After 42ms SMT Verify possible using all constraints in natural domain returned unsat :34 sat :0
Fused 34 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 34 atomic propositions for a total of 14 simplifications.
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 19:02:00] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-16 19:02:00] [INFO ] Flatten gal took : 19 ms
[2023-03-16 19:02:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DrinkVendingMachine-COL-16-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 19:02:00] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Quality
Symmetric sort wr.t. initial detected :Quality
Transition elaborate3 : guard parameter $x(Quality:64) in guard (AND (GT $x 47) (LEQ $x 63))introduces in Quality(64) partition with 2 elements
Transition elaborate2 : guard parameter $x(Quality:64) in guard (AND (GT $x 31) (LEQ $x 47))introduces in Quality(64) partition with 2 elements
Transition elaborate1 : guard parameter $x(Quality:64) in guard (AND (GT $x 15) (LEQ $x 31))introduces in Quality(64) partition with 2 elements
Transition elaborate0 : guard parameter $x(Quality:64) in guard (LEQ $x 15)introduces in Quality(64) partition with 2 elements
Sort wr.t. initial and guards Quality has partition 4
Applying symmetric unfolding of partitioned symmetric sort :Quality domain size was 64 reducing to 4 values.
For transition elaborate3:(AND (GT $x 47) (LEQ $x 63)) -> (EQ $x 3)
For transition elaborate2:(AND (GT $x 31) (LEQ $x 47)) -> (EQ $x 2)
For transition elaborate1:(AND (GT $x 15) (LEQ $x 31)) -> (EQ $x 1)
For transition elaborate0:(LEQ $x 15) -> (EQ $x 0)
Symmetric sort wr.t. initial and guards and successors and join/free detected :Options
Symmetric sort wr.t. initial detected :Options
Symmetric sort wr.t. initial and guards detected :Options
Applying symmetric unfolding of full symmetric sort :Options domain size was 16
Symmetric sort wr.t. initial and guards and successors and join/free detected :Products
Symmetric sort wr.t. initial detected :Products
Symmetric sort wr.t. initial and guards detected :Products
Applying symmetric unfolding of full symmetric sort :Products domain size was 16
[2023-03-16 19:02:00] [INFO ] Unfolded HLPN to a Petri net with 12 places and 10 transitions 34 arcs in 19 ms.
[2023-03-16 19:02:00] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Support contains 12 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 14 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 12 cols
[2023-03-16 19:02:00] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-16 19:02:00] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2023-03-16 19:02:00] [INFO ] Invariant cache hit.
[2023-03-16 19:02:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-16 19:02:00] [INFO ] Invariant cache hit.
[2023-03-16 19:02:00] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
[2023-03-16 19:02:00] [INFO ] Invariant cache hit.
[2023-03-16 19:02:00] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 12/12 places, 10/10 transitions.
Support contains 12 out of 12 places after structural reductions.
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 3 ms
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 4 ms
[2023-03-16 19:02:01] [INFO ] Input system was already deterministic with 10 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=87 ) properties (out of 29) seen :11
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) 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 18) 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 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-16 19:02:01] [INFO ] Invariant cache hit.
[2023-03-16 19:02:01] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 19:02:01] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :14 sat :0 real:4
[2023-03-16 19:02:01] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-16 19:02:01] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :4
[2023-03-16 19:02:01] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :4
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-16 19:02:01] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :4
Fused 18 Parikh solutions to 4 different solutions.
Finished Parikh walk after 169 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Parikh walk visited 4 properties in 11 ms.
Successfully simplified 14 atomic propositions for a total of 6 simplifications.
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 3 ms
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 3 ms
[2023-03-16 19:02:01] [INFO ] Input system was already deterministic with 10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 19:02:01] [INFO ] Invariant cache hit.
[2023-03-16 19:02:01] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 2 ms
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 3 ms
[2023-03-16 19:02:01] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 19:02:01] [INFO ] Invariant cache hit.
[2023-03-16 19:02:01] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 2 ms
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 1 ms
[2023-03-16 19:02:01] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 19:02:01] [INFO ] Invariant cache hit.
[2023-03-16 19:02:01] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 2 ms
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 2 ms
[2023-03-16 19:02:01] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 19:02:01] [INFO ] Invariant cache hit.
[2023-03-16 19:02:01] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 2 ms
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 5 ms
[2023-03-16 19:02:01] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 19:02:01] [INFO ] Invariant cache hit.
[2023-03-16 19:02:01] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 2 ms
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 2 ms
[2023-03-16 19:02:01] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2023-03-16 19:02:01] [INFO ] Invariant cache hit.
[2023-03-16 19:02:01] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 12/12 places, 10/10 transitions.
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 2 ms
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 2 ms
[2023-03-16 19:02:01] [INFO ] Input system was already deterministic with 10 transitions.
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 18 ms
[2023-03-16 19:02:01] [INFO ] Flatten gal took : 1 ms
[2023-03-16 19:02:01] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-16 19:02:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 12 places, 10 transitions and 34 arcs took 0 ms.
Total runtime 3463 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: 12 NrTr: 10 NrArc: 34)

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

net check time: 0m 0.000sec

init dd package: 0m 3.388sec


RS generation: 0m 0.007sec


-> reachability set: #nodes 108 (1.1e+02) #states 24,137,569 (7)



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

checking: [AF [p8<=p9] | EG [EX [EX [AG [p9<=p8]]]]]
normalized: [~ [EG [~ [p8<=p9]]] | EG [EX [EX [~ [E [true U ~ [p9<=p8]]]]]]]

abstracting: (p9<=p8)
states: 12,778,713 (7)
...
EG iterations: 1
abstracting: (p8<=p9)
states: 12,778,713 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-16-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[EX [AG [~ [p10<=p8]]] & AX [EF [~ [sum(p3, p2, p1, p0)<=p10]]]]]
normalized: ~ [E [true U ~ [[EX [~ [E [true U p10<=p8]]] & ~ [EX [~ [E [true U ~ [sum(p3, p2, p1, p0)<=p10]]]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=p10)
states: 345,933 (5)
.abstracting: (p10<=p8)
states: 12,778,713 (7)
.-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-16-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.467sec

checking: EX [AF [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]
normalized: EX [~ [EG [~ [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]]]

abstracting: (sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0))
MC time: 15m 0.017sec

checking: EG [E [AG [A [EX [0<=0] U AF [p11<=sum(p3, p2, p1, p0)]]] U ~ [AG [[AX [p11<=p8] | AX [sum(p3, p2, p1, p0)<=p10]]]]]]
normalized: EG [E [~ [E [true U ~ [[~ [EG [EG [~ [p11<=sum(p3, p2, p1, p0)]]]] & ~ [E [EG [~ [p11<=sum(p3, p2, p1, p0)]] U [~ [EX [0<=0]] & EG [~ [p11<=sum(p3, p2, p1, p0)]]]]]]]]] U E [true U ~ [[~ [EX [~ [p11<=p8]]] | ~ [EX [~ [sum(p3, p2, p1, p0)<=p10]]]]]]]]

abstracting: (sum(p3, p2, p1, p0)<=p10)
states: 345,933 (5)
.abstracting: (p11<=p8)
states: 12,778,713 (7)
.abstracting: (p11<=sum(p3, p2, p1, p0))
states: 23,874,001 (7)
.
EG iterations: 1
abstracting: (0<=0)
states: 24,137,569 (7)
.abstracting: (p11<=sum(p3, p2, p1, p0))
states: 23,874,001 (7)
.
EG iterations: 1
abstracting: (p11<=sum(p3, p2, p1, p0))
states: 23,874,001 (7)
.
EG iterations: 1
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA DrinkVendingMachine-COL-16-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.558sec

checking: AF [[10<=sum(p3, p2, p1, p0) | EX [[EX [58<=sum(p3, p2, p1, p0)] | [57<=sum(p3, p2, p1, p0) | 32<=p8]]]]]
normalized: ~ [EG [~ [[10<=sum(p3, p2, p1, p0) | EX [[[57<=sum(p3, p2, p1, p0) | 32<=p8] | EX [58<=sum(p3, p2, p1, p0)]]]]]]]

abstracting: (58<=sum(p3, p2, p1, p0))
states: 60,690 (4)
.abstracting: (32<=p8)
states: 0
abstracting: (57<=sum(p3, p2, p1, p0))
states: 95,370 (4)
.abstracting: (10<=sum(p3, p2, p1, p0))
states: 23,930,934 (7)
.
EG iterations: 1
-> the formula is FALSE

FORMULA DrinkVendingMachine-COL-16-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.184sec

checking: AX [~ [E [sum(p3, p2, p1, p0)<=19 U [A [p10<=p8 U p9<=sum(p7, p6, p5, p4)] & AX [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]]]]
normalized: ~ [EX [E [sum(p3, p2, p1, p0)<=19 U [~ [EX [~ [sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0)]]] & [~ [EG [~ [p9<=sum(p7, p6, p5, p4)]]] & ~ [E [~ [p9<=sum(p7, p6, p5, p4)] U [~ [p9<=sum(p7, p6, p5, p4)] & ~ [p10<=p8]]]]]]]]]

abstracting: (p10<=p8)
states: 12,778,713 (7)
abstracting: (p9<=sum(p7, p6, p5, p4))
states: 23,874,001 (7)
abstracting: (p9<=sum(p7, p6, p5, p4))
states: 23,874,001 (7)
abstracting: (p9<=sum(p7, p6, p5, p4))
states: 23,874,001 (7)
..................
EG iterations: 18
abstracting: (sum(p7, p6, p5, p4)<=sum(p3, p2, p1, p0))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10690876 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095096 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:682 (68), effective:256 (25)

initing FirstDep: 0m 0.000sec


iterations count:37 (3), effective:18 (1)

iterations count:80 (8), effective:34 (3)

iterations count:42 (4), effective:16 (1)

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

idd.h:1025: Timeout: after 899 sec


iterations count:85 (8), effective:46 (4)

iterations count:188 (18), effective:97 (9)

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

iterations count:88 (8), effective:45 (4)

idd.h:1025: Timeout: after 1348 sec

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="DrinkVendingMachine-COL-16"
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 DrinkVendingMachine-COL-16, 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 r138-smll-167819421200585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DrinkVendingMachine-COL-16.tgz
mv DrinkVendingMachine-COL-16 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 ;