fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r009-oct2-167813598000538
Last Updated
May 14, 2023

About the Execution of LTSMin+red for AutonomousCar-PT-01b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
496.852 12731.00 35812.00 62.20 TFTTFFTTFFFFTTTF normal

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.r009-oct2-167813598000538.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 ltsminxred
Input is AutonomousCar-PT-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r009-oct2-167813598000538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 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 31K 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 AutonomousCar-PT-01b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678636342577

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-01b
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:52:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 15:52:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:52:26] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2023-03-12 15:52:26] [INFO ] Transformed 119 places.
[2023-03-12 15:52:26] [INFO ] Transformed 132 transitions.
[2023-03-12 15:52:26] [INFO ] Found NUPN structural information;
[2023-03-12 15:52:26] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 88 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 130
Applied a total of 4 rules in 38 ms. Remains 117 /119 variables (removed 2) and now considering 130/132 (removed 2) transitions.
// Phase 1: matrix 130 rows 117 cols
[2023-03-12 15:52:26] [INFO ] Computed 6 place invariants in 5 ms
[2023-03-12 15:52:26] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 15:52:26] [INFO ] Invariant cache hit.
[2023-03-12 15:52:26] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 680 ms to find 0 implicit places.
[2023-03-12 15:52:26] [INFO ] Invariant cache hit.
[2023-03-12 15:52:27] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/119 places, 130/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 881 ms. Remains : 117/119 places, 130/132 transitions.
Support contains 88 out of 117 places after structural reductions.
[2023-03-12 15:52:27] [INFO ] Flatten gal took : 31 ms
[2023-03-12 15:52:27] [INFO ] Flatten gal took : 13 ms
[2023-03-12 15:52:27] [INFO ] Input system was already deterministic with 130 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 86) seen :55
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :13
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :5
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-12 15:52:27] [INFO ] Invariant cache hit.
[2023-03-12 15:52:28] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 15:52:28] [INFO ] After 106ms SMT Verify possible using state equation in real domain returned unsat :8 sat :2 real:3
[2023-03-12 15:52:28] [INFO ] Deduced a trap composed of 16 places in 180 ms of which 8 ms to minimize.
[2023-03-12 15:52:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-12 15:52:28] [INFO ] After 336ms SMT Verify possible using trap constraints in real domain returned unsat :9 sat :0 real:4
[2023-03-12 15:52:28] [INFO ] After 492ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:4
[2023-03-12 15:52:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 35 ms returned sat
[2023-03-12 15:52:28] [INFO ] After 117ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :2
[2023-03-12 15:52:28] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2023-03-12 15:52:28] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2023-03-12 15:52:29] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 0 ms to minimize.
[2023-03-12 15:52:29] [INFO ] Deduced a trap composed of 36 places in 57 ms of which 1 ms to minimize.
[2023-03-12 15:52:29] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 0 ms to minimize.
[2023-03-12 15:52:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 379 ms
[2023-03-12 15:52:29] [INFO ] After 513ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-12 15:52:29] [INFO ] After 755ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :2
Fused 13 Parikh solutions to 2 different solutions.
Finished Parikh walk after 47 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
Parikh walk visited 2 properties in 3 ms.
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 30 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 9 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 130 transitions.
Support contains 78 out of 117 places (down from 80) after GAL structural reductions.
Computed a total of 29 stabilizing places and 30 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 104 transition count 117
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 104 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 104 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 102 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 102 transition count 111
Applied a total of 34 rules in 10 ms. Remains 102 /117 variables (removed 15) and now considering 111/130 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 102/117 places, 111/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 5 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 5 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 109 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 114 transition count 71
Reduce places removed 56 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 66 rules applied. Total rules applied 123 place count 58 transition count 61
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 128 place count 53 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 128 place count 53 transition count 56
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 138 place count 48 transition count 56
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 146 place count 40 transition count 48
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 40 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 158 place count 40 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 158 place count 40 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 39 transition count 43
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 37 transition count 41
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 37 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 166 place count 37 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 36 transition count 39
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 189 place count 25 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 190 place count 25 transition count 27
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 7 with 2 rules applied. Total rules applied 192 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 24 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 195 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 196 place count 21 transition count 23
Applied a total of 196 rules in 21 ms. Remains 21 /117 variables (removed 96) and now considering 23/130 (removed 107) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 21/117 places, 23/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 1 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 1 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 23 transitions.
Finished random walk after 59 steps, including 5 resets, run visited all 1 properties in 2 ms. (steps per millisecond=29 )
FORMULA AutonomousCar-PT-01b-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 96 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 96 transition count 105
Applied a total of 46 rules in 7 ms. Remains 96 /117 variables (removed 21) and now considering 105/130 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 96/117 places, 105/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 103 transition count 116
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 103 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 103 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 101 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 101 transition count 110
Applied a total of 36 rules in 7 ms. Remains 101 /117 variables (removed 16) and now considering 110/130 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 101/117 places, 110/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 101 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 99 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 99 transition count 108
Applied a total of 40 rules in 5 ms. Remains 99 /117 variables (removed 18) and now considering 108/130 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 99/117 places, 108/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 3 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 7 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 102 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 114 transition count 77
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 108 place count 64 transition count 70
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 114 place count 61 transition count 67
Reduce places removed 3 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 5 rules applied. Total rules applied 119 place count 58 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 57 transition count 65
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 120 place count 57 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 130 place count 52 transition count 60
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 139 place count 43 transition count 51
Iterating global reduction 5 with 9 rules applied. Total rules applied 148 place count 43 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 152 place count 43 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 152 place count 43 transition count 46
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 154 place count 42 transition count 46
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 156 place count 40 transition count 44
Iterating global reduction 6 with 2 rules applied. Total rules applied 158 place count 40 transition count 44
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 160 place count 40 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 161 place count 39 transition count 42
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 183 place count 28 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 184 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 185 place count 27 transition count 28
Iterating global reduction 9 with 1 rules applied. Total rules applied 186 place count 27 transition count 28
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 9 with 2 rules applied. Total rules applied 188 place count 26 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 189 place count 26 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 191 place count 24 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 192 place count 23 transition count 24
Applied a total of 192 rules in 17 ms. Remains 23 /117 variables (removed 94) and now considering 24/130 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 23/117 places, 24/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 1 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 1 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 101 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 98 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 98 transition count 107
Applied a total of 42 rules in 4 ms. Remains 98 /117 variables (removed 19) and now considering 107/130 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 98/117 places, 107/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 3 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 102 transition count 115
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 102 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 102 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 99 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 99 transition count 108
Applied a total of 40 rules in 5 ms. Remains 99 /117 variables (removed 18) and now considering 108/130 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 99/117 places, 108/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 105 transition count 118
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 105 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 102 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 102 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 101 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 101 transition count 114
Applied a total of 32 rules in 5 ms. Remains 101 /117 variables (removed 16) and now considering 114/130 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 101/117 places, 114/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 5 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 93 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 114 transition count 77
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 59 rules applied. Total rules applied 110 place count 64 transition count 68
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 59 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 115 place count 59 transition count 65
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 121 place count 56 transition count 65
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 130 place count 47 transition count 56
Iterating global reduction 3 with 9 rules applied. Total rules applied 139 place count 47 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 47 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 140 place count 47 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 46 transition count 54
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 45 transition count 53
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 45 transition count 53
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 162 place count 36 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 36 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 34 transition count 41
Applied a total of 165 rules in 10 ms. Remains 34 /117 variables (removed 83) and now considering 41/130 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 34/117 places, 41/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 2 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 2 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 102 transition count 115
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 102 transition count 115
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 98 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 98 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 97 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 97 transition count 110
Applied a total of 40 rules in 4 ms. Remains 97 /117 variables (removed 20) and now considering 110/130 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 97/117 places, 110/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 3 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 96 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 95 transition count 104
Applied a total of 48 rules in 6 ms. Remains 95 /117 variables (removed 22) and now considering 104/130 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 95/117 places, 104/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 3 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 3 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 100 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 114 transition count 77
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 57 rules applied. Total rules applied 108 place count 64 transition count 70
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 115 place count 60 transition count 67
Reduce places removed 3 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 5 rules applied. Total rules applied 120 place count 57 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 56 transition count 65
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 121 place count 56 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 131 place count 51 transition count 60
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 140 place count 42 transition count 51
Iterating global reduction 5 with 9 rules applied. Total rules applied 149 place count 42 transition count 51
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 154 place count 42 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 154 place count 42 transition count 44
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 158 place count 40 transition count 44
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 159 place count 39 transition count 43
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 39 transition count 43
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 180 place count 29 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 181 place count 29 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 182 place count 28 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 183 place count 28 transition count 30
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 7 with 2 rules applied. Total rules applied 185 place count 27 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 186 place count 27 transition count 28
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 189 place count 27 transition count 28
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 190 place count 26 transition count 27
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 26 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 193 place count 24 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 23 transition count 25
Applied a total of 194 rules in 12 ms. Remains 23 /117 variables (removed 94) and now considering 25/130 (removed 105) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 23/117 places, 25/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 1 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 2 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 103 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 114 transition count 76
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 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 60 rules applied. Total rules applied 112 place count 63 transition count 67
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 58 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 57 transition count 66
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 119 place count 57 transition count 61
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 129 place count 52 transition count 61
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 139 place count 42 transition count 51
Iterating global reduction 4 with 10 rules applied. Total rules applied 149 place count 42 transition count 51
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 154 place count 42 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 154 place count 42 transition count 44
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 158 place count 40 transition count 44
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 160 place count 38 transition count 42
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 38 transition count 42
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 164 place count 38 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 37 transition count 40
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 185 place count 27 transition count 30
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 186 place count 26 transition count 28
Iterating global reduction 7 with 1 rules applied. Total rules applied 187 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 188 place count 26 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 189 place count 26 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 190 place count 25 transition count 26
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 25 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 193 place count 23 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 22 transition count 24
Applied a total of 194 rules in 15 ms. Remains 22 /117 variables (removed 95) and now considering 24/130 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 22/117 places, 24/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 1 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 1 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 24 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
FORMULA AutonomousCar-PT-01b-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 104 transition count 117
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 104 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 104 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 103 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 103 transition count 112
Applied a total of 32 rules in 5 ms. Remains 103 /117 variables (removed 14) and now considering 112/130 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 103/117 places, 112/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 91 edges and 117 vertex of which 4 / 117 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 115 transition count 87
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 48 rules applied. Total rules applied 90 place count 74 transition count 80
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 98 place count 70 transition count 76
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 102 place count 66 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 102 place count 66 transition count 72
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 110 place count 62 transition count 72
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 118 place count 54 transition count 64
Iterating global reduction 4 with 8 rules applied. Total rules applied 126 place count 54 transition count 64
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 131 place count 54 transition count 59
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 133 place count 52 transition count 57
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 52 transition count 57
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 5 with 28 rules applied. Total rules applied 163 place count 38 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 164 place count 38 transition count 42
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 166 place count 37 transition count 41
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 170 place count 37 transition count 41
Applied a total of 170 rules in 24 ms. Remains 37 /117 variables (removed 80) and now considering 41/130 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 37/117 places, 41/130 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 2 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 1 ms
[2023-03-12 15:52:29] [INFO ] Input system was already deterministic with 41 transitions.
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 17 ms
[2023-03-12 15:52:29] [INFO ] Flatten gal took : 4 ms
[2023-03-12 15:52:29] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-12 15:52:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 130 transitions and 335 arcs took 5 ms.
Total runtime 4075 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/495/ctl_0_ --ctl=/tmp/495/ctl_1_ --ctl=/tmp/495/ctl_2_ --ctl=/tmp/495/ctl_3_ --ctl=/tmp/495/ctl_4_ --ctl=/tmp/495/ctl_5_ --ctl=/tmp/495/ctl_6_ --ctl=/tmp/495/ctl_7_ --ctl=/tmp/495/ctl_8_ --ctl=/tmp/495/ctl_9_ --ctl=/tmp/495/ctl_10_ --ctl=/tmp/495/ctl_11_ --ctl=/tmp/495/ctl_12_ --ctl=/tmp/495/ctl_13_ --mu-par --mu-opt
FORMULA AutonomousCar-PT-01b-CTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA AutonomousCar-PT-01b-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1678636355308

