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.r010-oct2-167813599000394.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 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 AutoFlight-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599000394
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.7K Feb 25 18:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Feb 25 18:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 25 18:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 25 18:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 18:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Feb 25 18:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 25 18:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 48K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-00
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-01
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-02
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-03
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-04
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-05
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-06
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-07
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-08
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-09
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-10
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-11
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-12
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-13
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-14
FORMULA_NAME AutoFlight-PT-02b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678687541638

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=AutoFlight-PT-02b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 06:05:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 06:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 06:05:44] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-13 06:05:44] [INFO ] Transformed 206 places.
[2023-03-13 06:05:44] [INFO ] Transformed 204 transitions.
[2023-03-13 06:05:44] [INFO ] Found NUPN structural information;
[2023-03-13 06:05:44] [INFO ] Parsed PT model containing 206 places and 204 transitions and 478 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 86 out of 206 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 206/206 places, 204/204 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 197 transition count 195
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 197 transition count 195
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 197 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 195 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 195 transition count 192
Applied a total of 23 rules in 30 ms. Remains 195 /206 variables (removed 11) and now considering 192/204 (removed 12) transitions.
// Phase 1: matrix 192 rows 195 cols
[2023-03-13 06:05:44] [INFO ] Computed 16 place invariants in 16 ms
[2023-03-13 06:05:44] [INFO ] Implicit Places using invariants in 419 ms returned []
[2023-03-13 06:05:44] [INFO ] Invariant cache hit.
[2023-03-13 06:05:44] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2023-03-13 06:05:44] [INFO ] Invariant cache hit.
[2023-03-13 06:05:44] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 195/206 places, 192/204 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 829 ms. Remains : 195/206 places, 192/204 transitions.
Support contains 86 out of 195 places after structural reductions.
[2023-03-13 06:05:45] [INFO ] Flatten gal took : 51 ms
[2023-03-13 06:05:45] [INFO ] Flatten gal took : 16 ms
[2023-03-13 06:05:45] [INFO ] Input system was already deterministic with 192 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 489 ms. (steps per millisecond=20 ) properties (out of 69) seen :55
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-13 06:05:46] [INFO ] Invariant cache hit.
[2023-03-13 06:05:46] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-13 06:05:46] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-13 06:05:46] [INFO ] After 61ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:11
[2023-03-13 06:05:46] [INFO ] After 78ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:11
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-13 06:05:46] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1 real:11
[2023-03-13 06:05:46] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-13 06:05:46] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-13 06:05:46] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :10
[2023-03-13 06:05:46] [INFO ] Deduced a trap composed of 38 places in 105 ms of which 2 ms to minimize.
[2023-03-13 06:05:47] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
[2023-03-13 06:05:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2023-03-13 06:05:47] [INFO ] Deduced a trap composed of 26 places in 83 ms of which 1 ms to minimize.
[2023-03-13 06:05:47] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2023-03-13 06:05:47] [INFO ] Deduced a trap composed of 46 places in 76 ms of which 1 ms to minimize.
[2023-03-13 06:05:47] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2023-03-13 06:05:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 413 ms
[2023-03-13 06:05:47] [INFO ] Deduced a trap composed of 27 places in 80 ms of which 2 ms to minimize.
[2023-03-13 06:05:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-13 06:05:47] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 1 ms to minimize.
[2023-03-13 06:05:47] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2023-03-13 06:05:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
[2023-03-13 06:05:48] [INFO ] Deduced a trap composed of 26 places in 93 ms of which 1 ms to minimize.
[2023-03-13 06:05:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2023-03-13 06:05:48] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 0 ms to minimize.
[2023-03-13 06:05:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 131 ms
[2023-03-13 06:05:48] [INFO ] After 1592ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :10
Attempting to minimize the solution found.
Minimization took 173 ms.
[2023-03-13 06:05:48] [INFO ] After 1922ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :10
Fused 12 Parikh solutions to 10 different solutions.
Parikh walk visited 6 properties in 93 ms.
Support contains 7 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 192/192 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 195 transition count 124
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 77 rules applied. Total rules applied 145 place count 127 transition count 115
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 150 place count 123 transition count 114
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 152 place count 122 transition count 113
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 23 Pre rules applied. Total rules applied 152 place count 122 transition count 90
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 4 with 46 rules applied. Total rules applied 198 place count 99 transition count 90
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 209 place count 88 transition count 79
Iterating global reduction 4 with 11 rules applied. Total rules applied 220 place count 88 transition count 79
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 220 place count 88 transition count 75
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 228 place count 84 transition count 75
Performed 26 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 52 rules applied. Total rules applied 280 place count 58 transition count 47
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 281 place count 58 transition count 46
Free-agglomeration rule applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 289 place count 58 transition count 38
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 297 place count 50 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 298 place count 49 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 299 place count 48 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 299 place count 48 transition count 36
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 301 place count 47 transition count 36
Applied a total of 301 rules in 39 ms. Remains 47 /195 variables (removed 148) and now considering 36/192 (removed 156) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 47/195 places, 36/192 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 36 rows 47 cols
[2023-03-13 06:05:48] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-13 06:05:48] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 06:05:48] [INFO ] [Real]Absence check using 13 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-13 06:05:48] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 06:05:48] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-13 06:05:48] [INFO ] [Nat]Absence check using 13 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-13 06:05:48] [INFO ] After 37ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 06:05:48] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-13 06:05:48] [INFO ] After 4ms SMT Verify possible using 16 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-13 06:05:48] [INFO ] After 80ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-13 06:05:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 20 ms
FORMULA AutoFlight-PT-02b-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 14 ms
[2023-03-13 06:05:48] [INFO ] Input system was already deterministic with 192 transitions.
Support contains 71 out of 195 places (down from 72) after GAL structural reductions.
Computed a total of 57 stabilizing places and 57 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 194 transition count 124
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 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 77 rules applied. Total rules applied 144 place count 127 transition count 114
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 149 place count 123 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 122 transition count 113
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 27 Pre rules applied. Total rules applied 150 place count 122 transition count 86
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 204 place count 95 transition count 86
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 215 place count 84 transition count 75
Iterating global reduction 4 with 11 rules applied. Total rules applied 226 place count 84 transition count 75
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 226 place count 84 transition count 72
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 232 place count 81 transition count 72
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 276 place count 59 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 278 place count 59 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 282 place count 57 transition count 46
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 57 transition count 45
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 285 place count 56 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 286 place count 55 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 288 place count 53 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 288 place count 53 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 292 place count 51 transition count 41
Applied a total of 292 rules in 52 ms. Remains 51 /195 variables (removed 144) and now considering 41/192 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 52 ms. Remains : 51/195 places, 41/192 transitions.
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:05:48] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 179 transition count 176
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 179 transition count 176
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 34 place count 179 transition count 174
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 42 place count 171 transition count 166
Iterating global reduction 1 with 8 rules applied. Total rules applied 50 place count 171 transition count 166
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 169 transition count 164
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 169 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 167 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 167 transition count 162
Applied a total of 58 rules in 15 ms. Remains 167 /195 variables (removed 28) and now considering 162/192 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 167/195 places, 162/192 transitions.
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:05:48] [INFO ] Input system was already deterministic with 162 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 66 place count 194 transition count 125
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 77 rules applied. Total rules applied 143 place count 128 transition count 114
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 147 place count 124 transition count 114
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 147 place count 124 transition count 85
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 205 place count 95 transition count 85
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 216 place count 84 transition count 74
Iterating global reduction 3 with 11 rules applied. Total rules applied 227 place count 84 transition count 74
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 227 place count 84 transition count 71
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 233 place count 81 transition count 71
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 277 place count 59 transition count 49
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 279 place count 59 transition count 47
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 283 place count 57 transition count 45
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 284 place count 56 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 286 place count 54 transition count 44
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 286 place count 54 transition count 42
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 290 place count 52 transition count 42
Applied a total of 290 rules in 15 ms. Remains 52 /195 variables (removed 143) and now considering 42/192 (removed 150) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 52/195 places, 42/192 transitions.
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:05:48] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 177 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 177 transition count 174
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 38 place count 177 transition count 172
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 46 place count 169 transition count 164
Iterating global reduction 1 with 8 rules applied. Total rules applied 54 place count 169 transition count 164
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 167 transition count 162
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 167 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 166 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 166 transition count 161
Applied a total of 60 rules in 14 ms. Remains 166 /195 variables (removed 29) and now considering 161/192 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 166/195 places, 161/192 transitions.
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:05:48] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 177 transition count 174
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 177 transition count 174
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 39 place count 177 transition count 171
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 47 place count 169 transition count 163
Iterating global reduction 1 with 8 rules applied. Total rules applied 55 place count 169 transition count 163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 168 transition count 162
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 168 transition count 162
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 167 transition count 161
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 167 transition count 161
Applied a total of 59 rules in 31 ms. Remains 167 /195 variables (removed 28) and now considering 161/192 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 167/195 places, 161/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 161 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 175 transition count 172
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 175 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 175 transition count 169
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 166 transition count 160
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 164 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 162 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 162 transition count 156
Applied a total of 69 rules in 13 ms. Remains 162 /195 variables (removed 33) and now considering 156/192 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 162/195 places, 156/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 194 transition count 124
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 75 rules applied. Total rules applied 142 place count 127 transition count 116
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 144 place count 125 transition count 116
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 144 place count 125 transition count 87
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 202 place count 96 transition count 87
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 216 place count 82 transition count 73
Iterating global reduction 3 with 14 rules applied. Total rules applied 230 place count 82 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 230 place count 82 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 240 place count 77 transition count 68
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 280 place count 57 transition count 48
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 282 place count 57 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 286 place count 55 transition count 44
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 287 place count 54 transition count 43
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 289 place count 52 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 289 place count 52 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 293 place count 50 transition count 41
Applied a total of 293 rules in 17 ms. Remains 50 /195 variables (removed 145) and now considering 41/192 (removed 151) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 50/195 places, 41/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 179 transition count 176
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 179 transition count 176
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 35 place count 179 transition count 173
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 41 place count 173 transition count 167
Iterating global reduction 1 with 6 rules applied. Total rules applied 47 place count 173 transition count 167
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 172 transition count 166
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 172 transition count 166
Applied a total of 49 rules in 11 ms. Remains 172 /195 variables (removed 23) and now considering 166/192 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 172/195 places, 166/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 166 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 194 transition count 130
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 68 rules applied. Total rules applied 129 place count 133 transition count 123
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 134 place count 131 transition count 120
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 138 place count 128 transition count 119
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 138 place count 128 transition count 89
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 60 rules applied. Total rules applied 198 place count 98 transition count 89
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 212 place count 84 transition count 75
Iterating global reduction 4 with 14 rules applied. Total rules applied 226 place count 84 transition count 75
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 226 place count 84 transition count 71
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 234 place count 80 transition count 71
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 4 with 42 rules applied. Total rules applied 276 place count 59 transition count 50
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 278 place count 59 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 282 place count 57 transition count 46
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 283 place count 56 transition count 45
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 285 place count 54 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 285 place count 54 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 289 place count 52 transition count 43
Applied a total of 289 rules in 14 ms. Remains 52 /195 variables (removed 143) and now considering 43/192 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 52/195 places, 43/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 43 transitions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 175 transition count 172
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 175 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 43 place count 175 transition count 169
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 52 place count 166 transition count 160
Iterating global reduction 1 with 9 rules applied. Total rules applied 61 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 164 transition count 158
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 67 place count 162 transition count 156
Iterating global reduction 1 with 2 rules applied. Total rules applied 69 place count 162 transition count 156
Applied a total of 69 rules in 11 ms. Remains 162 /195 variables (removed 33) and now considering 156/192 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 162/195 places, 156/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 4 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 156 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 194 transition count 124
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 78 rules applied. Total rules applied 145 place count 127 transition count 113
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 150 place count 123 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 151 place count 122 transition count 112
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 29 Pre rules applied. Total rules applied 151 place count 122 transition count 83
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 209 place count 93 transition count 83
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 222 place count 80 transition count 70
Iterating global reduction 4 with 13 rules applied. Total rules applied 235 place count 80 transition count 70
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 235 place count 80 transition count 67
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 241 place count 77 transition count 67
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 4 with 44 rules applied. Total rules applied 285 place count 55 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 287 place count 55 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 291 place count 53 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 292 place count 52 transition count 40
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 294 place count 50 transition count 40
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 294 place count 50 transition count 38
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 298 place count 48 transition count 38
Applied a total of 298 rules in 16 ms. Remains 48 /195 variables (removed 147) and now considering 38/192 (removed 154) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 48/195 places, 38/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 38 transitions.
Finished random walk after 182 steps, including 12 resets, run visited all 1 properties in 1 ms. (steps per millisecond=182 )
FORMULA AutoFlight-PT-02b-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 176 transition count 173
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 176 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 176 transition count 170
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 169 transition count 163
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 169 transition count 163
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 167 transition count 161
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 167 transition count 161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 166 transition count 160
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 166 transition count 160
Applied a total of 61 rules in 11 ms. Remains 166 /195 variables (removed 29) and now considering 160/192 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 166/195 places, 160/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 5 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 12 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 160 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 69 transitions
Trivial Post-agglo rules discarded 69 transitions
Performed 69 trivial Post agglomeration. Transition count delta: 69
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 194 transition count 122
Reduce places removed 69 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 80 rules applied. Total rules applied 149 place count 125 transition count 111
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 153 place count 121 transition count 111
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 153 place count 121 transition count 83
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 209 place count 93 transition count 83
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 222 place count 80 transition count 70
Iterating global reduction 3 with 13 rules applied. Total rules applied 235 place count 80 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 235 place count 80 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 243 place count 76 transition count 66
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 287 place count 54 transition count 44
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 289 place count 54 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 293 place count 52 transition count 40
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 294 place count 51 transition count 39
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 296 place count 49 transition count 39
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 296 place count 49 transition count 37
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 300 place count 47 transition count 37
Applied a total of 300 rules in 14 ms. Remains 47 /195 variables (removed 148) and now considering 37/192 (removed 155) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 47/195 places, 37/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 3 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 37 transitions.
Incomplete random walk after 10000 steps, including 867 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished Best-First random walk after 5825 steps, including 92 resets, run visited all 1 properties in 4 ms. (steps per millisecond=1456 )
FORMULA AutoFlight-PT-02b-CTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 176 transition count 173
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 176 transition count 173
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 41 place count 176 transition count 170
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 49 place count 168 transition count 162
Iterating global reduction 1 with 8 rules applied. Total rules applied 57 place count 168 transition count 162
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 166 transition count 160
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 166 transition count 160
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 63 place count 164 transition count 158
Iterating global reduction 1 with 2 rules applied. Total rules applied 65 place count 164 transition count 158
Applied a total of 65 rules in 12 ms. Remains 164 /195 variables (removed 31) and now considering 158/192 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 164/195 places, 158/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 158 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 195/195 places, 192/192 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 68 transitions
Trivial Post-agglo rules discarded 68 transitions
Performed 68 trivial Post agglomeration. Transition count delta: 68
Iterating post reduction 0 with 68 rules applied. Total rules applied 68 place count 194 transition count 123
Reduce places removed 68 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 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 79 rules applied. Total rules applied 147 place count 126 transition count 112
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 151 place count 122 transition count 112
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 151 place count 122 transition count 83
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 209 place count 93 transition count 83
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 222 place count 80 transition count 70
Iterating global reduction 3 with 13 rules applied. Total rules applied 235 place count 80 transition count 70
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 235 place count 80 transition count 66
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 243 place count 76 transition count 66
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 285 place count 55 transition count 45
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 287 place count 55 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 291 place count 53 transition count 41
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 292 place count 52 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 293 place count 51 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 293 place count 51 transition count 39
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 295 place count 50 transition count 39
Applied a total of 295 rules in 12 ms. Remains 50 /195 variables (removed 145) and now considering 39/192 (removed 153) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 50/195 places, 39/192 transitions.
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 2 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 1 ms
[2023-03-13 06:05:49] [INFO ] Input system was already deterministic with 39 transitions.
Finished random walk after 31 steps, including 2 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
FORMULA AutoFlight-PT-02b-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 7 ms
[2023-03-13 06:05:49] [INFO ] Flatten gal took : 6 ms
[2023-03-13 06:05:49] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 14 ms.
[2023-03-13 06:05:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 195 places, 192 transitions and 454 arcs took 1 ms.
Total runtime 5512 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: 195 NrTr: 192 NrArc: 454)

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

