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

About the Execution of Marcie+red for BusinessProcesses-PT-18

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9848.508 1782066.00 1812368.00 359.80 ??T?F??T??T?F??? normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r042-tajo-167813696000585.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is BusinessProcesses-PT-18, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813696000585
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.3K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 177K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678734759737

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=BusinessProcesses-PT-18
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 19:12:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 19:12:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 19:12:41] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-13 19:12:41] [INFO ] Transformed 717 places.
[2023-03-13 19:12:41] [INFO ] Transformed 642 transitions.
[2023-03-13 19:12:41] [INFO ] Found NUPN structural information;
[2023-03-13 19:12:41] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 148 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 9 ms.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
Support contains 74 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 695 transition count 627
Discarding 91 places :
Symmetric choice reduction at 1 with 91 rule applications. Total rules 98 place count 604 transition count 536
Iterating global reduction 1 with 91 rules applied. Total rules applied 189 place count 604 transition count 536
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 190 place count 604 transition count 535
Discarding 44 places :
Symmetric choice reduction at 2 with 44 rule applications. Total rules 234 place count 560 transition count 491
Iterating global reduction 2 with 44 rules applied. Total rules applied 278 place count 560 transition count 491
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 279 place count 559 transition count 490
Iterating global reduction 2 with 1 rules applied. Total rules applied 280 place count 559 transition count 490
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 281 place count 558 transition count 489
Iterating global reduction 2 with 1 rules applied. Total rules applied 282 place count 558 transition count 489
Applied a total of 282 rules in 158 ms. Remains 558 /702 variables (removed 144) and now considering 489/627 (removed 138) transitions.
// Phase 1: matrix 489 rows 558 cols
[2023-03-13 19:12:42] [INFO ] Computed 107 place invariants in 39 ms
[2023-03-13 19:12:42] [INFO ] Implicit Places using invariants in 392 ms returned []
[2023-03-13 19:12:42] [INFO ] Invariant cache hit.
[2023-03-13 19:12:42] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-03-13 19:12:42] [INFO ] Invariant cache hit.
[2023-03-13 19:12:43] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 558/702 places, 489/627 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1317 ms. Remains : 558/702 places, 489/627 transitions.
Support contains 74 out of 558 places after structural reductions.
[2023-03-13 19:12:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 19:12:43] [INFO ] Flatten gal took : 65 ms
FORMULA BusinessProcesses-PT-18-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 19:12:43] [INFO ] Flatten gal took : 31 ms
[2023-03-13 19:12:43] [INFO ] Input system was already deterministic with 489 transitions.
Support contains 64 out of 558 places (down from 74) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 54 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 41) seen :17
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Running SMT prover for 24 properties.
[2023-03-13 19:12:44] [INFO ] Invariant cache hit.
[2023-03-13 19:12:44] [INFO ] After 230ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:24
[2023-03-13 19:12:44] [INFO ] [Nat]Absence check using 66 positive place invariants in 15 ms returned sat
[2023-03-13 19:12:44] [INFO ] [Nat]Absence check using 66 positive and 41 generalized place invariants in 8 ms returned sat
[2023-03-13 19:12:45] [INFO ] After 452ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :21
[2023-03-13 19:12:45] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 10 ms to minimize.
[2023-03-13 19:12:45] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2023-03-13 19:12:45] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 1 ms to minimize.
[2023-03-13 19:12:45] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 2 ms to minimize.
[2023-03-13 19:12:45] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2023-03-13 19:12:45] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2023-03-13 19:12:45] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 566 ms
[2023-03-13 19:12:45] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2023-03-13 19:12:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2023-03-13 19:12:46] [INFO ] Deduced a trap composed of 27 places in 166 ms of which 2 ms to minimize.
[2023-03-13 19:12:46] [INFO ] Deduced a trap composed of 27 places in 143 ms of which 1 ms to minimize.
[2023-03-13 19:12:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
[2023-03-13 19:12:46] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2023-03-13 19:12:46] [INFO ] Deduced a trap composed of 95 places in 268 ms of which 27 ms to minimize.
[2023-03-13 19:12:47] [INFO ] Deduced a trap composed of 105 places in 108 ms of which 1 ms to minimize.
[2023-03-13 19:12:47] [INFO ] Deduced a trap composed of 101 places in 116 ms of which 0 ms to minimize.
[2023-03-13 19:12:47] [INFO ] Deduced a trap composed of 100 places in 151 ms of which 0 ms to minimize.
[2023-03-13 19:12:47] [INFO ] Deduced a trap composed of 99 places in 97 ms of which 0 ms to minimize.
[2023-03-13 19:12:47] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 0 ms to minimize.
[2023-03-13 19:12:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1098 ms
[2023-03-13 19:12:47] [INFO ] Deduced a trap composed of 110 places in 177 ms of which 1 ms to minimize.
[2023-03-13 19:12:48] [INFO ] Deduced a trap composed of 112 places in 178 ms of which 0 ms to minimize.
[2023-03-13 19:12:48] [INFO ] Deduced a trap composed of 108 places in 109 ms of which 0 ms to minimize.
[2023-03-13 19:12:48] [INFO ] Deduced a trap composed of 107 places in 124 ms of which 0 ms to minimize.
[2023-03-13 19:12:48] [INFO ] Deduced a trap composed of 117 places in 116 ms of which 1 ms to minimize.
[2023-03-13 19:12:48] [INFO ] Deduced a trap composed of 105 places in 118 ms of which 1 ms to minimize.
[2023-03-13 19:12:48] [INFO ] Deduced a trap composed of 103 places in 116 ms of which 0 ms to minimize.
[2023-03-13 19:12:48] [INFO ] Deduced a trap composed of 101 places in 132 ms of which 1 ms to minimize.
[2023-03-13 19:12:49] [INFO ] Deduced a trap composed of 109 places in 121 ms of which 0 ms to minimize.
[2023-03-13 19:12:49] [INFO ] Deduced a trap composed of 105 places in 116 ms of which 1 ms to minimize.
[2023-03-13 19:12:49] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 1 ms to minimize.
[2023-03-13 19:12:49] [INFO ] Deduced a trap composed of 109 places in 142 ms of which 1 ms to minimize.
[2023-03-13 19:12:49] [INFO ] Deduced a trap composed of 122 places in 109 ms of which 0 ms to minimize.
[2023-03-13 19:12:49] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1997 ms
[2023-03-13 19:12:49] [INFO ] After 5181ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :21
Attempting to minimize the solution found.
Minimization took 363 ms.
[2023-03-13 19:12:50] [INFO ] After 5931ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :21
Fused 24 Parikh solutions to 21 different solutions.
Parikh walk visited 0 properties in 230 ms.
Support contains 32 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 489/489 transitions.
Graph (trivial) has 244 edges and 558 vertex of which 7 / 558 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1228 edges and 552 vertex of which 550 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 62 place count 550 transition count 420
Reduce places removed 60 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 490 transition count 419
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 124 place count 489 transition count 419
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 124 place count 489 transition count 319
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 343 place count 370 transition count 319
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 348 place count 365 transition count 314
Iterating global reduction 3 with 5 rules applied. Total rules applied 353 place count 365 transition count 314
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 9 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 635 place count 223 transition count 174
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 637 place count 222 transition count 177
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 638 place count 222 transition count 176
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 639 place count 221 transition count 176
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 642 place count 221 transition count 176
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 643 place count 220 transition count 175
Applied a total of 643 rules in 128 ms. Remains 220 /558 variables (removed 338) and now considering 175/489 (removed 314) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 220/558 places, 175/489 transitions.
Incomplete random walk after 10000 steps, including 402 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 21) seen :20
Finished Best-First random walk after 58 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-18-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 19:12:50] [INFO ] Flatten gal took : 33 ms
[2023-03-13 19:12:50] [INFO ] Flatten gal took : 40 ms
[2023-03-13 19:12:50] [INFO ] Input system was already deterministic with 489 transitions.
Computed a total of 498 stabilizing places and 439 stable transitions
Graph (complete) has 1242 edges and 558 vertex of which 556 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 557 transition count 489
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 16 place count 542 transition count 474
Iterating global reduction 1 with 15 rules applied. Total rules applied 31 place count 542 transition count 474
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 537 transition count 469
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 537 transition count 469
Applied a total of 41 rules in 25 ms. Remains 537 /558 variables (removed 21) and now considering 469/489 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 537/558 places, 469/489 transitions.
[2023-03-13 19:12:50] [INFO ] Flatten gal took : 17 ms
[2023-03-13 19:12:50] [INFO ] Flatten gal took : 17 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 469 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Graph (trivial) has 276 edges and 558 vertex of which 7 / 558 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1234 edges and 552 vertex of which 550 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 73 place count 549 transition count 409
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 144 place count 478 transition count 409
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 144 place count 478 transition count 295
Deduced a syphon composed of 114 places in 1 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 397 place count 339 transition count 295
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 413 place count 323 transition count 279
Iterating global reduction 2 with 16 rules applied. Total rules applied 429 place count 323 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 429 place count 323 transition count 278
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 432 place count 321 transition count 278
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 714 place count 179 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 715 place count 178 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 716 place count 177 transition count 137
Applied a total of 716 rules in 59 ms. Remains 177 /558 variables (removed 381) and now considering 137/489 (removed 352) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 177/558 places, 137/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 8 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 9 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 137 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Graph (trivial) has 275 edges and 558 vertex of which 7 / 558 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1234 edges and 552 vertex of which 550 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 549 transition count 410
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 142 place count 479 transition count 410
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 142 place count 479 transition count 296
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 253 rules applied. Total rules applied 395 place count 340 transition count 296
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 412 place count 323 transition count 279
Iterating global reduction 2 with 17 rules applied. Total rules applied 429 place count 323 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 429 place count 323 transition count 278
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 2 with 3 rules applied. Total rules applied 432 place count 321 transition count 278
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 141 places and 0 transitions.
Iterating global reduction 2 with 280 rules applied. Total rules applied 712 place count 180 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 713 place count 179 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 714 place count 178 transition count 138
Applied a total of 714 rules in 53 ms. Remains 178 /558 variables (removed 380) and now considering 138/489 (removed 351) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 178/558 places, 138/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 138 transitions.
Finished random walk after 177 steps, including 24 resets, run visited all 1 properties in 3 ms. (steps per millisecond=59 )
FORMULA BusinessProcesses-PT-18-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Graph (trivial) has 270 edges and 558 vertex of which 7 / 558 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1234 edges and 552 vertex of which 550 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 549 transition count 412
Reduce places removed 68 places and 0 transitions.
Iterating post reduction 1 with 68 rules applied. Total rules applied 138 place count 481 transition count 412
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 138 place count 481 transition count 300
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 247 rules applied. Total rules applied 385 place count 346 transition count 300
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 400 place count 331 transition count 285
Iterating global reduction 2 with 15 rules applied. Total rules applied 415 place count 331 transition count 285
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 282 rules applied. Total rules applied 697 place count 189 transition count 145
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 703 place count 189 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 704 place count 188 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 705 place count 187 transition count 144
Applied a total of 705 rules in 59 ms. Remains 187 /558 variables (removed 371) and now considering 144/489 (removed 345) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 187/558 places, 144/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 7 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 144 transitions.
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 557 transition count 489
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 539 transition count 471
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 539 transition count 471
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 532 transition count 464
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 532 transition count 464
Applied a total of 51 rules in 36 ms. Remains 532 /558 variables (removed 26) and now considering 464/489 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 532/558 places, 464/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 15 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 20 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 557 transition count 489
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 539 transition count 471
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 539 transition count 471
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 532 transition count 464
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 532 transition count 464
Applied a total of 51 rules in 34 ms. Remains 532 /558 variables (removed 26) and now considering 464/489 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 532/558 places, 464/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 14 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 464 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Graph (trivial) has 265 edges and 558 vertex of which 7 / 558 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1234 edges and 552 vertex of which 550 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 549 transition count 415
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 484 transition count 415
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 132 place count 484 transition count 303
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 135 places and 0 transitions.
Iterating global reduction 2 with 247 rules applied. Total rules applied 379 place count 349 transition count 303
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 391 place count 337 transition count 291
Iterating global reduction 2 with 12 rules applied. Total rules applied 403 place count 337 transition count 291
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 403 place count 337 transition count 290
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 2 with 3 rules applied. Total rules applied 406 place count 335 transition count 290
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 682 place count 196 transition count 153
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 683 place count 195 transition count 152
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 684 place count 194 transition count 152
Applied a total of 684 rules in 60 ms. Remains 194 /558 variables (removed 364) and now considering 152/489 (removed 337) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 194/558 places, 152/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 6 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 152 transitions.
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 557 transition count 489
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 539 transition count 471
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 539 transition count 471
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 43 place count 533 transition count 465
Iterating global reduction 1 with 6 rules applied. Total rules applied 49 place count 533 transition count 465
Applied a total of 49 rules in 39 ms. Remains 533 /558 variables (removed 25) and now considering 465/489 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 533/558 places, 465/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 13 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 465 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Graph (trivial) has 276 edges and 558 vertex of which 7 / 558 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1234 edges and 552 vertex of which 550 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 72 place count 549 transition count 410
Reduce places removed 70 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 71 rules applied. Total rules applied 143 place count 479 transition count 409
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 144 place count 478 transition count 409
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 144 place count 478 transition count 296
Deduced a syphon composed of 113 places in 1 ms
Ensure Unique test removed 24 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 250 rules applied. Total rules applied 394 place count 341 transition count 296
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 411 place count 324 transition count 279
Iterating global reduction 3 with 17 rules applied. Total rules applied 428 place count 324 transition count 279
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 428 place count 324 transition count 278
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 3 with 3 rules applied. Total rules applied 431 place count 322 transition count 278
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 3 with 282 rules applied. Total rules applied 713 place count 180 transition count 138
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 714 place count 179 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 715 place count 178 transition count 137
Applied a total of 715 rules in 41 ms. Remains 178 /558 variables (removed 380) and now considering 137/489 (removed 352) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 41 ms. Remains : 178/558 places, 137/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 5 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 137 transitions.
Finished random walk after 178 steps, including 25 resets, run visited all 1 properties in 3 ms. (steps per millisecond=59 )
FORMULA BusinessProcesses-PT-18-CTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 539 transition count 470
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 539 transition count 470
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 45 place count 532 transition count 463
Iterating global reduction 0 with 7 rules applied. Total rules applied 52 place count 532 transition count 463
Applied a total of 52 rules in 45 ms. Remains 532 /558 variables (removed 26) and now considering 463/489 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 532/558 places, 463/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:12:51] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 557 transition count 489
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 538 transition count 470
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 538 transition count 470
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 531 transition count 463
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 531 transition count 463
Applied a total of 53 rules in 43 ms. Remains 531 /558 variables (removed 27) and now considering 463/489 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 531/558 places, 463/489 transitions.
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:12:51] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:12:52] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 557 transition count 489
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 20 place count 538 transition count 470
Iterating global reduction 1 with 19 rules applied. Total rules applied 39 place count 538 transition count 470
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 46 place count 531 transition count 463
Iterating global reduction 1 with 7 rules applied. Total rules applied 53 place count 531 transition count 463
Applied a total of 53 rules in 37 ms. Remains 531 /558 variables (removed 27) and now considering 463/489 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 531/558 places, 463/489 transitions.
[2023-03-13 19:12:52] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:12:52] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:12:52] [INFO ] Input system was already deterministic with 463 transitions.
Starting structural reductions in LTL mode, iteration 0 : 558/558 places, 489/489 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 557 transition count 489
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 19 place count 539 transition count 471
Iterating global reduction 1 with 18 rules applied. Total rules applied 37 place count 539 transition count 471
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 532 transition count 464
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 532 transition count 464
Applied a total of 51 rules in 36 ms. Remains 532 /558 variables (removed 26) and now considering 464/489 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 532/558 places, 464/489 transitions.
[2023-03-13 19:12:52] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:12:52] [INFO ] Flatten gal took : 11 ms
[2023-03-13 19:12:52] [INFO ] Input system was already deterministic with 464 transitions.
[2023-03-13 19:12:52] [INFO ] Flatten gal took : 25 ms
[2023-03-13 19:12:52] [INFO ] Flatten gal took : 12 ms
[2023-03-13 19:12:52] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-13 19:12:52] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 558 places, 489 transitions and 1544 arcs took 2 ms.
Total runtime 10574 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: 558 NrTr: 489 NrArc: 1544)

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

net check time: 0m 0.000sec

init dd package: 0m 2.928sec


before gc: list nodes free: 1074821

after gc: idd nodes used:50335382, unused:13664618; list nodes free:58312494

RS generation: 28m54.537sec


-> last computed set: #nodes 50335298 (5.0e+07) #states 21,470,224,088 (10)


CANNOT_COMPUTE


BK_STOP 1678736541803

--------------------
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.001sec

idd.cc:820: DD Exception: No free nodes

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="BusinessProcesses-PT-18"
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 BusinessProcesses-PT-18, 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 r042-tajo-167813696000585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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