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

About the Execution of Marcie+red for ServersAndClients-PT-100020

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6194.407 3600000.00 3646054.00 9570.20 ??T?T?FT?????TF? 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.r362-smll-167891812900457.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 ServersAndClients-PT-100020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r362-smll-167891812900457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 11K Feb 26 03:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 26 03:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 03:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 03:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 03:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Feb 26 03:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Feb 26 03:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 4.1M 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 ServersAndClients-PT-100020-CTLCardinality-00
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-01
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-02
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-03
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-04
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-05
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-06
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-07
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-08
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-09
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-10
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-11
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-12
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-13
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-14
FORMULA_NAME ServersAndClients-PT-100020-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679180192305

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=ServersAndClients-PT-100020
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-18 22:56:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-18 22:56:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 22:56:36] [INFO ] Load time of PNML (sax parser for PT used): 578 ms
[2023-03-18 22:56:36] [INFO ] Transformed 2421 places.
[2023-03-18 22:56:36] [INFO ] Transformed 4200 transitions.
[2023-03-18 22:56:36] [INFO ] Found NUPN structural information;
[2023-03-18 22:56:36] [INFO ] Parsed PT model containing 2421 places and 4200 transitions and 12800 arcs in 764 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 33 ms.
FORMULA ServersAndClients-PT-100020-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 186 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 528 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2023-03-18 22:56:37] [INFO ] Computed 221 place invariants in 140 ms
[2023-03-18 22:56:39] [INFO ] Implicit Places using invariants in 1958 ms returned []
[2023-03-18 22:56:39] [INFO ] Invariant cache hit.
[2023-03-18 22:56:40] [INFO ] Implicit Places using invariants and state equation in 1216 ms returned []
Implicit Place search using SMT with State Equation took 3217 ms to find 0 implicit places.
[2023-03-18 22:56:40] [INFO ] Invariant cache hit.
[2023-03-18 22:56:44] [INFO ] Dead Transitions using invariants and state equation in 4368 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8116 ms. Remains : 2421/2421 places, 4200/4200 transitions.
Support contains 186 out of 2421 places after structural reductions.
[2023-03-18 22:56:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-18 22:56:45] [INFO ] Flatten gal took : 507 ms
FORMULA ServersAndClients-PT-100020-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 22:56:46] [INFO ] Flatten gal took : 256 ms
[2023-03-18 22:56:46] [INFO ] Input system was already deterministic with 4200 transitions.
Support contains 145 out of 2421 places (down from 186) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1005 ms. (steps per millisecond=9 ) properties (out of 90) seen :66
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) 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 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 22) 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 22) seen :0
Running SMT prover for 22 properties.
[2023-03-18 22:56:47] [INFO ] Invariant cache hit.
[2023-03-18 22:56:50] [INFO ] [Real]Absence check using 121 positive place invariants in 140 ms returned sat
[2023-03-18 22:56:50] [INFO ] [Real]Absence check using 121 positive and 100 generalized place invariants in 80 ms returned sat
[2023-03-18 22:56:58] [INFO ] After 6723ms SMT Verify possible using state equation in real domain returned unsat :1 sat :6 real:15
[2023-03-18 22:57:00] [INFO ] After 9085ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0 real:21
[2023-03-18 22:57:00] [INFO ] After 12720ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:21
[2023-03-18 22:57:02] [INFO ] [Nat]Absence check using 121 positive place invariants in 175 ms returned sat
[2023-03-18 22:57:02] [INFO ] [Nat]Absence check using 121 positive and 100 generalized place invariants in 87 ms returned sat
[2023-03-18 22:57:10] [INFO ] After 6386ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :20
[2023-03-18 22:57:16] [INFO ] After 13119ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :20
Attempting to minimize the solution found.
Minimization took 4879 ms.
[2023-03-18 22:57:21] [INFO ] After 21202ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :20
Fused 22 Parikh solutions to 19 different solutions.
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 20 properties in 104 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100020-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 22:57:22] [INFO ] Flatten gal took : 238 ms
[2023-03-18 22:57:22] [INFO ] Flatten gal took : 198 ms
[2023-03-18 22:57:22] [INFO ] Input system was already deterministic with 4200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 211 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 214 ms. Remains : 2421/2421 places, 4200/4200 transitions.
[2023-03-18 22:57:23] [INFO ] Flatten gal took : 131 ms
[2023-03-18 22:57:23] [INFO ] Flatten gal took : 143 ms
[2023-03-18 22:57:23] [INFO ] Input system was already deterministic with 4200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1908 transitions
Trivial Post-agglo rules discarded 1908 transitions
Performed 1908 trivial Post agglomeration. Transition count delta: 1908
Iterating post reduction 0 with 1908 rules applied. Total rules applied 1908 place count 2421 transition count 2292
Reduce places removed 1908 places and 0 transitions.
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Iterating post reduction 1 with 1988 rules applied. Total rules applied 3896 place count 513 transition count 2212
Reduce places removed 91 places and 0 transitions.
Ensure Unique test removed 1000 transitions
Reduce isomorphic transitions removed 1000 transitions.
Iterating post reduction 2 with 1091 rules applied. Total rules applied 4987 place count 422 transition count 1212
Drop transitions removed 888 transitions
Redundant transition composition rules discarded 888 transitions
Iterating global reduction 3 with 888 rules applied. Total rules applied 5875 place count 422 transition count 324
Discarding 87 places :
Implicit places reduction removed 87 places
Drop transitions removed 166 transitions
Trivial Post-agglo rules discarded 166 transitions
Performed 166 trivial Post agglomeration. Transition count delta: 166
Iterating post reduction 3 with 253 rules applied. Total rules applied 6128 place count 335 transition count 158
Reduce places removed 249 places and 0 transitions.
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 4 with 335 rules applied. Total rules applied 6463 place count 86 transition count 72
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 6467 place count 82 transition count 72
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 6467 place count 82 transition count 71
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 6470 place count 80 transition count 71
Applied a total of 6470 rules in 143 ms. Remains 80 /2421 variables (removed 2341) and now considering 71/4200 (removed 4129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 145 ms. Remains : 80/2421 places, 71/4200 transitions.
[2023-03-18 22:57:23] [INFO ] Flatten gal took : 3 ms
[2023-03-18 22:57:23] [INFO ] Flatten gal took : 2 ms
[2023-03-18 22:57:23] [INFO ] Input system was already deterministic with 71 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1993 transitions
Trivial Post-agglo rules discarded 1993 transitions
Performed 1993 trivial Post agglomeration. Transition count delta: 1993
Iterating post reduction 0 with 1993 rules applied. Total rules applied 1993 place count 2421 transition count 2207
Reduce places removed 2008 places and 0 transitions.
Ensure Unique test removed 1400 transitions
Reduce isomorphic transitions removed 1400 transitions.
Iterating post reduction 1 with 3408 rules applied. Total rules applied 5401 place count 413 transition count 807
Drop transitions removed 493 transitions
Redundant transition composition rules discarded 493 transitions
Iterating global reduction 2 with 493 rules applied. Total rules applied 5894 place count 413 transition count 314
Discarding 93 places :
Implicit places reduction removed 93 places
Drop transitions removed 186 transitions
Trivial Post-agglo rules discarded 186 transitions
Performed 186 trivial Post agglomeration. Transition count delta: 186
Iterating post reduction 2 with 279 rules applied. Total rules applied 6173 place count 320 transition count 128
Reduce places removed 279 places and 0 transitions.
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 3 with 371 rules applied. Total rules applied 6544 place count 41 transition count 36
Applied a total of 6544 rules in 71 ms. Remains 41 /2421 variables (removed 2380) and now considering 36/4200 (removed 4164) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 41/2421 places, 36/4200 transitions.
[2023-03-18 22:57:23] [INFO ] Flatten gal took : 2 ms
[2023-03-18 22:57:23] [INFO ] Flatten gal took : 2 ms
[2023-03-18 22:57:23] [INFO ] Input system was already deterministic with 36 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 363 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 370 ms. Remains : 2421/2421 places, 4200/4200 transitions.
[2023-03-18 22:57:24] [INFO ] Flatten gal took : 119 ms
[2023-03-18 22:57:24] [INFO ] Flatten gal took : 138 ms
[2023-03-18 22:57:24] [INFO ] Input system was already deterministic with 4200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 177 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 178 ms. Remains : 2421/2421 places, 4200/4200 transitions.
[2023-03-18 22:57:25] [INFO ] Flatten gal took : 106 ms
[2023-03-18 22:57:25] [INFO ] Flatten gal took : 120 ms
[2023-03-18 22:57:25] [INFO ] Input system was already deterministic with 4200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1999 transitions
Trivial Post-agglo rules discarded 1999 transitions
Performed 1999 trivial Post agglomeration. Transition count delta: 1999
Iterating post reduction 0 with 1999 rules applied. Total rules applied 1999 place count 2421 transition count 2201
Reduce places removed 2018 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 1 with 3818 rules applied. Total rules applied 5817 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 5916 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 6213 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 6608 place count 7 transition count 6
Applied a total of 6608 rules in 51 ms. Remains 7 /2421 variables (removed 2414) and now considering 6/4200 (removed 4194) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 7/2421 places, 6/4200 transitions.
[2023-03-18 22:57:25] [INFO ] Flatten gal took : 1 ms
[2023-03-18 22:57:25] [INFO ] Flatten gal took : 1 ms
[2023-03-18 22:57:25] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 178 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 2421/2421 places, 4200/4200 transitions.
[2023-03-18 22:57:25] [INFO ] Flatten gal took : 104 ms
[2023-03-18 22:57:25] [INFO ] Flatten gal took : 112 ms
[2023-03-18 22:57:26] [INFO ] Input system was already deterministic with 4200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 175 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 176 ms. Remains : 2421/2421 places, 4200/4200 transitions.
[2023-03-18 22:57:26] [INFO ] Flatten gal took : 102 ms
[2023-03-18 22:57:26] [INFO ] Flatten gal took : 106 ms
[2023-03-18 22:57:26] [INFO ] Input system was already deterministic with 4200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 198 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 200 ms. Remains : 2421/2421 places, 4200/4200 transitions.
[2023-03-18 22:57:27] [INFO ] Flatten gal took : 140 ms
[2023-03-18 22:57:27] [INFO ] Flatten gal took : 152 ms
[2023-03-18 22:57:27] [INFO ] Input system was already deterministic with 4200 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 174 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 2421/2421 places, 4200/4200 transitions.
[2023-03-18 22:57:27] [INFO ] Flatten gal took : 96 ms
[2023-03-18 22:57:27] [INFO ] Flatten gal took : 109 ms
[2023-03-18 22:57:28] [INFO ] Input system was already deterministic with 4200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1991 transitions
Trivial Post-agglo rules discarded 1991 transitions
Performed 1991 trivial Post agglomeration. Transition count delta: 1991
Iterating post reduction 0 with 1991 rules applied. Total rules applied 1991 place count 2421 transition count 2209
Reduce places removed 2004 places and 0 transitions.
Ensure Unique test removed 1200 transitions
Reduce isomorphic transitions removed 1200 transitions.
Iterating post reduction 1 with 3204 rules applied. Total rules applied 5195 place count 417 transition count 1009
Drop transitions removed 691 transitions
Redundant transition composition rules discarded 691 transitions
Iterating global reduction 2 with 691 rules applied. Total rules applied 5886 place count 417 transition count 318
Discarding 92 places :
Implicit places reduction removed 92 places
Drop transitions removed 184 transitions
Trivial Post-agglo rules discarded 184 transitions
Performed 184 trivial Post agglomeration. Transition count delta: 184
Iterating post reduction 2 with 276 rules applied. Total rules applied 6162 place count 325 transition count 134
Reduce places removed 276 places and 0 transitions.
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Iterating post reduction 3 with 367 rules applied. Total rules applied 6529 place count 49 transition count 43
Applied a total of 6529 rules in 52 ms. Remains 49 /2421 variables (removed 2372) and now considering 43/4200 (removed 4157) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 49/2421 places, 43/4200 transitions.
[2023-03-18 22:57:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 22:57:28] [INFO ] Flatten gal took : 2 ms
[2023-03-18 22:57:28] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 187 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 2421/2421 places, 4200/4200 transitions.
[2023-03-18 22:57:28] [INFO ] Flatten gal took : 103 ms
[2023-03-18 22:57:28] [INFO ] Flatten gal took : 112 ms
[2023-03-18 22:57:28] [INFO ] Input system was already deterministic with 4200 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Drop transitions removed 1996 transitions
Trivial Post-agglo rules discarded 1996 transitions
Performed 1996 trivial Post agglomeration. Transition count delta: 1996
Iterating post reduction 0 with 1996 rules applied. Total rules applied 1996 place count 2421 transition count 2204
Reduce places removed 2013 places and 0 transitions.
Ensure Unique test removed 1600 transitions
Reduce isomorphic transitions removed 1600 transitions.
Iterating post reduction 1 with 3613 rules applied. Total rules applied 5609 place count 408 transition count 604
Drop transitions removed 296 transitions
Redundant transition composition rules discarded 296 transitions
Iterating global reduction 2 with 296 rules applied. Total rules applied 5905 place count 408 transition count 308
Discarding 96 places :
Implicit places reduction removed 96 places
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 2 with 288 rules applied. Total rules applied 6193 place count 312 transition count 116
Reduce places removed 288 places and 0 transitions.
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Iterating post reduction 3 with 383 rules applied. Total rules applied 6576 place count 24 transition count 21
Applied a total of 6576 rules in 48 ms. Remains 24 /2421 variables (removed 2397) and now considering 21/4200 (removed 4179) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 24/2421 places, 21/4200 transitions.
[2023-03-18 22:57:28] [INFO ] Flatten gal took : 0 ms
[2023-03-18 22:57:28] [INFO ] Flatten gal took : 1 ms
[2023-03-18 22:57:28] [INFO ] Input system was already deterministic with 21 transitions.
[2023-03-18 22:57:29] [INFO ] Flatten gal took : 108 ms
[2023-03-18 22:57:29] [INFO ] Flatten gal took : 110 ms
[2023-03-18 22:57:29] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2023-03-18 22:57:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2421 places, 4200 transitions and 12800 arcs took 25 ms.
Total runtime 53352 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: 2421 NrTr: 4200 NrArc: 12800)

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

