Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167100146.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is AutoFlight-PT-06b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167100146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 17:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 22:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 22:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 22:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 22:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 134K May 18 16:42 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-06b-CTLFireability-2024-00
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-01
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-02
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-03
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-04
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-05
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-06
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-07
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-08
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-09
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-10
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2024-11
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2023-12
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2023-13
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2023-14
FORMULA_NAME AutoFlight-PT-06b-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717188457584

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutoFlight-PT-06b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:47:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 20:47:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:47:39] [INFO ] Load time of PNML (sax parser for PT used): 262 ms
[2024-05-31 20:47:39] [INFO ] Transformed 574 places.
[2024-05-31 20:47:39] [INFO ] Transformed 572 transitions.
[2024-05-31 20:47:39] [INFO ] Found NUPN structural information;
[2024-05-31 20:47:39] [INFO ] Parsed PT model containing 574 places and 572 transitions and 1334 arcs in 502 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 30 ms.
Support contains 136 out of 574 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 574/574 places, 572/572 transitions.
Discarding 48 places :
Symmetric choice reduction at 0 with 48 rule applications. Total rules 48 place count 526 transition count 524
Iterating global reduction 0 with 48 rules applied. Total rules applied 96 place count 526 transition count 524
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 101 place count 526 transition count 519
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 115 place count 512 transition count 505
Iterating global reduction 1 with 14 rules applied. Total rules applied 129 place count 512 transition count 505
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 131 place count 510 transition count 503
Iterating global reduction 1 with 2 rules applied. Total rules applied 133 place count 510 transition count 503
Applied a total of 133 rules in 209 ms. Remains 510 /574 variables (removed 64) and now considering 503/572 (removed 69) transitions.
// Phase 1: matrix 503 rows 510 cols
[2024-05-31 20:47:40] [INFO ] Computed 40 invariants in 50 ms
[2024-05-31 20:47:41] [INFO ] Implicit Places using invariants in 950 ms returned []
[2024-05-31 20:47:41] [INFO ] Invariant cache hit.
[2024-05-31 20:47:42] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 1689 ms to find 0 implicit places.
Running 502 sub problems to find dead transitions.
[2024-05-31 20:47:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/509 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 1 (OVERLAPS) 1/510 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 502 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/510 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-31 20:47:53] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 29 ms to minimize.
[2024-05-31 20:47:53] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 3 ms to minimize.
[2024-05-31 20:47:54] [INFO ] Deduced a trap composed of 73 places in 1045 ms of which 4 ms to minimize.
[2024-05-31 20:47:55] [INFO ] Deduced a trap composed of 53 places in 197 ms of which 3 ms to minimize.
[2024-05-31 20:47:55] [INFO ] Deduced a trap composed of 81 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:47:55] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 3 ms to minimize.
[2024-05-31 20:47:55] [INFO ] Deduced a trap composed of 69 places in 227 ms of which 3 ms to minimize.
[2024-05-31 20:47:56] [INFO ] Deduced a trap composed of 101 places in 211 ms of which 4 ms to minimize.
[2024-05-31 20:47:56] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 13 ms to minimize.
[2024-05-31 20:47:56] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 3 ms to minimize.
[2024-05-31 20:47:56] [INFO ] Deduced a trap composed of 85 places in 175 ms of which 3 ms to minimize.
[2024-05-31 20:47:56] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2024-05-31 20:47:57] [INFO ] Deduced a trap composed of 83 places in 222 ms of which 3 ms to minimize.
[2024-05-31 20:47:57] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 3 ms to minimize.
[2024-05-31 20:47:57] [INFO ] Deduced a trap composed of 103 places in 165 ms of which 2 ms to minimize.
[2024-05-31 20:47:57] [INFO ] Deduced a trap composed of 71 places in 198 ms of which 3 ms to minimize.
[2024-05-31 20:47:57] [INFO ] Deduced a trap composed of 114 places in 184 ms of which 3 ms to minimize.
[2024-05-31 20:47:57] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 4 ms to minimize.
[2024-05-31 20:47:58] [INFO ] Deduced a trap composed of 84 places in 197 ms of which 3 ms to minimize.
[2024-05-31 20:47:58] [INFO ] Deduced a trap composed of 42 places in 80 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/510 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 3 ms to minimize.
[2024-05-31 20:48:04] [INFO ] Deduced a trap composed of 67 places in 316 ms of which 5 ms to minimize.
[2024-05-31 20:48:05] [INFO ] Deduced a trap composed of 16 places in 305 ms of which 6 ms to minimize.
[2024-05-31 20:48:05] [INFO ] Deduced a trap composed of 64 places in 313 ms of which 17 ms to minimize.
[2024-05-31 20:48:05] [INFO ] Deduced a trap composed of 17 places in 326 ms of which 8 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 23 places in 301 ms of which 6 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 5 ms to minimize.
[2024-05-31 20:48:06] [INFO ] Deduced a trap composed of 22 places in 260 ms of which 4 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 4 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 23 places in 225 ms of which 5 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 4 ms to minimize.
[2024-05-31 20:48:07] [INFO ] Deduced a trap composed of 24 places in 182 ms of which 3 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 32 places in 182 ms of which 4 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 6 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 32 places in 172 ms of which 4 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 3 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 34 places in 162 ms of which 3 ms to minimize.
[2024-05-31 20:48:08] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 4 ms to minimize.
[2024-05-31 20:48:09] [INFO ] Deduced a trap composed of 29 places in 258 ms of which 4 ms to minimize.
[2024-05-31 20:48:09] [INFO ] Deduced a trap composed of 29 places in 222 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/510 variables, 20/80 constraints. Problems are: Problem set: 0 solved, 502 unsolved
[2024-05-31 20:48:10] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 3 ms to minimize.
[2024-05-31 20:48:10] [INFO ] Deduced a trap composed of 102 places in 113 ms of which 3 ms to minimize.
[2024-05-31 20:48:10] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 3 ms to minimize.
[2024-05-31 20:48:10] [INFO ] Deduced a trap composed of 20 places in 219 ms of which 5 ms to minimize.
[2024-05-31 20:48:11] [INFO ] Deduced a trap composed of 69 places in 219 ms of which 5 ms to minimize.
[2024-05-31 20:48:11] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 4 ms to minimize.
[2024-05-31 20:48:11] [INFO ] Deduced a trap composed of 79 places in 195 ms of which 4 ms to minimize.
[2024-05-31 20:48:11] [INFO ] Deduced a trap composed of 72 places in 215 ms of which 4 ms to minimize.
[2024-05-31 20:48:11] [INFO ] Deduced a trap composed of 84 places in 206 ms of which 3 ms to minimize.
[2024-05-31 20:48:12] [INFO ] Deduced a trap composed of 63 places in 260 ms of which 5 ms to minimize.
SMT process timed out in 30311ms, After SMT, problems are : Problem set: 0 solved, 502 unsolved
Search for dead transitions found 0 dead transitions in 30343ms
Starting structural reductions in LTL mode, iteration 1 : 510/574 places, 503/572 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32281 ms. Remains : 510/574 places, 503/572 transitions.
Support contains 136 out of 510 places after structural reductions.
[2024-05-31 20:48:12] [INFO ] Flatten gal took : 94 ms
[2024-05-31 20:48:12] [INFO ] Flatten gal took : 42 ms
[2024-05-31 20:48:13] [INFO ] Input system was already deterministic with 503 transitions.
Support contains 130 out of 510 places (down from 136) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 85 to 84
RANDOM walk for 40000 steps (137 resets) in 3303 ms. (12 steps per ms) remains 21/84 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 21/21 properties
[2024-05-31 20:48:14] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp70 is UNSAT
At refinement iteration 1 (OVERLAPS) 404/450 variables, 34/34 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/450 variables, 0/34 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 31/481 variables, 5/39 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/481 variables, 0/39 constraints. Problems are: Problem set: 1 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 29/510 variables, 1/40 constraints. Problems are: Problem set: 1 solved, 20 unsolved
[2024-05-31 20:48:15] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 5 ms to minimize.
[2024-05-31 20:48:15] [INFO ] Deduced a trap composed of 57 places in 302 ms of which 4 ms to minimize.
[2024-05-31 20:48:16] [INFO ] Deduced a trap composed of 26 places in 248 ms of which 4 ms to minimize.
[2024-05-31 20:48:16] [INFO ] Deduced a trap composed of 25 places in 193 ms of which 4 ms to minimize.
[2024-05-31 20:48:16] [INFO ] Deduced a trap composed of 97 places in 210 ms of which 4 ms to minimize.
[2024-05-31 20:48:16] [INFO ] Deduced a trap composed of 37 places in 218 ms of which 15 ms to minimize.
[2024-05-31 20:48:16] [INFO ] Deduced a trap composed of 23 places in 223 ms of which 4 ms to minimize.
[2024-05-31 20:48:17] [INFO ] Deduced a trap composed of 52 places in 197 ms of which 4 ms to minimize.
[2024-05-31 20:48:17] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 3 ms to minimize.
[2024-05-31 20:48:17] [INFO ] Deduced a trap composed of 89 places in 221 ms of which 3 ms to minimize.
[2024-05-31 20:48:17] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:48:17] [INFO ] Deduced a trap composed of 52 places in 150 ms of which 3 ms to minimize.
[2024-05-31 20:48:18] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 4 ms to minimize.
[2024-05-31 20:48:18] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 3 ms to minimize.
[2024-05-31 20:48:18] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 4 ms to minimize.
[2024-05-31 20:48:18] [INFO ] Deduced a trap composed of 79 places in 165 ms of which 4 ms to minimize.
[2024-05-31 20:48:18] [INFO ] Deduced a trap composed of 85 places in 155 ms of which 4 ms to minimize.
[2024-05-31 20:48:19] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 3 ms to minimize.
[2024-05-31 20:48:19] [INFO ] Deduced a trap composed of 66 places in 142 ms of which 3 ms to minimize.
[2024-05-31 20:48:19] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 3 ms to minimize.
Problem AtomicPropp63 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 20/60 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-05-31 20:48:19] [INFO ] Deduced a trap composed of 76 places in 150 ms of which 3 ms to minimize.
SMT process timed out in 5040ms, After SMT, problems are : Problem set: 2 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 510 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 510/510 places, 503/503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 142 transitions
Trivial Post-agglo rules discarded 142 transitions
Performed 142 trivial Post agglomeration. Transition count delta: 142
Iterating post reduction 0 with 142 rules applied. Total rules applied 142 place count 510 transition count 361
Reduce places removed 142 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 164 rules applied. Total rules applied 306 place count 368 transition count 339
Reduce places removed 10 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 2 with 21 rules applied. Total rules applied 327 place count 358 transition count 328
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 340 place count 347 transition count 326
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 61 Pre rules applied. Total rules applied 340 place count 347 transition count 265
Deduced a syphon composed of 61 places in 1 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 4 with 122 rules applied. Total rules applied 462 place count 286 transition count 265
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 477 place count 271 transition count 250
Iterating global reduction 4 with 15 rules applied. Total rules applied 492 place count 271 transition count 250
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 492 place count 271 transition count 243
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 506 place count 264 transition count 243
Performed 75 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 656 place count 189 transition count 161
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 657 place count 189 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 659 place count 188 transition count 160
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 661 place count 188 transition count 158
Free-agglomeration rule applied 15 times.
Iterating global reduction 5 with 15 rules applied. Total rules applied 676 place count 188 transition count 143
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 691 place count 173 transition count 143
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 692 place count 172 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 694 place count 170 transition count 142
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 2 Pre rules applied. Total rules applied 694 place count 170 transition count 140
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 7 with 4 rules applied. Total rules applied 698 place count 168 transition count 140
Applied a total of 698 rules in 147 ms. Remains 168 /510 variables (removed 342) and now considering 140/503 (removed 363) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 168/510 places, 140/503 transitions.
RANDOM walk for 40000 steps (797 resets) in 971 ms. (41 steps per ms) remains 9/19 properties
BEST_FIRST walk for 40004 steps (130 resets) in 174 ms. (228 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (131 resets) in 171 ms. (232 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (128 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (129 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (131 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (131 resets) in 105 ms. (377 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (142 resets) in 170 ms. (233 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (110 resets) in 198 ms. (201 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (120 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
// Phase 1: matrix 140 rows 168 cols
[2024-05-31 20:48:20] [INFO ] Computed 38 invariants in 2 ms
[2024-05-31 20:48:20] [INFO ] State equation strengthened by 25 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 30/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 90/133 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 5 places in 19 ms of which 1 ms to minimize.
[2024-05-31 20:48:20] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 27/160 variables, 2/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:48:21] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-31 20:48:21] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-31 20:48:21] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-05-31 20:48:21] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-31 20:48:21] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 2 ms to minimize.
[2024-05-31 20:48:21] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:48:21] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2024-05-31 20:48:21] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 8/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 5/165 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 138/303 variables, 165/213 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 25/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 4/307 variables, 2/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/308 variables, 1/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 1/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 0/308 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 242 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1204 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 168/168 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 30/43 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/43 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 90/133 variables, 26/33 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:48:22] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-31 20:48:22] [INFO ] Deduced a trap composed of 16 places in 57 ms of which 1 ms to minimize.
[2024-05-31 20:48:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 27/160 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/160 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 5/165 variables, 2/51 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:48:22] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 0 ms to minimize.
[2024-05-31 20:48:22] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 2 ms to minimize.
[2024-05-31 20:48:22] [INFO ] Deduced a trap composed of 59 places in 132 ms of which 1 ms to minimize.
[2024-05-31 20:48:22] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 2 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 2 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 56 places in 86 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/165 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 30 places in 132 ms of which 2 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 2 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 55 places in 74 ms of which 1 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2024-05-31 20:48:23] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 2 ms to minimize.
[2024-05-31 20:48:24] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2024-05-31 20:48:24] [INFO ] Deduced a trap composed of 56 places in 53 ms of which 1 ms to minimize.
[2024-05-31 20:48:24] [INFO ] Deduced a trap composed of 45 places in 81 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/165 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 138/303 variables, 165/234 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/303 variables, 25/259 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/303 variables, 8/267 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-31 20:48:24] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/303 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/303 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 4/307 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 1/308 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/308 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/308 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 0/308 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 308/308 variables, and 272 constraints, problems are : Problem set: 0 solved, 8 unsolved in 3034 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 168/168 constraints, ReadFeed: 25/25 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 33/33 constraints]
After SMT, in 4294ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 2591 ms.
Support contains 13 out of 168 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 168/168 places, 140/140 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 168 transition count 128
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 156 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 155 transition count 127
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 26 place count 155 transition count 121
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 38 place count 149 transition count 121
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 39 place count 148 transition count 120
Iterating global reduction 3 with 1 rules applied. Total rules applied 40 place count 148 transition count 120
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 15 places and 0 transitions.
Iterating global reduction 3 with 29 rules applied. Total rules applied 69 place count 133 transition count 106
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 71 place count 133 transition count 104
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 71 place count 133 transition count 103
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 73 place count 132 transition count 103
Free-agglomeration rule applied 6 times.
Iterating global reduction 4 with 6 rules applied. Total rules applied 79 place count 132 transition count 97
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 85 place count 126 transition count 97
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 86 place count 126 transition count 97
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 87 place count 125 transition count 96
Iterating global reduction 5 with 1 rules applied. Total rules applied 88 place count 125 transition count 96
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 90 place count 123 transition count 94
Reduce places removed 19 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 5 with 39 rules applied. Total rules applied 129 place count 104 transition count 74
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 6 with 20 rules applied. Total rules applied 149 place count 84 transition count 74
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 15 Pre rules applied. Total rules applied 149 place count 84 transition count 59
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 179 place count 69 transition count 59
Applied a total of 179 rules in 55 ms. Remains 69 /168 variables (removed 99) and now considering 59/140 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 69/168 places, 59/140 transitions.
RANDOM walk for 40000 steps (2100 resets) in 148 ms. (268 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40004 steps (447 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
// Phase 1: matrix 59 rows 69 cols
[2024-05-31 20:48:27] [INFO ] Computed 18 invariants in 1 ms
[2024-05-31 20:48:27] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/44 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/51 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/101 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 25/126 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/126 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/128 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/128 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/128 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 90 constraints, problems are : Problem set: 0 solved, 1 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 9/12 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 32/44 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/51 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 50/101 variables, 51/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/101 variables, 3/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/101 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/101 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 25/126 variables, 16/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/126 variables, 4/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/126 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/128 variables, 2/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/128 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/128 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 91 constraints, problems are : Problem set: 0 solved, 1 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 69/69 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 225ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 135 steps, including 12 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
Parikh walk visited 1 properties in 8 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 35 ms
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 33 ms
[2024-05-31 20:48:28] [INFO ] Input system was already deterministic with 503 transitions.
Computed a total of 148 stabilizing places and 148 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 175 transitions
Trivial Post-agglo rules discarded 175 transitions
Performed 175 trivial Post agglomeration. Transition count delta: 175
Iterating post reduction 0 with 175 rules applied. Total rules applied 175 place count 509 transition count 327
Reduce places removed 175 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 203 rules applied. Total rules applied 378 place count 334 transition count 299
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 392 place count 322 transition count 297
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 394 place count 320 transition count 297
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 394 place count 320 transition count 235
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 518 place count 258 transition count 235
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 544 place count 232 transition count 209
Iterating global reduction 4 with 26 rules applied. Total rules applied 570 place count 232 transition count 209
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 570 place count 232 transition count 195
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 598 place count 218 transition count 195
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 722 place count 156 transition count 133
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 731 place count 156 transition count 124
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 5 with 18 rules applied. Total rules applied 749 place count 147 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 750 place count 146 transition count 114
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 5 rules applied. Total rules applied 755 place count 142 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 756 place count 141 transition count 113
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 3 Pre rules applied. Total rules applied 756 place count 141 transition count 110
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 762 place count 138 transition count 110
Applied a total of 762 rules in 79 ms. Remains 138 /510 variables (removed 372) and now considering 110/503 (removed 393) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 79 ms. Remains : 138/510 places, 110/503 transitions.
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:48:28] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 176 place count 509 transition count 326
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 204 rules applied. Total rules applied 380 place count 333 transition count 298
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 393 place count 321 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 394 place count 320 transition count 297
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 394 place count 320 transition count 235
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 518 place count 258 transition count 235
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 540 place count 236 transition count 213
Iterating global reduction 4 with 22 rules applied. Total rules applied 562 place count 236 transition count 213
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 12 Pre rules applied. Total rules applied 562 place count 236 transition count 201
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 24 rules applied. Total rules applied 586 place count 224 transition count 201
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 724 place count 155 transition count 132
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 732 place count 155 transition count 124
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 748 place count 147 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 749 place count 147 transition count 115
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 751 place count 146 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 752 place count 145 transition count 113
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 760 place count 138 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 761 place count 137 transition count 112
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 761 place count 137 transition count 106
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 773 place count 131 transition count 106
Applied a total of 773 rules in 81 ms. Remains 131 /510 variables (removed 379) and now considering 106/503 (removed 397) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 131/510 places, 106/503 transitions.
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 7 ms
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 8 ms
[2024-05-31 20:48:28] [INFO ] Input system was already deterministic with 106 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 472 transition count 465
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 472 transition count 465
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 82 place count 472 transition count 459
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 99 place count 455 transition count 442
Iterating global reduction 1 with 17 rules applied. Total rules applied 116 place count 455 transition count 442
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 119 place count 452 transition count 439
Iterating global reduction 1 with 3 rules applied. Total rules applied 122 place count 452 transition count 439
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 124 place count 450 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 126 place count 450 transition count 437
Applied a total of 126 rules in 55 ms. Remains 450 /510 variables (removed 60) and now considering 437/503 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 450/510 places, 437/503 transitions.
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 21 ms
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 22 ms
[2024-05-31 20:48:28] [INFO ] Input system was already deterministic with 437 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 174 transitions
Trivial Post-agglo rules discarded 174 transitions
Performed 174 trivial Post agglomeration. Transition count delta: 174
Iterating post reduction 0 with 174 rules applied. Total rules applied 174 place count 509 transition count 328
Reduce places removed 174 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 201 rules applied. Total rules applied 375 place count 335 transition count 301
Reduce places removed 12 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 14 rules applied. Total rules applied 389 place count 323 transition count 299
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 391 place count 321 transition count 299
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 59 Pre rules applied. Total rules applied 391 place count 321 transition count 240
Deduced a syphon composed of 59 places in 1 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 4 with 118 rules applied. Total rules applied 509 place count 262 transition count 240
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 533 place count 238 transition count 216
Iterating global reduction 4 with 24 rules applied. Total rules applied 557 place count 238 transition count 216
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 557 place count 238 transition count 203
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 583 place count 225 transition count 203
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 723 place count 155 transition count 133
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 732 place count 155 transition count 124
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 5 with 18 rules applied. Total rules applied 750 place count 146 transition count 115
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 751 place count 145 transition count 114
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 757 place count 139 transition count 114
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 6 Pre rules applied. Total rules applied 757 place count 139 transition count 108
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 769 place count 133 transition count 108
Applied a total of 769 rules in 60 ms. Remains 133 /510 variables (removed 377) and now considering 108/503 (removed 395) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 61 ms. Remains : 133/510 places, 108/503 transitions.
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 6 ms
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 7 ms
[2024-05-31 20:48:28] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 471 transition count 464
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 471 transition count 464
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 85 place count 471 transition count 457
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 101 place count 455 transition count 441
Iterating global reduction 1 with 16 rules applied. Total rules applied 117 place count 455 transition count 441
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 452 transition count 438
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 452 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 450 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 450 transition count 436
Applied a total of 127 rules in 55 ms. Remains 450 /510 variables (removed 60) and now considering 436/503 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 450/510 places, 436/503 transitions.
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 21 ms
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 20 ms
[2024-05-31 20:48:28] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 472 transition count 465
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 472 transition count 465
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 83 place count 472 transition count 458
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 99 place count 456 transition count 442
Iterating global reduction 1 with 16 rules applied. Total rules applied 115 place count 456 transition count 442
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 118 place count 453 transition count 439
Iterating global reduction 1 with 3 rules applied. Total rules applied 121 place count 453 transition count 439
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 123 place count 451 transition count 437
Iterating global reduction 1 with 2 rules applied. Total rules applied 125 place count 451 transition count 437
Applied a total of 125 rules in 58 ms. Remains 451 /510 variables (removed 59) and now considering 437/503 (removed 66) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 451/510 places, 437/503 transitions.
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 18 ms
[2024-05-31 20:48:28] [INFO ] Flatten gal took : 18 ms
[2024-05-31 20:48:28] [INFO ] Input system was already deterministic with 437 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 176 transitions
Trivial Post-agglo rules discarded 176 transitions
Performed 176 trivial Post agglomeration. Transition count delta: 176
Iterating post reduction 0 with 176 rules applied. Total rules applied 176 place count 509 transition count 326
Reduce places removed 176 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 204 rules applied. Total rules applied 380 place count 333 transition count 298
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 393 place count 321 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 394 place count 320 transition count 297
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 63 Pre rules applied. Total rules applied 394 place count 320 transition count 234
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 520 place count 257 transition count 234
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 545 place count 232 transition count 209
Iterating global reduction 4 with 25 rules applied. Total rules applied 570 place count 232 transition count 209
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 570 place count 232 transition count 195
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 598 place count 218 transition count 195
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: 69
Deduced a syphon composed of 69 places in 0 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 4 with 138 rules applied. Total rules applied 736 place count 149 transition count 126
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 745 place count 149 transition count 117
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 5 with 18 rules applied. Total rules applied 763 place count 140 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 764 place count 139 transition count 107
Reduce places removed 7 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 772 place count 132 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 773 place count 131 transition count 106
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 6 Pre rules applied. Total rules applied 773 place count 131 transition count 100
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 7 with 12 rules applied. Total rules applied 785 place count 125 transition count 100
Applied a total of 785 rules in 55 ms. Remains 125 /510 variables (removed 385) and now considering 100/503 (removed 403) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 125/510 places, 100/503 transitions.
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 5 ms
[2024-05-31 20:48:29] [INFO ] Input system was already deterministic with 100 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 471 transition count 464
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 471 transition count 464
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 471 transition count 458
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 102 place count 453 transition count 440
Iterating global reduction 1 with 18 rules applied. Total rules applied 120 place count 453 transition count 440
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 123 place count 450 transition count 437
Iterating global reduction 1 with 3 rules applied. Total rules applied 126 place count 450 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 128 place count 448 transition count 435
Iterating global reduction 1 with 2 rules applied. Total rules applied 130 place count 448 transition count 435
Applied a total of 130 rules in 55 ms. Remains 448 /510 variables (removed 62) and now considering 435/503 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 448/510 places, 435/503 transitions.
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 18 ms
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 18 ms
[2024-05-31 20:48:29] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 472 transition count 465
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 472 transition count 465
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 83 place count 472 transition count 458
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 98 place count 457 transition count 443
Iterating global reduction 1 with 15 rules applied. Total rules applied 113 place count 457 transition count 443
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 116 place count 454 transition count 440
Iterating global reduction 1 with 3 rules applied. Total rules applied 119 place count 454 transition count 440
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 121 place count 452 transition count 438
Iterating global reduction 1 with 2 rules applied. Total rules applied 123 place count 452 transition count 438
Applied a total of 123 rules in 52 ms. Remains 452 /510 variables (removed 58) and now considering 438/503 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 452/510 places, 438/503 transitions.
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:48:29] [INFO ] Input system was already deterministic with 438 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 41 place count 469 transition count 462
Iterating global reduction 0 with 41 rules applied. Total rules applied 82 place count 469 transition count 462
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 89 place count 469 transition count 455
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 107 place count 451 transition count 437
Iterating global reduction 1 with 18 rules applied. Total rules applied 125 place count 451 transition count 437
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 128 place count 448 transition count 434
Iterating global reduction 1 with 3 rules applied. Total rules applied 131 place count 448 transition count 434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 133 place count 446 transition count 432
Iterating global reduction 1 with 2 rules applied. Total rules applied 135 place count 446 transition count 432
Applied a total of 135 rules in 45 ms. Remains 446 /510 variables (removed 64) and now considering 432/503 (removed 71) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 446/510 places, 432/503 transitions.
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 17 ms
[2024-05-31 20:48:29] [INFO ] Input system was already deterministic with 432 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 475 transition count 468
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 475 transition count 468
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 76 place count 475 transition count 462
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 90 place count 461 transition count 448
Iterating global reduction 1 with 14 rules applied. Total rules applied 104 place count 461 transition count 448
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 459 transition count 446
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 459 transition count 446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 458 transition count 445
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 458 transition count 445
Applied a total of 110 rules in 53 ms. Remains 458 /510 variables (removed 52) and now considering 445/503 (removed 58) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 458/510 places, 445/503 transitions.
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:48:29] [INFO ] Input system was already deterministic with 445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 471 transition count 464
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 471 transition count 464
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 85 place count 471 transition count 457
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 102 place count 454 transition count 440
Iterating global reduction 1 with 17 rules applied. Total rules applied 119 place count 454 transition count 440
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 122 place count 451 transition count 437
Iterating global reduction 1 with 3 rules applied. Total rules applied 125 place count 451 transition count 437
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 127 place count 449 transition count 435
Iterating global reduction 1 with 2 rules applied. Total rules applied 129 place count 449 transition count 435
Applied a total of 129 rules in 50 ms. Remains 449 /510 variables (removed 61) and now considering 435/503 (removed 68) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 449/510 places, 435/503 transitions.
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 21 ms
[2024-05-31 20:48:29] [INFO ] Input system was already deterministic with 435 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 474 transition count 467
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 474 transition count 467
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 77 place count 474 transition count 462
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 93 place count 458 transition count 446
Iterating global reduction 1 with 16 rules applied. Total rules applied 109 place count 458 transition count 446
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 112 place count 455 transition count 443
Iterating global reduction 1 with 3 rules applied. Total rules applied 115 place count 455 transition count 443
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 117 place count 453 transition count 441
Iterating global reduction 1 with 2 rules applied. Total rules applied 119 place count 453 transition count 441
Applied a total of 119 rules in 46 ms. Remains 453 /510 variables (removed 57) and now considering 441/503 (removed 62) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 453/510 places, 441/503 transitions.
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:48:29] [INFO ] Input system was already deterministic with 441 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 476 transition count 469
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 476 transition count 469
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 73 place count 476 transition count 464
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 86 place count 463 transition count 451
Iterating global reduction 1 with 13 rules applied. Total rules applied 99 place count 463 transition count 451
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 100 place count 462 transition count 450
Iterating global reduction 1 with 1 rules applied. Total rules applied 101 place count 462 transition count 450
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 102 place count 461 transition count 449
Iterating global reduction 1 with 1 rules applied. Total rules applied 103 place count 461 transition count 449
Applied a total of 103 rules in 52 ms. Remains 461 /510 variables (removed 49) and now considering 449/503 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 461/510 places, 449/503 transitions.
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 15 ms
[2024-05-31 20:48:29] [INFO ] Flatten gal took : 16 ms
[2024-05-31 20:48:29] [INFO ] Input system was already deterministic with 449 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 471 transition count 464
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 471 transition count 464
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 85 place count 471 transition count 457
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 101 place count 455 transition count 441
Iterating global reduction 1 with 16 rules applied. Total rules applied 117 place count 455 transition count 441
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 120 place count 452 transition count 438
Iterating global reduction 1 with 3 rules applied. Total rules applied 123 place count 452 transition count 438
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 125 place count 450 transition count 436
Iterating global reduction 1 with 2 rules applied. Total rules applied 127 place count 450 transition count 436
Applied a total of 127 rules in 50 ms. Remains 450 /510 variables (removed 60) and now considering 436/503 (removed 67) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50 ms. Remains : 450/510 places, 436/503 transitions.
[2024-05-31 20:48:30] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:48:30] [INFO ] Flatten gal took : 13 ms
[2024-05-31 20:48:30] [INFO ] Input system was already deterministic with 436 transitions.
Starting structural reductions in LTL mode, iteration 0 : 510/510 places, 503/503 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 471 transition count 464
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 471 transition count 464
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 84 place count 471 transition count 458
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 101 place count 454 transition count 441
Iterating global reduction 1 with 17 rules applied. Total rules applied 118 place count 454 transition count 441
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 120 place count 452 transition count 439
Iterating global reduction 1 with 2 rules applied. Total rules applied 122 place count 452 transition count 439
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 123 place count 451 transition count 438
Iterating global reduction 1 with 1 rules applied. Total rules applied 124 place count 451 transition count 438
Applied a total of 124 rules in 46 ms. Remains 451 /510 variables (removed 59) and now considering 438/503 (removed 65) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46 ms. Remains : 451/510 places, 438/503 transitions.
[2024-05-31 20:48:30] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:48:30] [INFO ] Flatten gal took : 12 ms
[2024-05-31 20:48:30] [INFO ] Input system was already deterministic with 438 transitions.
[2024-05-31 20:48:30] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:48:30] [INFO ] Flatten gal took : 14 ms
[2024-05-31 20:48:30] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-05-31 20:48:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 510 places, 503 transitions and 1196 arcs took 5 ms.
Total runtime 50858 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-00
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-01
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-02
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-03
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-04
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-05
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-06
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-07
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-08
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-09
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-10
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2024-11
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2023-12
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2023-13
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2023-14
Could not compute solution for formula : AutoFlight-PT-06b-CTLFireability-2023-15

BK_STOP 1717188510714

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/848/ctl_0_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/848/ctl_1_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/848/ctl_2_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/848/ctl_3_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/848/ctl_4_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/848/ctl_5_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/848/ctl_6_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/848/ctl_7_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/848/ctl_8_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/848/ctl_9_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/848/ctl_10_
ctl formula name AutoFlight-PT-06b-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/848/ctl_11_
ctl formula name AutoFlight-PT-06b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/848/ctl_12_
ctl formula name AutoFlight-PT-06b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/848/ctl_13_
ctl formula name AutoFlight-PT-06b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/848/ctl_14_
ctl formula name AutoFlight-PT-06b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/848/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-06b"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is AutoFlight-PT-06b, 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 r468-smll-171620167100146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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