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-167813695900529.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-11, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695900529
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 16:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 16:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:48 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.6K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 17K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:49 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 141K 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-11-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-11-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678731138858

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-11
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:12:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:12:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:12:20] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-13 18:12:20] [INFO ] Transformed 567 places.
[2023-03-13 18:12:20] [INFO ] Transformed 508 transitions.
[2023-03-13 18:12:20] [INFO ] Found NUPN structural information;
[2023-03-13 18:12:20] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 7 transitions.
Support contains 106 out of 560 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 560/560 places, 501/501 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 556 transition count 501
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 58 place count 502 transition count 447
Iterating global reduction 1 with 54 rules applied. Total rules applied 112 place count 502 transition count 447
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 132 place count 482 transition count 427
Iterating global reduction 1 with 20 rules applied. Total rules applied 152 place count 482 transition count 427
Applied a total of 152 rules in 117 ms. Remains 482 /560 variables (removed 78) and now considering 427/501 (removed 74) transitions.
// Phase 1: matrix 427 rows 482 cols
[2023-03-13 18:12:20] [INFO ] Computed 91 place invariants in 24 ms
[2023-03-13 18:12:21] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-13 18:12:21] [INFO ] Invariant cache hit.
[2023-03-13 18:12:21] [INFO ] Implicit Places using invariants and state equation in 480 ms returned []
Implicit Place search using SMT with State Equation took 835 ms to find 0 implicit places.
[2023-03-13 18:12:21] [INFO ] Invariant cache hit.
[2023-03-13 18:12:21] [INFO ] Dead Transitions using invariants and state equation in 249 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 482/560 places, 427/501 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1203 ms. Remains : 482/560 places, 427/501 transitions.
Support contains 106 out of 482 places after structural reductions.
[2023-03-13 18:12:22] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 18:12:22] [INFO ] Flatten gal took : 65 ms
[2023-03-13 18:12:22] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-11-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:12:22] [INFO ] Flatten gal took : 24 ms
[2023-03-13 18:12:22] [INFO ] Input system was already deterministic with 427 transitions.
Support contains 78 out of 482 places (down from 106) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 77 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 40) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) 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 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
[2023-03-13 18:12:22] [INFO ] Invariant cache hit.
[2023-03-13 18:12:23] [INFO ] After 293ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-13 18:12:23] [INFO ] [Nat]Absence check using 49 positive place invariants in 11 ms returned sat
[2023-03-13 18:12:23] [INFO ] [Nat]Absence check using 49 positive and 42 generalized place invariants in 9 ms returned sat
[2023-03-13 18:12:24] [INFO ] After 524ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-13 18:12:24] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 4 ms to minimize.
[2023-03-13 18:12:24] [INFO ] Deduced a trap composed of 113 places in 115 ms of which 0 ms to minimize.
[2023-03-13 18:12:24] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2023-03-13 18:12:24] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2023-03-13 18:12:24] [INFO ] Deduced a trap composed of 14 places in 99 ms of which 1 ms to minimize.
[2023-03-13 18:12:24] [INFO ] Deduced a trap composed of 65 places in 73 ms of which 1 ms to minimize.
[2023-03-13 18:12:25] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 0 ms to minimize.
[2023-03-13 18:12:25] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2023-03-13 18:12:25] [INFO ] Deduced a trap composed of 37 places in 65 ms of which 1 ms to minimize.
[2023-03-13 18:12:25] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 973 ms
[2023-03-13 18:12:25] [INFO ] Deduced a trap composed of 84 places in 139 ms of which 1 ms to minimize.
[2023-03-13 18:12:25] [INFO ] Deduced a trap composed of 84 places in 122 ms of which 0 ms to minimize.
[2023-03-13 18:12:25] [INFO ] Deduced a trap composed of 93 places in 111 ms of which 0 ms to minimize.
[2023-03-13 18:12:25] [INFO ] Deduced a trap composed of 94 places in 133 ms of which 1 ms to minimize.
[2023-03-13 18:12:26] [INFO ] Deduced a trap composed of 91 places in 121 ms of which 1 ms to minimize.
[2023-03-13 18:12:26] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 0 ms to minimize.
[2023-03-13 18:12:26] [INFO ] Deduced a trap composed of 87 places in 127 ms of which 0 ms to minimize.
[2023-03-13 18:12:26] [INFO ] Deduced a trap composed of 87 places in 141 ms of which 0 ms to minimize.
[2023-03-13 18:12:26] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1283 ms
[2023-03-13 18:12:26] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 0 ms to minimize.
[2023-03-13 18:12:26] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:12:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 232 ms
[2023-03-13 18:12:27] [INFO ] Deduced a trap composed of 86 places in 129 ms of which 2 ms to minimize.
[2023-03-13 18:12:27] [INFO ] Deduced a trap composed of 88 places in 143 ms of which 1 ms to minimize.
[2023-03-13 18:12:27] [INFO ] Deduced a trap composed of 96 places in 108 ms of which 0 ms to minimize.
[2023-03-13 18:12:27] [INFO ] Deduced a trap composed of 96 places in 102 ms of which 0 ms to minimize.
[2023-03-13 18:12:28] [INFO ] Deduced a trap composed of 103 places in 118 ms of which 1 ms to minimize.
[2023-03-13 18:12:28] [INFO ] Deduced a trap composed of 95 places in 110 ms of which 1 ms to minimize.
[2023-03-13 18:12:28] [INFO ] Deduced a trap composed of 93 places in 131 ms of which 1 ms to minimize.
[2023-03-13 18:12:28] [INFO ] Deduced a trap composed of 88 places in 137 ms of which 1 ms to minimize.
[2023-03-13 18:12:28] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 1 ms to minimize.
[2023-03-13 18:12:28] [INFO ] Deduced a trap composed of 94 places in 105 ms of which 1 ms to minimize.
[2023-03-13 18:12:29] [INFO ] Deduced a trap composed of 102 places in 101 ms of which 1 ms to minimize.
[2023-03-13 18:12:29] [INFO ] Deduced a trap composed of 95 places in 93 ms of which 0 ms to minimize.
[2023-03-13 18:12:29] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 1 ms to minimize.
[2023-03-13 18:12:29] [INFO ] Deduced a trap composed of 91 places in 102 ms of which 0 ms to minimize.
[2023-03-13 18:12:29] [INFO ] Deduced a trap composed of 91 places in 91 ms of which 1 ms to minimize.
[2023-03-13 18:12:29] [INFO ] Deduced a trap composed of 91 places in 94 ms of which 3 ms to minimize.
[2023-03-13 18:12:29] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 2360 ms
[2023-03-13 18:12:30] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2023-03-13 18:12:30] [INFO ] Deduced a trap composed of 56 places in 43 ms of which 0 ms to minimize.
[2023-03-13 18:12:30] [INFO ] Deduced a trap composed of 46 places in 38 ms of which 1 ms to minimize.
[2023-03-13 18:12:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 259 ms
[2023-03-13 18:12:30] [INFO ] After 6694ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 880 ms.
[2023-03-13 18:12:31] [INFO ] After 7958ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Fused 25 Parikh solutions to 24 different solutions.
Parikh walk visited 2 properties in 356 ms.
Support contains 44 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 201 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 7 ms
Free SCC test removed 5 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 1042 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 476 transition count 371
Reduce places removed 48 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 51 rules applied. Total rules applied 101 place count 428 transition count 368
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 425 transition count 368
Performed 82 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 82 Pre rules applied. Total rules applied 104 place count 425 transition count 286
Deduced a syphon composed of 82 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 176 rules applied. Total rules applied 280 place count 331 transition count 286
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 297 place count 314 transition count 269
Iterating global reduction 3 with 17 rules applied. Total rules applied 314 place count 314 transition count 269
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 314 place count 314 transition count 266
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 320 place count 311 transition count 266
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 1 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 498 place count 222 transition count 177
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 500 place count 221 transition count 181
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 502 place count 221 transition count 179
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 504 place count 219 transition count 179
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 508 place count 219 transition count 179
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 509 place count 218 transition count 178
Applied a total of 509 rules in 96 ms. Remains 218 /482 variables (removed 264) and now considering 178/427 (removed 249) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 218/482 places, 178/427 transitions.
Incomplete random walk after 10000 steps, including 260 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 96 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 178 rows 218 cols
[2023-03-13 18:12:32] [INFO ] Computed 79 place invariants in 6 ms
[2023-03-13 18:12:32] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 18:12:32] [INFO ] [Nat]Absence check using 49 positive place invariants in 6 ms returned sat
[2023-03-13 18:12:32] [INFO ] [Nat]Absence check using 49 positive and 30 generalized place invariants in 5 ms returned sat
[2023-03-13 18:12:32] [INFO ] After 89ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 18:12:32] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-13 18:12:32] [INFO ] After 40ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-13 18:12:32] [INFO ] Deduced a trap composed of 7 places in 62 ms of which 2 ms to minimize.
[2023-03-13 18:12:32] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2023-03-13 18:12:32] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-13 18:12:32] [INFO ] Deduced a trap composed of 6 places in 77 ms of which 0 ms to minimize.
[2023-03-13 18:12:32] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 0 ms to minimize.
[2023-03-13 18:12:32] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 466 ms
[2023-03-13 18:12:32] [INFO ] After 575ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-13 18:12:32] [INFO ] After 842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 2 properties in 6 ms.
Support contains 6 out of 218 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 218/218 places, 178/178 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 218 transition count 168
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 208 transition count 168
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 20 place count 208 transition count 157
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 48 place count 191 transition count 157
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 56 place count 183 transition count 149
Iterating global reduction 2 with 8 rules applied. Total rules applied 64 place count 183 transition count 149
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 33 rules applied. Total rules applied 97 place count 165 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -17
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 99 place count 164 transition count 151
Applied a total of 99 rules in 30 ms. Remains 164 /218 variables (removed 54) and now considering 151/178 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 164/218 places, 151/178 transitions.
Incomplete random walk after 10000 steps, including 362 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 115 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Probably explored full state space saw : 14389 states, properties seen :0
Probabilistic random walk after 51366 steps, saw 14389 distinct states, run finished after 197 ms. (steps per millisecond=260 ) properties seen :0
Explored full state space saw : 14389 states, properties seen :0
Exhaustive walk after 51366 steps, saw 14389 distinct states, run finished after 125 ms. (steps per millisecond=410 ) properties seen :0
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 19 ms
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 20 ms
[2023-03-13 18:12:33] [INFO ] Input system was already deterministic with 427 transitions.
Computed a total of 467 stabilizing places and 412 stable transitions
Graph (complete) has 1049 edges and 482 vertex of which 481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.12 ms
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 456 transition count 401
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 456 transition count 401
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 448 transition count 393
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 448 transition count 393
Applied a total of 68 rules in 22 ms. Remains 448 /482 variables (removed 34) and now considering 393/427 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 448/482 places, 393/427 transitions.
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 17 ms
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 17 ms
[2023-03-13 18:12:33] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 239 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 477 vertex of which 476 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 475 transition count 353
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 409 transition count 353
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 134 place count 409 transition count 260
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 338 place count 298 transition count 260
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 366 place count 270 transition count 232
Iterating global reduction 2 with 28 rules applied. Total rules applied 394 place count 270 transition count 232
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 394 place count 270 transition count 229
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 400 place count 267 transition count 229
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 609 place count 161 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 610 place count 160 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 611 place count 159 transition count 125
Applied a total of 611 rules in 46 ms. Remains 159 /482 variables (removed 323) and now considering 125/427 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 159/482 places, 125/427 transitions.
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:12:33] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 450 transition count 395
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 450 transition count 395
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 438 transition count 383
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 438 transition count 383
Applied a total of 88 rules in 21 ms. Remains 438 /482 variables (removed 44) and now considering 383/427 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 438/482 places, 383/427 transitions.
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:12:33] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 231 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 477 vertex of which 476 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 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 475 transition count 358
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 414 transition count 357
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 413 transition count 357
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 126 place count 413 transition count 264
Deduced a syphon composed of 93 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 3 with 203 rules applied. Total rules applied 329 place count 303 transition count 264
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 355 place count 277 transition count 238
Iterating global reduction 3 with 26 rules applied. Total rules applied 381 place count 277 transition count 238
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 381 place count 277 transition count 237
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 383 place count 276 transition count 237
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 582 place count 175 transition count 139
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 583 place count 174 transition count 138
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 584 place count 173 transition count 138
Applied a total of 584 rules in 43 ms. Remains 173 /482 variables (removed 309) and now considering 138/427 (removed 289) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 44 ms. Remains : 173/482 places, 138/427 transitions.
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:12:33] [INFO ] Input system was already deterministic with 138 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 239 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 477 vertex of which 476 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 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 475 transition count 354
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 410 transition count 353
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 409 transition count 353
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 134 place count 409 transition count 261
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 201 rules applied. Total rules applied 335 place count 300 transition count 261
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 364 place count 271 transition count 232
Iterating global reduction 3 with 29 rules applied. Total rules applied 393 place count 271 transition count 232
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 393 place count 271 transition count 229
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 399 place count 268 transition count 229
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 209 rules applied. Total rules applied 608 place count 162 transition count 126
Partial Post-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 614 place count 162 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 615 place count 161 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 616 place count 160 transition count 125
Applied a total of 616 rules in 46 ms. Remains 160 /482 variables (removed 322) and now considering 125/427 (removed 302) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 160/482 places, 125/427 transitions.
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:12:33] [INFO ] Input system was already deterministic with 125 transitions.
Incomplete random walk after 10000 steps, including 2054 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 603 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Finished probabilistic random walk after 527 steps, run visited all 1 properties in 6 ms. (steps per millisecond=87 )
Probabilistic random walk after 527 steps, saw 253 distinct states, run finished after 6 ms. (steps per millisecond=87 ) properties seen :1
FORMULA BusinessProcesses-PT-11-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 450 transition count 395
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 450 transition count 395
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 76 place count 438 transition count 383
Iterating global reduction 0 with 12 rules applied. Total rules applied 88 place count 438 transition count 383
Applied a total of 88 rules in 21 ms. Remains 438 /482 variables (removed 44) and now considering 383/427 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 438/482 places, 383/427 transitions.
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:12:33] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:12:33] [INFO ] Input system was already deterministic with 383 transitions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 452 transition count 397
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 452 transition count 397
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 71 place count 441 transition count 386
Iterating global reduction 0 with 11 rules applied. Total rules applied 82 place count 441 transition count 386
Applied a total of 82 rules in 25 ms. Remains 441 /482 variables (removed 41) and now considering 386/427 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 441/482 places, 386/427 transitions.
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:12:34] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 234 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 477 vertex of which 476 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 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 475 transition count 357
Reduce places removed 62 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 64 rules applied. Total rules applied 128 place count 413 transition count 355
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 411 transition count 355
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 130 place count 411 transition count 265
Deduced a syphon composed of 90 places in 4 ms
Ensure Unique test removed 16 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 326 place count 305 transition count 265
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 354 place count 277 transition count 237
Iterating global reduction 3 with 28 rules applied. Total rules applied 382 place count 277 transition count 237
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 382 place count 277 transition count 234
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 388 place count 274 transition count 234
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 105 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 595 place count 169 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 596 place count 168 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 597 place count 167 transition count 131
Applied a total of 597 rules in 41 ms. Remains 167 /482 variables (removed 315) and now considering 131/427 (removed 296) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 167/482 places, 131/427 transitions.
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:12:34] [INFO ] Input system was already deterministic with 131 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Graph (trivial) has 240 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1043 edges and 477 vertex of which 476 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 475 transition count 353
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 409 transition count 353
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 93 Pre rules applied. Total rules applied 134 place count 409 transition count 260
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 338 place count 298 transition count 260
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 368 place count 268 transition count 230
Iterating global reduction 2 with 30 rules applied. Total rules applied 398 place count 268 transition count 230
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 398 place count 268 transition count 227
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 404 place count 265 transition count 227
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 613 place count 159 transition count 124
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 614 place count 158 transition count 123
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 615 place count 157 transition count 123
Applied a total of 615 rules in 34 ms. Remains 157 /482 variables (removed 325) and now considering 123/427 (removed 304) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 34 ms. Remains : 157/482 places, 123/427 transitions.
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:12:34] [INFO ] Input system was already deterministic with 123 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
FORMULA BusinessProcesses-PT-11-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 452 transition count 397
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 452 transition count 397
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 70 place count 442 transition count 387
Iterating global reduction 0 with 10 rules applied. Total rules applied 80 place count 442 transition count 387
Applied a total of 80 rules in 42 ms. Remains 442 /482 variables (removed 40) and now considering 387/427 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 442/482 places, 387/427 transitions.
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:12:34] [INFO ] Input system was already deterministic with 387 transitions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 451 transition count 396
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 451 transition count 396
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 439 transition count 384
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 439 transition count 384
Applied a total of 86 rules in 43 ms. Remains 439 /482 variables (removed 43) and now considering 384/427 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 439/482 places, 384/427 transitions.
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:12:34] [INFO ] Input system was already deterministic with 384 transitions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 453 transition count 398
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 453 transition count 398
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 70 place count 441 transition count 386
Iterating global reduction 0 with 12 rules applied. Total rules applied 82 place count 441 transition count 386
Applied a total of 82 rules in 40 ms. Remains 441 /482 variables (removed 41) and now considering 386/427 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 441/482 places, 386/427 transitions.
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:12:34] [INFO ] Input system was already deterministic with 386 transitions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 427/427 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 454 transition count 399
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 454 transition count 399
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 67 place count 443 transition count 388
Iterating global reduction 0 with 11 rules applied. Total rules applied 78 place count 443 transition count 388
Applied a total of 78 rules in 40 ms. Remains 443 /482 variables (removed 39) and now considering 388/427 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 443/482 places, 388/427 transitions.
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:12:34] [INFO ] Input system was already deterministic with 388 transitions.
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:12:34] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:12:34] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 18:12:34] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 482 places, 427 transitions and 1346 arcs took 3 ms.
Total runtime 14086 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: 482 NrTr: 427 NrArc: 1346)

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

net check time: 0m 0.000sec

init dd package: 0m 3.045sec


before gc: list nodes free: 166872

after gc: idd nodes used:40579999, unused:23420001; list nodes free:95991315

RS generation: 48m43.497sec


-> last computed set: #nodes 40579914 (4.1e+07) #states 48,331,140,713 (10)


CANNOT_COMPUTE


BK_STOP 1678734117145

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.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-11"
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-11, 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-167813695900529"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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