net check time: 0m 0.002sec

init dd package: 0m 3.243sec


RS generation: 23m 5.166sec


-> reachability set: #nodes 240363 (2.4e+05) #states 2,201 (3)



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

checking: AF [[p1048<=1 & 1<=p1048]]
normalized: ~ [EG [~ [[p1048<=1 & 1<=p1048]]]]

abstracting: (1<=p1048)
states: 1
abstracting: (p1048<=1)
states: 2,201 (3)
MC time: 2m50.022sec

checking: EF [AX [[[p1687<=0 & 0<=p1687] & [p946<=1 & 1<=p946]]]]
normalized: E [true U ~ [EX [~ [[[p946<=1 & 1<=p946] & [p1687<=0 & 0<=p1687]]]]]]

abstracting: (0<=p1687)
states: 2,201 (3)
abstracting: (p1687<=0)
states: 2,200 (3)
abstracting: (1<=p946)
states: 1
abstracting: (p946<=1)
states: 2,201 (3)
.-> the formula is FALSE

FORMULA ServersAndClients-PT-100020-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m40.337sec

checking: EF [AG [E [[[p961<=0 & 0<=p961] | [p745<=1 & 1<=p745]] U ~ [A [[p913<=0 & 0<=p913] U [p1028<=1 & 1<=p1028]]]]]]
normalized: E [true U ~ [E [true U ~ [E [[[p745<=1 & 1<=p745] | [p961<=0 & 0<=p961]] U ~ [[~ [E [~ [[p1028<=1 & 1<=p1028]] U [~ [[p913<=0 & 0<=p913]] & ~ [[p1028<=1 & 1<=p1028]]]]] & ~ [EG [~ [[p1028<=1 & 1<=p1028]]]]]]]]]]]

