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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 7.5K Feb 25 16:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 25 16:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 16:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 16:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 16:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 16:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 104K Feb 25 16:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 157K 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-15-CTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-15-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678645663323

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-15
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 18:27:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 18:27:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 18:27:45] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-12 18:27:45] [INFO ] Transformed 630 places.
[2023-03-12 18:27:45] [INFO ] Transformed 566 transitions.
[2023-03-12 18:27:45] [INFO ] Found NUPN structural information;
[2023-03-12 18:27:45] [INFO ] Parsed PT model containing 630 places and 566 transitions and 1666 arcs in 140 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 4 places in 12 ms
Reduce places removed 4 places and 4 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-15-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-15-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 117 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 562/562 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 625 transition count 562
Discarding 72 places :
Symmetric choice reduction at 1 with 72 rule applications. Total rules 73 place count 553 transition count 490
Iterating global reduction 1 with 72 rules applied. Total rules applied 145 place count 553 transition count 490
Discarding 30 places :
Symmetric choice reduction at 1 with 30 rule applications. Total rules 175 place count 523 transition count 460
Iterating global reduction 1 with 30 rules applied. Total rules applied 205 place count 523 transition count 460
Applied a total of 205 rules in 105 ms. Remains 523 /626 variables (removed 103) and now considering 460/562 (removed 102) transitions.
// Phase 1: matrix 460 rows 523 cols
[2023-03-12 18:27:45] [INFO ] Computed 101 place invariants in 28 ms
[2023-03-12 18:27:45] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-12 18:27:45] [INFO ] Invariant cache hit.
[2023-03-12 18:27:46] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1098 ms to find 0 implicit places.
[2023-03-12 18:27:46] [INFO ] Invariant cache hit.
[2023-03-12 18:27:46] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 523/626 places, 460/562 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1496 ms. Remains : 523/626 places, 460/562 transitions.
Support contains 117 out of 523 places after structural reductions.
[2023-03-12 18:27:46] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 18:27:47] [INFO ] Flatten gal took : 65 ms
FORMULA BusinessProcesses-PT-15-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 18:27:47] [INFO ] Flatten gal took : 36 ms
[2023-03-12 18:27:47] [INFO ] Input system was already deterministic with 460 transitions.
Support contains 110 out of 523 places (down from 117) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 67 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 56) seen :24
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) 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 32) 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 32) 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 32) 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 32) 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 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) 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 32) seen :0
Running SMT prover for 32 properties.
[2023-03-12 18:27:47] [INFO ] Invariant cache hit.
[2023-03-12 18:27:48] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:32
[2023-03-12 18:27:48] [INFO ] [Nat]Absence check using 60 positive place invariants in 20 ms returned sat
[2023-03-12 18:27:48] [INFO ] [Nat]Absence check using 60 positive and 41 generalized place invariants in 11 ms returned sat
[2023-03-12 18:27:49] [INFO ] After 643ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :28
[2023-03-12 18:27:49] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 7 ms to minimize.
[2023-03-12 18:27:49] [INFO ] Deduced a trap composed of 84 places in 149 ms of which 1 ms to minimize.
[2023-03-12 18:27:50] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 1 ms to minimize.
[2023-03-12 18:27:50] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 2 ms to minimize.
[2023-03-12 18:27:50] [INFO ] Deduced a trap composed of 26 places in 131 ms of which 1 ms to minimize.
[2023-03-12 18:27:50] [INFO ] Deduced a trap composed of 25 places in 113 ms of which 1 ms to minimize.
[2023-03-12 18:27:50] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2023-03-12 18:27:50] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 2 ms to minimize.
[2023-03-12 18:27:50] [INFO ] Deduced a trap composed of 37 places in 103 ms of which 1 ms to minimize.
[2023-03-12 18:27:50] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 0 ms to minimize.
[2023-03-12 18:27:51] [INFO ] Deduced a trap composed of 25 places in 135 ms of which 0 ms to minimize.
[2023-03-12 18:27:51] [INFO ] Deduced a trap composed of 34 places in 122 ms of which 1 ms to minimize.
[2023-03-12 18:27:51] [INFO ] Deduced a trap composed of 27 places in 117 ms of which 1 ms to minimize.
[2023-03-12 18:27:51] [INFO ] Deduced a trap composed of 84 places in 125 ms of which 1 ms to minimize.
[2023-03-12 18:27:51] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 1 ms to minimize.
[2023-03-12 18:27:51] [INFO ] Deduced a trap composed of 29 places in 83 ms of which 1 ms to minimize.
[2023-03-12 18:27:51] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 0 ms to minimize.
[2023-03-12 18:27:51] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2023-03-12 18:27:52] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 0 ms to minimize.
[2023-03-12 18:27:52] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2023-03-12 18:27:52] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2023-03-12 18:27:52] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 1 ms to minimize.
[2023-03-12 18:27:52] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 1 ms to minimize.
[2023-03-12 18:27:52] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 1 ms to minimize.
[2023-03-12 18:27:52] [INFO ] Deduced a trap composed of 54 places in 94 ms of which 1 ms to minimize.
[2023-03-12 18:27:52] [INFO ] Deduced a trap composed of 59 places in 98 ms of which 0 ms to minimize.
[2023-03-12 18:27:52] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 3347 ms
[2023-03-12 18:27:53] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 0 ms to minimize.
[2023-03-12 18:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 205 ms
[2023-03-12 18:27:53] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 0 ms to minimize.
[2023-03-12 18:27:53] [INFO ] Deduced a trap composed of 23 places in 192 ms of which 1 ms to minimize.
[2023-03-12 18:27:54] [INFO ] Deduced a trap composed of 11 places in 171 ms of which 0 ms to minimize.
[2023-03-12 18:27:54] [INFO ] Deduced a trap composed of 100 places in 193 ms of which 1 ms to minimize.
[2023-03-12 18:27:54] [INFO ] Deduced a trap composed of 107 places in 185 ms of which 0 ms to minimize.
[2023-03-12 18:27:54] [INFO ] Deduced a trap composed of 100 places in 154 ms of which 1 ms to minimize.
[2023-03-12 18:27:54] [INFO ] Deduced a trap composed of 98 places in 187 ms of which 1 ms to minimize.
[2023-03-12 18:27:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1498 ms
[2023-03-12 18:27:55] [INFO ] Deduced a trap composed of 97 places in 182 ms of which 3 ms to minimize.
[2023-03-12 18:27:55] [INFO ] Deduced a trap composed of 107 places in 142 ms of which 1 ms to minimize.
[2023-03-12 18:27:55] [INFO ] Deduced a trap composed of 111 places in 173 ms of which 1 ms to minimize.
[2023-03-12 18:27:55] [INFO ] Deduced a trap composed of 95 places in 172 ms of which 1 ms to minimize.
[2023-03-12 18:27:56] [INFO ] Deduced a trap composed of 34 places in 154 ms of which 7 ms to minimize.
[2023-03-12 18:27:56] [INFO ] Deduced a trap composed of 151 places in 135 ms of which 1 ms to minimize.
[2023-03-12 18:27:56] [INFO ] Deduced a trap composed of 141 places in 143 ms of which 1 ms to minimize.
[2023-03-12 18:27:56] [INFO ] Deduced a trap composed of 100 places in 120 ms of which 1 ms to minimize.
[2023-03-12 18:27:56] [INFO ] Deduced a trap composed of 100 places in 129 ms of which 0 ms to minimize.
[2023-03-12 18:27:56] [INFO ] Deduced a trap composed of 99 places in 108 ms of which 0 ms to minimize.
[2023-03-12 18:27:56] [INFO ] Deduced a trap composed of 80 places in 149 ms of which 1 ms to minimize.
[2023-03-12 18:27:57] [INFO ] Deduced a trap composed of 96 places in 147 ms of which 0 ms to minimize.
[2023-03-12 18:27:57] [INFO ] Deduced a trap composed of 115 places in 128 ms of which 1 ms to minimize.
[2023-03-12 18:27:57] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 1 ms to minimize.
[2023-03-12 18:27:57] [INFO ] Deduced a trap composed of 99 places in 171 ms of which 1 ms to minimize.
[2023-03-12 18:27:57] [INFO ] Deduced a trap composed of 115 places in 133 ms of which 0 ms to minimize.
[2023-03-12 18:27:57] [INFO ] Deduced a trap composed of 99 places in 124 ms of which 13 ms to minimize.
[2023-03-12 18:27:58] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 0 ms to minimize.
[2023-03-12 18:27:58] [INFO ] Deduced a trap composed of 53 places in 141 ms of which 1 ms to minimize.
[2023-03-12 18:27:58] [INFO ] Deduced a trap composed of 111 places in 131 ms of which 0 ms to minimize.
[2023-03-12 18:27:58] [INFO ] Deduced a trap composed of 100 places in 128 ms of which 0 ms to minimize.
[2023-03-12 18:27:58] [INFO ] Deduced a trap composed of 45 places in 75 ms of which 3 ms to minimize.
[2023-03-12 18:27:58] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2023-03-12 18:27:58] [INFO ] Deduced a trap composed of 42 places in 73 ms of which 1 ms to minimize.
[2023-03-12 18:27:58] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 3868 ms
[2023-03-12 18:27:59] [INFO ] Deduced a trap composed of 110 places in 135 ms of which 0 ms to minimize.
[2023-03-12 18:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-12 18:27:59] [INFO ] After 11024ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :28
Attempting to minimize the solution found.
Minimization took 904 ms.
[2023-03-12 18:28:00] [INFO ] After 12567ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :28
Fused 32 Parikh solutions to 27 different solutions.
Parikh walk visited 1 properties in 515 ms.
Support contains 53 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 205 edges and 523 vertex of which 4 / 523 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1152 edges and 520 vertex of which 517 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 517 transition count 405
Reduce places removed 50 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 56 rules applied. Total rules applied 108 place count 467 transition count 399
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 114 place count 461 transition count 399
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 114 place count 461 transition count 320
Deduced a syphon composed of 79 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 282 place count 372 transition count 320
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 294 place count 360 transition count 308
Iterating global reduction 3 with 12 rules applied. Total rules applied 306 place count 360 transition count 308
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 306 place count 360 transition count 305
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 312 place count 357 transition count 305
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Deduced a syphon composed of 111 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 3 with 223 rules applied. Total rules applied 535 place count 245 transition count 194
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 537 place count 244 transition count 198
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 540 place count 244 transition count 195
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 543 place count 241 transition count 195
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 544 place count 240 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 545 place count 239 transition count 194
Applied a total of 545 rules in 159 ms. Remains 239 /523 variables (removed 284) and now considering 194/460 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 239/523 places, 194/460 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 435 ms. (steps per millisecond=22 ) properties (out of 27) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 194 rows 239 cols
[2023-03-12 18:28:02] [INFO ] Computed 87 place invariants in 6 ms
[2023-03-12 18:28:02] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-12 18:28:02] [INFO ] [Nat]Absence check using 56 positive place invariants in 11 ms returned sat
[2023-03-12 18:28:02] [INFO ] [Nat]Absence check using 56 positive and 31 generalized place invariants in 8 ms returned sat
[2023-03-12 18:28:02] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-12 18:28:02] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-12 18:28:02] [INFO ] After 72ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-12 18:28:02] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2023-03-12 18:28:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-12 18:28:02] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 0 ms to minimize.
[2023-03-12 18:28:02] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 0 ms to minimize.
[2023-03-12 18:28:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 186 ms
[2023-03-12 18:28:02] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 1 ms to minimize.
[2023-03-12 18:28:03] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 0 ms to minimize.
[2023-03-12 18:28:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-03-12 18:28:03] [INFO ] After 705ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-12 18:28:03] [INFO ] After 1065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 79 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=79 )
Parikh walk visited 6 properties in 6 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA BusinessProcesses-PT-15-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 18:28:03] [INFO ] Flatten gal took : 31 ms
[2023-03-12 18:28:03] [INFO ] Flatten gal took : 23 ms
[2023-03-12 18:28:03] [INFO ] Input system was already deterministic with 460 transitions.
Computed a total of 223 stabilizing places and 193 stable transitions
Graph (complete) has 1156 edges and 523 vertex of which 520 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.13 ms
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 495 transition count 434
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 495 transition count 434
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 484 transition count 423
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 484 transition count 423
Applied a total of 76 rules in 25 ms. Remains 484 /523 variables (removed 39) and now considering 423/460 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 484/523 places, 423/460 transitions.
[2023-03-12 18:28:03] [INFO ] Flatten gal took : 17 ms
[2023-03-12 18:28:03] [INFO ] Flatten gal took : 18 ms
[2023-03-12 18:28:03] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 26 place count 497 transition count 436
Iterating global reduction 1 with 24 rules applied. Total rules applied 50 place count 497 transition count 436
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 60 place count 487 transition count 426
Iterating global reduction 1 with 10 rules applied. Total rules applied 70 place count 487 transition count 426
Applied a total of 70 rules in 49 ms. Remains 487 /523 variables (removed 36) and now considering 426/460 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 487/523 places, 426/460 transitions.
[2023-03-12 18:28:03] [INFO ] Flatten gal took : 36 ms
[2023-03-12 18:28:03] [INFO ] Flatten gal took : 33 ms
[2023-03-12 18:28:03] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 256 edges and 523 vertex of which 7 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1149 edges and 517 vertex of which 514 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 69 place count 513 transition count 384
Reduce places removed 67 places and 0 transitions.
Iterating post reduction 1 with 67 rules applied. Total rules applied 136 place count 446 transition count 384
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 136 place count 446 transition count 285
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 352 place count 329 transition count 285
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 376 place count 305 transition count 261
Iterating global reduction 2 with 24 rules applied. Total rules applied 400 place count 305 transition count 261
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 400 place count 305 transition count 257
Deduced a syphon composed of 4 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 409 place count 300 transition count 257
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 247 rules applied. Total rules applied 656 place count 175 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 657 place count 174 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 658 place count 173 transition count 134
Applied a total of 658 rules in 147 ms. Remains 173 /523 variables (removed 350) and now considering 134/460 (removed 326) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 149 ms. Remains : 173/523 places, 134/460 transitions.
[2023-03-12 18:28:03] [INFO ] Flatten gal took : 9 ms
[2023-03-12 18:28:03] [INFO ] Flatten gal took : 23 ms
[2023-03-12 18:28:03] [INFO ] Input system was already deterministic with 134 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 522 transition count 460
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 24 place count 499 transition count 437
Iterating global reduction 1 with 23 rules applied. Total rules applied 47 place count 499 transition count 437
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 57 place count 489 transition count 427
Iterating global reduction 1 with 10 rules applied. Total rules applied 67 place count 489 transition count 427
Applied a total of 67 rules in 251 ms. Remains 489 /523 variables (removed 34) and now considering 427/460 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 489/523 places, 427/460 transitions.
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 17 ms
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 15 ms
[2023-03-12 18:28:04] [INFO ] Input system was already deterministic with 427 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 245 edges and 523 vertex of which 4 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 1153 edges and 520 vertex of which 517 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 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 516 transition count 393
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 454 transition count 391
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 452 transition count 391
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 130 place count 452 transition count 291
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 349 place count 333 transition count 291
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 369 place count 313 transition count 271
Iterating global reduction 3 with 20 rules applied. Total rules applied 389 place count 313 transition count 271
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 389 place count 313 transition count 266
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 400 place count 307 transition count 266
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 639 place count 186 transition count 148
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 640 place count 186 transition count 148
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 641 place count 185 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 642 place count 184 transition count 147
Applied a total of 642 rules in 103 ms. Remains 184 /523 variables (removed 339) and now considering 147/460 (removed 313) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 103 ms. Remains : 184/523 places, 147/460 transitions.
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 7 ms
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 8 ms
[2023-03-12 18:28:04] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 496 transition count 435
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 496 transition count 435
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 485 transition count 424
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 485 transition count 424
Applied a total of 74 rules in 111 ms. Remains 485 /523 variables (removed 38) and now considering 424/460 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 485/523 places, 424/460 transitions.
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 18 ms
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 17 ms
[2023-03-12 18:28:04] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 28 place count 495 transition count 434
Iterating global reduction 1 with 26 rules applied. Total rules applied 54 place count 495 transition count 434
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 65 place count 484 transition count 423
Iterating global reduction 1 with 11 rules applied. Total rules applied 76 place count 484 transition count 423
Applied a total of 76 rules in 191 ms. Remains 484 /523 variables (removed 39) and now considering 423/460 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 192 ms. Remains : 484/523 places, 423/460 transitions.
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 16 ms
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 15 ms
[2023-03-12 18:28:04] [INFO ] Input system was already deterministic with 423 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 249 edges and 523 vertex of which 7 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1149 edges and 517 vertex of which 514 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 65 place count 513 transition count 388
Reduce places removed 63 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 129 place count 450 transition count 387
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 130 place count 449 transition count 387
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 96 Pre rules applied. Total rules applied 130 place count 449 transition count 291
Deduced a syphon composed of 96 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 210 rules applied. Total rules applied 340 place count 335 transition count 291
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 362 place count 313 transition count 269
Iterating global reduction 3 with 22 rules applied. Total rules applied 384 place count 313 transition count 269
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 384 place count 313 transition count 264
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 395 place count 307 transition count 264
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 118
Deduced a syphon composed of 118 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 634 place count 186 transition count 146
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 635 place count 185 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 636 place count 184 transition count 145
Applied a total of 636 rules in 60 ms. Remains 184 /523 variables (removed 339) and now considering 145/460 (removed 315) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 184/523 places, 145/460 transitions.
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:28:04] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:28:04] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 521 transition count 460
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 27 place count 496 transition count 435
Iterating global reduction 1 with 25 rules applied. Total rules applied 52 place count 496 transition count 435
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 485 transition count 424
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 485 transition count 424
Applied a total of 74 rules in 23 ms. Remains 485 /523 variables (removed 38) and now considering 424/460 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 485/523 places, 424/460 transitions.
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 11 ms
[2023-03-12 18:28:05] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 256 edges and 523 vertex of which 7 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1149 edges and 517 vertex of which 515 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 514 transition count 386
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 1 with 65 rules applied. Total rules applied 132 place count 449 transition count 386
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 132 place count 449 transition count 284
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 356 place count 327 transition count 284
Discarding 24 places :
Symmetric choice reduction at 2 with 24 rule applications. Total rules 380 place count 303 transition count 260
Iterating global reduction 2 with 24 rules applied. Total rules applied 404 place count 303 transition count 260
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 404 place count 303 transition count 255
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 11 rules applied. Total rules applied 415 place count 297 transition count 255
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 241 rules applied. Total rules applied 656 place count 175 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 657 place count 174 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 658 place count 173 transition count 135
Applied a total of 658 rules in 42 ms. Remains 173 /523 variables (removed 350) and now considering 135/460 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 173/523 places, 135/460 transitions.
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 5 ms
[2023-03-12 18:28:05] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 256 edges and 523 vertex of which 7 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1149 edges and 517 vertex of which 514 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 513 transition count 386
Reduce places removed 65 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 67 rules applied. Total rules applied 134 place count 448 transition count 384
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 136 place count 446 transition count 384
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 136 place count 446 transition count 285
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 353 place count 328 transition count 285
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 377 place count 304 transition count 261
Iterating global reduction 3 with 24 rules applied. Total rules applied 401 place count 304 transition count 261
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 401 place count 304 transition count 256
Deduced a syphon composed of 5 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 11 rules applied. Total rules applied 412 place count 298 transition count 256
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 243 rules applied. Total rules applied 655 place count 175 transition count 136
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 656 place count 174 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 657 place count 173 transition count 135
Applied a total of 657 rules in 45 ms. Remains 173 /523 variables (removed 350) and now considering 135/460 (removed 325) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 173/523 places, 135/460 transitions.
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:28:05] [INFO ] Input system was already deterministic with 135 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 523/523 places, 460/460 transitions.
Graph (trivial) has 243 edges and 523 vertex of which 7 / 523 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 1149 edges and 517 vertex of which 514 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 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 513 transition count 389
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 451 transition count 387
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 130 place count 449 transition count 387
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 92 Pre rules applied. Total rules applied 130 place count 449 transition count 295
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 330 place count 341 transition count 295
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 350 place count 321 transition count 275
Iterating global reduction 3 with 20 rules applied. Total rules applied 370 place count 321 transition count 275
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 370 place count 321 transition count 272
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 7 rules applied. Total rules applied 377 place count 317 transition count 272
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 3 with 242 rules applied. Total rules applied 619 place count 195 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 620 place count 194 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 621 place count 193 transition count 151
Applied a total of 621 rules in 46 ms. Remains 193 /523 variables (removed 330) and now considering 151/460 (removed 309) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 193/523 places, 151/460 transitions.
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 6 ms
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 7 ms
[2023-03-12 18:28:05] [INFO ] Input system was already deterministic with 151 transitions.
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 13 ms
[2023-03-12 18:28:05] [INFO ] Flatten gal took : 12 ms
[2023-03-12 18:28:05] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-12 18:28:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 523 places, 460 transitions and 1453 arcs took 3 ms.
Total runtime 20251 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/688/ctl_0_ --ctl=/tmp/688/ctl_1_ --ctl=/tmp/688/ctl_2_ --ctl=/tmp/688/ctl_3_ --ctl=/tmp/688/ctl_4_ --ctl=/tmp/688/ctl_5_ --ctl=/tmp/688/ctl_6_ --ctl=/tmp/688/ctl_7_ --ctl=/tmp/688/ctl_8_ --ctl=/tmp/688/ctl_9_ --ctl=/tmp/688/ctl_10_ --ctl=/tmp/688/ctl_11_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 14066188 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097300 kB
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-00
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-01
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-02
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-04
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-05
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-06
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-07
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-08
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-10
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-11
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-12
Could not compute solution for formula : BusinessProcesses-PT-15-CTLCardinality-13

