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.r522-tall-167987247200313.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 Murphy-COL-D4N025, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247200313
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 23 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 23 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.0K Mar 23 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Mar 23 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Mar 23 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K Mar 23 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 20K Mar 31 16:48 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 Murphy-COL-D4N025-CTLCardinality-00
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-01
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-02
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-03
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-04
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-05
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-06
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-07
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-08
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-09
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-10
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-11
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-12
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-13
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-14
FORMULA_NAME Murphy-COL-D4N025-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680890991805

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=Murphy-COL-D4N025
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:09:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:09:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:09:53] [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-04-07 18:09:53] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-07 18:09:53] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 397 ms
[2023-04-07 18:09:53] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
[2023-04-07 18:09:53] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 3 ms.
[2023-04-07 18:09:53] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 7 formulas.
FORMULA Murphy-COL-D4N025-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Murphy-COL-D4N025-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 9 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10053 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=141 ) properties (out of 41) seen :26
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 15) 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 14) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 11) 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 11) 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 11) 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 11) 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 11) 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 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 10) 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 10) 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 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 7 rows 6 cols
[2023-04-07 18:09:53] [INFO ] Computed 2 invariants in 5 ms
[2023-04-07 18:09:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 18:09:54] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-04-07 18:09:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:09:54] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :9
[2023-04-07 18:09:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-04-07 18:09:54] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :1 sat :9
[2023-04-07 18:09:54] [INFO ] After 60ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :9
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-04-07 18:09:54] [INFO ] After 148ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :9
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 7 properties in 28 ms.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6/6 places, 7/7 transitions.
Graph (complete) has 14 edges and 6 vertex of which 3 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 9 ms. Remains 3 /6 variables (removed 3) and now considering 4/7 (removed 3) transitions.
// Phase 1: matrix 4 rows 3 cols
[2023-04-07 18:09:54] [INFO ] Computed 0 invariants in 0 ms
[2023-04-07 18:09:54] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 3/6 places, 4/7 transitions.
Incomplete random walk after 10040 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=669 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-04-07 18:09:54] [INFO ] Invariant cache hit.
[2023-04-07 18:09:54] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 18:09:54] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 18:09:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-04-07 18:09:54] [INFO ] After 2ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 18:09:54] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-04-07 18:09:54] [INFO ] After 28ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 161 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=80 )
Parikh walk visited 1 properties in 1 ms.
[2023-04-07 18:09:54] [INFO ] Flatten gal took : 13 ms
[2023-04-07 18:09:54] [INFO ] Flatten gal took : 2 ms
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2023-04-07 18:09:54] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 5 ms.
[2023-04-07 18:09:54] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:09:54] [INFO ] Computed 6 invariants in 2 ms
[2023-04-07 18:09:54] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-04-07 18:09:54] [INFO ] Invariant cache hit.
[2023-04-07 18:09:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-04-07 18:09:54] [INFO ] Invariant cache hit.
[2023-04-07 18:09:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:09:54] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
[2023-04-07 18:09:54] [INFO ] Invariant cache hit.
[2023-04-07 18:09:54] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-07 18:09:54] [INFO ] Flatten gal took : 6 ms
[2023-04-07 18:09:54] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:09:54] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 41) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) 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 23) 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 23) 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 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) 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 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-04-07 18:09:55] [INFO ] Invariant cache hit.
[2023-04-07 18:09:55] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:09:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 30 ms returned sat
[2023-04-07 18:09:55] [INFO ] After 287ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:22
[2023-04-07 18:09:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:09:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 18:09:55] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :22
[2023-04-07 18:09:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:09:55] [INFO ] After 93ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :1 sat :22
[2023-04-07 18:09:55] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2023-04-07 18:09:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 22 ms
[2023-04-07 18:09:55] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :22
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-04-07 18:09:55] [INFO ] After 498ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :22
Fused 23 Parikh solutions to 22 different solutions.
Parikh walk visited 4 properties in 207 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:09:56] [INFO ] Invariant cache hit.
[2023-04-07 18:09:56] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) 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 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 225904 steps, run timeout after 3014 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 225904 steps, saw 154632 distinct states, run finished after 3015 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 18 properties.
[2023-04-07 18:09:59] [INFO ] Invariant cache hit.
[2023-04-07 18:09:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:09:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:09:59] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-07 18:09:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:09:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2023-04-07 18:09:59] [INFO ] After 77ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-04-07 18:09:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:09:59] [INFO ] After 65ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-04-07 18:09:59] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-07 18:09:59] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
[2023-04-07 18:09:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 43 ms
[2023-04-07 18:09:59] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-07 18:09:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-07 18:09:59] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-04-07 18:09:59] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 186 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:10:00] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-04-07 18:10:00] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 18 properties.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:10:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-04-07 18:10:00] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-04-07 18:10:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:10:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:10:00] [INFO ] After 62ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-04-07 18:10:00] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:10:00] [INFO ] After 56ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-04-07 18:10:00] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-04-07 18:10:00] [INFO ] After 315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:10:00] [INFO ] Input system was already deterministic with 35 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:10:00] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:00] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:00] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 10 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:00] [INFO ] Invariant cache hit.
[2023-04-07 18:10:01] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:10:01] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:01] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:01] [INFO ] Input system was already deterministic with 35 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:10:01] [INFO ] Invariant cache hit.
[2023-04-07 18:10:01] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:10:01] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:01] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:01] [INFO ] Input system was already deterministic with 35 transitions.
[2023-04-07 18:10:01] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:01] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:10:01] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 18:10:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 35 transitions and 135 arcs took 1 ms.
Total runtime 7952 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: 30 NrTr: 35 NrArc: 135)

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

