Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r522-tall-167987247300369.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-PT-D4N050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247300369
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 7.8K Mar 23 15:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 23 15:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 12K Mar 23 15:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Mar 23 15:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 23 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Mar 23 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 19K 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-PT-D4N050-CTLCardinality-00
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-01
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-02
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-03
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-04
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-05
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-06
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-07
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-08
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-09
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-10
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-11
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-12
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-13
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-14
FORMULA_NAME Murphy-PT-D4N050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1680893533118

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-PT-D4N050
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-07 18:52:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-04-07 18:52:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 18:52:14] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-04-07 18:52:14] [INFO ] Transformed 30 places.
[2023-04-07 18:52:14] [INFO ] Transformed 35 transitions.
[2023-04-07 18:52:14] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 90 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 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 9 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:52:14] [INFO ] Computed 6 invariants in 10 ms
[2023-04-07 18:52:15] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
[2023-04-07 18:52:15] [INFO ] Invariant cache hit.
[2023-04-07 18:52:15] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-04-07 18:52:15] [INFO ] Invariant cache hit.
[2023-04-07 18:52:15] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:52:15] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-04-07 18:52:15] [INFO ] Invariant cache hit.
[2023-04-07 18:52:15] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 551 ms. Remains : 30/30 places, 35/35 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-04-07 18:52:15] [INFO ] Flatten gal took : 18 ms
[2023-04-07 18:52:15] [INFO ] Flatten gal took : 7 ms
[2023-04-07 18:52:15] [INFO ] Input system was already deterministic with 35 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 254 ms. (steps per millisecond=39 ) properties (out of 101) seen :71
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Running SMT prover for 30 properties.
[2023-04-07 18:52:15] [INFO ] Invariant cache hit.
[2023-04-07 18:52:15] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-04-07 18:52:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:52:15] [INFO ] After 148ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-04-07 18:52:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:52:16] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:52:16] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-04-07 18:52:16] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:52:16] [INFO ] After 100ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :30
[2023-04-07 18:52:16] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 10 ms to minimize.
[2023-04-07 18:52:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-04-07 18:52:16] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
[2023-04-07 18:52:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:52:16] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-04-07 18:52:16] [INFO ] After 581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 0 properties in 256 ms.
Support contains 16 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 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:16] [INFO ] Invariant cache hit.
[2023-04-07 18:52:16] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 30/30 places, 35/35 transitions.
Incomplete random walk after 10007 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Interrupted probabilistic random walk after 185747 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185747 steps, saw 128129 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 30 properties.
[2023-04-07 18:52:19] [INFO ] Invariant cache hit.
[2023-04-07 18:52:20] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-07 18:52:20] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:52:20] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-04-07 18:52:20] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-07 18:52:20] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-04-07 18:52:20] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-04-07 18:52:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:52:20] [INFO ] After 71ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :30
[2023-04-07 18:52:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 2 ms to minimize.
[2023-04-07 18:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2023-04-07 18:52:20] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2023-04-07 18:52:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:52:20] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-04-07 18:52:20] [INFO ] After 451ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 0 properties in 290 ms.
Support contains 16 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 10 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 10 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 3 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:20] [INFO ] Invariant cache hit.
[2023-04-07 18:52:20] [INFO ] Implicit Places using invariants in 40 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 43 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 48 ms. Remains : 25/30 places, 35/35 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) 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 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) 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 30) 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 30) 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 30) seen :0
Interrupted probabilistic random walk after 188071 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188071 steps, saw 129474 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 30 properties.
// Phase 1: matrix 35 rows 25 cols
[2023-04-07 18:52:24] [INFO ] Computed 1 invariants in 1 ms
[2023-04-07 18:52:24] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:52:24] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-04-07 18:52:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:52:24] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-04-07 18:52:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:52:24] [INFO ] After 67ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :30
[2023-04-07 18:52:24] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 0 ms to minimize.
[2023-04-07 18:52:24] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
[2023-04-07 18:52:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 62 ms
[2023-04-07 18:52:24] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2023-04-07 18:52:24] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2023-04-07 18:52:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 46 ms
[2023-04-07 18:52:24] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2023-04-07 18:52:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2023-04-07 18:52:24] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-04-07 18:52:24] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
Parikh walk visited 0 properties in 264 ms.
Support contains 16 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:24] [INFO ] Invariant cache hit.
[2023-04-07 18:52:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-04-07 18:52:24] [INFO ] Invariant cache hit.
[2023-04-07 18:52:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:52:24] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2023-04-07 18:52:24] [INFO ] Redundant transitions in 0 ms returned []
[2023-04-07 18:52:24] [INFO ] Invariant cache hit.
[2023-04-07 18:52:24] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 115 ms. Remains : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 30 properties.
[2023-04-07 18:52:24] [INFO ] Invariant cache hit.
[2023-04-07 18:52:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-04-07 18:52:25] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:30
[2023-04-07 18:52:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-04-07 18:52:25] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :30
[2023-04-07 18:52:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-04-07 18:52:25] [INFO ] After 66ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :30
[2023-04-07 18:52:25] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
[2023-04-07 18:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2023-04-07 18:52:25] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 0 ms to minimize.
[2023-04-07 18:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2023-04-07 18:52:25] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 1 ms to minimize.
[2023-04-07 18:52:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2023-04-07 18:52:25] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :30
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-04-07 18:52:25] [INFO ] After 487ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :30
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 4 ms
[2023-04-07 18:52:25] [INFO ] Input system was already deterministic with 35 transitions.
Computed a total of 0 stabilizing places and 0 stable 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.
// Phase 1: matrix 35 rows 30 cols
[2023-04-07 18:52:25] [INFO ] Computed 6 invariants in 4 ms
[2023-04-07 18:52:25] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 15 ms
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:25] [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:52:25] [INFO ] Invariant cache hit.
[2023-04-07 18:52:25] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 5 ms
[2023-04-07 18:52:25] [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 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:25] [INFO ] Invariant cache hit.
[2023-04-07 18:52:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 9 ms
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:25] [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 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:25] [INFO ] Invariant cache hit.
[2023-04-07 18:52:25] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 7 ms
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:25] [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:52:25] [INFO ] Invariant cache hit.
[2023-04-07 18:52:25] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:52:25] [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 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:25] [INFO ] Invariant cache hit.
[2023-04-07 18:52:25] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:25] [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:52:25] [INFO ] Invariant cache hit.
[2023-04-07 18:52:25] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:25] [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:52:25] [INFO ] Invariant cache hit.
[2023-04-07 18:52:25] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:25] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:25] [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:52:25] [INFO ] Invariant cache hit.
[2023-04-07 18:52:26] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [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 6 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2023-04-07 18:52:26] [INFO ] Invariant cache hit.
[2023-04-07 18:52:26] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 1 ms
[2023-04-07 18:52:26] [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:52:26] [INFO ] Invariant cache hit.
[2023-04-07 18:52:26] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [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:52:26] [INFO ] Invariant cache hit.
[2023-04-07 18:52:26] [INFO ] Dead Transitions using invariants and state equation in 27 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:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [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:52:26] [INFO ] Invariant cache hit.
[2023-04-07 18:52:26] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [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:52:26] [INFO ] Invariant cache hit.
[2023-04-07 18:52:26] [INFO ] Dead Transitions using invariants and state equation in 27 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:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [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:52:26] [INFO ] Invariant cache hit.
[2023-04-07 18:52:26] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 3 ms
[2023-04-07 18:52:26] [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:52:26] [INFO ] Invariant cache hit.
[2023-04-07 18:52:26] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 30/30 places, 35/35 transitions.
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Input system was already deterministic with 35 transitions.
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Flatten gal took : 2 ms
[2023-04-07 18:52:26] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-04-07 18:52:26] [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 11942 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.783sec


RS generation: 1m10.546sec


-> reachability set: #nodes 80010 (8.0e+04) #states 7,258,754,799,509,878,656 (18)



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

checking: AG [EX [[p1<=4 | 50<=p18]]]
normalized: ~ [E [true U ~ [EX [[p1<=4 | 50<=p18]]]]]

abstracting: (50<=p18)
states: 0
abstracting: (p1<=4)
states: 1,160,947,802,707,318,656 (18)
.-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m17.745sec

checking: AF [AX [EG [p18<=p1]]]
normalized: ~ [EG [EX [~ [EG [p18<=p1]]]]]

abstracting: (p18<=p1)
states: 7,136,872,953,887,932,560 (18)
.
EG iterations: 1
..
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.033sec

checking: EF [EX [AX [~ [E [p27<=23 U p17<=p7]]]]]
normalized: E [true U EX [~ [EX [E [p27<=23 U p17<=p7]]]]]

abstracting: (p17<=p7)
states: 7,136,872,721,328,759,984 (18)
abstracting: (p27<=23)
states: 7,258,754,799,509,878,656 (18)
..-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.978sec

checking: AG [A [~ [[~ [p20<=p13] & ~ [p7<=p9]]] U [EG [p27<=40] | AF [p27<=34]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[~ [EG [~ [p27<=34]]] | EG [p27<=40]]]]] & ~ [E [~ [[~ [EG [~ [p27<=34]]] | EG [p27<=40]]] U [~ [[~ [EG [~ [p27<=34]]] | EG [p27<=40]]] & [~ [p7<=p9] & ~ [p20<=p13]]]]]]]]]