net check time: 0m 0.000sec

init dd package: 0m 2.957sec


RS generation: 0m 7.313sec


-> reachability set: #nodes 193088 (1.9e+05) #states 12,272,799,787,465 (13)



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

checking: A [AF [~ [AG [[p105<=1 & 1<=p105]]]] U [p11<=1 & 1<=p11]]
normalized: [~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[p11<=1 & 1<=p11]] & EG [~ [E [true U ~ [[p105<=1 & 1<=p105]]]]]]]] & ~ [EG [~ [[p11<=1 & 1<=p11]]]]]

abstracting: (1<=p11)
states: 69,971,178,024 (10)
abstracting: (p11<=1)
states: 12,272,799,787,465 (13)
......................................................................................
EG iterations: 86
abstracting: (1<=p105)
states: 1,091,404,483,532 (12)
abstracting: (p105<=1)
states: 12,272,799,787,465 (13)
.
EG iterations: 1
abstracting: (1<=p11)
states: 69,971,178,024 (10)
abstracting: (p11<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p11)
states: 69,971,178,024 (10)
abstracting: (p11<=1)
states: 12,272,799,787,465 (13)
-> the formula is FALSE

FORMULA AutoFlight-PT-02b-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m50.958sec

checking: EG [EF [AG [[[AF [[p76<=1 & 1<=p76]] | AF [[p22<=0 & 0<=p22]]] | [1<=p143 & p143<=1]]]]]
normalized: EG [E [true U ~ [E [true U ~ [[[1<=p143 & p143<=1] | [~ [EG [~ [[p22<=0 & 0<=p22]]]] | ~ [EG [~ [[p76<=1 & 1<=p76]]]]]]]]]]]

