Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r458-smll-167912650500594.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is StigmergyElection-PT-04b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912650500594
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 6.8K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 16:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 16:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 203K 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 StigmergyElection-PT-04b-CTLFireability-00
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-01
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-02
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-03
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-04
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-05
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-06
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-07
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-08
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-09
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-10
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-11
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-12
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-13
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-14
FORMULA_NAME StigmergyElection-PT-04b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679551437078

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=StigmergyElection-PT-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-23 06:04:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-23 06:04:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 06:04:01] [INFO ] Load time of PNML (sax parser for PT used): 266 ms
[2023-03-23 06:04:01] [INFO ] Transformed 563 places.
[2023-03-23 06:04:01] [INFO ] Transformed 780 transitions.
[2023-03-23 06:04:01] [INFO ] Found NUPN structural information;
[2023-03-23 06:04:01] [INFO ] Parsed PT model containing 563 places and 780 transitions and 2680 arcs in 540 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 22 ms.
Support contains 124 out of 563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 563/563 places, 780/780 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 509 transition count 726
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 509 transition count 726
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 135 place count 482 transition count 699
Iterating global reduction 0 with 27 rules applied. Total rules applied 162 place count 482 transition count 699
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 168 place count 476 transition count 693
Iterating global reduction 0 with 6 rules applied. Total rules applied 174 place count 476 transition count 693
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 175 place count 475 transition count 692
Iterating global reduction 0 with 1 rules applied. Total rules applied 176 place count 475 transition count 692
Applied a total of 176 rules in 321 ms. Remains 475 /563 variables (removed 88) and now considering 692/780 (removed 88) transitions.
// Phase 1: matrix 692 rows 475 cols
[2023-03-23 06:04:01] [INFO ] Computed 5 place invariants in 61 ms
[2023-03-23 06:04:02] [INFO ] Implicit Places using invariants in 604 ms returned []
[2023-03-23 06:04:02] [INFO ] Invariant cache hit.
[2023-03-23 06:04:03] [INFO ] Implicit Places using invariants and state equation in 1153 ms returned []
Implicit Place search using SMT with State Equation took 1851 ms to find 0 implicit places.
[2023-03-23 06:04:03] [INFO ] Invariant cache hit.
[2023-03-23 06:04:04] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 475/563 places, 692/780 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2981 ms. Remains : 475/563 places, 692/780 transitions.
Support contains 124 out of 475 places after structural reductions.
[2023-03-23 06:04:04] [INFO ] Flatten gal took : 146 ms
[2023-03-23 06:04:04] [INFO ] Flatten gal took : 64 ms
[2023-03-23 06:04:05] [INFO ] Input system was already deterministic with 692 transitions.
Support contains 120 out of 475 places (down from 124) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 138 resets, run finished after 788 ms. (steps per millisecond=12 ) properties (out of 85) seen :31
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) 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 54) 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 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) 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 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 54) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 54) 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 54) 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 54) seen :0
Running SMT prover for 54 properties.
[2023-03-23 06:04:06] [INFO ] Invariant cache hit.
[2023-03-23 06:04:07] [INFO ] After 1061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:54
[2023-03-23 06:04:08] [INFO ] [Nat]Absence check using 5 positive place invariants in 7 ms returned sat
[2023-03-23 06:04:11] [INFO ] After 2419ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :49
[2023-03-23 06:04:12] [INFO ] Deduced a trap composed of 174 places in 294 ms of which 38 ms to minimize.
[2023-03-23 06:04:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2023-03-23 06:04:12] [INFO ] Deduced a trap composed of 177 places in 261 ms of which 2 ms to minimize.
[2023-03-23 06:04:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 328 ms
[2023-03-23 06:04:13] [INFO ] Deduced a trap composed of 169 places in 275 ms of which 2 ms to minimize.
[2023-03-23 06:04:14] [INFO ] Deduced a trap composed of 170 places in 237 ms of which 1 ms to minimize.
[2023-03-23 06:04:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 597 ms
[2023-03-23 06:04:14] [INFO ] Deduced a trap composed of 171 places in 283 ms of which 2 ms to minimize.
[2023-03-23 06:04:14] [INFO ] Deduced a trap composed of 169 places in 242 ms of which 1 ms to minimize.
[2023-03-23 06:04:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 617 ms
[2023-03-23 06:04:15] [INFO ] Deduced a trap composed of 170 places in 398 ms of which 1 ms to minimize.
[2023-03-23 06:04:16] [INFO ] Deduced a trap composed of 171 places in 369 ms of which 1 ms to minimize.
[2023-03-23 06:04:16] [INFO ] Deduced a trap composed of 169 places in 262 ms of which 1 ms to minimize.
[2023-03-23 06:04:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1154 ms
[2023-03-23 06:04:17] [INFO ] Deduced a trap composed of 173 places in 378 ms of which 1 ms to minimize.
[2023-03-23 06:04:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 440 ms
[2023-03-23 06:04:17] [INFO ] After 8695ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :48
Attempting to minimize the solution found.
Minimization took 1710 ms.
[2023-03-23 06:04:19] [INFO ] After 11862ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :48
Fused 54 Parikh solutions to 48 different solutions.
Parikh walk visited 30 properties in 599 ms.
Support contains 40 out of 475 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 475/475 places, 692/692 transitions.
Graph (trivial) has 405 edges and 475 vertex of which 37 / 475 are part of one of the 7 SCC in 10 ms
Free SCC test removed 30 places
Drop transitions removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Graph (complete) has 816 edges and 445 vertex of which 442 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 248 transitions
Trivial Post-agglo rules discarded 248 transitions
Performed 248 trivial Post agglomeration. Transition count delta: 248
Iterating post reduction 0 with 250 rules applied. Total rules applied 252 place count 442 transition count 401
Reduce places removed 248 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 259 rules applied. Total rules applied 511 place count 194 transition count 390
Reduce places removed 6 places and 0 transitions.
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Iterating post reduction 2 with 31 rules applied. Total rules applied 542 place count 188 transition count 365
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 27 rules applied. Total rules applied 569 place count 163 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 570 place count 162 transition count 363
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 19 Pre rules applied. Total rules applied 570 place count 162 transition count 344
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 608 place count 143 transition count 344
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 616 place count 135 transition count 336
Iterating global reduction 5 with 8 rules applied. Total rules applied 624 place count 135 transition count 336
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 624 place count 135 transition count 335
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 626 place count 134 transition count 335
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 628 place count 132 transition count 332
Iterating global reduction 5 with 2 rules applied. Total rules applied 630 place count 132 transition count 332
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 631 place count 131 transition count 330
Iterating global reduction 5 with 1 rules applied. Total rules applied 632 place count 131 transition count 330
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 5 with 32 rules applied. Total rules applied 664 place count 115 transition count 314
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 666 place count 115 transition count 312
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 670 place count 111 transition count 302
Iterating global reduction 6 with 4 rules applied. Total rules applied 674 place count 111 transition count 302
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 675 place count 111 transition count 301
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 687 place count 105 transition count 295
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 699 place count 99 transition count 304
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 700 place count 99 transition count 303
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 8 with 7 rules applied. Total rules applied 707 place count 99 transition count 296
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 715 place count 99 transition count 288
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 8 with 8 rules applied. Total rules applied 723 place count 91 transition count 288
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 725 place count 89 transition count 286
Iterating global reduction 9 with 2 rules applied. Total rules applied 727 place count 89 transition count 286
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 729 place count 89 transition count 286
Applied a total of 729 rules in 212 ms. Remains 89 /475 variables (removed 386) and now considering 286/692 (removed 406) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 212 ms. Remains : 89/475 places, 286/692 transitions.
Incomplete random walk after 10000 steps, including 617 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 18) seen :6
Incomplete Best-First random walk after 10000 steps, including 114 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 117 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 109 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 118 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 121 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 286 rows 89 cols
[2023-03-23 06:04:21] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-23 06:04:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 06:04:21] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-23 06:04:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2023-03-23 06:04:21] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-23 06:04:21] [INFO ] State equation strengthened by 55 read => feed constraints.
[2023-03-23 06:04:21] [INFO ] After 71ms SMT Verify possible using 55 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-23 06:04:21] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-23 06:04:21] [INFO ] After 426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 14 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=14 )
Parikh walk visited 4 properties in 2 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
[2023-03-23 06:04:21] [INFO ] Flatten gal took : 54 ms
[2023-03-23 06:04:21] [INFO ] Flatten gal took : 45 ms
[2023-03-23 06:04:22] [INFO ] Input system was already deterministic with 692 transitions.
Computed a total of 65 stabilizing places and 69 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 453 transition count 670
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 453 transition count 670
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 51 place count 446 transition count 663
Iterating global reduction 0 with 7 rules applied. Total rules applied 58 place count 446 transition count 663
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 445 transition count 662
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 445 transition count 662
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 444 transition count 661
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 444 transition count 661
Applied a total of 62 rules in 74 ms. Remains 444 /475 variables (removed 31) and now considering 661/692 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 76 ms. Remains : 444/475 places, 661/692 transitions.
[2023-03-23 06:04:22] [INFO ] Flatten gal took : 40 ms
[2023-03-23 06:04:22] [INFO ] Flatten gal took : 40 ms
[2023-03-23 06:04:22] [INFO ] Input system was already deterministic with 661 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Graph (trivial) has 434 edges and 475 vertex of which 53 / 475 are part of one of the 10 SCC in 1 ms
Free SCC test removed 43 places
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 268 rules applied. Total rules applied 269 place count 431 transition count 375
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 1 with 278 rules applied. Total rules applied 547 place count 163 transition count 365
Reduce places removed 5 places and 0 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 2 with 21 rules applied. Total rules applied 568 place count 158 transition count 349
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 584 place count 142 transition count 349
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 584 place count 142 transition count 338
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 606 place count 131 transition count 338
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 617 place count 120 transition count 326
Iterating global reduction 4 with 11 rules applied. Total rules applied 628 place count 120 transition count 326
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 630 place count 120 transition count 324
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 631 place count 119 transition count 324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 631 place count 119 transition count 323
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 633 place count 118 transition count 323
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 634 place count 117 transition count 322
Iterating global reduction 6 with 1 rules applied. Total rules applied 635 place count 117 transition count 322
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 663 place count 103 transition count 308
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 668 place count 98 transition count 276
Iterating global reduction 6 with 5 rules applied. Total rules applied 673 place count 98 transition count 276
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 674 place count 98 transition count 275
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 675 place count 97 transition count 273
Iterating global reduction 7 with 1 rules applied. Total rules applied 676 place count 97 transition count 273
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 7 with 2 rules applied. Total rules applied 678 place count 96 transition count 272
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 679 place count 95 transition count 265
Iterating global reduction 7 with 1 rules applied. Total rules applied 680 place count 95 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 681 place count 95 transition count 264
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 8 with 5 rules applied. Total rules applied 686 place count 95 transition count 259
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 4 places and 0 transitions.
Iterating global reduction 8 with 8 rules applied. Total rules applied 694 place count 91 transition count 255
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 695 place count 91 transition count 255
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 696 place count 90 transition count 254
Applied a total of 696 rules in 146 ms. Remains 90 /475 variables (removed 385) and now considering 254/692 (removed 438) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 148 ms. Remains : 90/475 places, 254/692 transitions.
[2023-03-23 06:04:22] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:04:22] [INFO ] Flatten gal took : 24 ms
[2023-03-23 06:04:22] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 455 transition count 672
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 455 transition count 672
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 448 transition count 665
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 448 transition count 665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 447 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 447 transition count 664
Applied a total of 56 rules in 91 ms. Remains 447 /475 variables (removed 28) and now considering 664/692 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 447/475 places, 664/692 transitions.
[2023-03-23 06:04:22] [INFO ] Flatten gal took : 31 ms
[2023-03-23 06:04:22] [INFO ] Flatten gal took : 30 ms
[2023-03-23 06:04:22] [INFO ] Input system was already deterministic with 664 transitions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 452 transition count 669
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 452 transition count 669
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 444 transition count 661
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 442 transition count 659
Applied a total of 66 rules in 92 ms. Remains 442 /475 variables (removed 33) and now considering 659/692 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 442/475 places, 659/692 transitions.
[2023-03-23 06:04:22] [INFO ] Flatten gal took : 23 ms
[2023-03-23 06:04:22] [INFO ] Flatten gal took : 25 ms
[2023-03-23 06:04:23] [INFO ] Input system was already deterministic with 659 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Graph (trivial) has 483 edges and 475 vertex of which 72 / 475 are part of one of the 12 SCC in 1 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 289 transitions
Trivial Post-agglo rules discarded 289 transitions
Performed 289 trivial Post agglomeration. Transition count delta: 289
Iterating post reduction 0 with 289 rules applied. Total rules applied 290 place count 414 transition count 334
Reduce places removed 289 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 297 rules applied. Total rules applied 587 place count 125 transition count 326
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 591 place count 121 transition count 326
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 591 place count 121 transition count 313
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 617 place count 108 transition count 313
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 629 place count 96 transition count 298
Iterating global reduction 3 with 12 rules applied. Total rules applied 641 place count 96 transition count 298
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 641 place count 96 transition count 296
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 645 place count 94 transition count 296
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 648 place count 91 transition count 266
Iterating global reduction 3 with 3 rules applied. Total rules applied 651 place count 91 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 652 place count 91 transition count 265
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 653 place count 90 transition count 263
Iterating global reduction 4 with 1 rules applied. Total rules applied 654 place count 90 transition count 263
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 684 place count 75 transition count 248
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 698 place count 61 transition count 135
Iterating global reduction 4 with 14 rules applied. Total rules applied 712 place count 61 transition count 135
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 719 place count 61 transition count 128
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 721 place count 59 transition count 124
Iterating global reduction 5 with 2 rules applied. Total rules applied 723 place count 59 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 724 place count 58 transition count 122
Iterating global reduction 5 with 1 rules applied. Total rules applied 725 place count 58 transition count 122
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 5 with 2 rules applied. Total rules applied 727 place count 57 transition count 121
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 731 place count 57 transition count 117
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 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 739 place count 53 transition count 113
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 740 place count 52 transition count 112
Applied a total of 740 rules in 71 ms. Remains 52 /475 variables (removed 423) and now considering 112/692 (removed 580) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 52/475 places, 112/692 transitions.
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 8 ms
[2023-03-23 06:04:23] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Graph (trivial) has 464 edges and 475 vertex of which 72 / 475 are part of one of the 12 SCC in 0 ms
Free SCC test removed 60 places
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 277 transitions
Trivial Post-agglo rules discarded 277 transitions
Performed 277 trivial Post agglomeration. Transition count delta: 277
Iterating post reduction 0 with 277 rules applied. Total rules applied 278 place count 414 transition count 346
Reduce places removed 277 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 285 rules applied. Total rules applied 563 place count 137 transition count 338
Reduce places removed 4 places and 0 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 2 with 16 rules applied. Total rules applied 579 place count 133 transition count 326
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 591 place count 121 transition count 326
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 591 place count 121 transition count 312
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 619 place count 107 transition count 312
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 633 place count 93 transition count 295
Iterating global reduction 4 with 14 rules applied. Total rules applied 647 place count 93 transition count 295
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 647 place count 93 transition count 293
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 651 place count 91 transition count 293
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 656 place count 86 transition count 259
Iterating global reduction 4 with 5 rules applied. Total rules applied 661 place count 86 transition count 259
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 662 place count 86 transition count 258
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 665 place count 83 transition count 252
Iterating global reduction 5 with 3 rules applied. Total rules applied 668 place count 83 transition count 252
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 694 place count 70 transition count 239
Discarding 12 places :
Symmetric choice reduction at 5 with 12 rule applications. Total rules 706 place count 58 transition count 130
Iterating global reduction 5 with 12 rules applied. Total rules applied 718 place count 58 transition count 130
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 725 place count 58 transition count 123
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 726 place count 57 transition count 121
Iterating global reduction 6 with 1 rules applied. Total rules applied 727 place count 57 transition count 121
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 728 place count 56 transition count 119
Iterating global reduction 6 with 1 rules applied. Total rules applied 729 place count 56 transition count 119
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 6 with 2 rules applied. Total rules applied 731 place count 55 transition count 118
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 732 place count 54 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 733 place count 54 transition count 114
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 734 place count 54 transition count 113
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 738 place count 54 transition count 109
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 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 746 place count 50 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 747 place count 49 transition count 104
Applied a total of 747 rules in 61 ms. Remains 49 /475 variables (removed 426) and now considering 104/692 (removed 588) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 49/475 places, 104/692 transitions.
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 6 ms
[2023-03-23 06:04:23] [INFO ] Input system was already deterministic with 104 transitions.
Incomplete random walk after 10000 steps, including 915 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Finished Best-First random walk after 362 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=181 )
FORMULA StigmergyElection-PT-04b-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 452 transition count 669
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 452 transition count 669
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 52 place count 446 transition count 663
Iterating global reduction 0 with 6 rules applied. Total rules applied 58 place count 446 transition count 663
Applied a total of 58 rules in 56 ms. Remains 446 /475 variables (removed 29) and now considering 663/692 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 446/475 places, 663/692 transitions.
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 24 ms
[2023-03-23 06:04:23] [INFO ] Input system was already deterministic with 663 transitions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 455 transition count 672
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 455 transition count 672
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 46 place count 449 transition count 666
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 449 transition count 666
Applied a total of 52 rules in 43 ms. Remains 449 /475 variables (removed 26) and now considering 666/692 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 449/475 places, 666/692 transitions.
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 23 ms
[2023-03-23 06:04:23] [INFO ] Input system was already deterministic with 666 transitions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 455 transition count 672
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 455 transition count 672
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 47 place count 448 transition count 665
Iterating global reduction 0 with 7 rules applied. Total rules applied 54 place count 448 transition count 665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 447 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 446 transition count 663
Applied a total of 58 rules in 73 ms. Remains 446 /475 variables (removed 29) and now considering 663/692 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 446/475 places, 663/692 transitions.
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 21 ms
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 23 ms
[2023-03-23 06:04:23] [INFO ] Input system was already deterministic with 663 transitions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 456 transition count 673
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 456 transition count 673
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 46 place count 448 transition count 665
Iterating global reduction 0 with 8 rules applied. Total rules applied 54 place count 448 transition count 665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 447 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 446 transition count 663
Applied a total of 58 rules in 57 ms. Remains 446 /475 variables (removed 29) and now considering 663/692 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 446/475 places, 663/692 transitions.
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 21 ms
[2023-03-23 06:04:23] [INFO ] Flatten gal took : 23 ms
[2023-03-23 06:04:23] [INFO ] Input system was already deterministic with 663 transitions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 454 transition count 671
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 454 transition count 671
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 449 transition count 666
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 449 transition count 666
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 448 transition count 665
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 448 transition count 665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 447 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 447 transition count 664
Applied a total of 56 rules in 63 ms. Remains 447 /475 variables (removed 28) and now considering 664/692 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 447/475 places, 664/692 transitions.
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 21 ms
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 23 ms
[2023-03-23 06:04:24] [INFO ] Input system was already deterministic with 664 transitions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 452 transition count 669
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 452 transition count 669
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 444 transition count 661
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 442 transition count 659
Applied a total of 66 rules in 49 ms. Remains 442 /475 variables (removed 33) and now considering 659/692 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 442/475 places, 659/692 transitions.
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 20 ms
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:04:24] [INFO ] Input system was already deterministic with 659 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Graph (trivial) has 476 edges and 475 vertex of which 69 / 475 are part of one of the 11 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 66 transitions
Reduce isomorphic transitions removed 66 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 284 place count 416 transition count 342
Reduce places removed 283 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 291 rules applied. Total rules applied 575 place count 133 transition count 334
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 5 rules applied. Total rules applied 580 place count 129 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 581 place count 128 transition count 333
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 581 place count 128 transition count 319
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 609 place count 114 transition count 319
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 620 place count 103 transition count 305
Iterating global reduction 4 with 11 rules applied. Total rules applied 631 place count 103 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 631 place count 103 transition count 303
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 635 place count 101 transition count 303
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 638 place count 98 transition count 273
Iterating global reduction 4 with 3 rules applied. Total rules applied 641 place count 98 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 642 place count 98 transition count 272
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 643 place count 97 transition count 270
Iterating global reduction 5 with 1 rules applied. Total rules applied 644 place count 97 transition count 270
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 674 place count 82 transition count 255
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 687 place count 69 transition count 150
Iterating global reduction 5 with 13 rules applied. Total rules applied 700 place count 69 transition count 150
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 705 place count 69 transition count 145
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 708 place count 66 transition count 139
Iterating global reduction 6 with 3 rules applied. Total rules applied 711 place count 66 transition count 139
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 712 place count 65 transition count 137
Iterating global reduction 6 with 1 rules applied. Total rules applied 713 place count 65 transition count 137
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 6 with 2 rules applied. Total rules applied 715 place count 64 transition count 136
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 716 place count 63 transition count 132
Iterating global reduction 6 with 1 rules applied. Total rules applied 717 place count 63 transition count 132
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 718 place count 63 transition count 131
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 722 place count 63 transition count 127
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 4 places and 0 transitions.
Iterating global reduction 7 with 8 rules applied. Total rules applied 730 place count 59 transition count 123
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 731 place count 58 transition count 122
Applied a total of 731 rules in 56 ms. Remains 58 /475 variables (removed 417) and now considering 122/692 (removed 570) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 58/475 places, 122/692 transitions.
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 6 ms
[2023-03-23 06:04:24] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Graph (trivial) has 484 edges and 475 vertex of which 70 / 475 are part of one of the 12 SCC in 1 ms
Free SCC test removed 58 places
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 292 transitions
Trivial Post-agglo rules discarded 292 transitions
Performed 292 trivial Post agglomeration. Transition count delta: 292
Iterating post reduction 0 with 292 rules applied. Total rules applied 293 place count 416 transition count 334
Reduce places removed 292 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 300 rules applied. Total rules applied 593 place count 124 transition count 326
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 597 place count 120 transition count 326
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 597 place count 120 transition count 313
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 623 place count 107 transition count 313
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 634 place count 96 transition count 300
Iterating global reduction 3 with 11 rules applied. Total rules applied 645 place count 96 transition count 300
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 645 place count 96 transition count 298
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 649 place count 94 transition count 298
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 652 place count 91 transition count 268
Iterating global reduction 3 with 3 rules applied. Total rules applied 655 place count 91 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 656 place count 91 transition count 267
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 657 place count 90 transition count 265
Iterating global reduction 4 with 1 rules applied. Total rules applied 658 place count 90 transition count 265
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 688 place count 75 transition count 250
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 701 place count 62 transition count 139
Iterating global reduction 4 with 13 rules applied. Total rules applied 714 place count 62 transition count 139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 721 place count 62 transition count 132
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 723 place count 60 transition count 128
Iterating global reduction 5 with 2 rules applied. Total rules applied 725 place count 60 transition count 128
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 726 place count 59 transition count 126
Iterating global reduction 5 with 1 rules applied. Total rules applied 727 place count 59 transition count 126
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 5 with 2 rules applied. Total rules applied 729 place count 58 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 730 place count 57 transition count 120
Iterating global reduction 5 with 1 rules applied. Total rules applied 731 place count 57 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 732 place count 57 transition count 119
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 6 with 5 rules applied. Total rules applied 737 place count 57 transition count 114
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 747 place count 52 transition count 109
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 748 place count 51 transition count 108
Applied a total of 748 rules in 48 ms. Remains 51 /475 variables (removed 424) and now considering 108/692 (removed 584) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 51/475 places, 108/692 transitions.
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 5 ms
[2023-03-23 06:04:24] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 454 transition count 671
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 454 transition count 671
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 448 transition count 665
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 448 transition count 665
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 447 transition count 664
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 447 transition count 664
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 446 transition count 663
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 446 transition count 663
Applied a total of 58 rules in 63 ms. Remains 446 /475 variables (removed 29) and now considering 663/692 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64 ms. Remains : 446/475 places, 663/692 transitions.
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 20 ms
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:04:24] [INFO ] Input system was already deterministic with 663 transitions.
Starting structural reductions in LTL mode, iteration 0 : 475/475 places, 692/692 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 452 transition count 669
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 452 transition count 669
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 54 place count 444 transition count 661
Iterating global reduction 0 with 8 rules applied. Total rules applied 62 place count 444 transition count 661
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 443 transition count 660
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 443 transition count 660
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 442 transition count 659
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 442 transition count 659
Applied a total of 66 rules in 58 ms. Remains 442 /475 variables (removed 33) and now considering 659/692 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 442/475 places, 659/692 transitions.
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 27 ms
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 21 ms
[2023-03-23 06:04:24] [INFO ] Input system was already deterministic with 659 transitions.
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 23 ms
[2023-03-23 06:04:24] [INFO ] Flatten gal took : 22 ms
[2023-03-23 06:04:24] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-23 06:04:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 475 places, 692 transitions and 2504 arcs took 5 ms.
Total runtime 24321 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: 475 NrTr: 692 NrArc: 2504)

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