net check time: 0m 0.000sec

init dd package: 0m 2.693sec


RS generation: 0m 8.675sec


-> reachability set: #nodes 25113 (2.5e+04) #states 20,012,606,308,670,976 (16)



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

checking: AG [EX [EX [~ [sum(p19, p18, p17, p16, p15)<=9]]]]
normalized: ~ [E [true U ~ [EX [EX [~ [sum(p19, p18, p17, p16, p15)<=9]]]]]]

abstracting: (sum(p19, p18, p17, p16, p15)<=9)
states: 20,012,606,308,670,976 (16)
..-> the formula is FALSE

FORMULA Murphy-COL-D4N025-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.378sec

checking: AG [EF [[~ [sum(p9, p8, p7, p6, p5)<=14] & ~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]]]]
normalized: ~ [E [true U ~ [E [true U [~ [sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)] & ~ [sum(p9, p8, p7, p6, p5)<=14]]]]]]

abstracting: (sum(p9, p8, p7, p6, p5)<=14)
MC time: 7m29.023sec

checking: EX [[EX [sum(p19, p18, p17, p16, p15)<=79] | [AX [[~ [sum(p4, p3, p2, p1, p0)<=82] | [~ [48<=sum(p24, p23, p22, p21, p20)] | [~ [81<=sum(p14, p13, p12, p11, p10)] & ~ [sum(p4, p3, p2, p1, p0)<=53]]]]] | ~ [sum(p19, p18, p17, p16, p15)<=56]]]]
normalized: EX [[[~ [EX [~ [[~ [sum(p4, p3, p2, p1, p0)<=82] | [[~ [sum(p4, p3, p2, p1, p0)<=53] & ~ [81<=sum(p14, p13, p12, p11, p10)]] | ~ [48<=sum(p24, p23, p22, p21, p20)]]]]]] | ~ [sum(p19, p18, p17, p16, p15)<=56]] | EX [sum(p19, p18, p17, p16, p15)<=79]]]

abstracting: (sum(p19, p18, p17, p16, p15)<=79)
states: 20,012,606,308,670,976 (16)
.abstracting: (sum(p19, p18, p17, p16, p15)<=56)
states: 20,012,606,308,670,976 (16)
abstracting: (48<=sum(p24, p23, p22, p21, p20))
states: 0
abstracting: (81<=sum(p14, p13, p12, p11, p10))
MC time: 6m33.000sec