abstracting: (1<=p76)
states: 458,194,392,800 (11)
abstracting: (p76<=1)
states: 12,272,799,787,465 (13)
.
EG iterations: 1
abstracting: (0<=p22)
states: 12,272,799,787,465 (13)
abstracting: (p22<=0)
states: 10,907,131,308,121 (13)
................
before gc: list nodes free: 1418978

after gc: idd nodes used:1175439, unused:62824561; list nodes free:284083079
................
before gc: list nodes free: 1948360

after gc: idd nodes used:3211795, unused:60788205; list nodes free:274950576
......
before gc: list nodes free: 3852463

after gc: idd nodes used:5565886, unused:58434114; list nodes free:264240811
.MC time: 5m22.265sec

checking: EG [[~ [E [[p157<=1 & 1<=p157] U [p7<=1 & 1<=p7]]] | [p30<=1 & 1<=p30]]]
normalized: EG [[[p30<=1 & 1<=p30] | ~ [E [[p157<=1 & 1<=p157] U [p7<=1 & 1<=p7]]]]]

abstracting: (1<=p7)
states: 7,717,864 (6)
abstracting: (p7<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p157)
states: 1,678,646,091,796 (12)
abstracting: (p157<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p30)
states: 702,483,632,664 (11)
abstracting: (p30<=1)
states: 12,272,799,787,465 (13)
................................................................
EG iterations: 64
-> the formula is FALSE