net check time: 0m 0.000sec

init dd package: 0m 3.810sec


RS generation: 0m28.022sec


-> reachability set: #nodes 29756 (3.0e+04) #states 926,649,151 (8)



starting MCC model checker
--------------------------

checking: EX [AG [AF [[p458<=1 & 1<=p458]]]]
normalized: EX [~ [E [true U EG [~ [[p458<=1 & 1<=p458]]]]]]

abstracting: (1<=p458)
states: 4,533,452 (6)
abstracting: (p458<=1)
states: 926,649,151 (8)
.......................................................................................................
EG iterations: 103
.-> the formula is FALSE

FORMULA StigmergyElection-PT-04b-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m 5.577sec

checking: EF [EG [AF [[p281<=1 & 1<=p281]]]]
normalized: E [true U EG [~ [EG [~ [[p281<=1 & 1<=p281]]]]]]

abstracting: (1<=p281)
states: 4,465,818 (6)
abstracting: (p281<=1)
states: 926,649,151 (8)
............................
before gc: list nodes free: 928293

after gc: idd nodes used:171696, unused:63828304; list nodes free:309596759
...........................
EG iterations: 55
........................................................
EG iterations: 56
-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m 8.774sec

checking: [EG [EF [[[p448<=0 & 0<=p448] | [p474<=0 & 0<=p474]]]] & AX [EG [AF [[p16<=0 & 0<=p16]]]]]
normalized: [~ [EX [~ [EG [~ [EG [~ [[p16<=0 & 0<=p16]]]]]]]] & EG [E [true U [[p474<=0 & 0<=p474] | [p448<=0 & 0<=p448]]]]]