checking: AF [[sum(p29, p28, p27, p26, p25)<=sum(p19, p18, p17, p16, p15) & [A [EF [[75<=sum(p9, p8, p7, p6, p5) & 12<=sum(p14, p13, p12, p11, p10)]] U 14<=sum(p9, p8, p7, p6, p5)] | A [sum(p29, p28, p27, p26, p25)<=47 U ~ [EX [sum(p4, p3, p2, p1, p0)<=84]]]]]]
normalized: ~ [EG [~ [[sum(p29, p28, p27, p26, p25)<=sum(p19, p18, p17, p16, p15) & [[~ [E [EX [sum(p4, p3, p2, p1, p0)<=84] U [~ [sum(p29, p28, p27, p26, p25)<=47] & EX [sum(p4, p3, p2, p1, p0)<=84]]]] & ~ [EG [EX [sum(p4, p3, p2, p1, p0)<=84]]]] | [~ [EG [~ [14<=sum(p9, p8, p7, p6, p5)]]] & ~ [E [~ [14<=sum(p9, p8, p7, p6, p5)] U [~ [E [true U [75<=sum(p9, p8, p7, p6, p5) & 12<=sum(p14, p13, p12, p11, p10)]]] & ~ [14<=sum(p9, p8, p7, p6, p5)]]]]]]]]]]

abstracting: (14<=sum(p9, p8, p7, p6, p5))
MC time: 5m44.000sec

checking: EG [A [sum(p29, p28, p27, p26, p25)<=98 U ~ [[EX [sum(p9, p8, p7, p6, p5)<=sum(p4, p3, p2, p1, p0)] | [E [sum(p9, p8, p7, p6, p5)<=sum(p14, p13, p12, p11, p10) U sum(p14, p13, p12, p11, p10)<=sum(p19, p18, p17, p16, p15)] & AX [sum(p24, p23, p22, p21, p20)<=61]]]]]]
normalized: EG [[~ [EG [[[~ [EX [~ [sum(p24, p23, p22, p21, p20)<=61]]] & E [sum(p9, p8, p7, p6, p5)<=sum(p14, p13, p12, p11, p10) U sum(p14, p13, p12, p11, p10)<=sum(p19, p18, p17, p16, p15)]] | EX [sum(p9, p8, p7, p6, p5)<=sum(p4, p3, p2, p1, p0)]]]] & ~ [E [[[~ [EX [~ [sum(p24, p23, p22, p21, p20)<=61]]] & E [sum(p9, p8, p7, p6, p5)<=sum(p14, p13, p12, p11, p10) U sum(p14, p13, p12, p11, p10)<=sum(p19, p18, p17, p16, p15)]] | EX [sum(p9, p8, p7, p6, p5)<=sum(p4, p3, p2, p1, p0)]] U [~ [sum(p29, p28, p27, p26, p25)<=98] & [[~ [EX [~ [sum(p24, p23, p22, p21, p20)<=61]]] & E [sum(p9, p8, p7, p6, p5)<=sum(p14, p13, p12, p11, p10) U sum(p14, p13, p12, p11, p10)<=sum(p19, p18, p17, p16, p15)]] | EX [sum(p9, p8, p7, p6, p5)<=sum(p4, p3, p2, p1, p0)]]]]]]]

abstracting: (sum(p9, p8, p7, p6, p5)<=sum(p4, p3, p2, p1, p0))
MC time: 5m 1.000sec

checking: [~ [A [[[sum(p24, p23, p22, p21, p20)<=71 & EF [EG [53<=sum(p19, p18, p17, p16, p15)]]] | AG [94<=sum(p4, p3, p2, p1, p0)]] U AF [~ [EX [sum(p29, p28, p27, p26, p25)<=13]]]]] & A [A [sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20) U 88<=sum(p19, p18, p17, p16, p15)] U AG [AX [EG [sum(p24, p23, p22, p21, p20)<=96]]]]]
normalized: [[~ [EG [E [true U EX [~ [EG [sum(p24, p23, p22, p21, p20)<=96]]]]]] & ~ [E [E [true U EX [~ [EG [sum(p24, p23, p22, p21, p20)<=96]]]] U [~ [[~ [EG [~ [88<=sum(p19, p18, p17, p16, p15)]]] & ~ [E [~ [88<=sum(p19, p18, p17, p16, p15)] U [~ [sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20)] & ~ [88<=sum(p19, p18, p17, p16, p15)]]]]]] & E [true U EX [~ [EG [sum(p24, p23, p22, p21, p20)<=96]]]]]]]] & ~ [[~ [EG [EG [EX [sum(p29, p28, p27, p26, p25)<=13]]]] & ~ [E [EG [EX [sum(p29, p28, p27, p26, p25)<=13]] U [~ [[~ [E [true U ~ [94<=sum(p4, p3, p2, p1, p0)]]] | [sum(p24, p23, p22, p21, p20)<=71 & E [true U EG [53<=sum(p19, p18, p17, p16, p15)]]]]] & EG [EX [sum(p29, p28, p27, p26, p25)<=13]]]]]]]]

