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

About the Execution of Marcie+red for SafeBus-COL-03

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5449.428 17989.00 29480.00 581.00 TFFTTFTTFFTFTFFF 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.r362-smll-167891812400201.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 SafeBus-COL-03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812400201
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.8K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 01:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 01:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 42K 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 SafeBus-COL-03-CTLCardinality-00
FORMULA_NAME SafeBus-COL-03-CTLCardinality-01
FORMULA_NAME SafeBus-COL-03-CTLCardinality-02
FORMULA_NAME SafeBus-COL-03-CTLCardinality-03
FORMULA_NAME SafeBus-COL-03-CTLCardinality-04
FORMULA_NAME SafeBus-COL-03-CTLCardinality-05
FORMULA_NAME SafeBus-COL-03-CTLCardinality-06
FORMULA_NAME SafeBus-COL-03-CTLCardinality-07
FORMULA_NAME SafeBus-COL-03-CTLCardinality-08
FORMULA_NAME SafeBus-COL-03-CTLCardinality-09
FORMULA_NAME SafeBus-COL-03-CTLCardinality-10
FORMULA_NAME SafeBus-COL-03-CTLCardinality-11
FORMULA_NAME SafeBus-COL-03-CTLCardinality-12
FORMULA_NAME SafeBus-COL-03-CTLCardinality-13
FORMULA_NAME SafeBus-COL-03-CTLCardinality-14
FORMULA_NAME SafeBus-COL-03-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679010139322

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=SafeBus-COL-03
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-16 23:42:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-16 23:42:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 23:42:22] [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 23:42:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-16 23:42:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1098 ms
[2023-03-16 23:42:24] [INFO ] Detected 1 constant HL places corresponding to 3 PT places.
[2023-03-16 23:42:24] [INFO ] Imported 20 HL places and 14 HL transitions for a total of 60 PT places and 214.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 45 ms.
[2023-03-16 23:42:24] [INFO ] Built PT skeleton of HLPN with 20 places and 14 transitions 68 arcs in 8 ms.
[2023-03-16 23:42:24] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 3 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
FORMULA SafeBus-COL-03-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 87) seen :23
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 64) 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 64) 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 64) 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 64) 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 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 64) 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 64) 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 64) 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 64) 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 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 64) 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 64) 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 64) 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 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=20 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 64) 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 64) 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 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=25 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 64) 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 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 64) 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 64) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=27 ) properties (out of 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 64) 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 64) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) 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 64) seen :0
Running SMT prover for 64 properties.
// Phase 1: matrix 14 rows 17 cols
[2023-03-16 23:42:26] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-16 23:42:26] [INFO ] [Real]Absence check using 4 positive place invariants in 14 ms returned sat
[2023-03-16 23:42:26] [INFO ] [Real]Absence check using 4 positive and 3 generalized place invariants in 12 ms returned sat
[2023-03-16 23:42:26] [INFO ] After 496ms SMT Verify possible using all constraints in real domain returned unsat :29 sat :0 real:35
[2023-03-16 23:42:26] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-16 23:42:26] [INFO ] [Nat]Absence check using 4 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-16 23:42:26] [INFO ] After 192ms SMT Verify possible using all constraints in natural domain returned unsat :64 sat :0
Fused 64 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 64 atomic propositions for a total of 15 simplifications.
FORMULA SafeBus-COL-03-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 23:42:26] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-16 23:42:26] [INFO ] Flatten gal took : 34 ms
[2023-03-16 23:42:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA SafeBus-COL-03-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SafeBus-COL-03-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-16 23:42:27] [INFO ] Flatten gal took : 10 ms
Domain [It(3), It(3)] of place AMC breaks symmetries in sort It
[2023-03-16 23:42:27] [INFO ] Unfolded HLPN to a Petri net with 60 places and 97 transitions 556 arcs in 25 ms.
[2023-03-16 23:42:27] [INFO ] Unfolded 5 HLPN properties in 1 ms.
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 6 transitions.
Support contains 45 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 91/91 transitions.
Applied a total of 0 rules in 11 ms. Remains 54 /54 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2023-03-16 23:42:27] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
// Phase 1: matrix 68 rows 54 cols
[2023-03-16 23:42:27] [INFO ] Computed 17 place invariants in 12 ms
[2023-03-16 23:42:27] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-16 23:42:27] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2023-03-16 23:42:27] [INFO ] Invariant cache hit.
[2023-03-16 23:42:27] [INFO ] State equation strengthened by 13 read => feed constraints.
[2023-03-16 23:42:27] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
[2023-03-16 23:42:27] [INFO ] Flow matrix only has 68 transitions (discarded 23 similar events)
[2023-03-16 23:42:27] [INFO ] Invariant cache hit.
[2023-03-16 23:42:27] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 9 transitions.
Found 9 dead transitions using SMT.
Drop transitions removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 54/54 places, 82/91 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 418 ms. Remains : 54/54 places, 82/91 transitions.
Support contains 45 out of 54 places after structural reductions.
[2023-03-16 23:42:27] [INFO ] Flatten gal took : 27 ms
[2023-03-16 23:42:27] [INFO ] Flatten gal took : 26 ms
[2023-03-16 23:42:27] [INFO ] Input system was already deterministic with 82 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 768 ms. (steps per millisecond=13 ) properties (out of 31) seen :12
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-16 23:42:28] [INFO ] Flow matrix only has 68 transitions (discarded 14 similar events)
[2023-03-16 23:42:28] [INFO ] Invariant cache hit.
[2023-03-16 23:42:28] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-16 23:42:28] [INFO ] [Real]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-16 23:42:28] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :17 sat :0 real:2
[2023-03-16 23:42:28] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-16 23:42:28] [INFO ] [Nat]Absence check using 7 positive and 10 generalized place invariants in 6 ms returned sat
[2023-03-16 23:42:28] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :19 sat :0
Fused 19 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 19 atomic propositions for a total of 5 simplifications.
[2023-03-16 23:42:28] [INFO ] Flatten gal took : 21 ms
[2023-03-16 23:42:28] [INFO ] Flatten gal took : 21 ms
[2023-03-16 23:42:29] [INFO ] Input system was already deterministic with 82 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 54/54 places, 82/82 transitions.
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 15 ms
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 15 ms
[2023-03-16 23:42:29] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 54/54 places, 82/82 transitions.
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 14 ms
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 16 ms
[2023-03-16 23:42:29] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 54/54 places, 82/82 transitions.
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 12 ms
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 14 ms
[2023-03-16 23:42:29] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 54/54 places, 82/82 transitions.
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 13 ms
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 15 ms
[2023-03-16 23:42:29] [INFO ] Input system was already deterministic with 82 transitions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 82/82 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 82/82 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 54/54 places, 82/82 transitions.
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 13 ms
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 14 ms
[2023-03-16 23:42:29] [INFO ] Input system was already deterministic with 82 transitions.
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 14 ms
[2023-03-16 23:42:29] [INFO ] Flatten gal took : 10 ms
[2023-03-16 23:42:29] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-16 23:42:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 54 places, 82 transitions and 457 arcs took 2 ms.
Total runtime 6618 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: 54 NrTr: 82 NrArc: 457)

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