abstracting: (0<=p448)
states: 926,649,151 (8)
abstracting: (p448<=0)
states: 922,115,699 (8)
abstracting: (0<=p474)
states: 926,649,151 (8)
abstracting: (p474<=0)
states: 860,459,926 (8)

EG iterations: 0
abstracting: (0<=p16)
states: 926,649,151 (8)
abstracting: (p16<=0)
states: 921,915,751 (8)
....................................................
EG iterations: 52
.
EG iterations: 1
.-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.772sec

checking: EF [EG [[EG [[p116<=1 & 1<=p116]] | [[p405<=1 & 1<=p405] & [p463<=1 & 1<=p463]]]]]
normalized: E [true U EG [[[[p463<=1 & 1<=p463] & [p405<=1 & 1<=p405]] | EG [[p116<=1 & 1<=p116]]]]]

abstracting: (1<=p116)
states: 4,599,126 (6)
abstracting: (p116<=1)
states: 926,649,151 (8)
.................................................................................................
EG iterations: 97
abstracting: (1<=p405)
states: 4,665,780 (6)
abstracting: (p405<=1)
states: 926,649,151 (8)
abstracting: (1<=p463)
states: 66,189,225 (7)
abstracting: (p463<=1)
states: 926,649,151 (8)
...............................................
EG iterations: 47
-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m26.191sec