abstracting: (1<=p1028)
states: 1
abstracting: (p1028<=1)
states: 2,201 (3)
.
EG iterations: 1
abstracting: (1<=p1028)
states: 1
abstracting: (p1028<=1)
states: 2,201 (3)
abstracting: (0<=p913)
states: 2,201 (3)
abstracting: (p913<=0)
states: 2,200 (3)
abstracting: (1<=p1028)
states: 1
abstracting: (p1028<=1)
states: 2,201 (3)
MC time: 2m42.000sec

checking: AF [[AG [[AX [[p1443<=0 & 0<=p1443]] & E [[[p2121<=0 & 0<=p2121] | [p493<=1 & 1<=p493]] U [[p1218<=0 & 0<=p1218] | [p621<=1 & 1<=p621]]]]] & AF [[p2376<=0 & 0<=p2376]]]]
normalized: ~ [EG [~ [[~ [EG [~ [[p2376<=0 & 0<=p2376]]]] & ~ [E [true U ~ [[E [[[p493<=1 & 1<=p493] | [p2121<=0 & 0<=p2121]] U [[p621<=1 & 1<=p621] | [p1218<=0 & 0<=p1218]]] & ~ [EX [~ [[p1443<=0 & 0<=p1443]]]]]]]]]]]]

abstracting: (0<=p1443)
states: 2,201 (3)
abstracting: (p1443<=0)
states: 2,200 (3)
.abstracting: (0<=p1218)
states: 2,201 (3)
abstracting: (p1218<=0)
states: 2,200 (3)
abstracting: (1<=p621)
states: 1
abstracting: (p621<=1)
states: 2,201 (3)
abstracting: (0<=p2121)
states: 2,201 (3)
abstracting: (p2121<=0)
states: 2,200 (3)
abstracting: (1<=p493)
states: 1
abstracting: (p493<=1)
states: 2,201 (3)
MC time: 2m29.042sec

