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

About the Execution of Marcie+red for Szymanski-PT-a12

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
8213.827 145150.00 143366.00 4896.40 FFTTTTFTFTFTTFFT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 26 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 101K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-00
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-01
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-02
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-03
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-04
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-05
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-06
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-07
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-08
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-09
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-10
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-11
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-12
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-13
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-14
FORMULA_NAME Szymanski-PT-a12-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679255371212

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=Szymanski-PT-a12
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 19:49:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 19:49:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 19:49:32] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2023-03-19 19:49:32] [INFO ] Transformed 61 places.
[2023-03-19 19:49:32] [INFO ] Transformed 224 transitions.
[2023-03-19 19:49:32] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 108 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-a12-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 216/216 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 48 transition count 212
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 48 transition count 212
Applied a total of 2 rules in 15 ms. Remains 48 /49 variables (removed 1) and now considering 212/216 (removed 4) transitions.
[2023-03-19 19:49:32] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
// Phase 1: matrix 78 rows 48 cols
[2023-03-19 19:49:32] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-19 19:49:32] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-19 19:49:32] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2023-03-19 19:49:32] [INFO ] Invariant cache hit.
[2023-03-19 19:49:33] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-19 19:49:33] [INFO ] Implicit Places using invariants and state equation in 76 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-19 19:49:33] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2023-03-19 19:49:33] [INFO ] Invariant cache hit.
[2023-03-19 19:49:33] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 48/49 places, 212/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 48/49 places, 212/216 transitions.
Support contains 41 out of 48 places after structural reductions.
[2023-03-19 19:49:33] [INFO ] Flatten gal took : 36 ms
[2023-03-19 19:49:33] [INFO ] Flatten gal took : 20 ms
[2023-03-19 19:49:33] [INFO ] Input system was already deterministic with 212 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 56) seen :40
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) 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 16) 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 16) 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 16) 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 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 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 7 ms. (steps per millisecond=143 ) properties (out of 16) 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 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 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) 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 16) seen :0
Incomplete Best-First random walk after 1000 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 5 ms. (steps per millisecond=200 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-19 19:49:33] [INFO ] Flow matrix only has 78 transitions (discarded 134 similar events)
[2023-03-19 19:49:33] [INFO ] Invariant cache hit.
[2023-03-19 19:49:33] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:49:33] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:49:33] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:11
[2023-03-19 19:49:33] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-19 19:49:33] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-19 19:49:33] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :15 sat :0
Fused 15 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 15 atomic propositions for a total of 13 simplifications.
FORMULA Szymanski-PT-a12-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:49:33] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-19 19:49:33] [INFO ] Flatten gal took : 11 ms
FORMULA Szymanski-PT-a12-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a12-CTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 19:49:33] [INFO ] Flatten gal took : 11 ms
[2023-03-19 19:49:33] [INFO ] Input system was already deterministic with 212 transitions.
Computed a total of 9 stabilizing places and 36 stable transitions
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 44 transition count 204
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 44 transition count 204
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 13 place count 44 transition count 196
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 14 place count 43 transition count 192
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 43 transition count 192
Applied a total of 15 rules in 29 ms. Remains 43 /48 variables (removed 5) and now considering 192/212 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 43/48 places, 192/212 transitions.
[2023-03-19 19:49:33] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:49:33] [INFO ] Input system was already deterministic with 192 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 5 place count 43 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 196
Applied a total of 9 rules in 4 ms. Remains 43 /48 variables (removed 5) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 43/48 places, 196/212 transitions.
[2023-03-19 19:49:33] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:33] [INFO ] Flatten gal took : 9 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 23 place count 43 transition count 184
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 25 place count 41 transition count 176
Iterating global reduction 0 with 2 rules applied. Total rules applied 27 place count 41 transition count 176
Applied a total of 27 rules in 18 ms. Remains 41 /48 variables (removed 7) and now considering 176/212 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 41/48 places, 176/212 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 176 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 42 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 42 transition count 196
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 25 place count 42 transition count 180
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 27 place count 40 transition count 172
Iterating global reduction 0 with 2 rules applied. Total rules applied 29 place count 40 transition count 172
Applied a total of 29 rules in 14 ms. Remains 40 /48 variables (removed 8) and now considering 172/212 (removed 40) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 40/48 places, 172/212 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 3 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/48 places, 200/212 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Graph (complete) has 375 edges and 48 vertex of which 46 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 43 transition count 200
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 43 transition count 200
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 0 with 16 rules applied. Total rules applied 23 place count 43 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 24 place count 42 transition count 180
Iterating global reduction 0 with 1 rules applied. Total rules applied 25 place count 42 transition count 180
Applied a total of 25 rules in 13 ms. Remains 42 /48 variables (removed 6) and now considering 180/212 (removed 32) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 42/48 places, 180/212 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 180 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 3 ms. Remains 42 /48 variables (removed 6) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/48 places, 196/212 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 8 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 7 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 3 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/48 places, 200/212 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 42/48 places, 196/212 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 196 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 43 transition count 200
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 43 transition count 200
Applied a total of 8 rules in 2 ms. Remains 43 /48 variables (removed 5) and now considering 200/212 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 43/48 places, 200/212 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 212/212 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 46 transition count 212
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 6 place count 42 transition count 196
Iterating global reduction 1 with 4 rules applied. Total rules applied 10 place count 42 transition count 196
Applied a total of 10 rules in 2 ms. Remains 42 /48 variables (removed 6) and now considering 196/212 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 42/48 places, 196/212 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 5 ms
[2023-03-19 19:49:34] [INFO ] Input system was already deterministic with 196 transitions.
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 6 ms
[2023-03-19 19:49:34] [INFO ] Flatten gal took : 11 ms
[2023-03-19 19:49:34] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-19 19:49:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 48 places, 212 transitions and 852 arcs took 2 ms.
Total runtime 1755 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: 48 NrTr: 212 NrArc: 852)

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