checking: EF [AX [[[[p29<=1 & 1<=p29] | AG [[p144<=0 & 0<=p144]]] & [[p452<=1 & 1<=p452] | [p457<=0 & 0<=p457]]]]]
normalized: E [true U ~ [EX [~ [[[[p457<=0 & 0<=p457] | [p452<=1 & 1<=p452]] & [~ [E [true U ~ [[p144<=0 & 0<=p144]]]] | [p29<=1 & 1<=p29]]]]]]]

abstracting: (1<=p29)
states: 11,705,148 (7)
abstracting: (p29<=1)
states: 926,649,151 (8)
abstracting: (0<=p144)
states: 926,649,151 (8)
abstracting: (p144<=0)
states: 914,719,051 (8)
abstracting: (1<=p452)
states: 4,533,452 (6)
abstracting: (p452<=1)
states: 926,649,151 (8)
abstracting: (0<=p457)
states: 926,649,151 (8)
abstracting: (p457<=0)
states: 922,115,699 (8)

before gc: list nodes free: 19185046

after gc: idd nodes used:227797, unused:63772203; list nodes free:309340786
.-> the formula is TRUE

FORMULA StigmergyElection-PT-04b-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m12.699sec

checking: AX [EF [[AF [[p27<=1 & 1<=p27]] | [EG [[p471<=1 & 1<=p471]] & [[p27<=1 & 1<=p27] & [p427<=1 & 1<=p427]]]]]]
normalized: ~ [EX [~ [E [true U [[[[p427<=1 & 1<=p427] & [p27<=1 & 1<=p27]] & EG [[p471<=1 & 1<=p471]]] | ~ [EG [~ [[p27<=1 & 1<=p27]]]]]]]]]

abstracting: (1<=p27)
states: 11,705,148 (7)
abstracting: (p27<=1)
states: 926,649,151 (8)
......................................................................................................
EG iterations: 102
abstracting: (1<=p471)
states: 66,189,225 (7)
abstracting: (p471<=1)
states: 926,649,151 (8)

before gc: list nodes free: 7743159

after gc: idd nodes used:220015, unused:63779985; list nodes free:309363501
.........................
before gc: list nodes free: 13450553

after gc: idd nodes used:701294, unused:63298706; list nodes free:307247961
.MC time: 5m 2.088sec

checking: A [EX [EX [~ [[[[p305<=1 & 1<=p305] | [p411<=1 & 1<=p411]] | [[p335<=1 & 1<=p335] | [p161<=1 & 1<=p161]]]]]] U EX [AF [[[p93<=1 & 1<=p93] | [p16<=1 & 1<=p16]]]]]
normalized: [~ [EG [~ [EX [~ [EG [~ [[[p16<=1 & 1<=p16] | [p93<=1 & 1<=p93]]]]]]]]] & ~ [E [~ [EX [~ [EG [~ [[[p16<=1 & 1<=p16] | [p93<=1 & 1<=p93]]]]]]] U [~ [EX [EX [~ [[[[p161<=1 & 1<=p161] | [p335<=1 & 1<=p335]] | [[p411<=1 & 1<=p411] | [p305<=1 & 1<=p305]]]]]]] & ~ [EX [~ [EG [~ [[[p16<=1 & 1<=p16] | [p93<=1 & 1<=p93]]]]]]]]]]]

abstracting: (1<=p93)
states: 4,665,780 (6)
abstracting: (p93<=1)
states: 926,649,151 (8)
abstracting: (1<=p16)
states: 4,733,400 (6)
abstracting: (p16<=1)
states: 926,649,151 (8)
.............................................................................................
EG iterations: 93
.abstracting: (1<=p305)
states: 4,465,818 (6)
abstracting: (p305<=1)
states: 926,649,151 (8)
abstracting: (1<=p411)
states: 12,106,164 (7)
abstracting: (p411<=1)
states: 926,649,151 (8)
abstracting: (1<=p335)
states: 11,906,188 (7)
abstracting: (p335<=1)
states: 926,649,151 (8)
abstracting: (1<=p161)
states: 11,930,100 (7)
abstracting: (p161<=1)
states: 926,649,151 (8)
..abstracting: (1<=p93)
states: 4,665,780 (6)
abstracting: (p93<=1)
states: 926,649,151 (8)
abstracting: (1<=p16)
states: 4,733,400 (6)
abstracting: (p16<=1)
states: 926,649,151 (8)
.............................................................................................
EG iterations: 93
.
before gc: list nodes free: 8614905

after gc: idd nodes used:221124, unused:63778876; list nodes free:309342247
abstracting: (1<=p93)
states: 4,665,780 (6)
abstracting: (p93<=1)
states: 926,649,151 (8)
abstracting: (1<=p16)
states: 4,733,400 (6)
abstracting: (p16<=1)
states: 926,649,151 (8)
.............................................................................................
EG iterations: 93
................MC time: 4m32.000sec

checking: A [[p204<=1 & 1<=p204] U ~ [[~ [EF [[p163<=1 & 1<=p163]]] | EF [[[p31<=1 & 1<=p31] | [[[p64<=1 & 1<=p64] & [p178<=1 & 1<=p178]] & [[p306<=1 & 1<=p306] & [p406<=1 & 1<=p406]]]]]]]]
normalized: [~ [EG [[E [true U [[[[p406<=1 & 1<=p406] & [p306<=1 & 1<=p306]] & [[p178<=1 & 1<=p178] & [p64<=1 & 1<=p64]]] | [p31<=1 & 1<=p31]]] | ~ [E [true U [p163<=1 & 1<=p163]]]]]] & ~ [E [[E [true U [[[[p406<=1 & 1<=p406] & [p306<=1 & 1<=p306]] & [[p178<=1 & 1<=p178] & [p64<=1 & 1<=p64]]] | [p31<=1 & 1<=p31]]] | ~ [E [true U [p163<=1 & 1<=p163]]]] U [~ [[p204<=1 & 1<=p204]] & [E [true U [[[[p406<=1 & 1<=p406] & [p306<=1 & 1<=p306]] & [[p178<=1 & 1<=p178] & [p64<=1 & 1<=p64]]] | [p31<=1 & 1<=p31]]] | ~ [E [true U [p163<=1 & 1<=p163]]]]]]]]

abstracting: (1<=p163)
states: 11,930,100 (7)
abstracting: (p163<=1)
states: 926,649,151 (8)

before gc: list nodes free: 6750015

after gc: idd nodes used:213770, unused:63786230; list nodes free:309394729
abstracting: (1<=p31)
states: 11,705,148 (7)
abstracting: (p31<=1)
states: 926,649,151 (8)
abstracting: (1<=p64)
states: 11,705,148 (7)
abstracting: (p64<=1)
states: 926,649,151 (8)
abstracting: (1<=p178)
states: 11,930,100 (7)
abstracting: (p178<=1)
states: 926,649,151 (8)
abstracting: (1<=p306)
states: 11,906,188 (7)
abstracting: (p306<=1)
states: 926,649,151 (8)
abstracting: (1<=p406)
states: 12,106,164 (7)
abstracting: (p406<=1)
states: 926,649,151 (8)
abstracting: (1<=p204)
states: 4,732,434 (6)
abstracting: (p204<=1)
states: 926,649,151 (8)
abstracting: (1<=p163)
states: 11,930,100 (7)
abstracting: (p163<=1)
states: 926,649,151 (8)
MC time: 4m 4.000sec

checking: [EX [EX [EF [[[p7<=0 & 0<=p7] & [p206<=1 & 1<=p206]]]]] & [A [[[~ [AX [[p66<=1 & 1<=p66]]] & [[p92<=1 & 1<=p92] & ~ [[p458<=1 & 1<=p458]]]] | [[[[p46<=1 & 1<=p46] & [p162<=1 & 1<=p162]] & [[p255<=1 & 1<=p255] & [p391<=1 & 1<=p391]]] | [p121<=1 & 1<=p121]]] U [p394<=1 & 1<=p394]] | EG [[p61<=0 & 0<=p61]]]]
normalized: [[EG [[p61<=0 & 0<=p61]] | [~ [EG [~ [[p394<=1 & 1<=p394]]]] & ~ [E [~ [[p394<=1 & 1<=p394]] U [~ [[[[p121<=1 & 1<=p121] | [[[p391<=1 & 1<=p391] & [p255<=1 & 1<=p255]] & [[p162<=1 & 1<=p162] & [p46<=1 & 1<=p46]]]] | [[~ [[p458<=1 & 1<=p458]] & [p92<=1 & 1<=p92]] & EX [~ [[p66<=1 & 1<=p66]]]]]] & ~ [[p394<=1 & 1<=p394]]]]]]] & EX [EX [E [true U [[p206<=1 & 1<=p206] & [p7<=0 & 0<=p7]]]]]]

