About the Execution of LTSMin+red for DiscoveryGPU-PT-13b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 531.327 | 53653.00 | 77220.00 | 138.70 | ???????????T???? | normal |
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.r488-tall-171631132800482.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 DiscoveryGPU-PT-13b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132800482
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K 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.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Apr 12 02:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 12 02:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 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 97K 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 DiscoveryGPU-PT-13b-CTLFireability-2024-00
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-01
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-02
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-03
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-04
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-05
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-06
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-07
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-08
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-09
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-10
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2024-11
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2023-12
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2023-13
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2023-14
FORMULA_NAME DiscoveryGPU-PT-13b-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717193119122
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DiscoveryGPU-PT-13b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:05:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 22:05:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:05:20] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2024-05-31 22:05:20] [INFO ] Transformed 380 places.
[2024-05-31 22:05:20] [INFO ] Transformed 404 transitions.
[2024-05-31 22:05:20] [INFO ] Found NUPN structural information;
[2024-05-31 22:05:20] [INFO ] Parsed PT model containing 380 places and 404 transitions and 1056 arcs in 181 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 19 ms.
Support contains 126 out of 380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 380/380 places, 404/404 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 354 transition count 404
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 61 place count 319 transition count 369
Iterating global reduction 1 with 35 rules applied. Total rules applied 96 place count 319 transition count 369
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 314 transition count 364
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 314 transition count 364
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 311 transition count 361
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 311 transition count 361
Applied a total of 112 rules in 74 ms. Remains 311 /380 variables (removed 69) and now considering 361/404 (removed 43) transitions.
// Phase 1: matrix 361 rows 311 cols
[2024-05-31 22:05:20] [INFO ] Computed 2 invariants in 28 ms
[2024-05-31 22:05:20] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-05-31 22:05:20] [INFO ] Invariant cache hit.
[2024-05-31 22:05:21] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Running 360 sub problems to find dead transitions.
[2024-05-31 22:05:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (OVERLAPS) 361/672 variables, 311/313 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 8 places in 143 ms of which 23 ms to minimize.
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 3 ms to minimize.
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 2 ms to minimize.
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 18 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 2 ms to minimize.
[2024-05-31 22:05:30] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-05-31 22:05:31] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/672 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 360 unsolved
[2024-05-31 22:05:32] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 2 ms to minimize.
[2024-05-31 22:05:32] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:05:32] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2024-05-31 22:05:32] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2024-05-31 22:05:32] [INFO ] Deduced a trap composed of 23 places in 51 ms of which 2 ms to minimize.
[2024-05-31 22:05:32] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:05:32] [INFO ] Deduced a trap composed of 22 places in 50 ms of which 1 ms to minimize.
[2024-05-31 22:05:32] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 8/341 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/672 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 341 constraints, problems are : Problem set: 0 solved, 360 unsolved in 24036 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 28/28 constraints]
Escalating to Integer solving :Problem set: 0 solved, 360 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/310 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 1 (OVERLAPS) 1/311 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/311 variables, 28/30 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/311 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 4 (OVERLAPS) 361/672 variables, 311/341 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/672 variables, 360/701 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 360 unsolved
At refinement iteration 7 (OVERLAPS) 0/672 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 360 unsolved
No progress, stopping.
After SMT solving in domain Int declared 672/672 variables, and 701 constraints, problems are : Problem set: 0 solved, 360 unsolved in 24049 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 360/360 constraints, Known Traps: 28/28 constraints]
After SMT, in 48324ms problems are : Problem set: 0 solved, 360 unsolved
Search for dead transitions found 0 dead transitions in 48349ms
Starting structural reductions in LTL mode, iteration 1 : 311/380 places, 361/404 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49025 ms. Remains : 311/380 places, 361/404 transitions.
Support contains 126 out of 311 places after structural reductions.
[2024-05-31 22:06:09] [INFO ] Flatten gal took : 59 ms
[2024-05-31 22:06:09] [INFO ] Flatten gal took : 22 ms
[2024-05-31 22:06:09] [INFO ] Input system was already deterministic with 361 transitions.
Support contains 125 out of 311 places (down from 126) after GAL structural reductions.
RANDOM walk for 40000 steps (94 resets) in 1397 ms. (28 steps per ms) remains 5/111 properties
BEST_FIRST walk for 40002 steps (15 resets) in 184 ms. (216 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (11 resets) in 93 ms. (425 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (12 resets) in 103 ms. (384 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 61 ms. (645 steps per ms) remains 1/1 properties
[2024-05-31 22:06:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/142 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 436/578 variables, 213/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 87/665 variables, 76/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/665 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/672 variables, 7/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/672 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/672 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 313 constraints, problems are : Problem set: 0 solved, 1 unsolved in 197 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 311/311 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 6/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 5/15 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 127/142 variables, 15/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 436/578 variables, 213/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/578 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/578 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 87/665 variables, 76/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/665 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 7/672 variables, 7/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/672 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/672 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 672/672 variables, and 314 constraints, problems are : Problem set: 0 solved, 1 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 311/311 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 43 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 1 properties in 6 ms.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 17 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 18 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 361 transitions.
Computed a total of 48 stabilizing places and 48 stable transitions
Graph (complete) has 593 edges and 311 vertex of which 300 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.6 ms
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 274 transition count 324
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 274 transition count 324
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 87 place count 261 transition count 310
Iterating global reduction 0 with 13 rules applied. Total rules applied 100 place count 261 transition count 310
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 112 place count 249 transition count 295
Iterating global reduction 0 with 12 rules applied. Total rules applied 124 place count 249 transition count 295
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 136 place count 237 transition count 282
Iterating global reduction 0 with 12 rules applied. Total rules applied 148 place count 237 transition count 282
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 158 place count 227 transition count 266
Iterating global reduction 0 with 10 rules applied. Total rules applied 168 place count 227 transition count 266
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 175 place count 220 transition count 259
Iterating global reduction 0 with 7 rules applied. Total rules applied 182 place count 220 transition count 259
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 188 place count 214 transition count 253
Iterating global reduction 0 with 6 rules applied. Total rules applied 194 place count 214 transition count 253
Applied a total of 194 rules in 38 ms. Remains 214 /311 variables (removed 97) and now considering 253/361 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 214/311 places, 253/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 275 transition count 325
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 275 transition count 325
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 85 place count 262 transition count 311
Iterating global reduction 0 with 13 rules applied. Total rules applied 98 place count 262 transition count 311
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 110 place count 250 transition count 296
Iterating global reduction 0 with 12 rules applied. Total rules applied 122 place count 250 transition count 296
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 134 place count 238 transition count 283
Iterating global reduction 0 with 12 rules applied. Total rules applied 146 place count 238 transition count 283
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 157 place count 227 transition count 265
Iterating global reduction 0 with 11 rules applied. Total rules applied 168 place count 227 transition count 265
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 176 place count 219 transition count 257
Iterating global reduction 0 with 8 rules applied. Total rules applied 184 place count 219 transition count 257
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 191 place count 212 transition count 250
Iterating global reduction 0 with 7 rules applied. Total rules applied 198 place count 212 transition count 250
Applied a total of 198 rules in 37 ms. Remains 212 /311 variables (removed 99) and now considering 250/361 (removed 111) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 212/311 places, 250/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 274 transition count 324
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 274 transition count 324
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 87 place count 261 transition count 310
Iterating global reduction 0 with 13 rules applied. Total rules applied 100 place count 261 transition count 310
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 112 place count 249 transition count 295
Iterating global reduction 0 with 12 rules applied. Total rules applied 124 place count 249 transition count 295
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 135 place count 238 transition count 283
Iterating global reduction 0 with 11 rules applied. Total rules applied 146 place count 238 transition count 283
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 156 place count 228 transition count 267
Iterating global reduction 0 with 10 rules applied. Total rules applied 166 place count 228 transition count 267
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 173 place count 221 transition count 260
Iterating global reduction 0 with 7 rules applied. Total rules applied 180 place count 221 transition count 260
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 186 place count 215 transition count 254
Iterating global reduction 0 with 6 rules applied. Total rules applied 192 place count 215 transition count 254
Applied a total of 192 rules in 42 ms. Remains 215 /311 variables (removed 96) and now considering 254/361 (removed 107) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 215/311 places, 254/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 254 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 277 transition count 327
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 277 transition count 327
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 81 place count 264 transition count 313
Iterating global reduction 0 with 13 rules applied. Total rules applied 94 place count 264 transition count 313
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 106 place count 252 transition count 298
Iterating global reduction 0 with 12 rules applied. Total rules applied 118 place count 252 transition count 298
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 129 place count 241 transition count 287
Iterating global reduction 0 with 11 rules applied. Total rules applied 140 place count 241 transition count 287
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 150 place count 231 transition count 270
Iterating global reduction 0 with 10 rules applied. Total rules applied 160 place count 231 transition count 270
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 166 place count 225 transition count 264
Iterating global reduction 0 with 6 rules applied. Total rules applied 172 place count 225 transition count 264
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 178 place count 219 transition count 258
Iterating global reduction 0 with 6 rules applied. Total rules applied 184 place count 219 transition count 258
Applied a total of 184 rules in 37 ms. Remains 219 /311 variables (removed 92) and now considering 258/361 (removed 103) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 219/311 places, 258/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 258 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 281 transition count 331
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 281 transition count 331
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 68 place count 273 transition count 322
Iterating global reduction 0 with 8 rules applied. Total rules applied 76 place count 273 transition count 322
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 83 place count 266 transition count 314
Iterating global reduction 0 with 7 rules applied. Total rules applied 90 place count 266 transition count 314
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 97 place count 259 transition count 306
Iterating global reduction 0 with 7 rules applied. Total rules applied 104 place count 259 transition count 306
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 110 place count 253 transition count 296
Iterating global reduction 0 with 6 rules applied. Total rules applied 116 place count 253 transition count 296
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 121 place count 248 transition count 291
Iterating global reduction 0 with 5 rules applied. Total rules applied 126 place count 248 transition count 291
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 129 place count 245 transition count 288
Iterating global reduction 0 with 3 rules applied. Total rules applied 132 place count 245 transition count 288
Applied a total of 132 rules in 37 ms. Remains 245 /311 variables (removed 66) and now considering 288/361 (removed 73) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 245/311 places, 288/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 288 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 275 transition count 325
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 275 transition count 325
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 84 place count 263 transition count 312
Iterating global reduction 0 with 12 rules applied. Total rules applied 96 place count 263 transition count 312
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 107 place count 252 transition count 299
Iterating global reduction 0 with 11 rules applied. Total rules applied 118 place count 252 transition count 299
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 129 place count 241 transition count 287
Iterating global reduction 0 with 11 rules applied. Total rules applied 140 place count 241 transition count 287
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 149 place count 232 transition count 272
Iterating global reduction 0 with 9 rules applied. Total rules applied 158 place count 232 transition count 272
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 165 place count 225 transition count 265
Iterating global reduction 0 with 7 rules applied. Total rules applied 172 place count 225 transition count 265
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 177 place count 220 transition count 260
Iterating global reduction 0 with 5 rules applied. Total rules applied 182 place count 220 transition count 260
Applied a total of 182 rules in 36 ms. Remains 220 /311 variables (removed 91) and now considering 260/361 (removed 101) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 220/311 places, 260/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 260 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Graph (complete) has 593 edges and 311 vertex of which 301 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 300 transition count 297
Reduce places removed 53 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 58 rules applied. Total rules applied 112 place count 247 transition count 292
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 117 place count 242 transition count 292
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 28 Pre rules applied. Total rules applied 117 place count 242 transition count 264
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 173 place count 214 transition count 264
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 186 place count 201 transition count 251
Iterating global reduction 3 with 13 rules applied. Total rules applied 199 place count 201 transition count 251
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 207 place count 193 transition count 243
Iterating global reduction 3 with 8 rules applied. Total rules applied 215 place count 193 transition count 243
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 223 place count 185 transition count 232
Iterating global reduction 3 with 8 rules applied. Total rules applied 231 place count 185 transition count 232
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 238 place count 178 transition count 220
Iterating global reduction 3 with 7 rules applied. Total rules applied 245 place count 178 transition count 220
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 250 place count 173 transition count 215
Iterating global reduction 3 with 5 rules applied. Total rules applied 255 place count 173 transition count 215
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 313 place count 144 transition count 186
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 315 place count 142 transition count 183
Iterating global reduction 3 with 2 rules applied. Total rules applied 317 place count 142 transition count 183
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 319 place count 140 transition count 180
Iterating global reduction 3 with 2 rules applied. Total rules applied 321 place count 140 transition count 180
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 322 place count 139 transition count 179
Iterating global reduction 3 with 1 rules applied. Total rules applied 323 place count 139 transition count 179
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 139 transition count 179
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 327 place count 137 transition count 177
Applied a total of 327 rules in 76 ms. Remains 137 /311 variables (removed 174) and now considering 177/361 (removed 184) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 77 ms. Remains : 137/311 places, 177/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 6 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 277 transition count 327
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 277 transition count 327
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 77 place count 268 transition count 317
Iterating global reduction 0 with 9 rules applied. Total rules applied 86 place count 268 transition count 317
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 95 place count 259 transition count 305
Iterating global reduction 0 with 9 rules applied. Total rules applied 104 place count 259 transition count 305
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 113 place count 250 transition count 296
Iterating global reduction 0 with 9 rules applied. Total rules applied 122 place count 250 transition count 296
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 128 place count 244 transition count 287
Iterating global reduction 0 with 6 rules applied. Total rules applied 134 place count 244 transition count 287
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 137 place count 241 transition count 284
Iterating global reduction 0 with 3 rules applied. Total rules applied 140 place count 241 transition count 284
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 143 place count 238 transition count 281
Iterating global reduction 0 with 3 rules applied. Total rules applied 146 place count 238 transition count 281
Applied a total of 146 rules in 39 ms. Remains 238 /311 variables (removed 73) and now considering 281/361 (removed 80) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 238/311 places, 281/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 10 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 281 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 280 transition count 330
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 280 transition count 330
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 74 place count 268 transition count 317
Iterating global reduction 0 with 12 rules applied. Total rules applied 86 place count 268 transition count 317
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 97 place count 257 transition count 304
Iterating global reduction 0 with 11 rules applied. Total rules applied 108 place count 257 transition count 304
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 118 place count 247 transition count 293
Iterating global reduction 0 with 10 rules applied. Total rules applied 128 place count 247 transition count 293
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 135 place count 240 transition count 282
Iterating global reduction 0 with 7 rules applied. Total rules applied 142 place count 240 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 147 place count 235 transition count 277
Iterating global reduction 0 with 5 rules applied. Total rules applied 152 place count 235 transition count 277
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 156 place count 231 transition count 273
Iterating global reduction 0 with 4 rules applied. Total rules applied 160 place count 231 transition count 273
Applied a total of 160 rules in 34 ms. Remains 231 /311 variables (removed 80) and now considering 273/361 (removed 88) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 231/311 places, 273/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 273 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Graph (complete) has 593 edges and 311 vertex of which 300 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.8 ms
Discarding 11 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 299 transition count 290
Reduce places removed 59 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 60 rules applied. Total rules applied 120 place count 240 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 239 transition count 289
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 121 place count 239 transition count 259
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 181 place count 209 transition count 259
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 194 place count 196 transition count 246
Iterating global reduction 3 with 13 rules applied. Total rules applied 207 place count 196 transition count 246
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 217 place count 186 transition count 236
Iterating global reduction 3 with 10 rules applied. Total rules applied 227 place count 186 transition count 236
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 236 place count 177 transition count 223
Iterating global reduction 3 with 9 rules applied. Total rules applied 245 place count 177 transition count 223
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 254 place count 168 transition count 209
Iterating global reduction 3 with 9 rules applied. Total rules applied 263 place count 168 transition count 209
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 268 place count 163 transition count 204
Iterating global reduction 3 with 5 rules applied. Total rules applied 273 place count 163 transition count 204
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 331 place count 134 transition count 175
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 333 place count 132 transition count 172
Iterating global reduction 3 with 2 rules applied. Total rules applied 335 place count 132 transition count 172
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 337 place count 130 transition count 169
Iterating global reduction 3 with 2 rules applied. Total rules applied 339 place count 130 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 340 place count 129 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 341 place count 129 transition count 168
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 342 place count 129 transition count 168
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 344 place count 127 transition count 166
Reduce places removed 1 places and 0 transitions.
Graph (complete) has 186 edges and 126 vertex of which 125 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Graph (trivial) has 129 edges and 125 vertex of which 52 / 125 are part of one of the 26 SCC in 2 ms
Free SCC test removed 26 places
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 3 with 15 rules applied. Total rules applied 359 place count 99 transition count 153
Reduce places removed 12 places and 0 transitions.
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 39 rules applied. Total rules applied 398 place count 87 transition count 126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 399 place count 86 transition count 126
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 12 Pre rules applied. Total rules applied 399 place count 86 transition count 114
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 6 with 24 rules applied. Total rules applied 423 place count 74 transition count 114
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 434 place count 63 transition count 92
Iterating global reduction 6 with 11 rules applied. Total rules applied 445 place count 63 transition count 92
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 455 place count 53 transition count 72
Iterating global reduction 6 with 10 rules applied. Total rules applied 465 place count 53 transition count 72
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 475 place count 43 transition count 62
Iterating global reduction 6 with 10 rules applied. Total rules applied 485 place count 43 transition count 62
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 495 place count 33 transition count 42
Iterating global reduction 6 with 10 rules applied. Total rules applied 505 place count 33 transition count 42
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 515 place count 23 transition count 32
Iterating global reduction 6 with 10 rules applied. Total rules applied 525 place count 23 transition count 32
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 528 place count 20 transition count 29
Applied a total of 528 rules in 81 ms. Remains 20 /311 variables (removed 291) and now considering 29/361 (removed 332) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 81 ms. Remains : 20/311 places, 29/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 1 ms
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 1 ms
[2024-05-31 22:06:11] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 280 transition count 330
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 280 transition count 330
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 73 place count 269 transition count 319
Iterating global reduction 0 with 11 rules applied. Total rules applied 84 place count 269 transition count 319
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 92 place count 261 transition count 310
Iterating global reduction 0 with 8 rules applied. Total rules applied 100 place count 261 transition count 310
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 107 place count 254 transition count 303
Iterating global reduction 0 with 7 rules applied. Total rules applied 114 place count 254 transition count 303
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 120 place count 248 transition count 292
Iterating global reduction 0 with 6 rules applied. Total rules applied 126 place count 248 transition count 292
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 131 place count 243 transition count 287
Iterating global reduction 0 with 5 rules applied. Total rules applied 136 place count 243 transition count 287
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 141 place count 238 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 146 place count 238 transition count 282
Applied a total of 146 rules in 35 ms. Remains 238 /311 variables (removed 73) and now considering 282/361 (removed 79) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 238/311 places, 282/361 transitions.
[2024-05-31 22:06:11] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 9 ms
[2024-05-31 22:06:12] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Graph (complete) has 593 edges and 311 vertex of which 301 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 300 transition count 292
Reduce places removed 58 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 120 place count 242 transition count 289
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 123 place count 239 transition count 289
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 123 place count 239 transition count 260
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 181 place count 210 transition count 260
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 194 place count 197 transition count 247
Iterating global reduction 3 with 13 rules applied. Total rules applied 207 place count 197 transition count 247
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 207 place count 197 transition count 246
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 209 place count 196 transition count 246
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 218 place count 187 transition count 237
Iterating global reduction 3 with 9 rules applied. Total rules applied 227 place count 187 transition count 237
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 236 place count 178 transition count 224
Iterating global reduction 3 with 9 rules applied. Total rules applied 245 place count 178 transition count 224
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 253 place count 170 transition count 212
Iterating global reduction 3 with 8 rules applied. Total rules applied 261 place count 170 transition count 212
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 265 place count 166 transition count 208
Iterating global reduction 3 with 4 rules applied. Total rules applied 269 place count 166 transition count 208
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 325 place count 138 transition count 180
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 327 place count 136 transition count 177
Iterating global reduction 3 with 2 rules applied. Total rules applied 329 place count 136 transition count 177
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 331 place count 134 transition count 174
Iterating global reduction 3 with 2 rules applied. Total rules applied 333 place count 134 transition count 174
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 334 place count 133 transition count 173
Iterating global reduction 3 with 1 rules applied. Total rules applied 335 place count 133 transition count 173
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 337 place count 131 transition count 171
Reduce places removed 2 places and 0 transitions.
Graph (complete) has 156 edges and 129 vertex of which 125 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Graph (trivial) has 131 edges and 125 vertex of which 50 / 125 are part of one of the 25 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 3 with 43 rules applied. Total rules applied 380 place count 100 transition count 127
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 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 4 with 67 rules applied. Total rules applied 447 place count 61 transition count 99
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 449 place count 60 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 450 place count 59 transition count 98
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 459 place count 50 transition count 80
Iterating global reduction 7 with 9 rules applied. Total rules applied 468 place count 50 transition count 80
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 477 place count 41 transition count 62
Iterating global reduction 7 with 9 rules applied. Total rules applied 486 place count 41 transition count 62
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 495 place count 32 transition count 44
Iterating global reduction 7 with 9 rules applied. Total rules applied 504 place count 32 transition count 44
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 512 place count 24 transition count 36
Iterating global reduction 7 with 8 rules applied. Total rules applied 520 place count 24 transition count 36
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 521 place count 24 transition count 35
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 7 with 1 rules applied. Total rules applied 522 place count 24 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 523 place count 23 transition count 34
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 527 place count 19 transition count 30
Applied a total of 527 rules in 71 ms. Remains 19 /311 variables (removed 292) and now considering 30/361 (removed 331) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 72 ms. Remains : 19/311 places, 30/361 transitions.
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 1 ms
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 1 ms
[2024-05-31 22:06:12] [INFO ] Input system was already deterministic with 30 transitions.
RANDOM walk for 106 steps (0 resets) in 5 ms. (17 steps per ms) remains 0/1 properties
FORMULA DiscoveryGPU-PT-13b-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 276 transition count 326
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 276 transition count 326
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 83 place count 263 transition count 312
Iterating global reduction 0 with 13 rules applied. Total rules applied 96 place count 263 transition count 312
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 108 place count 251 transition count 297
Iterating global reduction 0 with 12 rules applied. Total rules applied 120 place count 251 transition count 297
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 132 place count 239 transition count 284
Iterating global reduction 0 with 12 rules applied. Total rules applied 144 place count 239 transition count 284
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 154 place count 229 transition count 267
Iterating global reduction 0 with 10 rules applied. Total rules applied 164 place count 229 transition count 267
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 171 place count 222 transition count 260
Iterating global reduction 0 with 7 rules applied. Total rules applied 178 place count 222 transition count 260
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 185 place count 215 transition count 253
Iterating global reduction 0 with 7 rules applied. Total rules applied 192 place count 215 transition count 253
Applied a total of 192 rules in 37 ms. Remains 215 /311 variables (removed 96) and now considering 253/361 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 215/311 places, 253/361 transitions.
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:06:12] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 274 transition count 324
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 274 transition count 324
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 87 place count 261 transition count 310
Iterating global reduction 0 with 13 rules applied. Total rules applied 100 place count 261 transition count 310
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 112 place count 249 transition count 295
Iterating global reduction 0 with 12 rules applied. Total rules applied 124 place count 249 transition count 295
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 136 place count 237 transition count 282
Iterating global reduction 0 with 12 rules applied. Total rules applied 148 place count 237 transition count 282
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 158 place count 227 transition count 266
Iterating global reduction 0 with 10 rules applied. Total rules applied 168 place count 227 transition count 266
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 175 place count 220 transition count 259
Iterating global reduction 0 with 7 rules applied. Total rules applied 182 place count 220 transition count 259
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 188 place count 214 transition count 253
Iterating global reduction 0 with 6 rules applied. Total rules applied 194 place count 214 transition count 253
Applied a total of 194 rules in 41 ms. Remains 214 /311 variables (removed 97) and now considering 253/361 (removed 108) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 214/311 places, 253/361 transitions.
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:06:12] [INFO ] Input system was already deterministic with 253 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 276 transition count 326
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 276 transition count 326
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 81 place count 265 transition count 315
Iterating global reduction 0 with 11 rules applied. Total rules applied 92 place count 265 transition count 315
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 100 place count 257 transition count 306
Iterating global reduction 0 with 8 rules applied. Total rules applied 108 place count 257 transition count 306
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 116 place count 249 transition count 297
Iterating global reduction 0 with 8 rules applied. Total rules applied 124 place count 249 transition count 297
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 131 place count 242 transition count 285
Iterating global reduction 0 with 7 rules applied. Total rules applied 138 place count 242 transition count 285
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 144 place count 236 transition count 279
Iterating global reduction 0 with 6 rules applied. Total rules applied 150 place count 236 transition count 279
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 155 place count 231 transition count 274
Iterating global reduction 0 with 5 rules applied. Total rules applied 160 place count 231 transition count 274
Applied a total of 160 rules in 37 ms. Remains 231 /311 variables (removed 80) and now considering 274/361 (removed 87) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 231/311 places, 274/361 transitions.
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 8 ms
[2024-05-31 22:06:12] [INFO ] Input system was already deterministic with 274 transitions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 361/361 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 274 transition count 324
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 274 transition count 324
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 86 place count 262 transition count 311
Iterating global reduction 0 with 12 rules applied. Total rules applied 98 place count 262 transition count 311
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 109 place count 251 transition count 297
Iterating global reduction 0 with 11 rules applied. Total rules applied 120 place count 251 transition count 297
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 131 place count 240 transition count 285
Iterating global reduction 0 with 11 rules applied. Total rules applied 142 place count 240 transition count 285
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 152 place count 230 transition count 269
Iterating global reduction 0 with 10 rules applied. Total rules applied 162 place count 230 transition count 269
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 169 place count 223 transition count 262
Iterating global reduction 0 with 7 rules applied. Total rules applied 176 place count 223 transition count 262
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 182 place count 217 transition count 256
Iterating global reduction 0 with 6 rules applied. Total rules applied 188 place count 217 transition count 256
Applied a total of 188 rules in 35 ms. Remains 217 /311 variables (removed 94) and now considering 256/361 (removed 105) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 217/311 places, 256/361 transitions.
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:06:12] [INFO ] Input system was already deterministic with 256 transitions.
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:06:12] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:06:12] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-05-31 22:06:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 311 places, 361 transitions and 951 arcs took 2 ms.
Total runtime 52166 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-00
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-01
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-02
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-03
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-04
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-05
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-06
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-07
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-08
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-09
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2024-10
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2023-12
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2023-13
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2023-14
Could not compute solution for formula : DiscoveryGPU-PT-13b-CTLFireability-2023-15
BK_STOP 1717193172775
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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 DiscoveryGPU-PT-13b-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/610/ctl_0_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/610/ctl_1_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/610/ctl_2_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/610/ctl_3_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/610/ctl_4_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/610/ctl_5_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/610/ctl_6_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/610/ctl_7_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/610/ctl_8_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/610/ctl_9_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/610/ctl_10_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/610/ctl_11_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/610/ctl_12_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/610/ctl_13_
ctl formula name DiscoveryGPU-PT-13b-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/610/ctl_14_
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="DiscoveryGPU-PT-13b"
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 DiscoveryGPU-PT-13b, 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 r488-tall-171631132800482"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-13b.tgz
mv DiscoveryGPU-PT-13b 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 '
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 ;