FORMULA AutoFlight-PT-02b-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.439sec

checking: AX [~ [E [[p3<=1 & 1<=p3] U EF [EX [[[p145<=1 & 1<=p145] & [p193<=1 & 1<=p193]]]]]]]
normalized: ~ [EX [E [[p3<=1 & 1<=p3] U E [true U EX [[[p193<=1 & 1<=p193] & [p145<=1 & 1<=p145]]]]]]]

abstracting: (1<=p145)
states: 211,712,083,968 (11)
abstracting: (p145<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p193)
states: 5,302,268,455,921 (12)
abstracting: (p193<=1)
states: 12,272,799,787,465 (13)
.
before gc: list nodes free: 4230735

after gc: idd nodes used:581393, unused:63418607; list nodes free:286811807
abstracting: (1<=p3)
states: 7,078 (3)
abstracting: (p3<=1)
states: 12,272,799,787,465 (13)
.-> the formula is FALSE

FORMULA AutoFlight-PT-02b-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m54.438sec

checking: AG [[EG [~ [E [[[p134<=1 & 1<=p134] & [[p191<=1 & 1<=p191] & [p82<=1 & 1<=p82]]] U EX [[p43<=1 & 1<=p43]]]]] | AG [[p42<=0 & 0<=p42]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[p42<=0 & 0<=p42]]]] | EG [~ [E [[[[p82<=1 & 1<=p82] & [p191<=1 & 1<=p191]] & [p134<=1 & 1<=p134]] U EX [[p43<=1 & 1<=p43]]]]]]]]]

abstracting: (1<=p43)
states: 669,681,408,504 (11)
abstracting: (p43<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p134)
states: 1,510,313,210,366 (12)
abstracting: (p134<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p191)
states: 932,951,933,035 (11)
abstracting: (p191<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p82)
states: 633,146,796,008 (11)
abstracting: (p82<=1)
states: 12,272,799,787,465 (13)
..............................
before gc: list nodes free: 1586981

after gc: idd nodes used:2490549, unused:61509451; list nodes free:280310194
.........
before gc: list nodes free: 1848142

after gc: idd nodes used:6074393, unused:57925607; list nodes free:263437391
......
before gc: list nodes free: 2644212

after gc: idd nodes used:3188763, unused:60811237; list nodes free:277295681
MC time: 5m51.413sec

checking: E [[p105<=1 & 1<=p105] U AF [~ [[AF [[[p69<=1 & 1<=p69] & [p153<=1 & 1<=p153]]] | [~ [[p173<=1 & 1<=p173]] | ~ [[p54<=1 & 1<=p54]]]]]]]
normalized: E [[p105<=1 & 1<=p105] U ~ [EG [[[~ [[p54<=1 & 1<=p54]] | ~ [[p173<=1 & 1<=p173]]] | ~ [EG [~ [[[p153<=1 & 1<=p153] & [p69<=1 & 1<=p69]]]]]]]]]