net check time: 0m 0.000sec

init dd package: 0m 3.501sec


RS generation: 0m 0.258sec


-> reachability set: #nodes 4733 (4.7e+03) #states 4,650 (3)



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

checking: AG [AX [~ [sum(p36, p35, p34)<=1]]]
normalized: ~ [E [true U EX [sum(p36, p35, p34)<=1]]]

abstracting: (sum(p36, p35, p34)<=1)
states: 4,470 (3)
.-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.147sec

checking: [EG [AX [0<=0]] & EG [sum(p43, p42, p41)<=p45]]
normalized: [EG [sum(p43, p42, p41)<=p45] & EG [~ [EX [~ [0<=0]]]]]

abstracting: (0<=0)
states: 4,650 (3)
.
EG iterations: 0
abstracting: (sum(p43, p42, p41)<=p45)
states: 4,182 (3)
..........
EG iterations: 10
-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.199sec

checking: AF [EG [EX [~ [p6<=sum(p9, p8, p7)]]]]
normalized: ~ [EG [~ [EG [EX [~ [p6<=sum(p9, p8, p7)]]]]]]

abstracting: (p6<=sum(p9, p8, p7))
states: 3,960 (3)
.......
EG iterations: 6

EG iterations: 0
-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.093sec

checking: E [EG [[AF [[sum(p36, p35, p34)<=sum(p9, p8, p7) | sum(p9, p8, p7)<=sum(p53, p52, p51)]] | AF [~ [sum(p27, p26, p25, p24, p23, p22)<=sum(p12, p11, p10)]]]] U EX [0<=0]]
normalized: E [EG [[~ [EG [sum(p27, p26, p25, p24, p23, p22)<=sum(p12, p11, p10)]] | ~ [EG [~ [[sum(p36, p35, p34)<=sum(p9, p8, p7) | sum(p9, p8, p7)<=sum(p53, p52, p51)]]]]]] U EX [0<=0]]