abstracting: (sum(p29, p28, p27, p26, p25)<=13)
states: 19,984,296,294,602,640 (16)
.
EG iterations: 0
abstracting: (53<=sum(p19, p18, p17, p16, p15))
states: 0
.
EG iterations: 1
abstracting: (sum(p24, p23, p22, p21, p20)<=71)
states: 20,012,606,308,670,976 (16)
abstracting: (94<=sum(p4, p3, p2, p1, p0))
MC time: 4m23.000sec

checking: EX [[AF [[[[~ [86<=sum(p14, p13, p12, p11, p10)] & [sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20) | sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)]] | [sum(p19, p18, p17, p16, p15)<=sum(p4, p3, p2, p1, p0) & sum(p19, p18, p17, p16, p15)<=8]] & [EG [sum(p9, p8, p7, p6, p5)<=sum(p4, p3, p2, p1, p0)] & EX [~ [sum(p14, p13, p12, p11, p10)<=34]]]]] | sum(p9, p8, p7, p6, p5)<=sum(p19, p18, p17, p16, p15)]]
normalized: EX [[sum(p9, p8, p7, p6, p5)<=sum(p19, p18, p17, p16, p15) | ~ [EG [~ [[[EX [~ [sum(p14, p13, p12, p11, p10)<=34]] & EG [sum(p9, p8, p7, p6, p5)<=sum(p4, p3, p2, p1, p0)]] & [[sum(p19, p18, p17, p16, p15)<=sum(p4, p3, p2, p1, p0) & sum(p19, p18, p17, p16, p15)<=8] | [[sum(p9, p8, p7, p6, p5)<=sum(p24, p23, p22, p21, p20) | sum(p14, p13, p12, p11, p10)<=sum(p24, p23, p22, p21, p20)] & ~ [86<=sum(p14, p13, p12, p11, p10)]]]]]]]]]

abstracting: (86<=sum(p14, p13, p12, p11, p10))
MC time: 3m50.000sec

checking: E [AX [[~ [EX [[38<=sum(p24, p23, p22, p21, p20) | 10<=sum(p14, p13, p12, p11, p10)]]] & [A [~ [sum(p14, p13, p12, p11, p10)<=sum(p19, p18, p17, p16, p15)] U [35<=sum(p19, p18, p17, p16, p15) & sum(p24, p23, p22, p21, p20)<=30]] | [[sum(p4, p3, p2, p1, p0)<=sum(p29, p28, p27, p26, p25) & sum(p29, p28, p27, p26, p25)<=69] & [EX [43<=sum(p9, p8, p7, p6, p5)] & ~ [sum(p4, p3, p2, p1, p0)<=29]]]]]] U AX [EG [[AF [sum(p29, p28, p27, p26, p25)<=35] & A [sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25) U 53<=sum(p24, p23, p22, p21, p20)]]]]]
normalized: E [~ [EX [~ [[[[[~ [sum(p4, p3, p2, p1, p0)<=29] & EX [43<=sum(p9, p8, p7, p6, p5)]] & [sum(p4, p3, p2, p1, p0)<=sum(p29, p28, p27, p26, p25) & sum(p29, p28, p27, p26, p25)<=69]] | [~ [EG [~ [[35<=sum(p19, p18, p17, p16, p15) & sum(p24, p23, p22, p21, p20)<=30]]]] & ~ [E [~ [[35<=sum(p19, p18, p17, p16, p15) & sum(p24, p23, p22, p21, p20)<=30]] U [sum(p14, p13, p12, p11, p10)<=sum(p19, p18, p17, p16, p15) & ~ [[35<=sum(p19, p18, p17, p16, p15) & sum(p24, p23, p22, p21, p20)<=30]]]]]]] & ~ [EX [[38<=sum(p24, p23, p22, p21, p20) | 10<=sum(p14, p13, p12, p11, p10)]]]]]]] U ~ [EX [~ [EG [[[~ [EG [~ [53<=sum(p24, p23, p22, p21, p20)]]] & ~ [E [~ [53<=sum(p24, p23, p22, p21, p20)] U [~ [sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25)] & ~ [53<=sum(p24, p23, p22, p21, p20)]]]]] & ~ [EG [~ [sum(p29, p28, p27, p26, p25)<=35]]]]]]]]]