abstracting: (p20<=p13)
states: 7,014,990,983,510,486,304 (18)
abstracting: (p7<=p9)
states: 3,692,200,985,370,228,384 (18)
abstracting: (p27<=40)
states: 7,258,754,799,509,878,656 (18)

EG iterations: 0
abstracting: (p27<=34)
states: 7,258,754,799,509,878,656 (18)
.
EG iterations: 1
abstracting: (p27<=40)
states: 7,258,754,799,509,878,656 (18)

EG iterations: 0
abstracting: (p27<=34)
states: 7,258,754,799,509,878,656 (18)
.
EG iterations: 1
abstracting: (p27<=40)
states: 7,258,754,799,509,878,656 (18)

EG iterations: 0
abstracting: (p27<=34)
states: 7,258,754,799,509,878,656 (18)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.026sec

checking: EF [EG [[E [p18<=16 U p10<=p1] & [~ [p15<=p4] | ~ [p25<=41]]]]]
normalized: E [true U EG [[[~ [p25<=41] | ~ [p15<=p4]] & E [p18<=16 U p10<=p1]]]]

abstracting: (p10<=p1)
states: 3,692,200,798,267,366,752 (18)
abstracting: (p18<=16)
states: 7,258,754,799,509,878,656 (18)

before gc: list nodes free: 256801