net check time: 0m 0.000sec

init dd package: 0m 2.726sec


RS generation: 0m18.898sec


-> reachability set: #nodes 14286 (1.4e+04) #states 7,743,600,648,864,015 (15)



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

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

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

FORMULA Szymanski-PT-a12-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.911sec

checking: EF [AG [p11<=7]]
normalized: E [true U ~ [E [true U ~ [p11<=7]]]]

abstracting: (p11<=7)
states: 7,743,600,524,214,525 (15)
-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.878sec

checking: EX [~ [p39<=0]]
normalized: EX [~ [p39<=0]]

abstracting: (p39<=0)
states: 4,621,447,407,309,655 (15)
.-> the formula is FALSE

FORMULA Szymanski-PT-a12-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

checking: AX [AF [[EX [0<=0] | EX [9<=p33]]]]
normalized: ~ [EX [EG [~ [[EX [9<=p33] | EX [0<=0]]]]]]

abstracting: (0<=0)
states: 7,743,600,648,864,015 (15)
.abstracting: (9<=p33)
states: 113,095,604,370 (11)
..
EG iterations: 1
.-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: EX [[EF [EG [~ [p39<=0]]] & AF [7<=p16]]]
normalized: EX [[~ [EG [~ [7<=p16]]] & E [true U EG [~ [p39<=0]]]]]

abstracting: (p39<=0)
states: 4,621,447,407,309,655 (15)
.
EG iterations: 1
abstracting: (7<=p16)
states: 2,992,194,786,257 (12)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA Szymanski-PT-a12-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.344sec

checking: A [EG [p10<=p25] U EF [11<=p39]]
normalized: [~ [EG [~ [E [true U 11<=p39]]]] & ~ [E [~ [E [true U 11<=p39]] U [~ [EG [p10<=p25]] & ~ [E [true U 11<=p39]]]]]]