--------------------
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
mcc2023
ctl formula name AutonomousCar-PT-01b-CTLFireability-00
ctl formula formula --ctl=/tmp/495/ctl_0_
ctl formula name AutonomousCar-PT-01b-CTLFireability-02
ctl formula formula --ctl=/tmp/495/ctl_1_
ctl formula name AutonomousCar-PT-01b-CTLFireability-03
ctl formula formula --ctl=/tmp/495/ctl_2_
ctl formula name AutonomousCar-PT-01b-CTLFireability-04
ctl formula formula --ctl=/tmp/495/ctl_3_
ctl formula name AutonomousCar-PT-01b-CTLFireability-05
ctl formula formula --ctl=/tmp/495/ctl_4_
ctl formula name AutonomousCar-PT-01b-CTLFireability-06
ctl formula formula --ctl=/tmp/495/ctl_5_
ctl formula name AutonomousCar-PT-01b-CTLFireability-07
ctl formula formula --ctl=/tmp/495/ctl_6_
ctl formula name AutonomousCar-PT-01b-CTLFireability-08
ctl formula formula --ctl=/tmp/495/ctl_7_
ctl formula name AutonomousCar-PT-01b-CTLFireability-09
ctl formula formula --ctl=/tmp/495/ctl_8_
ctl formula name AutonomousCar-PT-01b-CTLFireability-10
ctl formula formula --ctl=/tmp/495/ctl_9_
ctl formula name AutonomousCar-PT-01b-CTLFireability-11
ctl formula formula --ctl=/tmp/495/ctl_10_
ctl formula name AutonomousCar-PT-01b-CTLFireability-12
ctl formula formula --ctl=/tmp/495/ctl_11_
ctl formula name AutonomousCar-PT-01b-CTLFireability-14
ctl formula formula --ctl=/tmp/495/ctl_12_
ctl formula name AutonomousCar-PT-01b-CTLFireability-15
ctl formula formula --ctl=/tmp/495/ctl_13_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 117 places, 130 transitions and 335 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 130->122 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state vector length is 117; there are 122 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 4170 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.050 real 0.190 user 0.020 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.000 real 0.000 user 0.000 sys
pnml2lts-sym: state space has 114394 states, 2033 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/495/ctl_13_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_2_ holds for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_0_ holds for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_12_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/495/ctl_1_ holds for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_3_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_4_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_11_ holds for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_6_ holds for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_10_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_9_ does not hold for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_8_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/495/ctl_5_ holds for the initial state
pnml2lts-sym: Formula /tmp/495/ctl_7_ does not hold for the initial state
pnml2lts-sym: group_next: 922 nodes total
pnml2lts-sym: group_explored: 954 nodes, 728 short vectors total
pnml2lts-sym: max token count: 1

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="AutonomousCar-PT-01b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is AutonomousCar-PT-01b, 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 r009-oct2-167813598000538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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