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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9914.340 2775931.00 2817881.00 638.40 ????T?????TT???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-167813695800482.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-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800482
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 25 16:45 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.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 16:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K Feb 25 16:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:38 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 85K 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-05-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678727990129

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:19:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 17:19:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:19:51] [INFO ] Load time of PNML (sax parser for PT used): 60 ms
[2023-03-13 17:19:51] [INFO ] Transformed 368 places.
[2023-03-13 17:19:51] [INFO ] Transformed 319 transitions.
[2023-03-13 17:19:51] [INFO ] Found NUPN structural information;
[2023-03-13 17:19:51] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 1 transitions.
Support contains 106 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 37 place count 330 transition count 283
Iterating global reduction 1 with 35 rules applied. Total rules applied 72 place count 330 transition count 283
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 90 place count 312 transition count 265
Iterating global reduction 1 with 18 rules applied. Total rules applied 108 place count 312 transition count 265
Applied a total of 108 rules in 60 ms. Remains 312 /367 variables (removed 55) and now considering 265/318 (removed 53) transitions.
// Phase 1: matrix 265 rows 312 cols
[2023-03-13 17:19:52] [INFO ] Computed 55 place invariants in 19 ms
[2023-03-13 17:19:52] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-13 17:19:52] [INFO ] Invariant cache hit.
[2023-03-13 17:19:52] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-13 17:19:52] [INFO ] Invariant cache hit.
[2023-03-13 17:19:52] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 312/367 places, 265/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 688 ms. Remains : 312/367 places, 265/318 transitions.
Support contains 106 out of 312 places after structural reductions.
[2023-03-13 17:19:52] [INFO ] Flatten gal took : 43 ms
[2023-03-13 17:19:52] [INFO ] Flatten gal took : 18 ms
[2023-03-13 17:19:52] [INFO ] Input system was already deterministic with 265 transitions.
Support contains 104 out of 312 places (down from 106) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 91 resets, run finished after 578 ms. (steps per millisecond=17 ) properties (out of 72) seen :53
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) 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 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Running SMT prover for 19 properties.
[2023-03-13 17:19:53] [INFO ] Invariant cache hit.
[2023-03-13 17:19:53] [INFO ] [Real]Absence check using 55 positive place invariants in 11 ms returned sat
[2023-03-13 17:19:54] [INFO ] After 214ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2 real:15
[2023-03-13 17:19:54] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 7 ms to minimize.
[2023-03-13 17:19:54] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 0 ms to minimize.
[2023-03-13 17:19:54] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-13 17:19:54] [INFO ] Deduced a trap composed of 23 places in 44 ms of which 1 ms to minimize.
[2023-03-13 17:19:54] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 345 ms
[2023-03-13 17:19:54] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2023-03-13 17:19:54] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 1 ms to minimize.
[2023-03-13 17:19:54] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 0 ms to minimize.
[2023-03-13 17:19:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 359 ms
[2023-03-13 17:19:54] [INFO ] After 946ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-13 17:19:54] [INFO ] After 1192ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-13 17:19:55] [INFO ] [Nat]Absence check using 55 positive place invariants in 13 ms returned sat
[2023-03-13 17:19:55] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :15
[2023-03-13 17:19:55] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-13 17:19:55] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-13 17:19:55] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2023-03-13 17:19:56] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2023-03-13 17:19:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 402 ms
[2023-03-13 17:19:57] [INFO ] Deduced a trap composed of 27 places in 1005 ms of which 1 ms to minimize.
[2023-03-13 17:19:57] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 1 ms to minimize.
[2023-03-13 17:19:57] [INFO ] Deduced a trap composed of 36 places in 79 ms of which 1 ms to minimize.
[2023-03-13 17:19:57] [INFO ] Deduced a trap composed of 49 places in 77 ms of which 1 ms to minimize.
[2023-03-13 17:19:57] [INFO ] Deduced a trap composed of 22 places in 114 ms of which 1 ms to minimize.
[2023-03-13 17:19:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1531 ms
[2023-03-13 17:19:57] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 0 ms to minimize.
[2023-03-13 17:19:57] [INFO ] Deduced a trap composed of 14 places in 87 ms of which 1 ms to minimize.
[2023-03-13 17:19:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
[2023-03-13 17:19:58] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 0 ms to minimize.
[2023-03-13 17:19:58] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2023-03-13 17:19:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 251 ms
[2023-03-13 17:19:58] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2023-03-13 17:19:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2023-03-13 17:19:58] [INFO ] After 3569ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :13
Attempting to minimize the solution found.
Minimization took 767 ms.
[2023-03-13 17:19:59] [INFO ] After 4794ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :13
Fused 19 Parikh solutions to 13 different solutions.
Parikh walk visited 8 properties in 192 ms.
Support contains 8 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (complete) has 638 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 311 transition count 217
Reduce places removed 46 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 48 rules applied. Total rules applied 96 place count 265 transition count 215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 263 transition count 215
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 98 place count 263 transition count 155
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 231 place count 190 transition count 155
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 261 place count 160 transition count 125
Iterating global reduction 3 with 30 rules applied. Total rules applied 291 place count 160 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 293 place count 160 transition count 123
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 295 place count 159 transition count 122
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 5 with 134 rules applied. Total rules applied 429 place count 91 transition count 56
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 430 place count 90 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 431 place count 89 transition count 55
Applied a total of 431 rules in 78 ms. Remains 89 /312 variables (removed 223) and now considering 55/265 (removed 210) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 89/312 places, 55/265 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 55 rows 89 cols
[2023-03-13 17:20:00] [INFO ] Computed 40 place invariants in 1 ms
[2023-03-13 17:20:00] [INFO ] [Real]Absence check using 39 positive place invariants in 17 ms returned sat
[2023-03-13 17:20:00] [INFO ] [Real]Absence check using 39 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-13 17:20:00] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 17:20:00] [INFO ] After 39ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-13 17:20:00] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 1 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA BusinessProcesses-PT-05-CTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:20:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 21 ms
FORMULA BusinessProcesses-PT-05-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 17 ms
[2023-03-13 17:20:00] [INFO ] Input system was already deterministic with 265 transitions.
Computed a total of 304 stabilizing places and 254 stable transitions
Graph (complete) has 638 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 311 transition count 217
Reduce places removed 47 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 49 rules applied. Total rules applied 96 place count 264 transition count 215
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 262 transition count 215
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 59 Pre rules applied. Total rules applied 98 place count 262 transition count 156
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 131 rules applied. Total rules applied 229 place count 190 transition count 156
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 261 place count 158 transition count 124
Iterating global reduction 3 with 32 rules applied. Total rules applied 293 place count 158 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 295 place count 158 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 296 place count 157 transition count 122
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 296 place count 157 transition count 120
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 301 place count 154 transition count 120
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 5 with 136 rules applied. Total rules applied 437 place count 85 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 438 place count 85 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 439 place count 84 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 440 place count 83 transition count 51
Applied a total of 440 rules in 77 ms. Remains 83 /312 variables (removed 229) and now considering 51/265 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 83/312 places, 51/265 transitions.
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:20:00] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 287 transition count 240
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 287 transition count 239
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 61 place count 277 transition count 229
Iterating global reduction 1 with 10 rules applied. Total rules applied 71 place count 277 transition count 229
Applied a total of 71 rules in 34 ms. Remains 277 /312 variables (removed 35) and now considering 229/265 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 277/312 places, 229/265 transitions.
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 14 ms
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 13 ms
[2023-03-13 17:20:00] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (complete) has 638 edges and 312 vertex of which 311 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 310 transition count 219
Reduce places removed 44 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 47 rules applied. Total rules applied 92 place count 266 transition count 216
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 95 place count 263 transition count 216
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 95 place count 263 transition count 156
Deduced a syphon composed of 60 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 3 with 133 rules applied. Total rules applied 228 place count 190 transition count 156
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 259 place count 159 transition count 125
Iterating global reduction 3 with 31 rules applied. Total rules applied 290 place count 159 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 292 place count 159 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 293 place count 158 transition count 123
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 293 place count 158 transition count 121
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 5 rules applied. Total rules applied 298 place count 155 transition count 121
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 5 with 128 rules applied. Total rules applied 426 place count 90 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 427 place count 90 transition count 57
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 428 place count 89 transition count 56
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 429 place count 88 transition count 56
Applied a total of 429 rules in 76 ms. Remains 88 /312 variables (removed 224) and now considering 56/265 (removed 209) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 88/312 places, 56/265 transitions.
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 4 ms
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 5 ms
[2023-03-13 17:20:00] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 279 transition count 232
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 279 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 279 transition count 231
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 267 transition count 219
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 267 transition count 219
Applied a total of 91 rules in 24 ms. Remains 267 /312 variables (removed 45) and now considering 219/265 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 267/312 places, 219/265 transitions.
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:20:00] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (trivial) has 178 edges and 312 vertex of which 8 / 312 are part of one of the 1 SCC in 4 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 629 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 55 place count 303 transition count 201
Reduce places removed 53 places and 0 transitions.
Iterating post reduction 1 with 53 rules applied. Total rules applied 108 place count 250 transition count 201
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 108 place count 250 transition count 148
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 227 place count 184 transition count 148
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 257 place count 154 transition count 118
Iterating global reduction 2 with 30 rules applied. Total rules applied 287 place count 154 transition count 118
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 287 place count 154 transition count 116
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 292 place count 151 transition count 116
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 2 with 136 rules applied. Total rules applied 428 place count 82 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 81 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 431 place count 80 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 432 place count 79 transition count 47
Applied a total of 432 rules in 40 ms. Remains 79 /312 variables (removed 233) and now considering 47/265 (removed 218) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 79/312 places, 47/265 transitions.
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:20:00] [INFO ] Input system was already deterministic with 47 transitions.
Finished random walk after 251 steps, including 75 resets, run visited all 1 properties in 8 ms. (steps per millisecond=31 )
FORMULA BusinessProcesses-PT-05-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 287 transition count 240
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 287 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 51 place count 287 transition count 239
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 60 place count 278 transition count 230
Iterating global reduction 1 with 9 rules applied. Total rules applied 69 place count 278 transition count 230
Applied a total of 69 rules in 18 ms. Remains 278 /312 variables (removed 34) and now considering 230/265 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 278/312 places, 230/265 transitions.
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:20:00] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:20:00] [INFO ] Input system was already deterministic with 230 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 285 transition count 238
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 285 transition count 238
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 55 place count 285 transition count 237
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 275 transition count 227
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 275 transition count 227
Applied a total of 75 rules in 17 ms. Remains 275 /312 variables (removed 37) and now considering 227/265 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 275/312 places, 227/265 transitions.
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 18 ms
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 14 ms
[2023-03-13 17:20:01] [INFO ] Input system was already deterministic with 227 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (trivial) has 172 edges and 312 vertex of which 8 / 312 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 629 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 303 transition count 205
Reduce places removed 49 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 52 rules applied. Total rules applied 103 place count 254 transition count 202
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 106 place count 251 transition count 202
Performed 51 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 51 Pre rules applied. Total rules applied 106 place count 251 transition count 151
Deduced a syphon composed of 51 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 113 rules applied. Total rules applied 219 place count 189 transition count 151
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 249 place count 159 transition count 121
Iterating global reduction 3 with 30 rules applied. Total rules applied 279 place count 159 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 279 place count 159 transition count 119
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 284 place count 156 transition count 119
Performed 63 Post agglomeration using F-continuation condition.Transition count delta: 63
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 411 place count 92 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
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 413 place count 91 transition count 55
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 414 place count 90 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 89 transition count 54
Applied a total of 415 rules in 52 ms. Remains 89 /312 variables (removed 223) and now considering 54/265 (removed 211) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 89/312 places, 54/265 transitions.
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 2 ms
[2023-03-13 17:20:01] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 282 transition count 235
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 282 transition count 235
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 61 place count 282 transition count 234
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 72 place count 271 transition count 223
Iterating global reduction 1 with 11 rules applied. Total rules applied 83 place count 271 transition count 223
Applied a total of 83 rules in 17 ms. Remains 271 /312 variables (removed 41) and now considering 223/265 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 271/312 places, 223/265 transitions.
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 15 ms
[2023-03-13 17:20:01] [INFO ] Input system was already deterministic with 223 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 280 transition count 233
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 280 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 280 transition count 232
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 76 place count 269 transition count 221
Iterating global reduction 1 with 11 rules applied. Total rules applied 87 place count 269 transition count 221
Applied a total of 87 rules in 12 ms. Remains 269 /312 variables (removed 43) and now considering 221/265 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 269/312 places, 221/265 transitions.
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:20:01] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Graph (trivial) has 176 edges and 312 vertex of which 8 / 312 are part of one of the 1 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 629 edges and 305 vertex of which 304 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 54 place count 303 transition count 202
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 1 with 52 rules applied. Total rules applied 106 place count 251 transition count 202
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 106 place count 251 transition count 150
Deduced a syphon composed of 52 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 116 rules applied. Total rules applied 222 place count 187 transition count 150
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 253 place count 156 transition count 119
Iterating global reduction 2 with 31 rules applied. Total rules applied 284 place count 156 transition count 119
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 284 place count 156 transition count 117
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 289 place count 153 transition count 117
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 423 place count 85 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 425 place count 84 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 426 place count 83 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 427 place count 82 transition count 49
Applied a total of 427 rules in 24 ms. Remains 82 /312 variables (removed 230) and now considering 49/265 (removed 216) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 82/312 places, 49/265 transitions.
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 17:20:01] [INFO ] Input system was already deterministic with 49 transitions.
Finished random walk after 2181 steps, including 503 resets, run visited all 1 properties in 6 ms. (steps per millisecond=363 )
FORMULA BusinessProcesses-PT-05-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 279 transition count 232
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 279 transition count 232
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 67 place count 279 transition count 231
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 79 place count 267 transition count 219
Iterating global reduction 1 with 12 rules applied. Total rules applied 91 place count 267 transition count 219
Applied a total of 91 rules in 22 ms. Remains 267 /312 variables (removed 45) and now considering 219/265 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 267/312 places, 219/265 transitions.
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:20:01] [INFO ] Input system was already deterministic with 219 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 280 transition count 233
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 280 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 280 transition count 232
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 76 place count 269 transition count 221
Iterating global reduction 1 with 11 rules applied. Total rules applied 87 place count 269 transition count 221
Applied a total of 87 rules in 13 ms. Remains 269 /312 variables (removed 43) and now considering 221/265 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 269/312 places, 221/265 transitions.
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:20:01] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 312/312 places, 265/265 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 280 transition count 233
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 280 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 280 transition count 232
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 77 place count 268 transition count 220
Iterating global reduction 1 with 12 rules applied. Total rules applied 89 place count 268 transition count 220
Applied a total of 89 rules in 13 ms. Remains 268 /312 variables (removed 44) and now considering 220/265 (removed 45) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 268/312 places, 220/265 transitions.
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 8 ms
[2023-03-13 17:20:01] [INFO ] Input system was already deterministic with 220 transitions.
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 10 ms
[2023-03-13 17:20:01] [INFO ] Flatten gal took : 9 ms
[2023-03-13 17:20:01] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 17:20:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 312 places, 265 transitions and 744 arcs took 2 ms.
Total runtime 9667 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 312 NrTr: 265 NrArc: 744)

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

net check time: 0m 0.000sec

init dd package: 0m 3.216sec


before gc: list nodes free: 3728

after gc: idd nodes used:56377494, unused:7622506; list nodes free:32999061

before gc: list nodes free: 1422199

after gc: idd nodes used:62295243, unused:1704757; list nodes free:9114902

RS generation: 45m 8.955sec


-> last computed set: #nodes 62294933 (6.2e+07) #states 27,624,598,403 (10)


CANNOT_COMPUTE


BK_STOP 1678730766060

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

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-05"
export BK_EXAMINATION="CTLFireability"
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-05, examination is CTLFireability"
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-167813695800482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;