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.r041-tajo-167813694800489.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 ltsminxred
Input is BusinessProcesses-PT-06, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694800489
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 16:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 16:50 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:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 12K Feb 25 16:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 25 16:52 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-06-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-06-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678640277061

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=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:57:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:57:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:57:59] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-12 16:57:59] [INFO ] Transformed 376 places.
[2023-03-12 16:57:59] [INFO ] Transformed 297 transitions.
[2023-03-12 16:57:59] [INFO ] Found NUPN structural information;
[2023-03-12 16:57:59] [INFO ] Parsed PT model containing 376 places and 297 transitions and 830 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-06-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 87 out of 375 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 375/375 places, 296/296 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 373 transition count 296
Discarding 28 places :
Symmetric choice reduction at 1 with 28 rule applications. Total rules 30 place count 345 transition count 268
Iterating global reduction 1 with 28 rules applied. Total rules applied 58 place count 345 transition count 268
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 69 place count 334 transition count 257
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 334 transition count 257
Applied a total of 80 rules in 68 ms. Remains 334 /375 variables (removed 41) and now considering 257/296 (removed 39) transitions.
// Phase 1: matrix 257 rows 334 cols
[2023-03-12 16:57:59] [INFO ] Computed 79 place invariants in 20 ms
[2023-03-12 16:57:59] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-12 16:57:59] [INFO ] Invariant cache hit.
[2023-03-12 16:57:59] [INFO ] Implicit Places using invariants and state equation in 377 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
[2023-03-12 16:57:59] [INFO ] Invariant cache hit.
[2023-03-12 16:58:00] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 334/375 places, 257/296 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 986 ms. Remains : 334/375 places, 257/296 transitions.
Support contains 87 out of 334 places after structural reductions.
[2023-03-12 16:58:00] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-12 16:58:00] [INFO ] Flatten gal took : 48 ms
[2023-03-12 16:58:00] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-06-CTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-06-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:58:00] [INFO ] Flatten gal took : 20 ms
[2023-03-12 16:58:00] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 76 out of 334 places (down from 87) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 105 resets, run finished after 506 ms. (steps per millisecond=19 ) properties (out of 55) seen :45
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 10) seen :3
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 16:58:01] [INFO ] Invariant cache hit.
[2023-03-12 16:58:01] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:58:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 238 ms returned sat
[2023-03-12 16:58:02] [INFO ] [Nat]Absence check using 34 positive and 45 generalized place invariants in 299 ms returned sat
[2023-03-12 16:58:04] [INFO ] After 973ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :6
[2023-03-12 16:58:04] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 5 ms to minimize.
[2023-03-12 16:58:04] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 0 ms to minimize.
[2023-03-12 16:58:04] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
[2023-03-12 16:58:04] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 2 ms to minimize.
[2023-03-12 16:58:04] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2023-03-12 16:58:04] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 0 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Deduced a trap composed of 20 places in 56 ms of which 1 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 0 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1155 ms
[2023-03-12 16:58:05] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 213 ms
[2023-03-12 16:58:05] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2023-03-12 16:58:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 84 ms
[2023-03-12 16:58:05] [INFO ] After 2529ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :5
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-12 16:58:05] [INFO ] After 4075ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :5
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 1 properties in 86 ms.
Support contains 6 out of 334 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 148 edges and 334 vertex of which 6 / 334 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 640 edges and 329 vertex of which 328 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 328 transition count 211
Reduce places removed 37 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 78 place count 291 transition count 209
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 80 place count 289 transition count 209
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 80 place count 289 transition count 144
Deduced a syphon composed of 65 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 219 place count 215 transition count 144
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 236 place count 198 transition count 127
Iterating global reduction 3 with 17 rules applied. Total rules applied 253 place count 198 transition count 127
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 3 with 158 rules applied. Total rules applied 411 place count 115 transition count 52
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 412 place count 115 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 413 place count 114 transition count 51
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 414 place count 114 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 415 place count 113 transition count 50
Applied a total of 415 rules in 104 ms. Remains 113 /334 variables (removed 221) and now considering 50/257 (removed 207) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 104 ms. Remains : 113/334 places, 50/257 transitions.
Finished random walk after 47 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=23 )
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 25 ms
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 26 ms
[2023-03-12 16:58:06] [INFO ] Input system was already deterministic with 257 transitions.
Computed a total of 327 stabilizing places and 248 stable transitions
Graph (complete) has 647 edges and 334 vertex of which 333 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 315 transition count 238
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 309 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 309 transition count 232
Applied a total of 50 rules in 34 ms. Remains 309 /334 variables (removed 25) and now considering 232/257 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 309/334 places, 232/257 transitions.
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 10 ms
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 15 ms
[2023-03-12 16:58:06] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 315 transition count 238
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 309 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 309 transition count 232
Applied a total of 50 rules in 56 ms. Remains 309 /334 variables (removed 25) and now considering 232/257 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 309/334 places, 232/257 transitions.
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 11 ms
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:58:06] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 152 edges and 334 vertex of which 6 / 334 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 641 edges and 329 vertex of which 328 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 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 327 transition count 209
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 1 with 40 rules applied. Total rules applied 82 place count 287 transition count 209
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 82 place count 287 transition count 145
Deduced a syphon composed of 64 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 138 rules applied. Total rules applied 220 place count 213 transition count 145
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 238 place count 195 transition count 127
Iterating global reduction 2 with 18 rules applied. Total rules applied 256 place count 195 transition count 127
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 414 place count 112 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 415 place count 111 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 416 place count 110 transition count 51
Applied a total of 416 rules in 62 ms. Remains 110 /334 variables (removed 224) and now considering 51/257 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 110/334 places, 51/257 transitions.
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:58:06] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 323 transition count 246
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 323 transition count 246
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 320 transition count 243
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 320 transition count 243
Applied a total of 28 rules in 39 ms. Remains 320 /334 variables (removed 14) and now considering 243/257 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 320/334 places, 243/257 transitions.
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 9 ms
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:58:06] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 317 transition count 240
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 311 transition count 234
Applied a total of 46 rules in 21 ms. Remains 311 /334 variables (removed 23) and now considering 234/257 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 311/334 places, 234/257 transitions.
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 22 ms
[2023-03-12 16:58:06] [INFO ] Flatten gal took : 12 ms
[2023-03-12 16:58:06] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 152 edges and 334 vertex of which 6 / 334 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 641 edges and 329 vertex of which 328 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 327 transition count 208
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 286 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 285 transition count 207
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 86 place count 285 transition count 144
Deduced a syphon composed of 63 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 135 rules applied. Total rules applied 221 place count 213 transition count 144
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 239 place count 195 transition count 126
Iterating global reduction 3 with 18 rules applied. Total rules applied 257 place count 195 transition count 126
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 413 place count 113 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 414 place count 112 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 415 place count 111 transition count 51
Applied a total of 415 rules in 65 ms. Remains 111 /334 variables (removed 223) and now considering 51/257 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 111/334 places, 51/257 transitions.
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:58:07] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 156 edges and 334 vertex of which 6 / 334 are part of one of the 1 SCC in 10 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 641 edges and 329 vertex of which 328 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 327 transition count 208
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 286 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 285 transition count 207
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 86 place count 285 transition count 142
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 225 place count 211 transition count 142
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 244 place count 192 transition count 123
Iterating global reduction 3 with 19 rules applied. Total rules applied 263 place count 192 transition count 123
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 149 rules applied. Total rules applied 412 place count 117 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 413 place count 116 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 414 place count 115 transition count 48
Applied a total of 414 rules in 57 ms. Remains 115 /334 variables (removed 219) and now considering 48/257 (removed 209) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 115/334 places, 48/257 transitions.
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:58:07] [INFO ] Input system was already deterministic with 48 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 317 transition count 240
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 317 transition count 240
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 39 place count 312 transition count 235
Iterating global reduction 0 with 5 rules applied. Total rules applied 44 place count 312 transition count 235
Applied a total of 44 rules in 19 ms. Remains 312 /334 variables (removed 22) and now considering 235/257 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 312/334 places, 235/257 transitions.
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 24 ms
[2023-03-12 16:58:07] [INFO ] Input system was already deterministic with 235 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 317 transition count 240
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 317 transition count 240
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 40 place count 311 transition count 234
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 311 transition count 234
Applied a total of 46 rules in 21 ms. Remains 311 /334 variables (removed 23) and now considering 234/257 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 311/334 places, 234/257 transitions.
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:58:07] [INFO ] Input system was already deterministic with 234 transitions.
Starting structural reductions in LTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 315 transition count 238
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 315 transition count 238
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 309 transition count 232
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 309 transition count 232
Applied a total of 50 rules in 24 ms. Remains 309 /334 variables (removed 25) and now considering 232/257 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 309/334 places, 232/257 transitions.
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 21 ms
[2023-03-12 16:58:07] [INFO ] Input system was already deterministic with 232 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 334/334 places, 257/257 transitions.
Graph (trivial) has 155 edges and 334 vertex of which 6 / 334 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 641 edges and 329 vertex of which 328 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 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 327 transition count 208
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 286 transition count 207
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 285 transition count 207
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 86 place count 285 transition count 142
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 140 rules applied. Total rules applied 226 place count 210 transition count 142
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 244 place count 192 transition count 124
Iterating global reduction 3 with 18 rules applied. Total rules applied 262 place count 192 transition count 124
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 415 place count 113 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 416 place count 112 transition count 49
Applied a total of 416 rules in 42 ms. Remains 112 /334 variables (removed 222) and now considering 49/257 (removed 208) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 112/334 places, 49/257 transitions.
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:58:07] [INFO ] Input system was already deterministic with 49 transitions.
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:58:07] [INFO ] Flatten gal took : 8 ms
[2023-03-12 16:58:07] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-12 16:58:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 334 places, 257 transitions and 748 arcs took 2 ms.
Total runtime 8680 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/530/ctl_0_ --ctl=/tmp/530/ctl_1_ --ctl=/tmp/530/ctl_2_ --ctl=/tmp/530/ctl_3_ --ctl=/tmp/530/ctl_4_ --ctl=/tmp/530/ctl_5_ --ctl=/tmp/530/ctl_6_ --ctl=/tmp/530/ctl_7_ --ctl=/tmp/530/ctl_8_ --ctl=/tmp/530/ctl_9_ --ctl=/tmp/530/ctl_10_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 10643816 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16101104 kB
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-03
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-04
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-05
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-06
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-06-CTLCardinality-13