abstracting: (sum(p29, p28, p27, p26, p25)<=35)
states: 20,012,606,308,670,976 (16)
.
EG iterations: 1
abstracting: (53<=sum(p24, p23, p22, p21, p20))
states: 0
abstracting: (sum(p24, p23, p22, p21, p20)<=sum(p29, p28, p27, p26, p25))
states: 15,580,802,288,155,104 (16)
abstracting: (53<=sum(p24, p23, p22, p21, p20))
states: 0
abstracting: (53<=sum(p24, p23, p22, p21, p20))
states: 0

EG iterations: 0
.
EG iterations: 1
.abstracting: (10<=sum(p14, p13, p12, p11, p10))
MC time: 3m22.000sec

checking: [EX [AG [[EG [[sum(p29, p28, p27, p26, p25)<=sum(p4, p3, p2, p1, p0) & sum(p29, p28, p27, p26, p25)<=sum(p9, p8, p7, p6, p5)]] & AG [~ [sum(p4, p3, p2, p1, p0)<=81]]]]] | EF [[sum(p4, p3, p2, p1, p0)<=4 & [[[~ [18<=sum(p9, p8, p7, p6, p5)] & ~ [sum(p4, p3, p2, p1, p0)<=sum(p24, p23, p22, p21, p20)]] | [~ [A [sum(p29, p28, p27, p26, p25)<=sum(p9, p8, p7, p6, p5) U sum(p9, p8, p7, p6, p5)<=sum(p29, p28, p27, p26, p25)]] | AG [~ [sum(p29, p28, p27, p26, p25)<=sum(p4, p3, p2, p1, p0)]]]] & AX [~ [sum(p24, p23, p22, p21, p20)<=sum(p9, p8, p7, p6, p5)]]]]]]
normalized: [E [true U [sum(p4, p3, p2, p1, p0)<=4 & [~ [EX [sum(p24, p23, p22, p21, p20)<=sum(p9, p8, p7, p6, p5)]] & [[~ [E [true U sum(p29, p28, p27, p26, p25)<=sum(p4, p3, p2, p1, p0)]] | ~ [[~ [EG [~ [sum(p9, p8, p7, p6, p5)<=sum(p29, p28, p27, p26, p25)]]] & ~ [E [~ [sum(p9, p8, p7, p6, p5)<=sum(p29, p28, p27, p26, p25)] U [~ [sum(p29, p28, p27, p26, p25)<=sum(p9, p8, p7, p6, p5)] & ~ [sum(p9, p8, p7, p6, p5)<=sum(p29, p28, p27, p26, p25)]]]]]]] | [~ [sum(p4, p3, p2, p1, p0)<=sum(p24, p23, p22, p21, p20)] & ~ [18<=sum(p9, p8, p7, p6, p5)]]]]]] | EX [~ [E [true U ~ [[~ [E [true U sum(p4, p3, p2, p1, p0)<=81]] & EG [[sum(p29, p28, p27, p26, p25)<=sum(p4, p3, p2, p1, p0) & sum(p29, p28, p27, p26, p25)<=sum(p9, p8, p7, p6, p5)]]]]]]]]

abstracting: (sum(p29, p28, p27, p26, p25)<=sum(p9, p8, p7, p6, p5))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9806376 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16103136 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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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:23162 (661), effective:4563 (130)

initing FirstDep: 0m 0.000sec


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

idd.h:1025: Timeout: after 448 sec


idd.h:1025: Timeout: after 392 sec


idd.h:1025: Timeout: after 343 sec


idd.h:1025: Timeout: after 300 sec


idd.h:1025: Timeout: after 262 sec


idd.h:1025: Timeout: after 229 sec


iterations count:83 (2), effective:13 (0)

idd.h:1025: Timeout: after 201 sec


idd.h:1025: Timeout: after 175 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="Murphy-COL-D4N025"
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 Murphy-COL-D4N025, 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 r522-tall-167987247200313"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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