abstracting: (11<=p39)
states: 1,490,183,110 (9)
abstracting: (p10<=p25)
states: 6,557,230,580,942,936 (15)
..
EG iterations: 2
abstracting: (11<=p39)
states: 1,490,183,110 (9)
abstracting: (11<=p39)
states: 1,490,183,110 (9)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.544sec

checking: EF [AG [[p19<=p30 | p23<=7]]]
normalized: E [true U ~ [E [true U ~ [[p19<=p30 | p23<=7]]]]]

abstracting: (p23<=7)
states: 7,742,962,232,985,643 (15)
abstracting: (p19<=p30)
states: 5,537,662,699,025,080 (15)
-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.152sec

checking: [[AX [[~ [E [p9<=p10 U p32<=11]] | ~ [p34<=p0]]] & EX [0<=0]] | EG [p33<=2]]
normalized: [EG [p33<=2] | [EX [0<=0] & ~ [EX [~ [[~ [p34<=p0] | ~ [E [p9<=p10 U p32<=11]]]]]]]]

abstracting: (p32<=11)
states: 7,743,600,574,982,610 (15)
abstracting: (p9<=p10)
states: 6,721,712,121,661,595 (15)
abstracting: (p34<=p0)
states: 4,775,852,515,255,991 (15)
.abstracting: (0<=0)
states: 7,743,600,648,864,015 (15)
.abstracting: (p33<=2)
states: 7,316,864,417,161,611 (15)
.
EG iterations: 1
-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.537sec

checking: EF [EX [[[AF [~ [p47<=p5]] & [EG [~ [p34<=11]] | EF [~ [p27<=p29]]]] & AG [~ [p41<=p43]]]]]
normalized: E [true U EX [[~ [E [true U p41<=p43]] & [[E [true U ~ [p27<=p29]] | EG [~ [p34<=11]]] & ~ [EG [p47<=p5]]]]]]

abstracting: (p47<=p5)
states: 6,104,211,396,768,979 (15)
.
EG iterations: 1
abstracting: (p34<=11)
states: 7,743,600,574,982,610 (15)
.
EG iterations: 1
abstracting: (p27<=p29)
states: 5,494,107,300,930,918 (15)
abstracting: (p41<=p43)
states: 5,494,107,216,648,644 (15)
.-> the formula is TRUE

FORMULA Szymanski-PT-a12-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.712sec

checking: AF [[[[~ [E [9<=p22 U p27<=5]] | ~ [p44<=p18]] | [~ [p25<=p45] | ~ [p12<=p14]]] & EG [AG [EX [~ [12<=p27]]]]]]
normalized: ~ [EG [~ [[[[~ [p25<=p45] | ~ [p12<=p14]] | [~ [p44<=p18] | ~ [E [9<=p22 U p27<=5]]]] & EG [~ [E [true U ~ [EX [~ [12<=p27]]]]]]]]]]

abstracting: (12<=p27)
states: 73,881,404 (7)
..
EG iterations: 1
abstracting: (p27<=5)
states: 7,731,479,082,623,227 (15)
abstracting: (9<=p22)
states: 113,095,602,200 (11)
abstracting: (p44<=p18)
states: 5,537,662,699,025,080 (15)
abstracting: (p12<=p14)
states: 6,439,026,204,974,048 (15)
abstracting: (p25<=p45)
states: 5,537,662,813,742,410 (15)

EG iterations: 0
-> the formula is FALSE

FORMULA Szymanski-PT-a12-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.338sec

checking: EG [AG [[[EF [5<=p24] | [EF [p10<=0] | E [7<=p10 U 1<=p15]]] | [A [[p17<=p2 | p4<=0] U [10<=p39 & p21<=p26]] | [~ [p44<=2] | [[~ [p37<=0] | ~ [9<=p18]] & [~ [p6<=12] | ~ [p23<=2]]]]]]]]
normalized: EG [~ [E [true U ~ [[[[[[~ [p23<=2] | ~ [p6<=12]] & [~ [9<=p18] | ~ [p37<=0]]] | ~ [p44<=2]] | [~ [EG [~ [[10<=p39 & p21<=p26]]]] & ~ [E [~ [[10<=p39 & p21<=p26]] U [~ [[p17<=p2 | p4<=0]] & ~ [[10<=p39 & p21<=p26]]]]]]] | [[E [7<=p10 U 1<=p15] | E [true U p10<=0]] | E [true U 5<=p24]]]]]]]

