Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813695200001.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BridgeAndVehicles-COL-V04P05N02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695200001
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 25 12:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 15:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 12:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Feb 25 12:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 10 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 37K 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 BridgeAndVehicles-COL-V04P05N02-CTLCardinality-00
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-01
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-02
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-03
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-04
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-05
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-06
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-07
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-08
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-09
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14
FORMULA_NAME BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678688536010

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=BridgeAndVehicles-COL-V04P05N02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:22:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 06:22:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:22:17] [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-13 06:22:17] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-13 06:22:18] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 424 ms
[2023-03-13 06:22:18] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 28 PT places and 346.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
[2023-03-13 06:22:18] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2023-03-13 06:22:18] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 482 ms. (steps per millisecond=20 ) properties (out of 71) seen :21
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) 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 49) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) 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 48) seen :0
Running SMT prover for 48 properties.
// Phase 1: matrix 10 rows 12 cols
[2023-03-13 06:22:19] [INFO ] Computed 4 place invariants in 3 ms
[2023-03-13 06:22:19] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:19] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :38 sat :0 real:10
[2023-03-13 06:22:19] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-13 06:22:19] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :48 sat :0
Fused 48 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 48 atomic propositions for a total of 13 simplifications.
[2023-03-13 06:22:19] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2023-03-13 06:22:19] [INFO ] Flatten gal took : 28 ms
[2023-03-13 06:22:19] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:22:19] [INFO ] Flatten gal took : 4 ms
Arc [1:1*[(MOD (ADD $cA 1) 5)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 5) 5) 5)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 3)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2023-03-13 06:22:19] [INFO ] Unfolded HLPN to a Petri net with 28 places and 52 transitions 326 arcs in 10 ms.
[2023-03-13 06:22:19] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Support contains 14 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 27 transition count 52
Applied a total of 1 rules in 7 ms. Remains 27 /28 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2023-03-13 06:22:19] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2023-03-13 06:22:19] [INFO ] Computed 6 place invariants in 4 ms
[2023-03-13 06:22:19] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2023-03-13 06:22:19] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 06:22:19] [INFO ] Invariant cache hit.
[2023-03-13 06:22:19] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-13 06:22:19] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 06:22:19] [INFO ] Invariant cache hit.
[2023-03-13 06:22:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:19] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2023-03-13 06:22:19] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 06:22:19] [INFO ] Invariant cache hit.
[2023-03-13 06:22:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 27/28 places, 52/52 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 218 ms. Remains : 27/28 places, 52/52 transitions.
Support contains 14 out of 27 places after structural reductions.
[2023-03-13 06:22:19] [INFO ] Flatten gal took : 7 ms
[2023-03-13 06:22:19] [INFO ] Flatten gal took : 7 ms
[2023-03-13 06:22:19] [INFO ] Input system was already deterministic with 52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 185 ms. (steps per millisecond=54 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 139 ms. (steps per millisecond=71 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 110 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 97 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-13 06:22:21] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
[2023-03-13 06:22:21] [INFO ] Invariant cache hit.
[2023-03-13 06:22:21] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:21] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :6 sat :0 real:7
[2023-03-13 06:22:21] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-13 06:22:21] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :12 sat :1
[2023-03-13 06:22:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-13 06:22:21] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :12 sat :1
[2023-03-13 06:22:21] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 06:22:21] [INFO ] After 69ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :1
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 27 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 27/27 places, 52/52 transitions.
Graph (complete) has 145 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 9 ms. Remains 25 /27 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2023-03-13 06:22:21] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-13 06:22:21] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 06:22:22] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 25/27 places, 51/52 transitions.
Incomplete random walk after 10000 steps, including 229 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 2874 states, properties seen :0
Probabilistic random walk after 10034 steps, saw 2874 distinct states, run finished after 42 ms. (steps per millisecond=238 ) properties seen :0
Explored full state space saw : 2874 states, properties seen :0
Exhaustive walk after 10034 steps, saw 2874 distinct states, run finished after 17 ms. (steps per millisecond=590 ) properties seen :0
Successfully simplified 13 atomic propositions for a total of 4 simplifications.
[2023-03-13 06:22:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 6 ms
FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:22:22] [INFO ] Input system was already deterministic with 52 transitions.
Support contains 3 out of 27 places (down from 4) after GAL structural reductions.
Computed a total of 18 stabilizing places and 20 stable transitions
Graph (complete) has 213 edges and 27 vertex of which 26 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2023-03-13 06:22:22] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 27 cols
[2023-03-13 06:22:22] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-13 06:22:22] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 27/27 places, 52/52 transitions.
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:22:22] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Applied a total of 1 rules in 1 ms. Remains 26 /27 variables (removed 1) and now considering 52/52 (removed 0) transitions.
[2023-03-13 06:22:22] [INFO ] Flow matrix only has 34 transitions (discarded 18 similar events)
// Phase 1: matrix 34 rows 26 cols
[2023-03-13 06:22:22] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-13 06:22:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 26/27 places, 52/52 transitions.
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:22:22] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2023-03-13 06:22:22] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 25 cols
[2023-03-13 06:22:22] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-13 06:22:22] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 25/27 places, 51/52 transitions.
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:22:22] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 2 ms. Remains 25 /27 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2023-03-13 06:22:22] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 06:22:22] [INFO ] Invariant cache hit.
[2023-03-13 06:22:22] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 25/27 places, 51/52 transitions.
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:22:22] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 52/52 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 26 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 25 transition count 51
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 25 transition count 51
Applied a total of 3 rules in 1 ms. Remains 25 /27 variables (removed 2) and now considering 51/52 (removed 1) transitions.
[2023-03-13 06:22:22] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2023-03-13 06:22:22] [INFO ] Invariant cache hit.
[2023-03-13 06:22:22] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 25/27 places, 51/52 transitions.
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:22:22] [INFO ] Input system was already deterministic with 51 transitions.
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:22:22] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:22:22] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 06:22:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 52 transitions and 325 arcs took 0 ms.
Total runtime 4902 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: 27 NrTr: 52 NrArc: 325)

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