checking: A [[p1432<=1 & 1<=p1432] U [[p575<=0 & 0<=p575] & A [~ [AG [A [[[p531<=0 & 0<=p531] | [p1412<=1 & 1<=p1412]] U [[p646<=0 & 0<=p646] | [p2394<=1 & 1<=p2394]]]]] U EG [EF [[p1250<=0 & 0<=p1250]]]]]]
normalized: [~ [EG [~ [[[~ [EG [~ [EG [E [true U [p1250<=0 & 0<=p1250]]]]]] & ~ [E [~ [EG [E [true U [p1250<=0 & 0<=p1250]]]] U [~ [EG [E [true U [p1250<=0 & 0<=p1250]]]] & ~ [E [true U ~ [[~ [EG [~ [[[p2394<=1 & 1<=p2394] | [p646<=0 & 0<=p646]]]]] & ~ [E [~ [[[p2394<=1 & 1<=p2394] | [p646<=0 & 0<=p646]]] U [~ [[[p1412<=1 & 1<=p1412] | [p531<=0 & 0<=p531]]] & ~ [[[p2394<=1 & 1<=p2394] | [p646<=0 & 0<=p646]]]]]]]]]]]]]] & [p575<=0 & 0<=p575]]]]] & ~ [E [~ [[[~ [EG [~ [EG [E [true U [p1250<=0 & 0<=p1250]]]]]] & ~ [E [~ [EG [E [true U [p1250<=0 & 0<=p1250]]]] U [~ [EG [E [true U [p1250<=0 & 0<=p1250]]]] & ~ [E [true U ~ [[~ [EG [~ [[[p2394<=1 & 1<=p2394] | [p646<=0 & 0<=p646]]]]] & ~ [E [~ [[[p2394<=1 & 1<=p2394] | [p646<=0 & 0<=p646]]] U [~ [[[p1412<=1 & 1<=p1412] | [p531<=0 & 0<=p531]]] & ~ [[[p2394<=1 & 1<=p2394] | [p646<=0 & 0<=p646]]]]]]]]]]]]]] & [p575<=0 & 0<=p575]]] U [~ [[p1432<=1 & 1<=p1432]] & ~ [[[~ [EG [~ [EG [E [true U [p1250<=0 & 0<=p1250]]]]]] & ~ [E [~ [EG [E [true U [p1250<=0 & 0<=p1250]]]] U [~ [EG [E [true U [p1250<=0 & 0<=p1250]]]] & ~ [E [true U ~ [[~ [EG [~ [[[p2394<=1 & 1<=p2394] | [p646<=0 & 0<=p646]]]]] & ~ [E [~ [[[p2394<=1 & 1<=p2394] | [p646<=0 & 0<=p646]]] U [~ [[[p1412<=1 & 1<=p1412] | [p531<=0 & 0<=p531]]] & ~ [[[p2394<=1 & 1<=p2394] | [p646<=0 & 0<=p646]]]]]]]]]]]]]] & [p575<=0 & 0<=p575]]]]]]]

abstracting: (0<=p575)
states: 2,201 (3)
abstracting: (p575<=0)
states: 2,200 (3)
abstracting: (0<=p646)
states: 2,201 (3)
abstracting: (p646<=0)
states: 2,200 (3)
abstracting: (1<=p2394)
states: 1
abstracting: (p2394<=1)
states: 2,201 (3)
abstracting: (0<=p531)
states: 2,201 (3)
abstracting: (p531<=0)
states: 2,200 (3)
abstracting: (1<=p1412)
states: 1
abstracting: (p1412<=1)
states: 2,201 (3)
abstracting: (0<=p646)
states: 2,201 (3)
abstracting: (p646<=0)
states: 2,200 (3)
abstracting: (1<=p2394)
states: 1
abstracting: (p2394<=1)
states: 2,201 (3)
abstracting: (0<=p646)
states: 2,201 (3)
abstracting: (p646<=0)
states: 2,200 (3)
abstracting: (1<=p2394)
states: 1
abstracting: (p2394<=1)
states: 2,201 (3)
..
EG iterations: 2
abstracting: (0<=p1250)
states: 2,201 (3)
abstracting: (p1250<=0)
states: 2,200 (3)

EG iterations: 0
abstracting: (0<=p1250)
states: 2,201 (3)
abstracting: (p1250<=0)
states: 2,200 (3)

