About the Execution of Marcie+red for FunctionPointer-PT-a064
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 1627081.00 | 0.00 | 0.00 | F?T????F????T??? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857500641.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 FunctionPointer-PT-a064, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857500641
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.2K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 11:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 11:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 11:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 34K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-00
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-01
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-02
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-03
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-04
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-05
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-06
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-07
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-08
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-09
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-10
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-11
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-12
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-13
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-14
FORMULA_NAME FunctionPointer-PT-a064-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678592513020
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=FunctionPointer-PT-a064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 03:41:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 03:41:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 03:41:54] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2023-03-12 03:41:54] [INFO ] Transformed 40 places.
[2023-03-12 03:41:54] [INFO ] Transformed 70 transitions.
[2023-03-12 03:41:54] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 92 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
Support contains 34 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Applied a total of 0 rules in 9 ms. Remains 34 /34 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2023-03-12 03:41:54] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2023-03-12 03:41:54] [INFO ] Computed 4 place invariants in 4 ms
[2023-03-12 03:41:55] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-12 03:41:55] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:41:55] [INFO ] Invariant cache hit.
[2023-03-12 03:41:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:41:55] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-12 03:41:55] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:41:55] [INFO ] Invariant cache hit.
[2023-03-12 03:41:55] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 532 ms. Remains : 34/34 places, 66/66 transitions.
Support contains 34 out of 34 places after structural reductions.
[2023-03-12 03:41:55] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 03:41:55] [INFO ] Flatten gal took : 23 ms
FORMULA FunctionPointer-PT-a064-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 03:41:55] [INFO ] Flatten gal took : 9 ms
[2023-03-12 03:41:55] [INFO ] Input system was already deterministic with 66 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 329 ms. (steps per millisecond=30 ) properties (out of 61) seen :28
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) 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 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) 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 33) 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 33) 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 33) 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 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) 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 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Running SMT prover for 33 properties.
[2023-03-12 03:41:55] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2023-03-12 03:41:55] [INFO ] Invariant cache hit.
[2023-03-12 03:41:56] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 03:41:56] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 03:41:56] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :10 sat :0 real:23
[2023-03-12 03:41:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 03:41:56] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-12 03:41:56] [INFO ] After 57ms SMT Verify possible using state equation in natural domain returned unsat :15 sat :18
[2023-03-12 03:41:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:41:56] [INFO ] After 58ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :15 sat :18
[2023-03-12 03:41:56] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 5 ms to minimize.
[2023-03-12 03:41:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-12 03:41:56] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :15 sat :18
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-12 03:41:56] [INFO ] After 378ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :18
Fused 33 Parikh solutions to 18 different solutions.
Parikh walk visited 0 properties in 259 ms.
Support contains 16 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 32 transition count 64
Applied a total of 3 rules in 20 ms. Remains 32 /34 variables (removed 2) and now considering 64/66 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 32/34 places, 64/66 transitions.
Incomplete random walk after 10008 steps, including 20 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) 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 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) 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 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 301656 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{16=1}
Probabilistic random walk after 301656 steps, saw 203018 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :1
Running SMT prover for 16 properties.
[2023-03-12 03:41:59] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
// Phase 1: matrix 45 rows 32 cols
[2023-03-12 03:41:59] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-12 03:41:59] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 03:42:00] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:11
[2023-03-12 03:42:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:42:00] [INFO ] After 16ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 03:42:00] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 03:42:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 03:42:00] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-12 03:42:00] [INFO ] After 47ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-12 03:42:00] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-12 03:42:00] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 261 ms.
Support contains 14 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 32/32 places, 64/64 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 199383 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199383 steps, saw 135145 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 16 properties.
[2023-03-12 03:42:03] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-12 03:42:03] [INFO ] Invariant cache hit.
[2023-03-12 03:42:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 03:42:03] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:12
[2023-03-12 03:42:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:42:03] [INFO ] After 11ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 03:42:03] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 03:42:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 03:42:03] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-12 03:42:04] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2023-03-12 03:42:04] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-12 03:42:04] [INFO ] After 220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 255 ms.
Support contains 14 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 32/32 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-12 03:42:04] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-12 03:42:04] [INFO ] Invariant cache hit.
[2023-03-12 03:42:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 03:42:04] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-12 03:42:04] [INFO ] Invariant cache hit.
[2023-03-12 03:42:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-12 03:42:04] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2023-03-12 03:42:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 03:42:04] [INFO ] Flow matrix only has 45 transitions (discarded 19 similar events)
[2023-03-12 03:42:04] [INFO ] Invariant cache hit.
[2023-03-12 03:42:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 32/32 places, 64/64 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 32 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 21 place count 31 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 21 place count 31 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 29 transition count 42
Applied a total of 25 rules in 5 ms. Remains 29 /32 variables (removed 3) and now considering 42/64 (removed 22) transitions.
Running SMT prover for 16 properties.
// Phase 1: matrix 42 rows 29 cols
[2023-03-12 03:42:04] [INFO ] Computed 3 place invariants in 2 ms
[2023-03-12 03:42:04] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-12 03:42:04] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:12
[2023-03-12 03:42:04] [INFO ] After 53ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 03:42:04] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-12 03:42:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-12 03:42:04] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-12 03:42:04] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2023-03-12 03:42:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-12 03:42:04] [INFO ] After 112ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-12 03:42:04] [INFO ] After 181ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Successfully simplified 15 atomic propositions for a total of 15 simplifications.
FORMULA FunctionPointer-PT-a064-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a064-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 03:42:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 7 ms
FORMULA FunctionPointer-PT-a064-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 5 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 66 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 4 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 31 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 31 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 31 transition count 62
Applied a total of 6 rules in 3 ms. Remains 31 /34 variables (removed 3) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 31/34 places, 62/66 transitions.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/34 places, 66/66 transitions.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/34 places, 66/66 transitions.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/34 places, 66/66 transitions.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 30/34 places, 62/66 transitions.
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:04] [INFO ] Flatten gal took : 7 ms
[2023-03-12 03:42:04] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/34 places, 66/66 transitions.
[2023-03-12 03:42:05] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:05] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:05] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 31 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 31 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 31 transition count 62
Applied a total of 6 rules in 2 ms. Remains 31 /34 variables (removed 3) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/34 places, 62/66 transitions.
[2023-03-12 03:42:05] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:05] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:05] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 62
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 60
Applied a total of 7 rules in 8 ms. Remains 30 /34 variables (removed 4) and now considering 60/66 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 30/34 places, 60/66 transitions.
[2023-03-12 03:42:05] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:05] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:05] [INFO ] Input system was already deterministic with 60 transitions.
[2023-03-12 03:42:05] [INFO ] Flatten gal took : 4 ms
[2023-03-12 03:42:05] [INFO ] Flatten gal took : 3 ms
[2023-03-12 03:42:05] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-12 03:42:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 66 transitions and 268 arcs took 1 ms.
Total runtime 10613 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: 34 NrTr: 66 NrArc: 268)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.739sec
BK_STOP 1678594140101
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
/home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin//../BenchKit_head.sh: line 16: 512 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="FunctionPointer-PT-a064"
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 FunctionPointer-PT-a064, 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 r170-tall-167838857500641"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-a064.tgz
mv FunctionPointer-PT-a064 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 '
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 ;