net check time: 0m 0.000sec

init dd package: 0m 3.299sec


RS generation: 0m 0.016sec


-> reachability set: #nodes 1709 (1.7e+03) #states 2,874 (3)



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

checking: AF [AX [AX [1<=0]]]
normalized: ~ [EG [EX [EX [~ [1<=0]]]]]

abstracting: (1<=0)
states: 0
...........................................................
EG iterations: 57
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.272sec

checking: EX [AX [1<=0]]
normalized: EX [~ [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
..-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AX [1<=0]]
normalized: ~ [EG [EX [~ [1<=0]]]]

abstracting: (1<=0)
states: 0
...........................................................
EG iterations: 58
-> the formula is TRUE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EG [EX [EX [EG [p17<=1]]]]
normalized: EG [EX [EX [EG [p17<=1]]]]

abstracting: (p17<=1)
states: 1,596 (3)
............................................
EG iterations: 44
...
EG iterations: 1
-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: EX [EF [AG [~ [p6<=p8]]]]
normalized: EX [E [true U ~ [E [true U p6<=p8]]]]

abstracting: (p6<=p8)
states: 1,323 (3)
.-> the formula is FALSE

FORMULA BridgeAndVehicles-COL-V04P05N02-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

totally nodes used: 181934 (1.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 180625 685187 865812
used/not used/entry size/cache size: 814233 66294631 16 1024MB
basic ops cache: hits/miss/sum: 19253 64776 84029
used/not used/entry size/cache size: 133044 16644172 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 655 3153 3808
used/not used/entry size/cache size: 3153 8385455 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 66939382
1 160240
2 8014
3 751
4 204
5 35
6 30
7 46
8 27
9 20
>= 10 115

Total processing time: 0m 6.383sec


BK_STOP 1678688549123

--------------------
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:2852 (54), effective:176 (3)

initing FirstDep: 0m 0.000sec


iterations count:87 (1), effective:4 (0)

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BridgeAndVehicles-COL-V04P05N02"
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 BridgeAndVehicles-COL-V04P05N02, 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 r042-tajo-167813695200001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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