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.r426-tajo-167905978500106.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 ShieldRVs-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978500106
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 18:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 18:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 18:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 18:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Feb 26 18:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 18:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 18:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 244K Mar 5 18:23 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 ShieldRVs-PT-020B-CTLFireability-00
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-01
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-02
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-03
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-04
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-05
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-06
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-07
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-08
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-09
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-10
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-11
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-12
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-13
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-14
FORMULA_NAME ShieldRVs-PT-020B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679340122284

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=ShieldRVs-PT-020B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 19:22:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 19:22:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 19:22:04] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-20 19:22:04] [INFO ] Transformed 803 places.
[2023-03-20 19:22:04] [INFO ] Transformed 903 transitions.
[2023-03-20 19:22:04] [INFO ] Found NUPN structural information;
[2023-03-20 19:22:04] [INFO ] Parsed PT model containing 803 places and 903 transitions and 2880 arcs in 143 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 196 out of 803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 803/803 places, 903/903 transitions.
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 110 place count 693 transition count 793
Iterating global reduction 0 with 110 rules applied. Total rules applied 220 place count 693 transition count 793
Applied a total of 220 rules in 74 ms. Remains 693 /803 variables (removed 110) and now considering 793/903 (removed 110) transitions.
// Phase 1: matrix 793 rows 693 cols
[2023-03-20 19:22:04] [INFO ] Computed 81 place invariants in 29 ms
[2023-03-20 19:22:04] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-20 19:22:04] [INFO ] Invariant cache hit.
[2023-03-20 19:22:05] [INFO ] Implicit Places using invariants and state equation in 577 ms returned []
Implicit Place search using SMT with State Equation took 1001 ms to find 0 implicit places.
[2023-03-20 19:22:05] [INFO ] Invariant cache hit.
[2023-03-20 19:22:05] [INFO ] Dead Transitions using invariants and state equation in 515 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 693/803 places, 793/903 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1602 ms. Remains : 693/803 places, 793/903 transitions.
Support contains 196 out of 693 places after structural reductions.
[2023-03-20 19:22:06] [INFO ] Flatten gal took : 105 ms
[2023-03-20 19:22:06] [INFO ] Flatten gal took : 67 ms
[2023-03-20 19:22:06] [INFO ] Input system was already deterministic with 793 transitions.
Incomplete random walk after 10000 steps, including 11 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 106) seen :87
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-20 19:22:07] [INFO ] Invariant cache hit.
[2023-03-20 19:22:07] [INFO ] [Real]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-20 19:22:08] [INFO ] After 1014ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:17
[2023-03-20 19:22:08] [INFO ] [Nat]Absence check using 81 positive place invariants in 16 ms returned sat
[2023-03-20 19:22:09] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :17
[2023-03-20 19:22:09] [INFO ] Deduced a trap composed of 31 places in 136 ms of which 4 ms to minimize.
[2023-03-20 19:22:09] [INFO ] Deduced a trap composed of 26 places in 121 ms of which 0 ms to minimize.
[2023-03-20 19:22:09] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2023-03-20 19:22:09] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 1 ms to minimize.
[2023-03-20 19:22:10] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 1 ms to minimize.
[2023-03-20 19:22:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 782 ms
[2023-03-20 19:22:10] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 0 ms to minimize.
[2023-03-20 19:22:10] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2023-03-20 19:22:10] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 1 ms to minimize.
[2023-03-20 19:22:10] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 0 ms to minimize.
[2023-03-20 19:22:10] [INFO ] Deduced a trap composed of 32 places in 65 ms of which 1 ms to minimize.
[2023-03-20 19:22:10] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 541 ms
[2023-03-20 19:22:10] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2023-03-20 19:22:10] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2023-03-20 19:22:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 177 ms
[2023-03-20 19:22:11] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2023-03-20 19:22:11] [INFO ] Deduced a trap composed of 31 places in 71 ms of which 0 ms to minimize.
[2023-03-20 19:22:11] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2023-03-20 19:22:11] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 1 ms to minimize.
[2023-03-20 19:22:11] [INFO ] Deduced a trap composed of 37 places in 128 ms of which 2 ms to minimize.
[2023-03-20 19:22:11] [INFO ] Deduced a trap composed of 33 places in 116 ms of which 1 ms to minimize.
[2023-03-20 19:22:11] [INFO ] Deduced a trap composed of 39 places in 140 ms of which 0 ms to minimize.
[2023-03-20 19:22:11] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 981 ms
[2023-03-20 19:22:12] [INFO ] Deduced a trap composed of 40 places in 114 ms of which 1 ms to minimize.
[2023-03-20 19:22:12] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 1 ms to minimize.
[2023-03-20 19:22:12] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 1 ms to minimize.
[2023-03-20 19:22:12] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:22:12] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2023-03-20 19:22:12] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 738 ms
[2023-03-20 19:22:12] [INFO ] Deduced a trap composed of 30 places in 121 ms of which 1 ms to minimize.
[2023-03-20 19:22:13] [INFO ] Deduced a trap composed of 33 places in 132 ms of which 0 ms to minimize.
[2023-03-20 19:22:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 357 ms
[2023-03-20 19:22:13] [INFO ] Deduced a trap composed of 36 places in 155 ms of which 3 ms to minimize.
[2023-03-20 19:22:13] [INFO ] Deduced a trap composed of 28 places in 136 ms of which 1 ms to minimize.
[2023-03-20 19:22:13] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 0 ms to minimize.
[2023-03-20 19:22:13] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 548 ms
[2023-03-20 19:22:13] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 0 ms to minimize.
[2023-03-20 19:22:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2023-03-20 19:22:14] [INFO ] Deduced a trap composed of 27 places in 123 ms of which 1 ms to minimize.
[2023-03-20 19:22:14] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2023-03-20 19:22:14] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 0 ms to minimize.
[2023-03-20 19:22:14] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2023-03-20 19:22:14] [INFO ] Deduced a trap composed of 21 places in 80 ms of which 1 ms to minimize.
[2023-03-20 19:22:14] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2023-03-20 19:22:14] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 772 ms
[2023-03-20 19:22:15] [INFO ] Deduced a trap composed of 32 places in 109 ms of which 0 ms to minimize.
[2023-03-20 19:22:15] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2023-03-20 19:22:15] [INFO ] Deduced a trap composed of 33 places in 77 ms of which 1 ms to minimize.
[2023-03-20 19:22:15] [INFO ] Deduced a trap composed of 39 places in 79 ms of which 1 ms to minimize.
[2023-03-20 19:22:15] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2023-03-20 19:22:15] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 1 ms to minimize.
[2023-03-20 19:22:15] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 0 ms to minimize.
[2023-03-20 19:22:15] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 879 ms
[2023-03-20 19:22:16] [INFO ] After 7427ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :17
Attempting to minimize the solution found.
Minimization took 696 ms.
[2023-03-20 19:22:16] [INFO ] After 8546ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :17
Fused 19 Parikh solutions to 17 different solutions.
Parikh walk visited 1 properties in 838 ms.
Support contains 57 out of 693 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 693/693 places, 793/793 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 693 transition count 720
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 620 transition count 720
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 146 place count 620 transition count 628
Deduced a syphon composed of 92 places in 1 ms
Reduce places removed 92 places and 0 transitions.
Iterating global reduction 2 with 184 rules applied. Total rules applied 330 place count 528 transition count 628
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 353 place count 505 transition count 605
Iterating global reduction 2 with 23 rules applied. Total rules applied 376 place count 505 transition count 605
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 376 place count 505 transition count 592
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 402 place count 492 transition count 592
Performed 175 Post agglomeration using F-continuation condition.Transition count delta: 175
Deduced a syphon composed of 175 places in 1 ms
Reduce places removed 175 places and 0 transitions.
Iterating global reduction 2 with 350 rules applied. Total rules applied 752 place count 317 transition count 417
Partial Free-agglomeration rule applied 34 times.
Drop transitions removed 34 transitions
Iterating global reduction 2 with 34 rules applied. Total rules applied 786 place count 317 transition count 417
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 787 place count 316 transition count 416
Applied a total of 787 rules in 133 ms. Remains 316 /693 variables (removed 377) and now considering 416/793 (removed 377) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 316/693 places, 416/793 transitions.
Incomplete random walk after 10000 steps, including 31 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 16) seen :12
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 416 rows 316 cols
[2023-03-20 19:22:18] [INFO ] Computed 81 place invariants in 15 ms
[2023-03-20 19:22:18] [INFO ] [Real]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 19:22:18] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:22:18] [INFO ] [Nat]Absence check using 81 positive place invariants in 11 ms returned sat
[2023-03-20 19:22:18] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:22:18] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2023-03-20 19:22:18] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2023-03-20 19:22:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 142 ms
[2023-03-20 19:22:18] [INFO ] After 279ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-20 19:22:18] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 416/416 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 316 transition count 413
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 313 transition count 413
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 6 place count 313 transition count 403
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 26 place count 303 transition count 403
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 60 place count 286 transition count 386
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 2 with 11 rules applied. Total rules applied 71 place count 286 transition count 386
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 285 transition count 385
Applied a total of 72 rules in 147 ms. Remains 285 /316 variables (removed 31) and now considering 385/416 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 285/316 places, 385/416 transitions.
Incomplete random walk after 10000 steps, including 39 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 890153 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :{}
Probabilistic random walk after 890153 steps, saw 176262 distinct states, run finished after 3002 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 385 rows 285 cols
[2023-03-20 19:22:21] [INFO ] Computed 81 place invariants in 6 ms
[2023-03-20 19:22:22] [INFO ] [Real]Absence check using 81 positive place invariants in 17 ms returned sat
[2023-03-20 19:22:22] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:22:22] [INFO ] [Nat]Absence check using 81 positive place invariants in 12 ms returned sat
[2023-03-20 19:22:22] [INFO ] After 116ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:22:22] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2023-03-20 19:22:22] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2023-03-20 19:22:22] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2023-03-20 19:22:22] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 194 ms
[2023-03-20 19:22:22] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-20 19:22:22] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 285 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 385/385 transitions.
Applied a total of 0 rules in 8 ms. Remains 285 /285 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 285/285 places, 385/385 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 285/285 places, 385/385 transitions.
Applied a total of 0 rules in 12 ms. Remains 285 /285 variables (removed 0) and now considering 385/385 (removed 0) transitions.
[2023-03-20 19:22:22] [INFO ] Invariant cache hit.
[2023-03-20 19:22:22] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-20 19:22:22] [INFO ] Invariant cache hit.
[2023-03-20 19:22:23] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-20 19:22:23] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-20 19:22:23] [INFO ] Invariant cache hit.
[2023-03-20 19:22:23] [INFO ] Dead Transitions using invariants and state equation in 164 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 659 ms. Remains : 285/285 places, 385/385 transitions.
Applied a total of 0 rules in 9 ms. Remains 285 /285 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 19:22:23] [INFO ] Invariant cache hit.
[2023-03-20 19:22:23] [INFO ] [Real]Absence check using 81 positive place invariants in 10 ms returned sat
[2023-03-20 19:22:23] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 19:22:23] [INFO ] [Nat]Absence check using 81 positive place invariants in 8 ms returned sat
[2023-03-20 19:22:23] [INFO ] After 95ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 19:22:23] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 0 ms to minimize.
[2023-03-20 19:22:23] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 1 ms to minimize.
[2023-03-20 19:22:23] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-20 19:22:23] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 226 ms
[2023-03-20 19:22:23] [INFO ] After 335ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-20 19:22:23] [INFO ] After 399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-20 19:22:23] [INFO ] Flatten gal took : 34 ms
[2023-03-20 19:22:23] [INFO ] Flatten gal took : 31 ms
[2023-03-20 19:22:23] [INFO ] Input system was already deterministic with 793 transitions.
Computed a total of 182 stabilizing places and 182 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 662 transition count 762
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 662 transition count 762
Applied a total of 62 rules in 24 ms. Remains 662 /693 variables (removed 31) and now considering 762/793 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 662/693 places, 762/793 transitions.
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 23 ms
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 27 ms
[2023-03-20 19:22:24] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 675 transition count 775
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 675 transition count 775
Applied a total of 36 rules in 16 ms. Remains 675 /693 variables (removed 18) and now considering 775/793 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 675/693 places, 775/793 transitions.
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 25 ms
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 21 ms
[2023-03-20 19:22:24] [INFO ] Input system was already deterministic with 775 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 665 transition count 765
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 665 transition count 765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 664 transition count 764
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 664 transition count 764
Applied a total of 58 rules in 27 ms. Remains 664 /693 variables (removed 29) and now considering 764/793 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 664/693 places, 764/793 transitions.
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 19 ms
[2023-03-20 19:22:24] [INFO ] Input system was already deterministic with 764 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 665 transition count 765
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 665 transition count 765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 664 transition count 764
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 664 transition count 764
Applied a total of 58 rules in 28 ms. Remains 664 /693 variables (removed 29) and now considering 764/793 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 664/693 places, 764/793 transitions.
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:22:24] [INFO ] Input system was already deterministic with 764 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 665 transition count 765
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 665 transition count 765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 664 transition count 764
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 664 transition count 764
Applied a total of 58 rules in 23 ms. Remains 664 /693 variables (removed 29) and now considering 764/793 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 664/693 places, 764/793 transitions.
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:22:24] [INFO ] Input system was already deterministic with 764 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 662 transition count 762
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 662 transition count 762
Applied a total of 62 rules in 28 ms. Remains 662 /693 variables (removed 31) and now considering 762/793 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 662/693 places, 762/793 transitions.
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 17 ms
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 17 ms
[2023-03-20 19:22:24] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 662 transition count 762
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 662 transition count 762
Applied a total of 62 rules in 27 ms. Remains 662 /693 variables (removed 31) and now considering 762/793 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 662/693 places, 762/793 transitions.
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 17 ms
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:22:24] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 662 transition count 762
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 662 transition count 762
Applied a total of 62 rules in 23 ms. Remains 662 /693 variables (removed 31) and now considering 762/793 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 662/693 places, 762/793 transitions.
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 21 ms
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 18 ms
[2023-03-20 19:22:24] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 671 transition count 771
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 671 transition count 771
Applied a total of 44 rules in 19 ms. Remains 671 /693 variables (removed 22) and now considering 771/793 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 671/693 places, 771/793 transitions.
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 21 ms
[2023-03-20 19:22:24] [INFO ] Flatten gal took : 16 ms
[2023-03-20 19:22:24] [INFO ] Input system was already deterministic with 771 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 78 place count 692 transition count 714
Reduce places removed 78 places and 0 transitions.
Iterating post reduction 1 with 78 rules applied. Total rules applied 156 place count 614 transition count 714
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 156 place count 614 transition count 614
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 356 place count 514 transition count 614
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 386 place count 484 transition count 584
Iterating global reduction 2 with 30 rules applied. Total rules applied 416 place count 484 transition count 584
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 416 place count 484 transition count 568
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 448 place count 468 transition count 568
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 2 with 358 rules applied. Total rules applied 806 place count 289 transition count 389
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 808 place count 287 transition count 387
Applied a total of 808 rules in 55 ms. Remains 287 /693 variables (removed 406) and now considering 387/793 (removed 406) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 287/693 places, 387/793 transitions.
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 9 ms
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 9 ms
[2023-03-20 19:22:25] [INFO ] Input system was already deterministic with 387 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 664 transition count 764
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 664 transition count 764
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 663 transition count 763
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 24 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 663/693 places, 763/793 transitions.
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:22:25] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 692 transition count 711
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 611 transition count 711
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 100 Pre rules applied. Total rules applied 162 place count 611 transition count 611
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 362 place count 511 transition count 611
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 392 place count 481 transition count 581
Iterating global reduction 2 with 30 rules applied. Total rules applied 422 place count 481 transition count 581
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 422 place count 481 transition count 565
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 454 place count 465 transition count 565
Performed 182 Post agglomeration using F-continuation condition.Transition count delta: 182
Deduced a syphon composed of 182 places in 0 ms
Reduce places removed 182 places and 0 transitions.
Iterating global reduction 2 with 364 rules applied. Total rules applied 818 place count 283 transition count 383
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 820 place count 281 transition count 381
Applied a total of 820 rules in 45 ms. Remains 281 /693 variables (removed 412) and now considering 381/793 (removed 412) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 281/693 places, 381/793 transitions.
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 8 ms
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 17 ms
[2023-03-20 19:22:25] [INFO ] Input system was already deterministic with 381 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 663 transition count 763
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 663 transition count 763
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 662 transition count 762
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 662 transition count 762
Applied a total of 62 rules in 30 ms. Remains 662 /693 variables (removed 31) and now considering 762/793 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 662/693 places, 762/793 transitions.
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 14 ms
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:22:25] [INFO ] Input system was already deterministic with 762 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 664 transition count 764
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 664 transition count 764
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 663 transition count 763
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 663 transition count 763
Applied a total of 60 rules in 23 ms. Remains 663 /693 variables (removed 30) and now considering 763/793 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 663/693 places, 763/793 transitions.
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 14 ms
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:22:25] [INFO ] Input system was already deterministic with 763 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 76 place count 692 transition count 716
Reduce places removed 76 places and 0 transitions.
Iterating post reduction 1 with 76 rules applied. Total rules applied 152 place count 616 transition count 716
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 152 place count 616 transition count 620
Deduced a syphon composed of 96 places in 0 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 344 place count 520 transition count 620
Discarding 27 places :
Symmetric choice reduction at 2 with 27 rule applications. Total rules 371 place count 493 transition count 593
Iterating global reduction 2 with 27 rules applied. Total rules applied 398 place count 493 transition count 593
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 398 place count 493 transition count 580
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 424 place count 480 transition count 580
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 1 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 786 place count 299 transition count 399
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 788 place count 297 transition count 397
Applied a total of 788 rules in 47 ms. Remains 297 /693 variables (removed 396) and now considering 397/793 (removed 396) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 297/693 places, 397/793 transitions.
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 8 ms
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 8 ms
[2023-03-20 19:22:25] [INFO ] Input system was already deterministic with 397 transitions.
Starting structural reductions in LTL mode, iteration 0 : 693/693 places, 793/793 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 665 transition count 765
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 665 transition count 765
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 664 transition count 764
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 664 transition count 764
Applied a total of 58 rules in 22 ms. Remains 664 /693 variables (removed 29) and now considering 764/793 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 664/693 places, 764/793 transitions.
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 15 ms
[2023-03-20 19:22:25] [INFO ] Input system was already deterministic with 764 transitions.
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 16 ms
[2023-03-20 19:22:25] [INFO ] Flatten gal took : 17 ms
[2023-03-20 19:22:25] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-20 19:22:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 693 places, 793 transitions and 2660 arcs took 4 ms.
Total runtime 21576 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: 693 NrTr: 793 NrArc: 2660)

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

net check time: 0m 0.000sec

init dd package: 0m 3.028sec


before gc: list nodes free: 1314883

after gc: idd nodes used:28911181, unused:35088819; list nodes free:158006968

before gc: list nodes free: 14675050

after gc: idd nodes used:41793311, unused:22206689; list nodes free:115643304

before gc: list nodes free: 15495966

after gc: idd nodes used:62838980, unused:1161020; list nodes free:20954185

RS generation: 36m 3.706sec


-> last computed set: #nodes 62838289 (6.3e+07) #states 457,938,722,542,856 (14)


CANNOT_COMPUTE


BK_STOP 1679342379292

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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.005sec

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="ShieldRVs-PT-020B"
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 ShieldRVs-PT-020B, 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 r426-tajo-167905978500106"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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