EG iterations: 0
abstracting: (0<=p1250)
states: 2,201 (3)
abstracting: (p1250<=0)
states: 2,200 (3)

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p1432)
states: 1
abstracting: (p1432<=1)
states: 2,201 (3)
abstracting: (0<=p575)
states: 2,201 (3)
abstracting: (p575<=0)
states: 2,200 (3)
abstracting: (0<=p646)
states: 2,201 (3)
abstracting: (p646<=0)
states: 2,200 (3)
abstracting: (1<=p2394)
states: 1
abstracting: (p2394<=1)
states: 2,201 (3)
abstracting: (0<=p531)
states: 2,201 (3)
abstracting: (p531<=0)
states: 2,200 (3)
abstracting: (1<=p1412)
states: 1
abstracting: (p1412<=1)
states: 2,201 (3)
abstracting: (0<=p646)
states: 2,201 (3)
abstracting: (p646<=0)
states: 2,200 (3)
abstracting: (1<=p2394)
states: 1
abstracting: (p2394<=1)
states: 2,201 (3)
abstracting: (0<=p646)
states: 2,201 (3)
abstracting: (p646<=0)
states: 2,200 (3)
abstracting: (1<=p2394)
states: 1
abstracting: (p2394<=1)
states: 2,201 (3)
..
EG iterations: 2
abstracting: (0<=p1250)
states: 2,201 (3)
abstracting: (p1250<=0)
states: 2,200 (3)

EG iterations: 0
abstracting: (0<=p1250)
states: 2,201 (3)
abstracting: (p1250<=0)
states: 2,200 (3)

EG iterations: 0
abstracting: (0<=p1250)
states: 2,201 (3)
abstracting: (p1250<=0)
states: 2,200 (3)

EG iterations: 0
.
EG iterations: 1
abstracting: (0<=p575)
states: 2,201 (3)
abstracting: (p575<=0)
states: 2,200 (3)
abstracting: (0<=p646)
states: 2,201 (3)
abstracting: (p646<=0)
states: 2,200 (3)
abstracting: (1<=p2394)
states: 1
abstracting: (p2394<=1)
states: 2,201 (3)
abstracting: (0<=p531)
states: 2,201 (3)
abstracting: (p531<=0)
states: 2,200 (3)
abstracting: (1<=p1412)
states: 1
abstracting: (p1412<=1)
states: 2,201 (3)
abstracting: (0<=p646)
states: 2,201 (3)
abstracting: (p646<=0)
states: 2,200 (3)
abstracting: (1<=p2394)
states: 1
abstracting: (p2394<=1)
states: 2,201 (3)
abstracting: (0<=p646)
states: 2,201 (3)
abstracting: (p646<=0)
states: 2,200 (3)
abstracting: (1<=p2394)
states: 1
abstracting: (p2394<=1)
states: 2,201 (3)
..
EG iterations: 2
abstracting: (0<=p1250)
states: 2,201 (3)
abstracting: (p1250<=0)
states: 2,200 (3)

EG iterations: 0
abstracting: (0<=p1250)
states: 2,201 (3)
abstracting: (p1250<=0)
states: 2,200 (3)

EG iterations: 0
abstracting: (0<=p1250)
states: 2,201 (3)
abstracting: (p1250<=0)
states: 2,200 (3)

EG iterations: 0
.
EG iterations: 1
..
EG iterations: 2
-> the formula is TRUE

FORMULA ServersAndClients-PT-100020-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m33.121sec

checking: AX [[A [EX [EF [[[p2092<=0 & 0<=p2092] | [p418<=1 & 1<=p418]]]] U ~ [AG [[p322<=1 & 1<=p322]]]] & E [EF [[[p2222<=0 & 0<=p2222] | [p223<=1 & 1<=p223]]] U ~ [[[[1<=p511 & p511<=1] | [p521<=0 & 0<=p521]] & ~ [[p572<=1 & 1<=p572]]]]]]]
normalized: ~ [EX [~ [[E [E [true U [[p223<=1 & 1<=p223] | [p2222<=0 & 0<=p2222]]] U ~ [[~ [[p572<=1 & 1<=p572]] & [[p521<=0 & 0<=p521] | [1<=p511 & p511<=1]]]]] & [~ [EG [~ [E [true U ~ [[p322<=1 & 1<=p322]]]]]] & ~ [E [~ [E [true U ~ [[p322<=1 & 1<=p322]]]] U [~ [EX [E [true U [[p418<=1 & 1<=p418] | [p2092<=0 & 0<=p2092]]]]] & ~ [E [true U ~ [[p322<=1 & 1<=p322]]]]]]]]]]]]

abstracting: (1<=p322)
states: 1
abstracting: (p322<=1)
states: 2,201 (3)
abstracting: (0<=p2092)
states: 2,201 (3)
abstracting: (p2092<=0)
states: 2,200 (3)
abstracting: (1<=p418)
states: 1
abstracting: (p418<=1)
states: 2,201 (3)
MC time: 2m20.049sec

checking: AG [E [[[EF [[[p1805<=0 & 0<=p1805] | [p1304<=1 & 1<=p1304]]] | EG [[p1030<=1 & 1<=p1030]]] | [AG [[p1065<=1 & 1<=p1065]] | [p633<=1 & 1<=p633]]] U [AG [A [[p1441<=1 & 1<=p1441] U [p935<=0 & 0<=p935]]] | [[p2026<=0 & 0<=p2026] | [p1071<=1 & 1<=p1071]]]]]
normalized: ~ [E [true U ~ [E [[[~ [E [true U ~ [[p1065<=1 & 1<=p1065]]]] | [p633<=1 & 1<=p633]] | [EG [[p1030<=1 & 1<=p1030]] | E [true U [[p1304<=1 & 1<=p1304] | [p1805<=0 & 0<=p1805]]]]] U [~ [E [true U ~ [[~ [E [~ [[p935<=0 & 0<=p935]] U [~ [[p935<=0 & 0<=p935]] & ~ [[p1441<=1 & 1<=p1441]]]]] & ~ [EG [~ [[p935<=0 & 0<=p935]]]]]]]] | [[p2026<=0 & 0<=p2026] | [p1071<=1 & 1<=p1071]]]]]]]