abstracting: (1<=p69)
states: 1,386,061,468,304 (12)
abstracting: (p69<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p153)
states: 401,970,010,848 (11)
abstracting: (p153<=1)
states: 12,272,799,787,465 (13)
...................................
before gc: list nodes free: 3677969

after gc: idd nodes used:5464138, unused:58535862; list nodes free:266300714
......................................................
EG iterations: 89
abstracting: (1<=p173)
states: 725,851,385,287 (11)
abstracting: (p173<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p54)
states: 1,548,970,639,168 (12)
abstracting: (p54<=1)
states: 12,272,799,787,465 (13)

before gc: list nodes free: 2234292

after gc: idd nodes used:1076661, unused:62923339; list nodes free:286661848
.
EG iterations: 1
abstracting: (1<=p105)
states: 1,091,404,483,532 (12)
abstracting: (p105<=1)
states: 12,272,799,787,465 (13)
-> the formula is FALSE

FORMULA AutoFlight-PT-02b-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m25.904sec

checking: [AX [EG [[p71<=0 & 0<=p71]]] | A [AG [[[[p14<=1 & 1<=p14] & AG [[p19<=1 & 1<=p19]]] | AG [[[p175<=1 & 1<=p175] | [p8<=1 & 1<=p8]]]]] U ~ [AF [EX [[p112<=1 & 1<=p112]]]]]]
normalized: [~ [EX [~ [EG [[p71<=0 & 0<=p71]]]]] | [~ [EG [~ [EG [~ [EX [[p112<=1 & 1<=p112]]]]]]] & ~ [E [~ [EG [~ [EX [[p112<=1 & 1<=p112]]]]] U [E [true U ~ [[~ [E [true U ~ [[[p8<=1 & 1<=p8] | [p175<=1 & 1<=p175]]]]] | [~ [E [true U ~ [[p19<=1 & 1<=p19]]]] & [p14<=1 & 1<=p14]]]]] & ~ [EG [~ [EX [[p112<=1 & 1<=p112]]]]]]]]]]

abstracting: (1<=p112)
states: 1,680,854,035,048 (12)
abstracting: (p112<=1)
states: 12,272,799,787,465 (13)
..........................................
before gc: list nodes free: 1801315

after gc: idd nodes used:2123435, unused:61876565; list nodes free:281973471
.............................................
EG iterations: 86
abstracting: (1<=p14)
states: 1,612,989,117,664 (12)
abstracting: (p14<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p19)
states: 1,612,989,117,664 (12)
abstracting: (p19<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p175)
states: 714,986,621,360 (11)
abstracting: (p175<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p8)
states: 69,460,776 (7)
abstracting: (p8<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p112)
states: 1,680,854,035,048 (12)
abstracting: (p112<=1)
states: 12,272,799,787,465 (13)
..........................
before gc: list nodes free: 599629

after gc: idd nodes used:2283731, unused:61716269; list nodes free:281203255
.............................................................
EG iterations: 86
abstracting: (1<=p112)
states: 1,680,854,035,048 (12)
abstracting: (p112<=1)
states: 12,272,799,787,465 (13)
.......
before gc: list nodes free: 336471

after gc: idd nodes used:1724994, unused:62275006; list nodes free:283758418
.MC time: 5m17.130sec

checking: EX [[[EF [[[p75<=1 & 1<=p75] & [p131<=1 & 1<=p131]]] & A [[p119<=1 & 1<=p119] U ~ [[p64<=1 & 1<=p64]]]] & [[p84<=0 & 0<=p84] & [p122<=0 & 0<=p122]]]]
normalized: EX [[[[p122<=0 & 0<=p122] & [p84<=0 & 0<=p84]] & [[~ [EG [[p64<=1 & 1<=p64]]] & ~ [E [[p64<=1 & 1<=p64] U [~ [[p119<=1 & 1<=p119]] & [p64<=1 & 1<=p64]]]]] & E [true U [[p131<=1 & 1<=p131] & [p75<=1 & 1<=p75]]]]]]

abstracting: (1<=p75)
states: 1,386,061,468,304 (12)
abstracting: (p75<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p131)
states: 213,647,320,992 (11)
abstracting: (p131<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p64)
states: 1,625,227,262,072 (12)
abstracting: (p64<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p119)
states: 880,300,147,550 (11)
abstracting: (p119<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p64)
states: 1,625,227,262,072 (12)
abstracting: (p64<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p64)
states: 1,625,227,262,072 (12)
abstracting: (p64<=1)
states: 12,272,799,787,465 (13)
..........................
before gc: list nodes free: 3449773

after gc: idd nodes used:3488266, unused:60511734; list nodes free:275925834
....
before gc: list nodes free: 4015291

after gc: idd nodes used:4016196, unused:59983804; list nodes free:273630418
MC time: 4m37.967sec