BK_STOP 1678643859304

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2023
ctl formula name BusinessProcesses-PT-06-CTLCardinality-00
ctl formula formula --ctl=/tmp/530/ctl_0_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-01
ctl formula formula --ctl=/tmp/530/ctl_1_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-02
ctl formula formula --ctl=/tmp/530/ctl_2_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-03
ctl formula formula --ctl=/tmp/530/ctl_3_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-04
ctl formula formula --ctl=/tmp/530/ctl_4_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-05
ctl formula formula --ctl=/tmp/530/ctl_5_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-06
ctl formula formula --ctl=/tmp/530/ctl_6_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-08
ctl formula formula --ctl=/tmp/530/ctl_7_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-10
ctl formula formula --ctl=/tmp/530/ctl_8_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-11
ctl formula formula --ctl=/tmp/530/ctl_9_
ctl formula name BusinessProcesses-PT-06-CTLCardinality-13
ctl formula formula --ctl=/tmp/530/ctl_10_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 334 places, 257 transitions and 748 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 257->255 groups
pnml2lts-sym: Regrouping took 0.060 real 0.060 user 0.000 sys
pnml2lts-sym: state vector length is 334; there are 255 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 538
Killing (9) : 538

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-06"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-06, 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 r041-tajo-167813694800489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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