abstracting: (0<=p7)
states: 926,649,151 (8)
abstracting: (p7<=0)
states: 921,915,751 (8)
abstracting: (1<=p206)
states: 4,732,434 (6)
abstracting: (p206<=1)
states: 926,649,151 (8)
..abstracting: (1<=p394)
states: 4,665,780 (6)
abstracting: (p394<=1)
states: 926,649,151 (8)
abstracting: (1<=p66)
states: 11,705,148 (7)
abstracting: (p66<=1)
states: 926,649,151 (8)
.abstracting: (1<=p92)
states: 4,665,780 (6)
abstracting: (p92<=1)
states: 926,649,151 (8)
abstracting: (1<=p458)
states: 4,533,452 (6)
abstracting: (p458<=1)
states: 926,649,151 (8)
abstracting: (1<=p46)
states: 11,705,148 (7)
abstracting: (p46<=1)
states: 926,649,151 (8)
abstracting: (1<=p162)
states: 11,930,100 (7)
abstracting: (p162<=1)
states: 926,649,151 (8)
abstracting: (1<=p255)
states: 11,906,188 (7)
abstracting: (p255<=1)
states: 926,649,151 (8)
abstracting: (1<=p391)
states: 12,106,164 (7)
abstracting: (p391<=1)
states: 926,649,151 (8)
abstracting: (1<=p121)
states: 4,599,126 (6)
abstracting: (p121<=1)
states: 926,649,151 (8)
abstracting: (1<=p394)
states: 4,665,780 (6)
abstracting: (p394<=1)
states: 926,649,151 (8)
abstracting: (1<=p394)
states: 4,665,780 (6)
abstracting: (p394<=1)
states: 926,649,151 (8)
.
EG iterations: 1
abstracting: (0<=p61)
states: 926,649,151 (8)
abstracting: (p61<=0)
states: 922,118,611 (8)
...............................................................
before gc: list nodes free: 15328102

after gc: idd nodes used:322957, unused:63677043; list nodes free:308901355
.MC time: 3m40.010sec

checking: A [EF [AX [[[[p86<=1 & 1<=p86] & [p178<=1 & 1<=p178]] & [[p294<=1 & 1<=p294] & [p406<=1 & 1<=p406]]]]] U [AF [[AF [[p49<=1 & 1<=p49]] | E [[p237<=1 & 1<=p237] U [p264<=1 & 1<=p264]]]] | [AG [~ [AX [[p318<=1 & 1<=p318]]]] | [AF [AG [[p179<=1 & 1<=p179]]] & E [AX [[p154<=1 & 1<=p154]] U [[[p108<=1 & 1<=p108] & [p366<=1 & 1<=p366]] & [[p463<=1 & 1<=p463] & ~ [[p204<=1 & 1<=p204]]]]]]]]]
normalized: [~ [EG [~ [[[[E [~ [EX [~ [[p154<=1 & 1<=p154]]]] U [[~ [[p204<=1 & 1<=p204]] & [p463<=1 & 1<=p463]] & [[p366<=1 & 1<=p366] & [p108<=1 & 1<=p108]]]] & ~ [EG [E [true U ~ [[p179<=1 & 1<=p179]]]]]] | ~ [E [true U ~ [EX [~ [[p318<=1 & 1<=p318]]]]]]] | ~ [EG [~ [[E [[p237<=1 & 1<=p237] U [p264<=1 & 1<=p264]] | ~ [EG [~ [[p49<=1 & 1<=p49]]]]]]]]]]]] & ~ [E [~ [[[[E [~ [EX [~ [[p154<=1 & 1<=p154]]]] U [[~ [[p204<=1 & 1<=p204]] & [p463<=1 & 1<=p463]] & [[p366<=1 & 1<=p366] & [p108<=1 & 1<=p108]]]] & ~ [EG [E [true U ~ [[p179<=1 & 1<=p179]]]]]] | ~ [E [true U ~ [EX [~ [[p318<=1 & 1<=p318]]]]]]] | ~ [EG [~ [[E [[p237<=1 & 1<=p237] U [p264<=1 & 1<=p264]] | ~ [EG [~ [[p49<=1 & 1<=p49]]]]]]]]]] U [~ [E [true U ~ [EX [~ [[[[p406<=1 & 1<=p406] & [p294<=1 & 1<=p294]] & [[p178<=1 & 1<=p178] & [p86<=1 & 1<=p86]]]]]]]] & ~ [[[[E [~ [EX [~ [[p154<=1 & 1<=p154]]]] U [[~ [[p204<=1 & 1<=p204]] & [p463<=1 & 1<=p463]] & [[p366<=1 & 1<=p366] & [p108<=1 & 1<=p108]]]] & ~ [EG [E [true U ~ [[p179<=1 & 1<=p179]]]]]] | ~ [E [true U ~ [EX [~ [[p318<=1 & 1<=p318]]]]]]] | ~ [EG [~ [[E [[p237<=1 & 1<=p237] U [p264<=1 & 1<=p264]] | ~ [EG [~ [[p49<=1 & 1<=p49]]]]]]]]]]]]]]

abstracting: (1<=p49)
states: 4,530,540 (6)
abstracting: (p49<=1)
states: 926,649,151 (8)
........................................................
EG iterations: 56
abstracting: (1<=p264)
states: 11,906,188 (7)
abstracting: (p264<=1)
states: 926,649,151 (8)
abstracting: (1<=p237)
states: 4,801,020 (6)
abstracting: (p237<=1)
states: 926,649,151 (8)
.................................................................
before gc: list nodes free: 6485046

after gc: idd nodes used:320913, unused:63679087; list nodes free:308887539
.................................
EG iterations: 98
abstracting: (1<=p318)
states: 11,906,188 (7)
abstracting: (p318<=1)
states: 926,649,151 (8)
.MC time: 3m17.999sec

checking: [EG [[[p122<=0 & 0<=p122] | EF [[p94<=0 & 0<=p94]]]] & [AX [[AF [[p32<=1 & 1<=p32]] & [EX [[p196<=1 & 1<=p196]] & AX [[[[p64<=1 & 1<=p64] & [p178<=1 & 1<=p178]] & [[p294<=1 & 1<=p294] & [p406<=1 & 1<=p406]]]]]]] | EX [[~ [A [[[[p75<=1 & 1<=p75] & [p189<=1 & 1<=p189]] & [[p317<=1 & 1<=p317] & [p406<=1 & 1<=p406]]] U [p160<=1 & 1<=p160]]] | [[[p219<=0 & 0<=p219] & [[p253<=1 & 1<=p253] | [[[p75<=1 & 1<=p75] & [p201<=1 & 1<=p201]] & [[p294<=1 & 1<=p294] & [p406<=1 & 1<=p406]]]]] | [p174<=0 & 0<=p174]]]]]]
normalized: [[EX [[[[p174<=0 & 0<=p174] | [[[[[p406<=1 & 1<=p406] & [p294<=1 & 1<=p294]] & [[p201<=1 & 1<=p201] & [p75<=1 & 1<=p75]]] | [p253<=1 & 1<=p253]] & [p219<=0 & 0<=p219]]] | ~ [[~ [EG [~ [[p160<=1 & 1<=p160]]]] & ~ [E [~ [[p160<=1 & 1<=p160]] U [~ [[[[p406<=1 & 1<=p406] & [p317<=1 & 1<=p317]] & [[p189<=1 & 1<=p189] & [p75<=1 & 1<=p75]]]] & ~ [[p160<=1 & 1<=p160]]]]]]]]] | ~ [EX [~ [[[~ [EX [~ [[[[p406<=1 & 1<=p406] & [p294<=1 & 1<=p294]] & [[p178<=1 & 1<=p178] & [p64<=1 & 1<=p64]]]]]] & EX [[p196<=1 & 1<=p196]]] & ~ [EG [~ [[p32<=1 & 1<=p32]]]]]]]]] & EG [[E [true U [p94<=0 & 0<=p94]] | [p122<=0 & 0<=p122]]]]

abstracting: (0<=p122)
states: 926,649,151 (8)
abstracting: (p122<=0)
states: 922,116,679 (8)
abstracting: (0<=p94)
states: 926,649,151 (8)
abstracting: (p94<=0)
states: 921,983,371 (8)