checking: EX [[EF [~ [A [[[p190<=1 & 1<=p190] & [p126<=1 & 1<=p126]] U ~ [[p113<=1 & 1<=p113]]]]] | AF [[[A [[[p38<=1 & 1<=p38] & [p130<=1 & 1<=p130]] U [[p77<=1 & 1<=p77] & [p124<=1 & 1<=p124]]] & AF [[p140<=1 & 1<=p140]]] & [[p41<=1 & 1<=p41] & [p147<=1 & 1<=p147]]]]]]
normalized: EX [[~ [EG [~ [[[[p147<=1 & 1<=p147] & [p41<=1 & 1<=p41]] & [~ [EG [~ [[p140<=1 & 1<=p140]]]] & [~ [EG [~ [[[p124<=1 & 1<=p124] & [p77<=1 & 1<=p77]]]]] & ~ [E [~ [[[p124<=1 & 1<=p124] & [p77<=1 & 1<=p77]]] U [~ [[[p130<=1 & 1<=p130] & [p38<=1 & 1<=p38]]] & ~ [[[p124<=1 & 1<=p124] & [p77<=1 & 1<=p77]]]]]]]]]]]] | E [true U ~ [[~ [EG [[p113<=1 & 1<=p113]]] & ~ [E [[p113<=1 & 1<=p113] U [~ [[[p126<=1 & 1<=p126] & [p190<=1 & 1<=p190]]] & [p113<=1 & 1<=p113]]]]]]]]]

abstracting: (1<=p113)
states: 1,680,854,035,048 (12)
abstracting: (p113<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p190)
states: 714,986,621,360 (11)
abstracting: (p190<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p126)
states: 78,553,728,288 (10)
abstracting: (p126<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p113)
states: 1,680,854,035,048 (12)
abstracting: (p113<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p113)
states: 1,680,854,035,048 (12)
abstracting: (p113<=1)
states: 12,272,799,787,465 (13)
.........................
before gc: list nodes free: 3339780

after gc: idd nodes used:3812515, unused:60187485; list nodes free:274496500
.MC time: 4m 3.500sec

checking: A [EX [[[EX [[p56<=1 & 1<=p56]] & E [[p108<=1 & 1<=p108] U [p92<=1 & 1<=p92]]] & [AG [AX [[p110<=1 & 1<=p110]]] & [~ [[[p77<=1 & 1<=p77] & [p124<=1 & 1<=p124]]] | E [[p174<=1 & 1<=p174] U [p146<=1 & 1<=p146]]]]]] U EF [[[~ [AX [[p37<=1 & 1<=p37]]] | ~ [AX [[p67<=1 & 1<=p67]]]] & [[p127<=1 & 1<=p127] | [p15<=1 & 1<=p15]]]]]
normalized: [~ [EG [~ [E [true U [[[p15<=1 & 1<=p15] | [p127<=1 & 1<=p127]] & [EX [~ [[p67<=1 & 1<=p67]]] | EX [~ [[p37<=1 & 1<=p37]]]]]]]]] & ~ [E [~ [E [true U [[[p15<=1 & 1<=p15] | [p127<=1 & 1<=p127]] & [EX [~ [[p67<=1 & 1<=p67]]] | EX [~ [[p37<=1 & 1<=p37]]]]]]] U [~ [EX [[[[E [[p174<=1 & 1<=p174] U [p146<=1 & 1<=p146]] | ~ [[[p124<=1 & 1<=p124] & [p77<=1 & 1<=p77]]]] & ~ [E [true U EX [~ [[p110<=1 & 1<=p110]]]]]] & [E [[p108<=1 & 1<=p108] U [p92<=1 & 1<=p92]] & EX [[p56<=1 & 1<=p56]]]]]] & ~ [E [true U [[[p15<=1 & 1<=p15] | [p127<=1 & 1<=p127]] & [EX [~ [[p67<=1 & 1<=p67]]] | EX [~ [[p37<=1 & 1<=p37]]]]]]]]]]]

abstracting: (1<=p37)
states: 259,475,529,600 (11)
abstracting: (p37<=1)
states: 12,272,799,787,465 (13)

before gc: list nodes free: 3865149

after gc: idd nodes used:1644751, unused:62355249; list nodes free:284109139
.abstracting: (1<=p67)
states: 872,277,761,792 (11)
abstracting: (p67<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p127)
states: 78,553,728,288 (10)
abstracting: (p127<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p15)
states: 449,132,898,400 (11)
abstracting: (p15<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p56)
states: 791,437,983,072 (11)
abstracting: (p56<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p92)
states: 1,103,337,797,448 (12)
abstracting: (p92<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p108)
states: 1,091,404,483,532 (12)
abstracting: (p108<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p110)
states: 623,555,839,852 (11)
abstracting: (p110<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p77)
states: 1,386,061,468,304 (12)
abstracting: (p77<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p124)
states: 78,553,728,288 (10)
abstracting: (p124<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p146)
states: 211,712,083,968 (11)
abstracting: (p146<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p174)
states: 725,851,385,287 (11)
abstracting: (p174<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p37)
states: 259,475,529,600 (11)
abstracting: (p37<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p67)
states: 872,277,761,792 (11)
abstracting: (p67<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p127)
states: 78,553,728,288 (10)
abstracting: (p127<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p15)
states: 449,132,898,400 (11)
abstracting: (p15<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p37)
states: 259,475,529,600 (11)
abstracting: (p37<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p67)
states: 872,277,761,792 (11)
abstracting: (p67<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p127)
states: 78,553,728,288 (10)
abstracting: (p127<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p15)
states: 449,132,898,400 (11)
abstracting: (p15<=1)
states: 12,272,799,787,465 (13)
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m18.059sec