after gc: idd nodes used:6179012, unused:57820988; list nodes free:752665059
MC time: 10m43.921sec

checking: EF [[A [~ [EX [p9<=10]] U p22<=p23] & [AG [p24<=p27] & [2<=p0 | p27<=47]]]]
normalized: E [true U [[[2<=p0 | p27<=47] & ~ [E [true U ~ [p24<=p27]]]] & [~ [EG [~ [p22<=p23]]] & ~ [E [~ [p22<=p23] U [EX [p9<=10] & ~ [p22<=p23]]]]]]]

abstracting: (p22<=p23)
states: 4,839,169,866,339,919,104 (18)
abstracting: (p9<=10)
states: 2,337,467,135,468,718,816 (18)
.abstracting: (p22<=p23)
states: 4,839,169,866,339,919,104 (18)
abstracting: (p22<=p23)
states: 4,839,169,866,339,919,104 (18)
.
EG iterations: 1
abstracting: (p24<=p27)
states: 5,645,698,177,396,572,288 (18)
abstracting: (p27<=47)
states: 7,258,754,799,509,878,656 (18)
abstracting: (2<=p0)
states: 6,771,227,042,755,593,792 (18)
-> the formula is FALSE

FORMULA Murphy-PT-D4N050-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m30.357sec

checking: AG [EF [[EX [p16<=p7] | [EF [EX [~ [4<=p5]]] | [A [39<=p16 U 40<=p6] & [38<=p19 | p16<=p28]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[38<=p19 | p16<=p28] & [~ [EG [~ [40<=p6]]] & ~ [E [~ [40<=p6] U [~ [39<=p16] & ~ [40<=p6]]]]]] | E [true U EX [~ [4<=p5]]]] | EX [p16<=p7]]]]]]

abstracting: (p16<=p7)
states: 7,136,872,721,328,759,984 (18)
.abstracting: (4<=p5)
states: 6,313,023,169,731,139,968 (18)
.abstracting: (40<=p6)
states: 1,612,872,342,455,174,784 (18)
abstracting: (39<=p16)
states: 0
abstracting: (40<=p6)
states: 1,612,872,342,455,174,784 (18)
abstracting: (40<=p6)
states: 1,612,872,342,455,174,784 (18)
.
EG iterations: 1
abstracting: (p16<=p28)
states: 6,653,858,566,217,388,768 (18)
abstracting: (38<=p19)
states: 0
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.108sec