EG iterations: 0
abstracting: (1<=p32)
states: 11,705,148 (7)
abstracting: (p32<=1)
states: 926,649,151 (8)
.................................................................................................
EG iterations: 97
abstracting: (1<=p196)
states: 11,930,100 (7)
abstracting: (p196<=1)
states: 926,649,151 (8)
.abstracting: (1<=p64)
states: 11,705,148 (7)
abstracting: (p64<=1)
states: 926,649,151 (8)
abstracting: (1<=p178)
states: 11,930,100 (7)
abstracting: (p178<=1)
states: 926,649,151 (8)
abstracting: (1<=p294)
states: 11,906,188 (7)
abstracting: (p294<=1)
states: 926,649,151 (8)
abstracting: (1<=p406)
states: 12,106,164 (7)
abstracting: (p406<=1)
states: 926,649,151 (8)
..abstracting: (1<=p160)
states: 11,930,100 (7)
abstracting: (p160<=1)
states: 926,649,151 (8)
abstracting: (1<=p75)
states: 11,705,148 (7)
abstracting: (p75<=1)
states: 926,649,151 (8)
abstracting: (1<=p189)
states: 11,930,100 (7)
abstracting: (p189<=1)
states: 926,649,151 (8)
abstracting: (1<=p317)
states: 11,906,188 (7)
abstracting: (p317<=1)
states: 926,649,151 (8)
abstracting: (1<=p406)
states: 12,106,164 (7)
abstracting: (p406<=1)
states: 926,649,151 (8)
abstracting: (1<=p160)
states: 11,930,100 (7)
abstracting: (p160<=1)
states: 926,649,151 (8)
abstracting: (1<=p160)
states: 11,930,100 (7)
abstracting: (p160<=1)
states: 926,649,151 (8)
...
before gc: list nodes free: 6295976

after gc: idd nodes used:323431, unused:63676569; list nodes free:308873189
...................................MC time: 2m58.001sec

checking: A [AG [[~ [[~ [[[[p64<=1 & 1<=p64] & [p201<=1 & 1<=p201]] & [[p306<=1 & 1<=p306] & [p428<=1 & 1<=p428]]]] | [p289<=1 & 1<=p289]]] | [[p238<=1 & 1<=p238] & [A [[p303<=1 & 1<=p303] U [p168<=1 & 1<=p168]] & AG [[p56<=1 & 1<=p56]]]]]] U ~ [[[~ [[~ [[[p327<=1 & 1<=p327] & [p474<=1 & 1<=p474]]] & [[p284<=1 & 1<=p284] | [p134<=1 & 1<=p134]]]] & EG [[[[p34<=1 & 1<=p34] & [p162<=1 & 1<=p162]] & [[p277<=1 & 1<=p277] & [p391<=1 & 1<=p391]]]]] | EF [[EF [[p26<=1 & 1<=p26]] & A [[[[p107<=1 & 1<=p107] & [p219<=1 & 1<=p219]] & [[p335<=1 & 1<=p335] & [p445<=1 & 1<=p445]]] U [p292<=1 & 1<=p292]]]]]]]
normalized: [~ [EG [[[EG [[[[p391<=1 & 1<=p391] & [p277<=1 & 1<=p277]] & [[p162<=1 & 1<=p162] & [p34<=1 & 1<=p34]]]] & ~ [[[[p134<=1 & 1<=p134] | [p284<=1 & 1<=p284]] & ~ [[[p474<=1 & 1<=p474] & [p327<=1 & 1<=p327]]]]]] | E [true U [[~ [EG [~ [[p292<=1 & 1<=p292]]]] & ~ [E [~ [[p292<=1 & 1<=p292]] U [~ [[[[p445<=1 & 1<=p445] & [p335<=1 & 1<=p335]] & [[p219<=1 & 1<=p219] & [p107<=1 & 1<=p107]]]] & ~ [[p292<=1 & 1<=p292]]]]]] & E [true U [p26<=1 & 1<=p26]]]]]]] & ~ [E [[[EG [[[[p391<=1 & 1<=p391] & [p277<=1 & 1<=p277]] & [[p162<=1 & 1<=p162] & [p34<=1 & 1<=p34]]]] & ~ [[[[p134<=1 & 1<=p134] | [p284<=1 & 1<=p284]] & ~ [[[p474<=1 & 1<=p474] & [p327<=1 & 1<=p327]]]]]] | E [true U [[~ [EG [~ [[p292<=1 & 1<=p292]]]] & ~ [E [~ [[p292<=1 & 1<=p292]] U [~ [[[[p445<=1 & 1<=p445] & [p335<=1 & 1<=p335]] & [[p219<=1 & 1<=p219] & [p107<=1 & 1<=p107]]]] & ~ [[p292<=1 & 1<=p292]]]]]] & E [true U [p26<=1 & 1<=p26]]]]] U [[[EG [[[[p391<=1 & 1<=p391] & [p277<=1 & 1<=p277]] & [[p162<=1 & 1<=p162] & [p34<=1 & 1<=p34]]]] & ~ [[[[p134<=1 & 1<=p134] | [p284<=1 & 1<=p284]] & ~ [[[p474<=1 & 1<=p474] & [p327<=1 & 1<=p327]]]]]] | E [true U [[~ [EG [~ [[p292<=1 & 1<=p292]]]] & ~ [E [~ [[p292<=1 & 1<=p292]] U [~ [[[[p445<=1 & 1<=p445] & [p335<=1 & 1<=p335]] & [[p219<=1 & 1<=p219] & [p107<=1 & 1<=p107]]]] & ~ [[p292<=1 & 1<=p292]]]]]] & E [true U [p26<=1 & 1<=p26]]]]] & E [true U ~ [[[[~ [E [true U ~ [[p56<=1 & 1<=p56]]]] & [~ [EG [~ [[p168<=1 & 1<=p168]]]] & ~ [E [~ [[p168<=1 & 1<=p168]] U [~ [[p303<=1 & 1<=p303]] & ~ [[p168<=1 & 1<=p168]]]]]]] & [p238<=1 & 1<=p238]] | ~ [[[p289<=1 & 1<=p289] | ~ [[[[p428<=1 & 1<=p428] & [p306<=1 & 1<=p306]] & [[p201<=1 & 1<=p201] & [p64<=1 & 1<=p64]]]]]]]]]]]]]

abstracting: (1<=p64)
states: 11,705,148 (7)
abstracting: (p64<=1)
states: 926,649,151 (8)
abstracting: (1<=p201)
states: 11,930,100 (7)
abstracting: (p201<=1)
states: 926,649,151 (8)
abstracting: (1<=p306)
states: 11,906,188 (7)
abstracting: (p306<=1)
states: 926,649,151 (8)
abstracting: (1<=p428)
states: 12,106,164 (7)
abstracting: (p428<=1)
states: 926,649,151 (8)
abstracting: (1<=p289)
states: 4,465,818 (6)
abstracting: (p289<=1)
states: 926,649,151 (8)
abstracting: (1<=p238)
states: 4,801,020 (6)
abstracting: (p238<=1)
states: 926,649,151 (8)
abstracting: (1<=p168)
states: 4,530,540 (6)
abstracting: (p168<=1)
states: 926,649,151 (8)
abstracting: (1<=p303)
states: 11,906,188 (7)
abstracting: (p303<=1)
states: 926,649,151 (8)
abstracting: (1<=p168)
states: 4,530,540 (6)
abstracting: (p168<=1)
states: 926,649,151 (8)
abstracting: (1<=p168)
states: 4,530,540 (6)
abstracting: (p168<=1)
states: 926,649,151 (8)
...........................................................
EG iterations: 59
abstracting: (1<=p56)
states: 4,530,540 (6)
abstracting: (p56<=1)
states: 926,649,151 (8)
abstracting: (1<=p26)
states: 11,705,148 (7)
abstracting: (p26<=1)
states: 926,649,151 (8)
MC time: 2m39.999sec

checking: [EF [[[[[p46<=1 & 1<=p46] & [p140<=1 & 1<=p140]] & [[p277<=1 & 1<=p277] & [p391<=1 & 1<=p391]]] | [[[p108<=1 & 1<=p108] & [p218<=1 & 1<=p218]] & [[p334<=1 & 1<=p334] & [p445<=1 & 1<=p445]]]]] & EF [[AX [[AX [[p204<=0 & 0<=p204]] & [[[[p34<=0 & 0<=p34] | [p140<=0 & 0<=p140]] | [[p255<=0 & 0<=p255] | [p378<=0 & 0<=p378]]] & [[[p23<=0 & 0<=p23] | [p162<=0 & 0<=p162]] | [[p255<=0 & 0<=p255] | [p378<=0 & 0<=p378]]]]]] | [[p84<=0 & 0<=p84] & [[[[p336<=0 & 0<=p336] & [p447<=0 & 0<=p447]] | [[[[p46<=0 & 0<=p46] | [p162<=0 & 0<=p162]] | [[p277<=0 & 0<=p277] | [p391<=0 & 0<=p391]]] & [p89<=0 & 0<=p89]]] & [[[p23<=0 & 0<=p23] | [p162<=0 & 0<=p162]] | [[p277<=0 & 0<=p277] | [p378<=0 & 0<=p378]]]]]]]]
normalized: [E [true U [~ [EX [~ [[[[[[p378<=0 & 0<=p378] | [p255<=0 & 0<=p255]] | [[p162<=0 & 0<=p162] | [p23<=0 & 0<=p23]]] & [[[p378<=0 & 0<=p378] | [p255<=0 & 0<=p255]] | [[p140<=0 & 0<=p140] | [p34<=0 & 0<=p34]]]] & ~ [EX [~ [[p204<=0 & 0<=p204]]]]]]]] | [[[[[p378<=0 & 0<=p378] | [p277<=0 & 0<=p277]] | [[p162<=0 & 0<=p162] | [p23<=0 & 0<=p23]]] & [[[p89<=0 & 0<=p89] & [[[p391<=0 & 0<=p391] | [p277<=0 & 0<=p277]] | [[p162<=0 & 0<=p162] | [p46<=0 & 0<=p46]]]] | [[p447<=0 & 0<=p447] & [p336<=0 & 0<=p336]]]] & [p84<=0 & 0<=p84]]]] & E [true U [[[[p445<=1 & 1<=p445] & [p334<=1 & 1<=p334]] & [[p218<=1 & 1<=p218] & [p108<=1 & 1<=p108]]] | [[[p391<=1 & 1<=p391] & [p277<=1 & 1<=p277]] & [[p140<=1 & 1<=p140] & [p46<=1 & 1<=p46]]]]]]