checking: A [EF [[p165<=1 & 1<=p165]] U [[p8<=1 & 1<=p8] & [AX [[AF [[p77<=1 & 1<=p77]] & [[p74<=1 & 1<=p74] | [[p134<=1 & 1<=p134] & [p191<=1 & 1<=p191]]]]] | [AG [~ [A [[p120<=1 & 1<=p120] U [p62<=1 & 1<=p62]]]] | [E [[AF [[p185<=1 & 1<=p185]] | [[p53<=1 & 1<=p53] & [[p114<=1 & 1<=p114] & [p183<=1 & 1<=p183]]]] U [[p56<=1 & 1<=p56] & ~ [[[p41<=1 & 1<=p41] & [p147<=1 & 1<=p147]]]]] & AF [AX [[p7<=1 & 1<=p7]]]]]]]]
normalized: [~ [EG [~ [[[[[~ [EG [EX [~ [[p7<=1 & 1<=p7]]]]] & E [[[[[p183<=1 & 1<=p183] & [p114<=1 & 1<=p114]] & [p53<=1 & 1<=p53]] | ~ [EG [~ [[p185<=1 & 1<=p185]]]]] U [~ [[[p147<=1 & 1<=p147] & [p41<=1 & 1<=p41]]] & [p56<=1 & 1<=p56]]]] | ~ [E [true U [~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[p120<=1 & 1<=p120]] & ~ [[p62<=1 & 1<=p62]]]]]]]]] | ~ [EX [~ [[[[[p191<=1 & 1<=p191] & [p134<=1 & 1<=p134]] | [p74<=1 & 1<=p74]] & ~ [EG [~ [[p77<=1 & 1<=p77]]]]]]]]] & [p8<=1 & 1<=p8]]]]] & ~ [E [~ [[[[[~ [EG [EX [~ [[p7<=1 & 1<=p7]]]]] & E [[[[[p183<=1 & 1<=p183] & [p114<=1 & 1<=p114]] & [p53<=1 & 1<=p53]] | ~ [EG [~ [[p185<=1 & 1<=p185]]]]] U [~ [[[p147<=1 & 1<=p147] & [p41<=1 & 1<=p41]]] & [p56<=1 & 1<=p56]]]] | ~ [E [true U [~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[p120<=1 & 1<=p120]] & ~ [[p62<=1 & 1<=p62]]]]]]]]] | ~ [EX [~ [[[[[p191<=1 & 1<=p191] & [p134<=1 & 1<=p134]] | [p74<=1 & 1<=p74]] & ~ [EG [~ [[p77<=1 & 1<=p77]]]]]]]]] & [p8<=1 & 1<=p8]]] U [~ [E [true U [p165<=1 & 1<=p165]]] & ~ [[[[[~ [EG [EX [~ [[p7<=1 & 1<=p7]]]]] & E [[[[[p183<=1 & 1<=p183] & [p114<=1 & 1<=p114]] & [p53<=1 & 1<=p53]] | ~ [EG [~ [[p185<=1 & 1<=p185]]]]] U [~ [[[p147<=1 & 1<=p147] & [p41<=1 & 1<=p41]]] & [p56<=1 & 1<=p56]]]] | ~ [E [true U [~ [EG [~ [[p62<=1 & 1<=p62]]]] & ~ [E [~ [[p62<=1 & 1<=p62]] U [~ [[p120<=1 & 1<=p120]] & ~ [[p62<=1 & 1<=p62]]]]]]]]] | ~ [EX [~ [[[[[p191<=1 & 1<=p191] & [p134<=1 & 1<=p134]] | [p74<=1 & 1<=p74]] & ~ [EG [~ [[p77<=1 & 1<=p77]]]]]]]]] & [p8<=1 & 1<=p8]]]]]]]

abstracting: (1<=p8)
states: 69,460,776 (7)
abstracting: (p8<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p77)
states: 1,386,061,468,304 (12)
abstracting: (p77<=1)
states: 12,272,799,787,465 (13)
...............
before gc: list nodes free: 4647639

after gc: idd nodes used:3044497, unused:60955503; list nodes free:277781726
.......
before gc: list nodes free: 3244122

after gc: idd nodes used:4395492, unused:59604508; list nodes free:271775561
MC time: 3m43.586sec

checking: EX [[AF [[[AX [[[p108<=1 & 1<=p108] & [p194<=1 & 1<=p194]]] & [[p64<=1 & 1<=p64] | [[p61<=1 & 1<=p61] & [p155<=1 & 1<=p155]]]] & [EF [[[p134<=1 & 1<=p134] & [p191<=1 & 1<=p191]]] & [AX [[[p145<=1 & 1<=p145] & [p193<=1 & 1<=p193]]] | [[p41<=1 & 1<=p41] | [p39<=1 & 1<=p39]]]]]] | E [[p109<=1 & 1<=p109] U [EF [[[p72<=1 & 1<=p72] | [p181<=1 & 1<=p181]]] & ~ [[[p55<=1 & 1<=p55] & [[p173<=1 & 1<=p173] & ~ [[p78<=1 & 1<=p78]]]]]]]]]
normalized: EX [[E [[p109<=1 & 1<=p109] U [~ [[[[p173<=1 & 1<=p173] & ~ [[p78<=1 & 1<=p78]]] & [p55<=1 & 1<=p55]]] & E [true U [[p181<=1 & 1<=p181] | [p72<=1 & 1<=p72]]]]] | ~ [EG [~ [[[~ [EX [~ [[[p194<=1 & 1<=p194] & [p108<=1 & 1<=p108]]]]] & [[[p61<=1 & 1<=p61] & [p155<=1 & 1<=p155]] | [p64<=1 & 1<=p64]]] & [E [true U [[p191<=1 & 1<=p191] & [p134<=1 & 1<=p134]]] & [~ [EX [~ [[[p193<=1 & 1<=p193] & [p145<=1 & 1<=p145]]]]] | [[p41<=1 & 1<=p41] | [p39<=1 & 1<=p39]]]]]]]]]]