abstracting: (1<=p1071)
states: 1
abstracting: (p1071<=1)
states: 2,201 (3)
abstracting: (0<=p2026)
states: 2,201 (3)
abstracting: (p2026<=0)
states: 2,200 (3)
abstracting: (0<=p935)
states: 2,201 (3)
abstracting: (p935<=0)
states: 2,200 (3)
..
EG iterations: 2
abstracting: (1<=p1441)
states: 1
abstracting: (p1441<=1)
states: 2,201 (3)
abstracting: (0<=p935)
states: 2,201 (3)
abstracting: (p935<=0)
states: 2,200 (3)
abstracting: (0<=p935)
states: 2,201 (3)
abstracting: (p935<=0)
states: 2,200 (3)
MC time: 2m 7.000sec

checking: [EX [~ [A [A [~ [[p381<=1 & 1<=p381]] U AF [[p1614<=1 & 1<=p1614]]] U E [[[p971<=0 & 0<=p971] | [p1781<=1 & 1<=p1781]] U [p198<=0 & 0<=p198]]]]] & [EG [EF [AG [[p1032<=0 & 0<=p1032]]]] | AX [[[[p361<=0 & 0<=p361] | [p1961<=1 & 1<=p1961]] & EG [[~ [[p1284<=0 & 0<=p1284]] & ~ [[p892<=1 & 1<=p892]]]]]]]]
normalized: [EX [~ [[~ [EG [~ [E [[[p1781<=1 & 1<=p1781] | [p971<=0 & 0<=p971]] U [p198<=0 & 0<=p198]]]]] & ~ [E [~ [E [[[p1781<=1 & 1<=p1781] | [p971<=0 & 0<=p971]] U [p198<=0 & 0<=p198]]] U [~ [[~ [EG [EG [~ [[p1614<=1 & 1<=p1614]]]]] & ~ [E [EG [~ [[p1614<=1 & 1<=p1614]]] U [EG [~ [[p1614<=1 & 1<=p1614]]] & [p381<=1 & 1<=p381]]]]]] & ~ [E [[[p1781<=1 & 1<=p1781] | [p971<=0 & 0<=p971]] U [p198<=0 & 0<=p198]]]]]]]]] & [~ [EX [~ [[EG [[~ [[p892<=1 & 1<=p892]] & ~ [[p1284<=0 & 0<=p1284]]]] & [[p1961<=1 & 1<=p1961] | [p361<=0 & 0<=p361]]]]]] | EG [E [true U ~ [E [true U ~ [[p1032<=0 & 0<=p1032]]]]]]]]

abstracting: (0<=p1032)
states: 2,201 (3)
abstracting: (p1032<=0)
states: 2,200 (3)
MC time: 1m56.000sec

checking: E [A [AX [[~ [[1<=p1131 & p1131<=1]] & EF [[0<=p1473 & p1473<=0]]]] U ~ [EF [~ [[0<=p2104 & p2104<=0]]]]] U [E [AX [EX [[0<=p938 & p938<=0]]] U ~ [EF [[0<=p649 & p649<=0]]]] & [[[AX [[0<=p700 & p700<=0]] & AG [[[1<=p1246 & p1246<=1] & [[1<=p636 & p636<=1] | [0<=p1964 & p1964<=0]]]]] & [[1<=p942 & p942<=1] & EF [[1<=p2005 & p2005<=1]]]] | [p32<=0 & 0<=p32]]]]
normalized: E [[~ [EG [E [true U ~ [[0<=p2104 & p2104<=0]]]]] & ~ [E [E [true U ~ [[0<=p2104 & p2104<=0]]] U [EX [~ [[E [true U [0<=p1473 & p1473<=0]] & ~ [[1<=p1131 & p1131<=1]]]]] & E [true U ~ [[0<=p2104 & p2104<=0]]]]]]] U [E [~ [EX [~ [EX [[0<=p938 & p938<=0]]]]] U ~ [E [true U [0<=p649 & p649<=0]]]] & [[[E [true U [1<=p2005 & p2005<=1]] & [1<=p942 & p942<=1]] & [~ [E [true U ~ [[[[0<=p1964 & p1964<=0] | [1<=p636 & p636<=1]] & [1<=p1246 & p1246<=1]]]]] & ~ [EX [~ [[0<=p700 & p700<=0]]]]]] | [p32<=0 & 0<=p32]]]]

abstracting: (0<=p32)
states: 2,201 (3)
abstracting: (p32<=0)
states: 22
abstracting: (p700<=0)
states: 2,200 (3)
abstracting: (0<=p700)
states: 2,201 (3)
.abstracting: (p1246<=1)
states: 2,201 (3)
abstracting: (1<=p1246)
states: 1
abstracting: (p636<=1)
states: 2,201 (3)
abstracting: (1<=p636)
states: 1
abstracting: (p1964<=0)
states: 2,200 (3)
abstracting: (0<=p1964)
states: 2,201 (3)
MC time: 1m45.005sec

checking: AX [[EG [AG [[EX [0<=0] & [[[p575<=0 & 0<=p575] | [p124<=1 & 1<=p124]] & [p1900<=0 & 0<=p1900]]]]] | [EX [AX [[p152<=0 & 0<=p152]]] & [AG [[[[p687<=0 & 0<=p687] & [p2374<=1 & 1<=p2374]] | [p1253<=0 & 0<=p1253]]] | [[p1819<=0 & 0<=p1819] | [AX [[[p1348<=0 & 0<=p1348] | [p1187<=1 & 1<=p1187]]] & [[p1132<=0 & 0<=p1132] | [p1861<=1 & 1<=p1861]]]]]]]]
normalized: ~ [EX [~ [[[[[[~ [EX [~ [[[p1348<=0 & 0<=p1348] | [p1187<=1 & 1<=p1187]]]]] & [[p1861<=1 & 1<=p1861] | [p1132<=0 & 0<=p1132]]] | [p1819<=0 & 0<=p1819]] | ~ [E [true U ~ [[[p1253<=0 & 0<=p1253] | [[p2374<=1 & 1<=p2374] & [p687<=0 & 0<=p687]]]]]]] & EX [~ [EX [~ [[p152<=0 & 0<=p152]]]]]] | EG [~ [E [true U ~ [[[[p1900<=0 & 0<=p1900] & [[p124<=1 & 1<=p124] | [p575<=0 & 0<=p575]]] & EX [0<=0]]]]]]]]]]