abstracting: (1<=p46)
states: 11,705,148 (7)
abstracting: (p46<=1)
states: 926,649,151 (8)
abstracting: (1<=p140)
states: 11,930,100 (7)
abstracting: (p140<=1)
states: 926,649,151 (8)
abstracting: (1<=p277)
states: 11,906,188 (7)
abstracting: (p277<=1)
states: 926,649,151 (8)
abstracting: (1<=p391)
states: 12,106,164 (7)
abstracting: (p391<=1)
states: 926,649,151 (8)
abstracting: (1<=p108)
states: 11,705,148 (7)
abstracting: (p108<=1)
states: 926,649,151 (8)
abstracting: (1<=p218)
states: 11,930,100 (7)
abstracting: (p218<=1)
states: 926,649,151 (8)
abstracting: (1<=p334)
states: 11,906,188 (7)
abstracting: (p334<=1)
states: 926,649,151 (8)
abstracting: (1<=p445)
states: 12,106,164 (7)
abstracting: (p445<=1)
states: 926,649,151 (8)

before gc: list nodes free: 12424417

after gc: idd nodes used:343760, unused:63656240; list nodes free:308769062
MC time: 2m24.008sec

checking: EX [[[EG [[EF [[[[p46<=0 & 0<=p46] | [p162<=0 & 0<=p162]] | [[p266<=0 & 0<=p266] | [p391<=0 & 0<=p391]]]] & ~ [E [[p217<=1 & 1<=p217] U [[p100<=1 & 1<=p100] & [p474<=1 & 1<=p474]]]]]] & [AF [[p37<=0 & 0<=p37]] | [EX [[p291<=1 & 1<=p291]] & E [[p208<=1 & 1<=p208] U [[[p23<=1 & 1<=p23] & [p140<=1 & 1<=p140]] & [[p266<=1 & 1<=p266] & [p391<=1 & 1<=p391]]]]]]] | [~ [E [[[[p141<=1 & 1<=p141] & [p369<=1 & 1<=p369]] | [[[p107<=1 & 1<=p107] & [p218<=1 & 1<=p218]] & [[p335<=1 & 1<=p335] & [p446<=1 & 1<=p446]]]] U [~ [[[[p23<=1 & 1<=p23] & [p140<=1 & 1<=p140]] & [[p277<=1 & 1<=p277] & [p367<=1 & 1<=p367]]]] | [[p7<=1 & 1<=p7] & [p12<=1 & 1<=p12]]]]] & AF [~ [A [[[[p86<=1 & 1<=p86] & [p189<=1 & 1<=p189]] & [[p317<=1 & 1<=p317] & [p406<=1 & 1<=p406]]] U [p389<=1 & 1<=p389]]]]]]]
normalized: EX [[[[~ [EG [~ [[p37<=0 & 0<=p37]]]] | [E [[p208<=1 & 1<=p208] U [[[p391<=1 & 1<=p391] & [p266<=1 & 1<=p266]] & [[p140<=1 & 1<=p140] & [p23<=1 & 1<=p23]]]] & EX [[p291<=1 & 1<=p291]]]] & EG [[~ [E [[p217<=1 & 1<=p217] U [[p474<=1 & 1<=p474] & [p100<=1 & 1<=p100]]]] & E [true U [[[p391<=0 & 0<=p391] | [p266<=0 & 0<=p266]] | [[p162<=0 & 0<=p162] | [p46<=0 & 0<=p46]]]]]]] | [~ [EG [[~ [EG [~ [[p389<=1 & 1<=p389]]]] & ~ [E [~ [[p389<=1 & 1<=p389]] U [~ [[[[p406<=1 & 1<=p406] & [p317<=1 & 1<=p317]] & [[p189<=1 & 1<=p189] & [p86<=1 & 1<=p86]]]] & ~ [[p389<=1 & 1<=p389]]]]]]]] & ~ [E [[[[[p446<=1 & 1<=p446] & [p335<=1 & 1<=p335]] & [[p218<=1 & 1<=p218] & [p107<=1 & 1<=p107]]] | [[p369<=1 & 1<=p369] & [p141<=1 & 1<=p141]]] U [~ [[[[p140<=1 & 1<=p140] & [p23<=1 & 1<=p23]] & [[p367<=1 & 1<=p367] & [p277<=1 & 1<=p277]]]] | [[p12<=1 & 1<=p12] & [p7<=1 & 1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 4,733,400 (6)
abstracting: (p7<=1)
states: 926,649,151 (8)
abstracting: (1<=p12)
states: 4,733,400 (6)
abstracting: (p12<=1)
states: 926,649,151 (8)
abstracting: (1<=p277)
states: 11,906,188 (7)
abstracting: (p277<=1)
states: 926,649,151 (8)
abstracting: (1<=p367)
states: 12,106,164 (7)
abstracting: (p367<=1)
states: 926,649,151 (8)
abstracting: (1<=p23)
states: 11,705,148 (7)
abstracting: (p23<=1)
states: 926,649,151 (8)
abstracting: (1<=p140)
states: 11,930,100 (7)
abstracting: (p140<=1)
states: 926,649,151 (8)
abstracting: (1<=p141)
states: 11,930,100 (7)
abstracting: (p141<=1)
states: 926,649,151 (8)
abstracting: (1<=p369)
states: 12,106,164 (7)
abstracting: (p369<=1)
states: 926,649,151 (8)
abstracting: (1<=p107)
states: 11,705,148 (7)
abstracting: (p107<=1)
states: 926,649,151 (8)
abstracting: (1<=p218)
states: 11,930,100 (7)
abstracting: (p218<=1)
states: 926,649,151 (8)
abstracting: (1<=p335)
states: 11,906,188 (7)
abstracting: (p335<=1)
states: 926,649,151 (8)
abstracting: (1<=p446)
states: 12,106,164 (7)
abstracting: (p446<=1)
states: 926,649,151 (8)
abstracting: (1<=p389)
states: 4,801,020 (6)
abstracting: (p389<=1)
states: 926,649,151 (8)
abstracting: (1<=p86)
states: 11,705,148 (7)
abstracting: (p86<=1)
states: 926,649,151 (8)
abstracting: (1<=p189)
states: 11,930,100 (7)
abstracting: (p189<=1)
states: 926,649,151 (8)
abstracting: (1<=p317)
states: 11,906,188 (7)
abstracting: (p317<=1)
states: 926,649,151 (8)
abstracting: (1<=p406)
states: 12,106,164 (7)
abstracting: (p406<=1)
states: 926,649,151 (8)
abstracting: (1<=p389)
states: 4,801,020 (6)
abstracting: (p389<=1)
states: 926,649,151 (8)
abstracting: (1<=p389)
states: 4,801,020 (6)
abstracting: (p389<=1)
states: 926,649,151 (8)
...............................................................................
EG iterations: 79
....................................................
EG iterations: 52
abstracting: (0<=p46)
states: 926,649,151 (8)
abstracting: (p46<=0)
states: 914,944,003 (8)
abstracting: (0<=p162)
states: 926,649,151 (8)
abstracting: (p162<=0)
states: 914,719,051 (8)
abstracting: (0<=p266)
states: 926,649,151 (8)
abstracting: (p266<=0)
states: 914,742,963 (8)
abstracting: (0<=p391)
states: 926,649,151 (8)
abstracting: (p391<=0)
states: 914,542,987 (8)
abstracting: (1<=p100)
states: 4,665,780 (6)
abstracting: (p100<=1)
states: 926,649,151 (8)
abstracting: (1<=p474)
states: 66,189,225 (7)
abstracting: (p474<=1)
states: 926,649,151 (8)
abstracting: (1<=p217)
states: 4,732,434 (6)
abstracting: (p217<=1)
states: 926,649,151 (8)
.........................................................
EG iterations: 57
abstracting: (1<=p291)
states: 4,465,818 (6)
abstracting: (p291<=1)
states: 926,649,151 (8)
.abstracting: (1<=p23)
states: 11,705,148 (7)
abstracting: (p23<=1)
states: 926,649,151 (8)
abstracting: (1<=p140)
states: 11,930,100 (7)
abstracting: (p140<=1)
states: 926,649,151 (8)
abstracting: (1<=p266)
states: 11,906,188 (7)
abstracting: (p266<=1)
states: 926,649,151 (8)
abstracting: (1<=p391)
states: 12,106,164 (7)
abstracting: (p391<=1)
states: 926,649,151 (8)
abstracting: (1<=p208)
states: 4,732,434 (6)
abstracting: (p208<=1)
states: 926,649,151 (8)
abstracting: (0<=p37)
states: 926,649,151 (8)
abstracting: (p37<=0)
states: 914,944,003 (8)
.........................MC time: 2m10.000sec

checking: [[AF [[[p74<=1 & 1<=p74] | [[AX [[[p123<=1 & 1<=p123] & [p32<=1 & 1<=p32]]] & [[[p34<=0 & 0<=p34] | [p162<=0 & 0<=p162]] | [[p255<=0 & 0<=p255] | [p367<=0 & 0<=p367]]]] & [[[[p86<=0 & 0<=p86] | [p178<=0 & 0<=p178]] | [[p294<=0 & 0<=p294] | [p406<=0 & 0<=p406]]] & [p123<=0 & 0<=p123]]]]] & [~ [A [~ [A [[p220<=1 & 1<=p220] U [p450<=1 & 1<=p450]]] U [[p288<=1 & 1<=p288] | [[p212<=1 & 1<=p212] | [[[p75<=1 & 1<=p75] & [p178<=1 & 1<=p178]] & [[p294<=1 & 1<=p294] & [[p406<=1 & 1<=p406] & [p392<=1 & 1<=p392]]]]]]]] | [EX [[AF [[[[p86<=0 & 0<=p86] | [p201<=0 & 0<=p201]] | [[p294<=0 & 0<=p294] | [p406<=0 & 0<=p406]]]] | [[p232<=0 & 0<=p232] & [p335<=0 & 0<=p335]]]] | A [[[[p75<=1 & 1<=p75] & [p189<=1 & 1<=p189]] & [[p306<=1 & 1<=p306] & [p417<=1 & 1<=p417]]] U E [[[p329<=1 & 1<=p329] | [p182<=1 & 1<=p182]] U [[p132<=1 & 1<=p132] | [p53<=1 & 1<=p53]]]]]]] | [EF [[p308<=1 & 1<=p308]] & EX [EX [0<=0]]]]
normalized: [[EX [EX [0<=0]] & E [true U [p308<=1 & 1<=p308]]] | [[[[~ [EG [~ [E [[[p182<=1 & 1<=p182] | [p329<=1 & 1<=p329]] U [[p53<=1 & 1<=p53] | [p132<=1 & 1<=p132]]]]]] & ~ [E [~ [E [[[p182<=1 & 1<=p182] | [p329<=1 & 1<=p329]] U [[p53<=1 & 1<=p53] | [p132<=1 & 1<=p132]]]] U [~ [[[[p417<=1 & 1<=p417] & [p306<=1 & 1<=p306]] & [[p189<=1 & 1<=p189] & [p75<=1 & 1<=p75]]]] & ~ [E [[[p182<=1 & 1<=p182] | [p329<=1 & 1<=p329]] U [[p53<=1 & 1<=p53] | [p132<=1 & 1<=p132]]]]]]]] | EX [[[[p335<=0 & 0<=p335] & [p232<=0 & 0<=p232]] | ~ [EG [~ [[[[p406<=0 & 0<=p406] | [p294<=0 & 0<=p294]] | [[p201<=0 & 0<=p201] | [p86<=0 & 0<=p86]]]]]]]]] | ~ [[~ [EG [~ [[[[[[[p392<=1 & 1<=p392] & [p406<=1 & 1<=p406]] & [p294<=1 & 1<=p294]] & [[p178<=1 & 1<=p178] & [p75<=1 & 1<=p75]]] | [p212<=1 & 1<=p212]] | [p288<=1 & 1<=p288]]]]] & ~ [E [~ [[[[[[[p392<=1 & 1<=p392] & [p406<=1 & 1<=p406]] & [p294<=1 & 1<=p294]] & [[p178<=1 & 1<=p178] & [p75<=1 & 1<=p75]]] | [p212<=1 & 1<=p212]] | [p288<=1 & 1<=p288]]] U [[~ [EG [~ [[p450<=1 & 1<=p450]]]] & ~ [E [~ [[p450<=1 & 1<=p450]] U [~ [[p220<=1 & 1<=p220]] & ~ [[p450<=1 & 1<=p450]]]]]] & ~ [[[[[[[p392<=1 & 1<=p392] & [p406<=1 & 1<=p406]] & [p294<=1 & 1<=p294]] & [[p178<=1 & 1<=p178] & [p75<=1 & 1<=p75]]] | [p212<=1 & 1<=p212]] | [p288<=1 & 1<=p288]]]]]]]]] & ~ [EG [~ [[[[[p123<=0 & 0<=p123] & [[[p406<=0 & 0<=p406] | [p294<=0 & 0<=p294]] | [[p178<=0 & 0<=p178] | [p86<=0 & 0<=p86]]]] & [[[[p367<=0 & 0<=p367] | [p255<=0 & 0<=p255]] | [[p162<=0 & 0<=p162] | [p34<=0 & 0<=p34]]] & ~ [EX [~ [[[p32<=1 & 1<=p32] & [p123<=1 & 1<=p123]]]]]]] | [p74<=1 & 1<=p74]]]]]]]

abstracting: (1<=p74)
states: 11,705,148 (7)
abstracting: (p74<=1)
states: 926,649,151 (8)
abstracting: (1<=p123)
states: 4,870,600 (6)
abstracting: (p123<=1)
states: 926,649,151 (8)
abstracting: (1<=p32)
states: 11,705,148 (7)
abstracting: (p32<=1)
states: 926,649,151 (8)
.abstracting: (0<=p34)
states: 926,649,151 (8)
abstracting: (p34<=0)
states: 914,944,003 (8)
abstracting: (0<=p162)
states: 926,649,151 (8)
abstracting: (p162<=0)
states: 914,719,051 (8)
abstracting: (0<=p255)
states: 926,649,151 (8)
abstracting: (p255<=0)
states: 914,742,963 (8)
abstracting: (0<=p367)
states: 926,649,151 (8)
abstracting: (p367<=0)
states: 914,542,987 (8)
abstracting: (0<=p86)
states: 926,649,151 (8)
abstracting: (p86<=0)
states: 914,944,003 (8)
abstracting: (0<=p178)
states: 926,649,151 (8)
abstracting: (p178<=0)
states: 914,719,051 (8)
abstracting: (0<=p294)
states: 926,649,151 (8)
abstracting: (p294<=0)
states: 914,742,963 (8)
abstracting: (0<=p406)
states: 926,649,151 (8)
abstracting: (p406<=0)
states: 914,542,987 (8)
abstracting: (0<=p123)
states: 926,649,151 (8)
abstracting: (p123<=0)
states: 921,778,551 (8)
.........
before gc: list nodes free: 11025649

after gc: idd nodes used:560520, unused:63439480; list nodes free:307775409
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5856604 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16100876 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.007sec

24022 30975
iterations count:277052 (400), effective:9033 (13)

initing FirstDep: 0m 0.006sec


iterations count:770 (1), effective:6 (0)
40148 50762 52690 56375 55643 61395 63026 64421 68516
iterations count:970845 (1402), effective:19764 (28)

iterations count:693 (1), effective:1 (0)
42521 48619 50557 54960 52506 58131 58715 61960 66347
iterations count:971749 (1404), effective:19754 (28)
38917 42757 50628 53298 58047 56738 58450
iterations count:762891 (1102), effective:15323 (22)
38179
iterations count:178884 (258), effective:5338 (7)

net_ddint.h:600: Timeout: after 301 sec

50349
iterations count:161109 (232), effective:4976 (7)

net_ddint.h:600: Timeout: after 271 sec

39144 41361 48821 55427 59346 57516 58325
iterations count:758797 (1096), effective:15453 (22)
42802 48129 58911 64632 63185 60804 59254
iterations count:718147 (1037), effective:15031 (21)
39144 41361 48821
sat_reach.icc:155: Timeout: after 243 sec

25761 28616 37376 47169 47271 50172 50467 55200 55518
iterations count:950605 (1373), effective:19433 (28)

iterations count:939 (1), effective:3 (0)

net_ddint.h:600: Timeout: after 219 sec


iterations count:692 (1), effective:0 (0)
28696
sat_reach.icc:155: Timeout: after 197 sec


iterations count:694 (1), effective:1 (0)

iterations count:850 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 177 sec


iterations count:694 (1), effective:1 (0)

iterations count:696 (1), effective:1 (0)

iterations count:768 (1), effective:1 (0)
42938 48458 58678 61989 59397
sat_reach.icc:155: Timeout: after 159 sec

30323 34291 37049 43228 48479 50330 52562
sat_reach.icc:155: Timeout: after 143 sec


iterations count:692 (1), effective:0 (0)

iterations count:794 (1), effective:1 (0)

iterations count:812 (1), effective:1 (0)

iterations count:1024 (1), effective:8 (0)

iterations count:692 (1), effective:0 (0)

net_ddint.h:600: Timeout: after 129 sec


net_ddint.h:600: Timeout: after 116 sec

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="StigmergyElection-PT-04b"
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 StigmergyElection-PT-04b, 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 r458-smll-167912650500594"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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