abstracting: (5<=p24)
states: 43,623,944,262,850 (13)
abstracting: (p10<=0)
states: 5,921,169,407,774,465 (15)
abstracting: (1<=p15)
states: 3,122,153,126,837,030 (15)
abstracting: (7<=p10)
states: 2,418,970,446 (9)
abstracting: (p21<=p26)
states: 5,494,107,300,930,918 (15)
abstracting: (10<=p39)
states: 15,602,162,930 (10)
abstracting: (p4<=0)
states: 7,647,184,603,528,704 (15)
abstracting: (p17<=p2)
states: 5,121,689,352,695,357 (15)
abstracting: (p21<=p26)
states: 5,494,107,300,930,918 (15)
abstracting: (10<=p39)
states: 15,602,162,930 (10)
abstracting: (p21<=p26)
states: 5,494,107,300,930,918 (15)
abstracting: (10<=p39)
states: 15,602,162,930 (10)
.
EG iterations: 1
abstracting: (p44<=2)
states: 7,316,864,417,161,611 (15)
abstracting: (p37<=0)
states: 4,621,447,407,309,655 (15)
abstracting: (9<=p18)
states: 113,095,602,200 (11)
abstracting: (p6<=12)
states: 7,743,600,648,864,015 (15)
abstracting: (p23<=2)
states: 7,316,864,430,728,736 (15)
.
EG iterations: 1
-> the formula is FALSE

FORMULA Szymanski-PT-a12-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.460sec

totally nodes used: 17312654 (1.7e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1202760450 252054941 1454815391
used/not used/entry size/cache size: 65022801 2086063 16 1024MB
basic ops cache: hits/miss/sum: 85973971 15986427 101960398
used/not used/entry size/cache size: 13593254 3183962 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 870357 195602 1065959
used/not used/entry size/cache size: 193324 8195284 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 52470492
1 12729960
2 1660309
3 180481
4 28591
5 8877
6 5350
7 4972
8 2866
9 1761
>= 10 15205

Total processing time: 2m13.545sec


BK_STOP 1679255516362

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

10130 11649 24848 17796 25642 20281
iterations count:620522 (2926), effective:17351 (81)

initing FirstDep: 0m 0.000sec


iterations count:1061 (5), effective:33 (0)

iterations count:1627 (7), effective:50 (0)

iterations count:18789 (88), effective:213 (1)
15893 20562 21106 29073 26508 22348 18502
iterations count:735119 (3467), effective:9156 (43)
15893 20562 21106 29073 26508 22348 18502
iterations count:735119 (3467), effective:9156 (43)

iterations count:212 (1), effective:0 (0)
15893 20562 21106 29073 26508 22348 18502
iterations count:735119 (3467), effective:9156 (43)

iterations count:51718 (243), effective:2062 (9)

iterations count:51423 (242), effective:1858 (8)

iterations count:2622 (12), effective:18 (0)

iterations count:7445 (35), effective:136 (0)

iterations count:63184 (298), effective:799 (3)

iterations count:90487 (426), effective:2009 (9)

iterations count:63854 (301), effective:795 (3)

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

iterations count:15512 (73), effective:628 (2)

iterations count:1083 (5), effective:32 (0)

iterations count:5344 (25), effective:89 (0)

iterations count:37064 (174), effective:567 (2)
25000
iterations count:121493 (573), effective:2334 (11)

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="Szymanski-PT-a12"
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 Szymanski-PT-a12, 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 r490-tall-167912708700441"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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