checking: E [AX [AG [EF [38<=p12]]] U E [AG [[~ [[p29<=p7 | 49<=p24]] | [AX [25<=p28] & [p8<=p15 & p25<=31]]]] U 6<=p15]]
normalized: E [~ [EX [E [true U ~ [E [true U 38<=p12]]]]] U E [~ [E [true U ~ [[[[p8<=p15 & p25<=31] & ~ [EX [~ [25<=p28]]]] | ~ [[p29<=p7 | 49<=p24]]]]]] U 6<=p15]]

abstracting: (6<=p15)
states: 0
abstracting: (49<=p24)
states: 0
abstracting: (p29<=p7)
states: 6,895,552,313,658,660,048 (18)
abstracting: (25<=p28)
states: 0
.abstracting: (p25<=31)
states: 7,258,754,799,509,878,656 (18)
abstracting: (p8<=p15)
states: 365,646,234,543,356,016 (17)
abstracting: (38<=p12)
states: 1,749,814,658,067,548,160 (18)
MC time: 4m21.427sec

checking: EG [[AG [~ [p7<=50]] | EG [[[~ [p15<=p6] | EF [p18<=p22]] & [[AF [p18<=1] | p29<=p13] & AG [p25<=27]]]]]]
normalized: EG [[EG [[[~ [E [true U ~ [p25<=27]]] & [p29<=p13 | ~ [EG [~ [p18<=1]]]]] & [E [true U p18<=p22] | ~ [p15<=p6]]]] | ~ [E [true U p7<=50]]]]

abstracting: (p7<=50)
states: 6,241,676,965,837,146,720 (18)
abstracting: (p15<=p6)
states: 7,136,872,721,328,759,984 (18)
abstracting: (p18<=p22)
states: 6,048,962,332,924,898,880 (18)
abstracting: (p18<=1)
states: 7,258,754,799,509,878,656 (18)
.
EG iterations: 1
abstracting: (p29<=p13)
states: 6,895,552,746,683,203,344 (18)
abstracting: (p25<=27)
states: 7,258,754,799,509,878,656 (18)

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Murphy-PT-D4N050-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m45.462sec

checking: EF [[AF [[[p15<=p24 | [~ [39<=p2] | ~ [p8<=p20]]] & [~ [A [p2<=34 U p17<=p1]] & ~ [2<=p27]]]] & ~ [p19<=p14]]]
normalized: E [true U [~ [p19<=p14] & ~ [EG [~ [[[~ [2<=p27] & ~ [[~ [EG [~ [p17<=p1]]] & ~ [E [~ [p17<=p1] U [~ [p2<=34] & ~ [p17<=p1]]]]]]] & [p15<=p24 | [~ [p8<=p20] | ~ [39<=p2]]]]]]]]]

abstracting: (39<=p2)
states: 1,681,343,649,708,383,232 (18)
abstracting: (p8<=p20)
states: 482,640,815,340,199,872 (17)
abstracting: (p15<=p24)
states: 6,048,962,332,924,898,880 (18)
abstracting: (p17<=p1)
states: 7,136,872,953,887,932,560 (18)
abstracting: (p2<=34)
states: 5,282,717,997,175,030,656 (18)
abstracting: (p17<=p1)
states: 7,136,872,953,887,932,560 (18)

BK_STOP 1680895068245

--------------------
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:45332 (1295), effective:8976 (256)

initing FirstDep: 0m 0.000sec


iterations count:1150 (32), effective:215 (6)

iterations count:132 (3), effective:18 (0)

sat_reach.icc:155: Timeout: after 291 sec


iterations count:1183 (33), effective:250 (7)

iterations count:57 (1), effective:6 (0)

iterations count:356 (10), effective:261 (7)

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

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

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

sat_reach.icc:155: Timeout: after 260 sec


iterations count:1115 (31), effective:215 (6)

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

iterations count:103 (2), effective:34 (0)
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 618 Killed ${MARCIE} --net-file=model.pnml --mcc-file=${BK_EXAMINATION}.xml ${MARCIE_CONFIG}

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-PT-D4N050"
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-PT-D4N050, 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-167987247300369"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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