Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.8K Feb 25 16:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 16:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 16:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:47 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.8K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:38 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 11K Feb 25 16:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 16:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 25 16:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 104K 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-09-CTLFireability-00
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-01
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-02
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-03
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-04
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-05
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-06
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-07
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-08
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-09
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-10
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-11
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-12
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-13
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-14
FORMULA_NAME BusinessProcesses-PT-09-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678730597708

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-09
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:03:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 18:03:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:03:19] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2023-03-13 18:03:19] [INFO ] Transformed 403 places.
[2023-03-13 18:03:19] [INFO ] Transformed 374 transitions.
[2023-03-13 18:03:19] [INFO ] Found NUPN structural information;
[2023-03-13 18:03:19] [INFO ] Parsed PT model containing 403 places and 374 transitions and 1148 arcs in 116 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 137 out of 403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 403/403 places, 374/374 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 402 transition count 374
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 36 place count 367 transition count 339
Iterating global reduction 1 with 35 rules applied. Total rules applied 71 place count 367 transition count 339
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 84 place count 354 transition count 326
Iterating global reduction 1 with 13 rules applied. Total rules applied 97 place count 354 transition count 326
Applied a total of 97 rules in 58 ms. Remains 354 /403 variables (removed 49) and now considering 326/374 (removed 48) transitions.
// Phase 1: matrix 326 rows 354 cols
[2023-03-13 18:03:19] [INFO ] Computed 64 place invariants in 23 ms
[2023-03-13 18:03:20] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-13 18:03:20] [INFO ] Invariant cache hit.
[2023-03-13 18:03:20] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-13 18:03:20] [INFO ] Invariant cache hit.
[2023-03-13 18:03:20] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 354/403 places, 326/374 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 832 ms. Remains : 354/403 places, 326/374 transitions.
Support contains 137 out of 354 places after structural reductions.
[2023-03-13 18:03:20] [INFO ] Flatten gal took : 55 ms
[2023-03-13 18:03:20] [INFO ] Flatten gal took : 27 ms
[2023-03-13 18:03:20] [INFO ] Input system was already deterministic with 326 transitions.
Incomplete random walk after 10000 steps, including 106 resets, run finished after 544 ms. (steps per millisecond=18 ) properties (out of 92) seen :58
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) 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 34) seen :0
Running SMT prover for 34 properties.
[2023-03-13 18:03:21] [INFO ] Invariant cache hit.
[2023-03-13 18:03:22] [INFO ] [Real]Absence check using 34 positive place invariants in 7 ms returned sat
[2023-03-13 18:03:22] [INFO ] [Real]Absence check using 34 positive and 30 generalized place invariants in 8 ms returned sat
[2023-03-13 18:03:22] [INFO ] After 548ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:30
[2023-03-13 18:03:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2023-03-13 18:03:22] [INFO ] [Nat]Absence check using 34 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-13 18:03:23] [INFO ] After 379ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :23
[2023-03-13 18:03:23] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 6 ms to minimize.
[2023-03-13 18:03:23] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2023-03-13 18:03:23] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 1 ms to minimize.
[2023-03-13 18:03:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 338 ms
[2023-03-13 18:03:23] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 2 ms to minimize.
[2023-03-13 18:03:23] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2023-03-13 18:03:23] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 0 ms to minimize.
[2023-03-13 18:03:23] [INFO ] Deduced a trap composed of 22 places in 45 ms of which 1 ms to minimize.
[2023-03-13 18:03:23] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2023-03-13 18:03:23] [INFO ] Deduced a trap composed of 20 places in 41 ms of which 1 ms to minimize.
[2023-03-13 18:03:23] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 429 ms
[2023-03-13 18:03:24] [INFO ] Deduced a trap composed of 19 places in 96 ms of which 1 ms to minimize.
[2023-03-13 18:03:24] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2023-03-13 18:03:24] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 1 ms to minimize.
[2023-03-13 18:03:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 333 ms
[2023-03-13 18:03:24] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
[2023-03-13 18:03:24] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2023-03-13 18:03:24] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 1 ms to minimize.
[2023-03-13 18:03:25] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 1 ms to minimize.
[2023-03-13 18:03:25] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2023-03-13 18:03:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 641 ms
[2023-03-13 18:03:25] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2023-03-13 18:03:25] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 0 ms to minimize.
[2023-03-13 18:03:25] [INFO ] Deduced a trap composed of 83 places in 83 ms of which 1 ms to minimize.
[2023-03-13 18:03:25] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 0 ms to minimize.
[2023-03-13 18:03:25] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 1 ms to minimize.
[2023-03-13 18:03:25] [INFO ] Deduced a trap composed of 80 places in 79 ms of which 1 ms to minimize.
[2023-03-13 18:03:25] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 0 ms to minimize.
[2023-03-13 18:03:26] [INFO ] Deduced a trap composed of 74 places in 85 ms of which 0 ms to minimize.
[2023-03-13 18:03:26] [INFO ] Deduced a trap composed of 71 places in 75 ms of which 1 ms to minimize.
[2023-03-13 18:03:26] [INFO ] Deduced a trap composed of 88 places in 97 ms of which 0 ms to minimize.
[2023-03-13 18:03:26] [INFO ] Deduced a trap composed of 75 places in 89 ms of which 1 ms to minimize.
[2023-03-13 18:03:26] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 0 ms to minimize.
[2023-03-13 18:03:26] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 1 ms to minimize.
[2023-03-13 18:03:26] [INFO ] Deduced a trap composed of 81 places in 79 ms of which 1 ms to minimize.
[2023-03-13 18:03:26] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 0 ms to minimize.
[2023-03-13 18:03:26] [INFO ] Deduced a trap composed of 82 places in 72 ms of which 0 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 75 places in 84 ms of which 1 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 4 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 1 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 0 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 1 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 100 places in 95 ms of which 1 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 1 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 75 places in 95 ms of which 0 ms to minimize.
[2023-03-13 18:03:27] [INFO ] Deduced a trap composed of 79 places in 100 ms of which 0 ms to minimize.
[2023-03-13 18:03:28] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 0 ms to minimize.
[2023-03-13 18:03:28] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2023-03-13 18:03:28] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 0 ms to minimize.
[2023-03-13 18:03:28] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
[2023-03-13 18:03:28] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 3158 ms
[2023-03-13 18:03:28] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 1 ms to minimize.
[2023-03-13 18:03:28] [INFO ] Deduced a trap composed of 88 places in 82 ms of which 0 ms to minimize.
[2023-03-13 18:03:28] [INFO ] Deduced a trap composed of 71 places in 77 ms of which 1 ms to minimize.
[2023-03-13 18:03:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 335 ms
[2023-03-13 18:03:28] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 1 ms to minimize.
[2023-03-13 18:03:28] [INFO ] Deduced a trap composed of 88 places in 94 ms of which 0 ms to minimize.
[2023-03-13 18:03:29] [INFO ] Deduced a trap composed of 84 places in 104 ms of which 0 ms to minimize.
[2023-03-13 18:03:29] [INFO ] Deduced a trap composed of 87 places in 95 ms of which 0 ms to minimize.
[2023-03-13 18:03:29] [INFO ] Deduced a trap composed of 88 places in 93 ms of which 1 ms to minimize.
[2023-03-13 18:03:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 602 ms
[2023-03-13 18:03:29] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 0 ms to minimize.
[2023-03-13 18:03:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-13 18:03:29] [INFO ] After 6739ms SMT Verify possible using trap constraints in natural domain returned unsat :12 sat :22
Attempting to minimize the solution found.
Minimization took 297 ms.
[2023-03-13 18:03:29] [INFO ] After 7444ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :22
Fused 34 Parikh solutions to 22 different solutions.
Parikh walk visited 4 properties in 287 ms.
Support contains 28 out of 354 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (trivial) has 151 edges and 354 vertex of which 7 / 354 are part of one of the 1 SCC in 5 ms
Free SCC test removed 6 places
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 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 41 place count 348 transition count 278
Reduce places removed 40 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 43 rules applied. Total rules applied 84 place count 308 transition count 275
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 87 place count 305 transition count 275
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 87 place count 305 transition count 218
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 123 rules applied. Total rules applied 210 place count 239 transition count 218
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 224 place count 225 transition count 204
Iterating global reduction 3 with 14 rules applied. Total rules applied 238 place count 225 transition count 204
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 379 place count 153 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 381 place count 152 transition count 138
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 382 place count 152 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 383 place count 151 transition count 137
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 387 place count 151 transition count 137
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 388 place count 150 transition count 136
Applied a total of 388 rules in 75 ms. Remains 150 /354 variables (removed 204) and now considering 136/326 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 150/354 places, 136/326 transitions.
Incomplete random walk after 10000 steps, including 1181 resets, run finished after 260 ms. (steps per millisecond=38 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10001 steps, including 299 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 157 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 272 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :2
Running SMT prover for 2 properties.
// Phase 1: matrix 136 rows 150 cols
[2023-03-13 18:03:30] [INFO ] Computed 52 place invariants in 11 ms
[2023-03-13 18:03:30] [INFO ] [Real]Absence check using 36 positive place invariants in 8 ms returned sat
[2023-03-13 18:03:30] [INFO ] [Real]Absence check using 36 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-13 18:03:30] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-13 18:03:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-13 18:03:30] [INFO ] [Nat]Absence check using 36 positive and 16 generalized place invariants in 4 ms returned sat
[2023-03-13 18:03:31] [INFO ] After 52ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-13 18:03:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 18:03:31] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-13 18:03:31] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 1 ms to minimize.
[2023-03-13 18:03:31] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2023-03-13 18:03:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 111 ms
[2023-03-13 18:03:31] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-13 18:03:31] [INFO ] After 275ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 136/136 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 150 transition count 131
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 145 transition count 131
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 10 place count 145 transition count 123
Deduced a syphon composed of 8 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 27 place count 136 transition count 123
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 30 place count 133 transition count 119
Iterating global reduction 2 with 3 rules applied. Total rules applied 33 place count 133 transition count 119
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 50 place count 124 transition count 111
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 54 place count 122 transition count 128
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 122 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 56 place count 121 transition count 127
Applied a total of 56 rules in 30 ms. Remains 121 /150 variables (removed 29) and now considering 127/136 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 121/150 places, 127/136 transitions.
Incomplete random walk after 10000 steps, including 572 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 121 cols
[2023-03-13 18:03:31] [INFO ] Computed 50 place invariants in 5 ms
[2023-03-13 18:03:31] [INFO ] [Real]Absence check using 37 positive place invariants in 7 ms returned sat
[2023-03-13 18:03:31] [INFO ] [Real]Absence check using 37 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-13 18:03:31] [INFO ] After 38ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 18:03:31] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:03:31] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:03:31] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:03:31] [INFO ] [Nat]Absence check using 37 positive place invariants in 6 ms returned sat
[2023-03-13 18:03:31] [INFO ] [Nat]Absence check using 37 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-13 18:03:31] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:03:31] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:03:31] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-13 18:03:31] [INFO ] After 110ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 121 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 121/121 places, 127/127 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 126
Applied a total of 2 rules in 10 ms. Remains 120 /121 variables (removed 1) and now considering 126/127 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 120/121 places, 126/127 transitions.
Incomplete random walk after 10000 steps, including 562 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 113 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1403917 steps, run timeout after 3001 ms. (steps per millisecond=467 ) properties seen :{}
Probabilistic random walk after 1403917 steps, saw 382338 distinct states, run finished after 3003 ms. (steps per millisecond=467 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 126 rows 120 cols
[2023-03-13 18:03:34] [INFO ] Computed 50 place invariants in 7 ms
[2023-03-13 18:03:34] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-13 18:03:34] [INFO ] [Real]Absence check using 33 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-13 18:03:34] [INFO ] After 51ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 18:03:34] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:03:34] [INFO ] After 21ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:03:34] [INFO ] After 156ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:03:34] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-13 18:03:34] [INFO ] [Nat]Absence check using 33 positive and 17 generalized place invariants in 4 ms returned sat
[2023-03-13 18:03:34] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:03:34] [INFO ] After 7ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:03:34] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2023-03-13 18:03:34] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2023-03-13 18:03:34] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 1 ms to minimize.
[2023-03-13 18:03:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 161 ms
[2023-03-13 18:03:34] [INFO ] After 175ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-13 18:03:34] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 120/120 places, 126/126 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 120 /120 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-13 18:03:34] [INFO ] Invariant cache hit.
[2023-03-13 18:03:35] [INFO ] Implicit Places using invariants in 171 ms returned [10, 11, 20, 22, 24, 30, 32, 34, 36, 37, 38, 42, 43, 44]
Discarding 14 places :
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Implicit Place search using SMT only with invariants took 174 ms to find 14 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/120 places, 112/126 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 102 transition count 96
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 102 transition count 96
Applied a total of 8 rules in 8 ms. Remains 102 /106 variables (removed 4) and now considering 96/112 (removed 16) transitions.
// Phase 1: matrix 96 rows 102 cols
[2023-03-13 18:03:35] [INFO ] Computed 38 place invariants in 1 ms
[2023-03-13 18:03:35] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-13 18:03:35] [INFO ] Invariant cache hit.
[2023-03-13 18:03:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:03:35] [INFO ] Implicit Places using invariants and state equation in 185 ms returned [33, 53, 55, 61, 63]
Discarding 5 places :
Implicit Place search using SMT with State Equation took 338 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 97/120 places, 96/126 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 97 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 96 transition count 95
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 95 transition count 93
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 95 transition count 93
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 94 transition count 92
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 94 transition count 92
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 92 transition count 90
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 92 transition count 90
Applied a total of 11 rules in 15 ms. Remains 92 /97 variables (removed 5) and now considering 90/96 (removed 6) transitions.
// Phase 1: matrix 90 rows 92 cols
[2023-03-13 18:03:35] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-13 18:03:35] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-13 18:03:35] [INFO ] Invariant cache hit.
[2023-03-13 18:03:35] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:03:35] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 92/120 places, 90/126 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 785 ms. Remains : 92/120 places, 90/126 transitions.
Incomplete random walk after 10000 steps, including 658 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2194760 steps, run timeout after 3001 ms. (steps per millisecond=731 ) properties seen :{}
Probabilistic random walk after 2194760 steps, saw 573385 distinct states, run finished after 3001 ms. (steps per millisecond=731 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 18:03:38] [INFO ] Invariant cache hit.
[2023-03-13 18:03:38] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-13 18:03:38] [INFO ] [Real]Absence check using 22 positive and 11 generalized place invariants in 3 ms returned sat
[2023-03-13 18:03:38] [INFO ] After 35ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 18:03:38] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:03:38] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:03:38] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:03:38] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-13 18:03:38] [INFO ] [Nat]Absence check using 22 positive and 11 generalized place invariants in 3 ms returned sat
[2023-03-13 18:03:39] [INFO ] After 36ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:03:39] [INFO ] After 5ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:03:39] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-13 18:03:39] [INFO ] After 115ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 92 /92 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 92/92 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 90/90 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2023-03-13 18:03:39] [INFO ] Invariant cache hit.
[2023-03-13 18:03:39] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-13 18:03:39] [INFO ] Invariant cache hit.
[2023-03-13 18:03:39] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-13 18:03:39] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2023-03-13 18:03:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-13 18:03:39] [INFO ] Invariant cache hit.
[2023-03-13 18:03:39] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 336 ms. Remains : 92/92 places, 90/90 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 92 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 92 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 91 transition count 88
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 12 rules applied. Total rules applied 15 place count 83 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 82 transition count 83
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 82 transition count 83
Graph (complete) has 287 edges and 82 vertex of which 81 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 20 place count 81 transition count 83
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 81 transition count 82
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 81 transition count 82
Applied a total of 24 rules in 17 ms. Remains 81 /92 variables (removed 11) and now considering 82/90 (removed 8) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 82 rows 81 cols
[2023-03-13 18:03:39] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-13 18:03:39] [INFO ] [Real]Absence check using 22 positive place invariants in 3 ms returned sat
[2023-03-13 18:03:39] [INFO ] [Real]Absence check using 22 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-13 18:03:39] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 18:03:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-13 18:03:39] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-13 18:03:39] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2023-03-13 18:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-13 18:03:39] [INFO ] After 41ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:03:39] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 18:03:39] [INFO ] [Nat]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-13 18:03:39] [INFO ] [Nat]Absence check using 22 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-13 18:03:39] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 18:03:39] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 18:03:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2023-03-13 18:03:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-13 18:03:39] [INFO ] After 54ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 18:03:39] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
[2023-03-13 18:03:39] [INFO ] Flatten gal took : 27 ms
[2023-03-13 18:03:39] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BusinessProcesses-PT-09-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:03:39] [INFO ] Flatten gal took : 23 ms
[2023-03-13 18:03:39] [INFO ] Input system was already deterministic with 326 transitions.
Support contains 97 out of 354 places (down from 110) after GAL structural reductions.
Computed a total of 212 stabilizing places and 214 stable transitions
Graph (complete) has 793 edges and 354 vertex of which 353 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (trivial) has 173 edges and 354 vertex of which 4 / 354 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (complete) has 790 edges and 351 vertex of which 350 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 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 349 transition count 271
Reduce places removed 50 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 299 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 104 place count 298 transition count 270
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 104 place count 298 transition count 204
Deduced a syphon composed of 66 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 141 rules applied. Total rules applied 245 place count 223 transition count 204
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 267 place count 201 transition count 182
Iterating global reduction 3 with 22 rules applied. Total rules applied 289 place count 201 transition count 182
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 289 place count 201 transition count 180
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 293 place count 199 transition count 180
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 430 place count 129 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 432 place count 128 transition count 112
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 433 place count 127 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 434 place count 126 transition count 111
Applied a total of 434 rules in 49 ms. Remains 126 /354 variables (removed 228) and now considering 111/326 (removed 215) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 126/354 places, 111/326 transitions.
[2023-03-13 18:03:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:03:39] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:03:39] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (trivial) has 177 edges and 354 vertex of which 7 / 354 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 786 edges and 348 vertex of which 347 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 346 transition count 266
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 295 transition count 266
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 66 Pre rules applied. Total rules applied 104 place count 295 transition count 200
Deduced a syphon composed of 66 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 246 place count 219 transition count 200
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 269 place count 196 transition count 177
Iterating global reduction 2 with 23 rules applied. Total rules applied 292 place count 196 transition count 177
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 292 place count 196 transition count 175
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 296 place count 194 transition count 175
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 2 with 137 rules applied. Total rules applied 433 place count 124 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 434 place count 123 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 435 place count 122 transition count 107
Applied a total of 435 rules in 39 ms. Remains 122 /354 variables (removed 232) and now considering 107/326 (removed 219) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 39 ms. Remains : 122/354 places, 107/326 transitions.
[2023-03-13 18:03:39] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:03:39] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:03:39] [INFO ] Input system was already deterministic with 107 transitions.
Finished random walk after 67 steps, including 8 resets, run visited all 1 properties in 1 ms. (steps per millisecond=67 )
FORMULA BusinessProcesses-PT-09-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (complete) has 793 edges and 354 vertex of which 353 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 40 place count 352 transition count 285
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 81 place count 313 transition count 283
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 83 place count 311 transition count 283
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 83 place count 311 transition count 207
Deduced a syphon composed of 76 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 162 rules applied. Total rules applied 245 place count 225 transition count 207
Discarding 24 places :
Symmetric choice reduction at 3 with 24 rule applications. Total rules 269 place count 201 transition count 183
Iterating global reduction 3 with 24 rules applied. Total rules applied 293 place count 201 transition count 183
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 293 place count 201 transition count 181
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 297 place count 199 transition count 181
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 137 rules applied. Total rules applied 434 place count 129 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 435 place count 129 transition count 114
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 129 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 437 place count 128 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 438 place count 127 transition count 112
Applied a total of 438 rules in 59 ms. Remains 127 /354 variables (removed 227) and now considering 112/326 (removed 214) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 127/354 places, 112/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 320 transition count 292
Applied a total of 68 rules in 28 ms. Remains 320 /354 variables (removed 34) and now considering 292/326 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 320/354 places, 292/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 16 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 17 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 60 place count 319 transition count 291
Iterating global reduction 0 with 10 rules applied. Total rules applied 70 place count 319 transition count 291
Applied a total of 70 rules in 29 ms. Remains 319 /354 variables (removed 35) and now considering 291/326 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 319/354 places, 291/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 291 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 327 transition count 299
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 327 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 317 transition count 289
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 317 transition count 289
Applied a total of 74 rules in 30 ms. Remains 317 /354 variables (removed 37) and now considering 289/326 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 317/354 places, 289/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 320 transition count 292
Applied a total of 68 rules in 28 ms. Remains 320 /354 variables (removed 34) and now considering 292/326 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 320/354 places, 292/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (complete) has 793 edges and 354 vertex of which 353 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 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 41 place count 352 transition count 284
Reduce places removed 40 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 83 place count 312 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 310 transition count 282
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 85 place count 310 transition count 207
Deduced a syphon composed of 75 places in 1 ms
Ensure Unique test removed 10 places
Reduce places removed 85 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 245 place count 225 transition count 207
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 268 place count 202 transition count 184
Iterating global reduction 3 with 23 rules applied. Total rules applied 291 place count 202 transition count 184
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 291 place count 202 transition count 182
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 295 place count 200 transition count 182
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 434 place count 129 transition count 114
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 435 place count 129 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 436 place count 128 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 437 place count 127 transition count 113
Applied a total of 437 rules in 42 ms. Remains 127 /354 variables (removed 227) and now considering 113/326 (removed 213) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 43 ms. Remains : 127/354 places, 113/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 113 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 333 transition count 305
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 333 transition count 305
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 49 place count 326 transition count 298
Iterating global reduction 0 with 7 rules applied. Total rules applied 56 place count 326 transition count 298
Applied a total of 56 rules in 44 ms. Remains 326 /354 variables (removed 28) and now considering 298/326 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 326/354 places, 298/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 330 transition count 302
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 330 transition count 302
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 55 place count 323 transition count 295
Iterating global reduction 0 with 7 rules applied. Total rules applied 62 place count 323 transition count 295
Applied a total of 62 rules in 23 ms. Remains 323 /354 variables (removed 31) and now considering 295/326 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 323/354 places, 295/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 295 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Graph (trivial) has 174 edges and 354 vertex of which 7 / 354 are part of one of the 1 SCC in 0 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 786 edges and 348 vertex of which 347 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 346 transition count 269
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 298 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 102 place count 296 transition count 267
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 65 Pre rules applied. Total rules applied 102 place count 296 transition count 202
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 241 place count 222 transition count 202
Discarding 23 places :
Symmetric choice reduction at 3 with 23 rule applications. Total rules 264 place count 199 transition count 179
Iterating global reduction 3 with 23 rules applied. Total rules applied 287 place count 199 transition count 179
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 287 place count 199 transition count 177
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 291 place count 197 transition count 177
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 3 with 139 rules applied. Total rules applied 430 place count 126 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 431 place count 125 transition count 108
Applied a total of 431 rules in 30 ms. Remains 125 /354 variables (removed 229) and now considering 108/326 (removed 218) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 125/354 places, 108/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 327 transition count 299
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 327 transition count 299
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 64 place count 317 transition count 289
Iterating global reduction 0 with 10 rules applied. Total rules applied 74 place count 317 transition count 289
Applied a total of 74 rules in 20 ms. Remains 317 /354 variables (removed 37) and now considering 289/326 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 317/354 places, 289/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 289 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 320 transition count 292
Applied a total of 68 rules in 23 ms. Remains 320 /354 variables (removed 34) and now considering 292/326 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 320/354 places, 292/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 329 transition count 301
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 329 transition count 301
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 59 place count 320 transition count 292
Iterating global reduction 0 with 9 rules applied. Total rules applied 68 place count 320 transition count 292
Applied a total of 68 rules in 16 ms. Remains 320 /354 variables (removed 34) and now considering 292/326 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 320/354 places, 292/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 292 transitions.
Starting structural reductions in LTL mode, iteration 0 : 354/354 places, 326/326 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 328 transition count 300
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 328 transition count 300
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 61 place count 319 transition count 291
Iterating global reduction 0 with 9 rules applied. Total rules applied 70 place count 319 transition count 291
Applied a total of 70 rules in 15 ms. Remains 319 /354 variables (removed 35) and now considering 291/326 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 319/354 places, 291/326 transitions.
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:03:40] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:03:40] [INFO ] Input system was already deterministic with 291 transitions.
[2023-03-13 18:03:41] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:03:41] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:03:41] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-13 18:03:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 354 places, 326 transitions and 1051 arcs took 23 ms.
Total runtime 21407 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 354 NrTr: 326 NrArc: 1051)

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

net check time: 0m 0.000sec

init dd package: 0m 3.083sec


before gc: list nodes free: 80100

after gc: idd nodes used:45723741, unused:18276259; list nodes free:74326051

RS generation: 39m15.524sec


-> last computed set: #nodes 45723535 (4.6e+07) #states 23,183,612,728 (10)


CANNOT_COMPUTE


BK_STOP 1678733005411

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

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


initing FirstDep: 0m 0.001sec

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-09"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is BusinessProcesses-PT-09, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r042-tajo-167813695900514"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-09.tgz
mv BusinessProcesses-PT-09 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;