abstracting: (1<=p39)
states: 462,559,756,544 (11)
abstracting: (p39<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p41)
states: 1,365,681,183,896 (12)
abstracting: (p41<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p145)
states: 211,712,083,968 (11)
abstracting: (p145<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p193)
states: 5,302,268,455,921 (12)
abstracting: (p193<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p134)
states: 1,510,313,210,366 (12)
abstracting: (p134<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p191)
states: 932,951,933,035 (11)
abstracting: (p191<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p64)
states: 1,625,227,262,072 (12)
abstracting: (p64<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p155)
states: 534,547,413,140 (11)
abstracting: (p155<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p61)
states: 1,625,227,262,072 (12)
abstracting: (p61<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p108)
states: 1,091,404,483,532 (12)
abstracting: (p108<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p194)
states: 5,302,268,455,921 (12)
abstracting: (p194<=1)
states: 12,272,799,787,465 (13)
.
EG iterations: 0
abstracting: (1<=p72)
states: 255,176,605,152 (11)
abstracting: (p72<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p181)
states: 452,324,526,896 (11)
abstracting: (p181<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p55)
states: 1,548,970,639,168 (12)
abstracting: (p55<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p78)
states: 1,386,061,468,304 (12)
abstracting: (p78<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p173)
states: 725,851,385,287 (11)
abstracting: (p173<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p109)
states: 1,091,404,483,532 (12)
abstracting: (p109<=1)
states: 12,272,799,787,465 (13)
.-> the formula is TRUE

FORMULA AutoFlight-PT-02b-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m37.647sec

checking: EG [EF [AG [[[AF [[p76<=1 & 1<=p76]] | AF [[p22<=0 & 0<=p22]]] | [1<=p143 & p143<=1]]]]]
normalized: EG [E [true U ~ [E [true U ~ [[[1<=p143 & p143<=1] | [~ [EG [~ [[p22<=0 & 0<=p22]]]] | ~ [EG [~ [[p76<=1 & 1<=p76]]]]]]]]]]]

abstracting: (1<=p76)
states: 458,194,392,800 (11)
abstracting: (p76<=1)
states: 12,272,799,787,465 (13)
.
EG iterations: 1
abstracting: (0<=p22)
states: 12,272,799,787,465 (13)
abstracting: (p22<=0)
states: 10,907,131,308,121 (13)
.................
before gc: list nodes free: 4402669

after gc: idd nodes used:3022283, unused:60977717; list nodes free:277919491
...............
before gc: list nodes free: 4129162

after gc: idd nodes used:4431646, unused:59568354; list nodes free:271632547
.....
before gc: list nodes free: 5769455

after gc: idd nodes used:8607966, unused:55392034; list nodes free:252491495
.....
before gc: list nodes free: 6409678

after gc: idd nodes used:5037779, unused:58962221; list nodes free:269130002
....
before gc: list nodes free: 6508530

after gc: idd nodes used:5250123, unused:58749877; list nodes free:268127930
......
before gc: list nodes free: 6487315

after gc: idd nodes used:4849192, unused:59150808; list nodes free:270022751
..............
before gc: list nodes free: 6452780

after gc: idd nodes used:3733809, unused:60266191; list nodes free:274822689
............................
EG iterations: 94
abstracting: (p143<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p143)
states: 1,678,646,091,796 (12)

EG iterations: 0
-> the formula is TRUE

FORMULA AutoFlight-PT-02b-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 19m25.688sec

checking: AG [[EG [~ [E [[[p134<=1 & 1<=p134] & [[p191<=1 & 1<=p191] & [p82<=1 & 1<=p82]]] U EX [[p43<=1 & 1<=p43]]]]] | AG [[p42<=0 & 0<=p42]]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [[p42<=0 & 0<=p42]]]] | EG [~ [E [[[[p82<=1 & 1<=p82] & [p191<=1 & 1<=p191]] & [p134<=1 & 1<=p134]] U EX [[p43<=1 & 1<=p43]]]]]]]]]

abstracting: (1<=p43)
states: 669,681,408,504 (11)
abstracting: (p43<=1)
states: 12,272,799,787,465 (13)
.abstracting: (1<=p134)
states: 1,510,313,210,366 (12)
abstracting: (p134<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p191)
states: 932,951,933,035 (11)
abstracting: (p191<=1)
states: 12,272,799,787,465 (13)
abstracting: (1<=p82)
states: 633,146,796,008 (11)
abstracting: (p82<=1)
states: 12,272,799,787,465 (13)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 6103500 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16096040 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:15648 (81), effective:1205 (6)

initing FirstDep: 0m 0.000sec


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

net_ddint.h:600: Timeout: after 321 sec


iterations count:209 (1), effective:4 (0)

iterations count:4073 (21), effective:289 (1)

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

iterations count:209 (1), effective:6 (0)

net_ddint.h:600: Timeout: after 350 sec


iterations count:2087 (10), effective:144 (0)

iterations count:202 (1), effective:2 (0)

iterations count:221 (1), effective:2 (0)

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

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

net_ddint.h:600: Timeout: after 316 sec


iterations count:4043 (21), effective:299 (1)

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

net_ddint.h:600: Timeout: after 276 sec


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

net_ddint.h:600: Timeout: after 242 sec


iterations count:3296 (17), effective:234 (1)

iterations count:3127 (16), effective:200 (1)

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

iterations count:2908 (15), effective:226 (1)

iterations count:3296 (17), effective:234 (1)

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

iterations count:3296 (17), effective:234 (1)

net_ddint.h:600: Timeout: after 222 sec


iterations count:3284 (17), effective:237 (1)

iterations count:3458 (18), effective:241 (1)

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

iterations count:4984 (25), effective:353 (1)

iterations count:2405 (12), effective:184 (0)

iterations count:209 (1), effective:6 (0)

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="AutoFlight-PT-02b"
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 AutoFlight-PT-02b, 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 r010-oct2-167813599000394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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