BK_STOP 1678649256896

--------------------
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-15-CTLCardinality-00
ctl formula formula --ctl=/tmp/688/ctl_0_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-01
ctl formula formula --ctl=/tmp/688/ctl_1_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-02
ctl formula formula --ctl=/tmp/688/ctl_2_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-04
ctl formula formula --ctl=/tmp/688/ctl_3_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-05
ctl formula formula --ctl=/tmp/688/ctl_4_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-06
ctl formula formula --ctl=/tmp/688/ctl_5_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-07
ctl formula formula --ctl=/tmp/688/ctl_6_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-08
ctl formula formula --ctl=/tmp/688/ctl_7_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-10
ctl formula formula --ctl=/tmp/688/ctl_8_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-11
ctl formula formula --ctl=/tmp/688/ctl_9_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-12
ctl formula formula --ctl=/tmp/688/ctl_10_
ctl formula name BusinessProcesses-PT-15-CTLCardinality-13
ctl formula formula --ctl=/tmp/688/ctl_11_
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 523 places, 460 transitions and 1453 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: 460->459 groups
pnml2lts-sym: Regrouping took 0.140 real 0.150 user 0.000 sys
pnml2lts-sym: state vector length is 523; there are 459 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: 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
Killing (15) : 694
Killing (9) : 694

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-15"
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-15, 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-167813694900561"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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