abstracting: (0<=0)
states: 4,650 (3)
.abstracting: (sum(p9, p8, p7)<=sum(p53, p52, p51))
states: 2,022 (3)
abstracting: (sum(p36, p35, p34)<=sum(p9, p8, p7))
states: 4,236 (3)
.....
EG iterations: 5
abstracting: (sum(p27, p26, p25, p24, p23, p22)<=sum(p12, p11, p10))
states: 2,310 (3)
............
EG iterations: 12

EG iterations: 0
-> the formula is TRUE

FORMULA SafeBus-COL-03-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.234sec

checking: E [[AX [1<=0] & [sum(p49, p48, p47)<=sum(p40, p39, p38) & ~ [98<=p37]]] U [~ [A [p46<=sum(p30, p29, p28) U sum(p9, p8, p7)<=sum(p40, p39, p38)]] & ~ [EF [sum(p21, p20, p19, p18, p17, p16, p15, p14, p13)<=sum(p12, p11, p10)]]]]
normalized: E [[[sum(p49, p48, p47)<=sum(p40, p39, p38) & ~ [98<=p37]] & ~ [EX [~ [1<=0]]]] U [~ [E [true U sum(p21, p20, p19, p18, p17, p16, p15, p14, p13)<=sum(p12, p11, p10)]] & ~ [[~ [EG [~ [sum(p9, p8, p7)<=sum(p40, p39, p38)]]] & ~ [E [~ [sum(p9, p8, p7)<=sum(p40, p39, p38)] U [~ [p46<=sum(p30, p29, p28)] & ~ [sum(p9, p8, p7)<=sum(p40, p39, p38)]]]]]]]]

abstracting: (sum(p9, p8, p7)<=sum(p40, p39, p38))
states: 1,158 (3)
abstracting: (p46<=sum(p30, p29, p28))
states: 4,026 (3)
abstracting: (sum(p9, p8, p7)<=sum(p40, p39, p38))
states: 1,158 (3)
abstracting: (sum(p9, p8, p7)<=sum(p40, p39, p38))
states: 1,158 (3)
.....................
EG iterations: 21
abstracting: (sum(p21, p20, p19, p18, p17, p16, p15, p14, p13)<=sum(p12, p11, p10))
states: 2,670 (3)
abstracting: (1<=0)
states: 0
.abstracting: (98<=p37)
states: 0
abstracting: (sum(p49, p48, p47)<=sum(p40, p39, p38))
states: 3,192 (3)
-> the formula is FALSE

FORMULA SafeBus-COL-03-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.635sec

totally nodes used: 361108 (3.6e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 522287 2887971 3410258
used/not used/entry size/cache size: 3149427 63959437 16 1024MB
basic ops cache: hits/miss/sum: 48498 215527 264025
used/not used/entry size/cache size: 414660 16362556 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 4910 4910
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 3037 16868 19905
used/not used/entry size/cache size: 16857 8371751 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 66785829
1 290323
2 27936
3 4251
4 470
5 50
6 5
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.681sec


BK_STOP 1679010157311

--------------------
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:14583 (177), effective:640 (7)

initing FirstDep: 0m 0.000sec


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

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

iterations count:1987 (24), effective:40 (0)

iterations count:3987 (48), effective:106 (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="SafeBus-COL-03"
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 SafeBus-COL-03, 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 r362-smll-167891812400201"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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