abstracting: (0<=0)
states: 2,201 (3)
MC time: 1m36.005sec

checking: EG [[EF [[EX [[[0<=p1328 & p1328<=0] & [p1481<=1 & 1<=p1481]]] | [p1817<=1 & 1<=p1817]]] | [[AF [[[[[p1401<=0 & 0<=p1401] & [p1957<=1 & 1<=p1957]] | [[p1033<=0 & 0<=p1033] & [p1517<=1 & 1<=p1517]]] & EF [[p2124<=1 & 1<=p2124]]]] & EF [[p2019<=0 & 0<=p2019]]] & [AF [EG [[[p1558<=0 & 0<=p1558] | [p633<=1 & 1<=p633]]]] & [[p315<=0 & 0<=p315] | [[p870<=0 & 0<=p870] & [p1533<=1 & 1<=p1533]]]]]]]
normalized: EG [[[[[[[p1533<=1 & 1<=p1533] & [p870<=0 & 0<=p870]] | [p315<=0 & 0<=p315]] & ~ [EG [~ [EG [[[p633<=1 & 1<=p633] | [p1558<=0 & 0<=p1558]]]]]]] & [E [true U [p2019<=0 & 0<=p2019]] & ~ [EG [~ [[E [true U [p2124<=1 & 1<=p2124]] & [[[p1517<=1 & 1<=p1517] & [p1033<=0 & 0<=p1033]] | [[p1957<=1 & 1<=p1957] & [p1401<=0 & 0<=p1401]]]]]]]]] | E [true U [[p1817<=1 & 1<=p1817] | EX [[[p1481<=1 & 1<=p1481] & [0<=p1328 & p1328<=0]]]]]]]

abstracting: (p1328<=0)
states: 2,200 (3)
abstracting: (0<=p1328)
states: 2,201 (3)
abstracting: (1<=p1481)
states: 1
abstracting: (p1481<=1)
states: 2,201 (3)
.abstracting: (1<=p1817)
states: 1
abstracting: (p1817<=1)
states: 2,201 (3)
MC time: 1m26.999sec

checking: [AF [EG [A [[AF [[[p258<=0 & 0<=p258] | [p703<=1 & 1<=p703]]] & EF [[[p1164<=0 & 0<=p1164] | [p756<=1 & 1<=p756]]]] U [p524<=0 & 0<=p524]]]] & EG [[[[[[[p1212<=0 & 0<=p1212] | [p1273<=1 & 1<=p1273]] & EF [[p697<=1 & 1<=p697]]] | EF [[[p2053<=0 & 0<=p2053] & [p2210<=1 & 1<=p2210]]]] & [AF [[p1999<=1 & 1<=p1999]] & [p1632<=1 & 1<=p1632]]] | [EF [[AX [[p1156<=1 & 1<=p1156]] | A [[p672<=1 & 1<=p672] U [p1980<=1 & 1<=p1980]]]] | [p1562<=0 & 0<=p1562]]]]]
normalized: [EG [[[E [true U [[~ [EG [~ [[p1980<=1 & 1<=p1980]]]] & ~ [E [~ [[p1980<=1 & 1<=p1980]] U [~ [[p1980<=1 & 1<=p1980]] & ~ [[p672<=1 & 1<=p672]]]]]] | ~ [EX [~ [[p1156<=1 & 1<=p1156]]]]]] | [p1562<=0 & 0<=p1562]] | [[[p1632<=1 & 1<=p1632] & ~ [EG [~ [[p1999<=1 & 1<=p1999]]]]] & [E [true U [[p2210<=1 & 1<=p2210] & [p2053<=0 & 0<=p2053]]] | [E [true U [p697<=1 & 1<=p697]] & [[p1273<=1 & 1<=p1273] | [p1212<=0 & 0<=p1212]]]]]]] & ~ [EG [~ [EG [[~ [EG [~ [[p524<=0 & 0<=p524]]]] & ~ [E [~ [[p524<=0 & 0<=p524]] U [~ [[E [true U [[p756<=1 & 1<=p756] | [p1164<=0 & 0<=p1164]]] & ~ [EG [~ [[[p703<=1 & 1<=p703] | [p258<=0 & 0<=p258]]]]]]] & ~ [[p524<=0 & 0<=p524]]]]]]]]]]]

abstracting: (0<=p524)
states: 2,201 (3)
abstracting: (p524<=0)
states: 2,200 (3)
abstracting: (0<=p258)
states: 2,201 (3)
abstracting: (p258<=0)
states: 2,200 (3)
abstracting: (1<=p703)
states: 1
abstracting: (p703<=1)
states: 2,201 (3)
..
EG iterations: 2
abstracting: (0<=p1164)
states: 2,201 (3)
abstracting: (p1164<=0)
states: 2,200 (3)
abstracting: (1<=p756)
states: 1
abstracting: (p756<=1)
states: 2,201 (3)
MC time: 1m19.025sec

checking: A [[E [[p1681<=0 & 0<=p1681] U A [EF [[p2018<=0 & 0<=p2018]] U [[[p331<=1 & 1<=p331] | [0<=p381 & p381<=0]] & [p718<=0 & 0<=p718]]]] | [~ [A [[E [[[0<=p1065 & p1065<=0] | [1<=p951 & p951<=1]] U [p2114<=1 & 1<=p2114]] & [[1<=p1107 & p1107<=1] & [[p253<=0 & 0<=p253] | [p1173<=1 & 1<=p1173]]]] U E [[p2357<=0 & 0<=p2357] U [[p1252<=0 & 0<=p1252] | [p91<=1 & 1<=p91]]]]] & [[p239<=0 & 0<=p239] | [p1535<=1 & 1<=p1535]]]] U [p1519<=1 & 1<=p1519]]
normalized: [~ [EG [~ [[p1519<=1 & 1<=p1519]]]] & ~ [E [~ [[p1519<=1 & 1<=p1519]] U [~ [[[~ [[~ [EG [~ [E [[p2357<=0 & 0<=p2357] U [[p91<=1 & 1<=p91] | [p1252<=0 & 0<=p1252]]]]]] & ~ [E [~ [E [[p2357<=0 & 0<=p2357] U [[p91<=1 & 1<=p91] | [p1252<=0 & 0<=p1252]]]] U [~ [[[[[p253<=0 & 0<=p253] | [p1173<=1 & 1<=p1173]] & [1<=p1107 & p1107<=1]] & E [[[1<=p951 & p951<=1] | [0<=p1065 & p1065<=0]] U [p2114<=1 & 1<=p2114]]]] & ~ [E [[p2357<=0 & 0<=p2357] U [[p91<=1 & 1<=p91] | [p1252<=0 & 0<=p1252]]]]]]]]] & [[p1535<=1 & 1<=p1535] | [p239<=0 & 0<=p239]]] | E [[p1681<=0 & 0<=p1681] U [~ [EG [~ [[[p718<=0 & 0<=p718] & [[0<=p381 & p381<=0] | [p331<=1 & 1<=p331]]]]]] & ~ [E [~ [[[p718<=0 & 0<=p718] & [[0<=p381 & p381<=0] | [p331<=1 & 1<=p331]]]] U [~ [E [true U [p2018<=0 & 0<=p2018]]] & ~ [[[p718<=0 & 0<=p718] & [[0<=p381 & p381<=0] | [p331<=1 & 1<=p331]]]]]]]]]]] & ~ [[p1519<=1 & 1<=p1519]]]]]]

abstracting: (1<=p1519)
states: 1
abstracting: (p1519<=1)
states: 2,201 (3)
abstracting: (1<=p331)
states: 1
abstracting: (p331<=1)
states: 2,201 (3)
abstracting: (p381<=0)
states: 2,200 (3)
abstracting: (0<=p381)
states: 2,201 (3)
abstracting: (0<=p718)
states: 2,201 (3)
abstracting: (p718<=0)
states: 2,200 (3)
abstracting: (0<=p2018)
states: 2,201 (3)
abstracting: (p2018<=0)
states: 2,200 (3)
MC time: 1m12.020sec

checking: AF [[p1048<=1 & 1<=p1048]]
normalized: ~ [EG [~ [[p1048<=1 & 1<=p1048]]]]

abstracting: (1<=p1048)
states: 1
abstracting: (p1048<=1)
states: 2,201 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ServersAndClients-PT-100020-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m30.299sec

checking: EF [AG [E [[[p961<=0 & 0<=p961] | [p745<=1 & 1<=p745]] U ~ [A [[p913<=0 & 0<=p913] U [p1028<=1 & 1<=p1028]]]]]]
normalized: E [true U ~ [E [true U ~ [E [[[p745<=1 & 1<=p745] | [p961<=0 & 0<=p961]] U ~ [[~ [EG [~ [[p1028<=1 & 1<=p1028]]]] & ~ [E [~ [[p1028<=1 & 1<=p1028]] U [~ [[p913<=0 & 0<=p913]] & ~ [[p1028<=1 & 1<=p1028]]]]]]]]]]]]

abstracting: (1<=p1028)
states: 1
abstracting: (p1028<=1)
states: 2,201 (3)
abstracting: (0<=p913)
states: 2,201 (3)
abstracting: (p913<=0)
states: 2,200 (3)
abstracting: (1<=p1028)
states: 1
abstracting: (p1028<=1)
states: 2,201 (3)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9944292 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16092424 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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.039sec

64466 91622 113979 129456 142681 153167 156343 162936 165912 170654 174828 177162 180926 183425 186506 191689 192129 195244 200047 200627 203597 208461 208758 211393 216935 216963 218740 221845 225494 225997 228419 231625 234111 235138 237543
iterations count:3590420 (854), effective:2200 (0)

initing FirstDep: 0m 0.040sec


net_ddint.h:600: Timeout: after 169 sec

24480 38456
sat_reach.icc:155: Timeout: after 161 sec


sat_reach.icc:155: Timeout: after 148 sec


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

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

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

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

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

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

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

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

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

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

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

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

net_ddint.h:600: Timeout: after 139 sec


iterations count:4200 (1), effective:0 (0)
24904 38969
sat_reach.icc:155: Timeout: after 126 sec

24481 38456 50583
sat_reach.icc:155: Timeout: after 115 sec


sat_reach.icc:155: Timeout: after 104 sec


net_ddint.h:600: Timeout: after 95 sec

26669
sat_reach.icc:155: Timeout: after 86 sec


sat_reach.icc:155: Timeout: after 78 sec


sat_reach.icc:155: Timeout: after 71 sec

24480 38456 50598 65741 75034 87965 99628

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="ServersAndClients-PT-100020"
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 ServersAndClients-PT-100020, 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 r362-smll-167891812900457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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