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.r579-smll-171734921300145.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 MedleyA-PT-19, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300145
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 184K Jun 2 16:33 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 MedleyA-PT-19-CTLCardinality-2024-00
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-01
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-02
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-03
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-04
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-05
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-06
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-07
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-08
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-09
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-10
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-11
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-12
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-13
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-14
FORMULA_NAME MedleyA-PT-19-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717361869397

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 20:57:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 20:57:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 20:57:51] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2024-06-02 20:57:51] [INFO ] Transformed 272 places.
[2024-06-02 20:57:51] [INFO ] Transformed 586 transitions.
[2024-06-02 20:57:51] [INFO ] Found NUPN structural information;
[2024-06-02 20:57:51] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 326 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 119 ms.
Deduced a syphon composed of 3 places in 14 ms
Reduce places removed 3 places and 3 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-19-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-19-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 112 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 583/583 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 267 transition count 583
Discarding 43 places :
Symmetric choice reduction at 1 with 43 rule applications. Total rules 45 place count 224 transition count 533
Iterating global reduction 1 with 43 rules applied. Total rules applied 88 place count 224 transition count 533
Applied a total of 88 rules in 63 ms. Remains 224 /269 variables (removed 45) and now considering 533/583 (removed 50) transitions.
// Phase 1: matrix 533 rows 224 cols
[2024-06-02 20:57:51] [INFO ] Computed 22 invariants in 47 ms
[2024-06-02 20:57:52] [INFO ] Implicit Places using invariants in 421 ms returned []
[2024-06-02 20:57:52] [INFO ] Invariant cache hit.
[2024-06-02 20:57:52] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 893 ms to find 0 implicit places.
Running 532 sub problems to find dead transitions.
[2024-06-02 20:57:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 532 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 532 unsolved
Problem TDEAD224 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD472 is UNSAT
Problem TDEAD474 is UNSAT
Problem TDEAD476 is UNSAT
Problem TDEAD487 is UNSAT
Problem TDEAD489 is UNSAT
Problem TDEAD491 is UNSAT
Problem TDEAD494 is UNSAT
Problem TDEAD500 is UNSAT
Problem TDEAD502 is UNSAT
Problem TDEAD504 is UNSAT
Problem TDEAD507 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/224 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-02 20:58:01] [INFO ] Deduced a trap composed of 33 places in 207 ms of which 26 ms to minimize.
[2024-06-02 20:58:01] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 2 ms to minimize.
[2024-06-02 20:58:01] [INFO ] Deduced a trap composed of 40 places in 122 ms of which 2 ms to minimize.
[2024-06-02 20:58:01] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 1 ms to minimize.
[2024-06-02 20:58:02] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-06-02 20:58:02] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 1 ms to minimize.
[2024-06-02 20:58:02] [INFO ] Deduced a trap composed of 25 places in 93 ms of which 1 ms to minimize.
[2024-06-02 20:58:03] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 2 ms to minimize.
[2024-06-02 20:58:03] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 2 ms to minimize.
[2024-06-02 20:58:03] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 4 ms to minimize.
[2024-06-02 20:58:03] [INFO ] Deduced a trap composed of 31 places in 118 ms of which 2 ms to minimize.
[2024-06-02 20:58:03] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-06-02 20:58:03] [INFO ] Deduced a trap composed of 21 places in 93 ms of which 15 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 13/35 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-02 20:58:08] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 1 ms to minimize.
[2024-06-02 20:58:08] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 2 ms to minimize.
[2024-06-02 20:58:09] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-02 20:58:09] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2024-06-02 20:58:09] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:58:09] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 6/41 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-02 20:58:11] [INFO ] Deduced a trap composed of 26 places in 90 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/224 variables, 1/42 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-02 20:58:14] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 1/43 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-02 20:58:19] [INFO ] Deduced a trap composed of 36 places in 104 ms of which 3 ms to minimize.
[2024-06-02 20:58:19] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/224 variables, 2/45 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/45 constraints. Problems are: Problem set: 120 solved, 412 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 533/757 variables, 224/269 constraints. Problems are: Problem set: 120 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 757/757 variables, and 269 constraints, problems are : Problem set: 120 solved, 412 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 532/532 constraints, Known Traps: 23/23 constraints]
Escalating to Integer solving :Problem set: 120 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/223 variables, 16/16 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/223 variables, 0/16 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/224 variables, 6/22 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/224 variables, 23/45 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/45 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 533/757 variables, 224/269 constraints. Problems are: Problem set: 120 solved, 412 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/757 variables, 412/681 constraints. Problems are: Problem set: 120 solved, 412 unsolved
[2024-06-02 20:58:37] [INFO ] Deduced a trap composed of 30 places in 187 ms of which 2 ms to minimize.
[2024-06-02 20:58:37] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 3 ms to minimize.
[2024-06-02 20:58:37] [INFO ] Deduced a trap composed of 17 places in 170 ms of which 2 ms to minimize.
[2024-06-02 20:58:37] [INFO ] Deduced a trap composed of 36 places in 178 ms of which 2 ms to minimize.
[2024-06-02 20:58:38] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 3 ms to minimize.
[2024-06-02 20:58:38] [INFO ] Deduced a trap composed of 28 places in 164 ms of which 3 ms to minimize.
[2024-06-02 20:58:38] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2024-06-02 20:58:38] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-06-02 20:58:39] [INFO ] Deduced a trap composed of 27 places in 196 ms of which 2 ms to minimize.
[2024-06-02 20:58:39] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 3 ms to minimize.
[2024-06-02 20:58:39] [INFO ] Deduced a trap composed of 25 places in 202 ms of which 3 ms to minimize.
[2024-06-02 20:58:40] [INFO ] Deduced a trap composed of 24 places in 214 ms of which 4 ms to minimize.
[2024-06-02 20:58:40] [INFO ] Deduced a trap composed of 27 places in 209 ms of which 3 ms to minimize.
[2024-06-02 20:58:40] [INFO ] Deduced a trap composed of 70 places in 154 ms of which 2 ms to minimize.
[2024-06-02 20:58:41] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 1 ms to minimize.
[2024-06-02 20:58:42] [INFO ] Deduced a trap composed of 34 places in 197 ms of which 3 ms to minimize.
[2024-06-02 20:58:43] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2024-06-02 20:58:43] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-06-02 20:58:43] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-06-02 20:58:44] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/757 variables, 20/701 constraints. Problems are: Problem set: 120 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 757/757 variables, and 701 constraints, problems are : Problem set: 120 solved, 412 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 412/532 constraints, Known Traps: 43/43 constraints]
After SMT, in 61920ms problems are : Problem set: 120 solved, 412 unsolved
Search for dead transitions found 120 dead transitions in 61959ms
Found 120 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 120 transitions
Dead transitions reduction (with SMT) removed 120 transitions
Starting structural reductions in LTL mode, iteration 1 : 224/269 places, 413/583 transitions.
Applied a total of 0 rules in 7 ms. Remains 224 /224 variables (removed 0) and now considering 413/413 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62964 ms. Remains : 224/269 places, 413/583 transitions.
Support contains 112 out of 224 places after structural reductions.
[2024-06-02 20:58:55] [INFO ] Flatten gal took : 88 ms
[2024-06-02 20:58:55] [INFO ] Flatten gal took : 44 ms
[2024-06-02 20:58:55] [INFO ] Input system was already deterministic with 413 transitions.
Support contains 99 out of 224 places (down from 112) after GAL structural reductions.
RANDOM walk for 40000 steps (17 resets) in 2317 ms. (17 steps per ms) remains 42/65 properties
BEST_FIRST walk for 4003 steps (12 resets) in 57 ms. (69 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4002 steps (13 resets) in 62 ms. (63 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (13 resets) in 49 ms. (80 steps per ms) remains 40/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 90 ms. (43 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (13 resets) in 43 ms. (90 steps per ms) remains 40/40 properties
BEST_FIRST walk for 4003 steps (11 resets) in 84 ms. (47 steps per ms) remains 39/40 properties
BEST_FIRST walk for 4002 steps (9 resets) in 46 ms. (85 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (11 resets) in 59 ms. (66 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (13 resets) in 51 ms. (77 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 46 ms. (85 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (12 resets) in 30 ms. (129 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (11 resets) in 39 ms. (100 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (11 resets) in 15 ms. (250 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (14 resets) in 11 ms. (333 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (12 resets) in 29 ms. (133 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (12 resets) in 12 ms. (307 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4001 steps (12 resets) in 15 ms. (250 steps per ms) remains 36/39 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (12 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (12 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 50 ms. (78 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (13 resets) in 24 ms. (160 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (13 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (13 resets) in 42 ms. (93 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (11 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (10 resets) in 13 ms. (285 steps per ms) remains 33/36 properties
BEST_FIRST walk for 4002 steps (10 resets) in 42 ms. (93 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (10 resets) in 33 ms. (117 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (11 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4001 steps (12 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (13 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
// Phase 1: matrix 413 rows 224 cols
[2024-06-02 20:58:56] [INFO ] Computed 22 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 72/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 81/206 variables, 15/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/206 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 2/208 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 400/608 variables, 208/230 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/608 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 24/632 variables, 12/242 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/632 variables, 0/242 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 5/637 variables, 4/246 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/637 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 0/637 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 637/637 variables, and 246 constraints, problems are : Problem set: 0 solved, 33 unsolved in 2181 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 224/224 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 72/125 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 81/206 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 2 ms to minimize.
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 26 places in 114 ms of which 2 ms to minimize.
[2024-06-02 20:58:59] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 2 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 3 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 35 places in 65 ms of which 2 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 1 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 35 places in 67 ms of which 2 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 13 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-06-02 20:59:00] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/206 variables, 17/39 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 37 places in 109 ms of which 2 ms to minimize.
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 2 ms to minimize.
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 3 ms to minimize.
[2024-06-02 20:59:01] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 4/43 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (OVERLAPS) 2/208 variables, 1/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 20:59:02] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 2 ms to minimize.
[2024-06-02 20:59:02] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2024-06-02 20:59:02] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/208 variables, 3/47 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 20:59:02] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/208 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-02 20:59:03] [INFO ] Deduced a trap composed of 38 places in 66 ms of which 1 ms to minimize.
[2024-06-02 20:59:03] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2024-06-02 20:59:03] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/208 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/208 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 13 (OVERLAPS) 400/608 variables, 208/259 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/608 variables, 26/285 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/637 variables, and 285 constraints, problems are : Problem set: 0 solved, 33 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 208/224 constraints, PredecessorRefiner: 26/33 constraints, Known Traps: 29/29 constraints]
After SMT, in 7222ms problems are : Problem set: 0 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 224 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 221 transition count 395
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 22 rules applied. Total rules applied 38 place count 207 transition count 387
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 44 place count 201 transition count 387
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 44 place count 201 transition count 384
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 50 place count 198 transition count 384
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 68 place count 180 transition count 364
Iterating global reduction 3 with 18 rules applied. Total rules applied 86 place count 180 transition count 364
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 86 place count 180 transition count 363
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 88 place count 179 transition count 363
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 59 rules applied. Total rules applied 147 place count 149 transition count 334
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 149 place count 149 transition count 332
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 159 place count 144 transition count 341
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 168 place count 144 transition count 332
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 1 rules applied. Total rules applied 169 place count 144 transition count 331
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 170 place count 143 transition count 331
Free-agglomeration rule applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 174 place count 143 transition count 327
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 178 place count 139 transition count 327
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 7 with 4 rules applied. Total rules applied 182 place count 139 transition count 323
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 186 place count 135 transition count 323
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 198 place count 135 transition count 323
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 199 place count 135 transition count 323
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 200 place count 134 transition count 322
Applied a total of 200 rules in 180 ms. Remains 134 /224 variables (removed 90) and now considering 322/413 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 134/224 places, 322/413 transitions.
RANDOM walk for 40000 steps (2350 resets) in 451 ms. (88 steps per ms) remains 11/33 properties
BEST_FIRST walk for 40002 steps (512 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (508 resets) in 111 ms. (357 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (556 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (521 resets) in 81 ms. (487 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40002 steps (512 resets) in 110 ms. (360 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (500 resets) in 77 ms. (512 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (484 resets) in 107 ms. (370 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (522 resets) in 109 ms. (363 steps per ms) remains 7/8 properties
// Phase 1: matrix 322 rows 134 cols
[2024-06-02 20:59:04] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 20:59:04] [INFO ] State equation strengthened by 119 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 71/90 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 43/133 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 322/455 variables, 133/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 119/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 1/456 variables, 1/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/456 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/456 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 456/456 variables, and 275 constraints, problems are : Problem set: 0 solved, 7 unsolved in 408 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 134/134 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 71/90 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/90 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 43/133 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 322/455 variables, 133/155 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 119/274 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:59:05] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-06-02 20:59:05] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 20:59:05] [INFO ] Deduced a trap composed of 18 places in 61 ms of which 1 ms to minimize.
[2024-06-02 20:59:05] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 2/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/455 variables, 0/283 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/456 variables, 1/284 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 2/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/456 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 456/456 variables, and 286 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1325 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 134/134 constraints, ReadFeed: 119/119 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 1751ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 4 properties in 1482 ms.
Support contains 8 out of 134 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 134/134 places, 322/322 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 134 transition count 307
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 119 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 118 transition count 306
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 40 place count 110 transition count 290
Iterating global reduction 3 with 8 rules applied. Total rules applied 48 place count 110 transition count 290
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 31 rules applied. Total rules applied 79 place count 94 transition count 275
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
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 81 place count 93 transition count 277
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 93 transition count 270
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 96 place count 86 transition count 269
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 97 place count 86 transition count 268
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 4 with 9 rules applied. Total rules applied 106 place count 86 transition count 450
Reduce places removed 9 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 4 with 33 rules applied. Total rules applied 139 place count 77 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 77 transitions
Redundant transition composition rules discarded 77 transitions
Iterating global reduction 5 with 77 rules applied. Total rules applied 216 place count 77 transition count 349
Applied a total of 216 rules in 99 ms. Remains 77 /134 variables (removed 57) and now considering 349/322 (removed -27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 77/134 places, 349/322 transitions.
RANDOM walk for 40000 steps (3720 resets) in 655 ms. (60 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (761 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (660 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
[2024-06-02 20:59:08] [INFO ] Flow matrix only has 341 transitions (discarded 8 similar events)
// Phase 1: matrix 341 rows 77 cols
[2024-06-02 20:59:08] [INFO ] Computed 21 invariants in 3 ms
[2024-06-02 20:59:08] [INFO ] State equation strengthened by 156 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/48 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/64 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 327/391 variables, 64/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 144/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 27/418 variables, 13/237 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/418 variables, 3/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 2/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 12/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/418 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 418/418 variables, and 254 constraints, problems are : Problem set: 0 solved, 2 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 18/25 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 23/48 variables, 6/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 16/64 variables, 6/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 327/391 variables, 64/80 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 144/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/391 variables, 2/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/391 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 27/418 variables, 13/239 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/418 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/418 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/418 variables, 12/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/418 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/418 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 418/418 variables, and 256 constraints, problems are : Problem set: 0 solved, 2 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 77/77 constraints, ReadFeed: 156/156 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 639ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 833 steps, including 60 resets, run visited all 2 properties in 4 ms. (steps per millisecond=208 )
Parikh walk visited 2 properties in 10 ms.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-19-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 20:59:08] [INFO ] Flatten gal took : 31 ms
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 34 ms
[2024-06-02 20:59:09] [INFO ] Input system was already deterministic with 413 transitions.
Computed a total of 25 stabilizing places and 28 stable transitions
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.7 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 220 transition count 373
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 184 transition count 369
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 182 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 81 place count 181 transition count 368
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 81 place count 181 transition count 362
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 93 place count 175 transition count 362
Discarding 31 places :
Symmetric choice reduction at 4 with 31 rule applications. Total rules 124 place count 144 transition count 322
Iterating global reduction 4 with 31 rules applied. Total rules applied 155 place count 144 transition count 322
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 155 place count 144 transition count 320
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 142 transition count 320
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 59 rules applied. Total rules applied 218 place count 111 transition count 292
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 220 place count 109 transition count 288
Iterating global reduction 4 with 2 rules applied. Total rules applied 222 place count 109 transition count 288
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 109 transition count 284
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 1 rules applied. Total rules applied 227 place count 109 transition count 283
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 228 place count 108 transition count 283
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 234 place count 105 transition count 280
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 235 place count 105 transition count 280
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 236 place count 104 transition count 279
Iterating global reduction 6 with 1 rules applied. Total rules applied 237 place count 104 transition count 279
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 239 place count 102 transition count 277
Applied a total of 239 rules in 98 ms. Remains 102 /224 variables (removed 122) and now considering 277/413 (removed 136) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 99 ms. Remains : 102/224 places, 277/413 transitions.
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:59:09] [INFO ] Input system was already deterministic with 277 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 190 transition count 375
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 190 transition count 375
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 71 place count 187 transition count 369
Iterating global reduction 0 with 3 rules applied. Total rules applied 74 place count 187 transition count 369
Applied a total of 74 rules in 9 ms. Remains 187 /224 variables (removed 37) and now considering 369/413 (removed 44) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 187/224 places, 369/413 transitions.
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 22 ms
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 23 ms
[2024-06-02 20:59:09] [INFO ] Input system was already deterministic with 369 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 189 transition count 373
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 189 transition count 373
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 186 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 186 transition count 367
Applied a total of 76 rules in 10 ms. Remains 186 /224 variables (removed 38) and now considering 367/413 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 186/224 places, 367/413 transitions.
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 20 ms
[2024-06-02 20:59:09] [INFO ] Input system was already deterministic with 367 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 193 transition count 377
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 193 transition count 377
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 191 transition count 373
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 191 transition count 373
Applied a total of 66 rules in 10 ms. Remains 191 /224 variables (removed 33) and now considering 373/413 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 191/224 places, 373/413 transitions.
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:59:09] [INFO ] Input system was already deterministic with 373 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 220 transition count 372
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 43 rules applied. Total rules applied 81 place count 183 transition count 366
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 85 place count 180 transition count 365
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 179 transition count 365
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 86 place count 179 transition count 358
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 100 place count 172 transition count 358
Discarding 32 places :
Symmetric choice reduction at 4 with 32 rule applications. Total rules 132 place count 140 transition count 317
Iterating global reduction 4 with 32 rules applied. Total rules applied 164 place count 140 transition count 317
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 164 place count 140 transition count 314
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 170 place count 137 transition count 314
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 4 with 57 rules applied. Total rules applied 227 place count 107 transition count 287
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 229 place count 105 transition count 283
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 105 transition count 283
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 234 place count 105 transition count 280
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 240 place count 102 transition count 277
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 100 transition count 275
Applied a total of 242 rules in 65 ms. Remains 100 /224 variables (removed 124) and now considering 275/413 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 100/224 places, 275/413 transitions.
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 14 ms
[2024-06-02 20:59:09] [INFO ] Input system was already deterministic with 275 transitions.
RANDOM walk for 156 steps (11 resets) in 6 ms. (22 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-19-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 221 transition count 375
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 41 rules applied. Total rules applied 77 place count 186 transition count 369
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 80 place count 183 transition count 369
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 80 place count 183 transition count 363
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 92 place count 177 transition count 363
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 122 place count 147 transition count 325
Iterating global reduction 3 with 30 rules applied. Total rules applied 152 place count 147 transition count 325
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 152 place count 147 transition count 322
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 144 transition count 322
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 212 place count 116 transition count 296
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 214 place count 114 transition count 292
Iterating global reduction 3 with 2 rules applied. Total rules applied 216 place count 114 transition count 292
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 219 place count 114 transition count 289
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 225 place count 111 transition count 286
Applied a total of 225 rules in 45 ms. Remains 111 /224 variables (removed 113) and now considering 286/413 (removed 127) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 45 ms. Remains : 111/224 places, 286/413 transitions.
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:59:09] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 193 transition count 377
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 193 transition count 377
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 191 transition count 373
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 191 transition count 373
Applied a total of 66 rules in 9 ms. Remains 191 /224 variables (removed 33) and now considering 373/413 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 191/224 places, 373/413 transitions.
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:59:09] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:59:10] [INFO ] Input system was already deterministic with 373 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 220 transition count 373
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 42 rules applied. Total rules applied 79 place count 184 transition count 367
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 181 transition count 367
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 82 place count 181 transition count 361
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 94 place count 175 transition count 361
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 123 place count 146 transition count 323
Iterating global reduction 3 with 29 rules applied. Total rules applied 152 place count 146 transition count 323
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 152 place count 146 transition count 320
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 158 place count 143 transition count 320
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 216 place count 113 transition count 292
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 217 place count 112 transition count 290
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 112 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 221 place count 112 transition count 287
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 227 place count 109 transition count 284
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 228 place count 109 transition count 284
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 230 place count 107 transition count 282
Applied a total of 230 rules in 56 ms. Remains 107 /224 variables (removed 117) and now considering 282/413 (removed 131) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 107/224 places, 282/413 transitions.
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 13 ms
[2024-06-02 20:59:10] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 189 transition count 374
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 189 transition count 374
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 187 transition count 370
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 187 transition count 370
Applied a total of 74 rules in 9 ms. Remains 187 /224 variables (removed 37) and now considering 370/413 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 187/224 places, 370/413 transitions.
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:59:10] [INFO ] Input system was already deterministic with 370 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 188 transition count 373
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 188 transition count 373
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 75 place count 185 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 78 place count 185 transition count 367
Applied a total of 78 rules in 10 ms. Remains 185 /224 variables (removed 39) and now considering 367/413 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 185/224 places, 367/413 transitions.
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 26 ms
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:59:10] [INFO ] Input system was already deterministic with 367 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 221 transition count 377
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 73 place count 188 transition count 371
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 185 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 78 place count 184 transition count 370
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 78 place count 184 transition count 362
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 94 place count 176 transition count 362
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 120 place count 150 transition count 331
Iterating global reduction 4 with 26 rules applied. Total rules applied 146 place count 150 transition count 331
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 146 place count 150 transition count 329
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 150 place count 148 transition count 329
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 59 rules applied. Total rules applied 209 place count 117 transition count 301
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 211 place count 115 transition count 297
Iterating global reduction 4 with 2 rules applied. Total rules applied 213 place count 115 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 216 place count 115 transition count 294
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 222 place count 112 transition count 291
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 223 place count 112 transition count 291
Applied a total of 223 rules in 49 ms. Remains 112 /224 variables (removed 112) and now considering 291/413 (removed 122) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 50 ms. Remains : 112/224 places, 291/413 transitions.
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 15 ms
[2024-06-02 20:59:10] [INFO ] Input system was already deterministic with 291 transitions.
Starting structural reductions in LTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 192 transition count 376
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 192 transition count 376
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 191 transition count 374
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 191 transition count 374
Applied a total of 66 rules in 9 ms. Remains 191 /224 variables (removed 33) and now considering 374/413 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 191/224 places, 374/413 transitions.
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 16 ms
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 17 ms
[2024-06-02 20:59:10] [INFO ] Input system was already deterministic with 374 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 224/224 places, 413/413 transitions.
Graph (complete) has 745 edges and 224 vertex of which 221 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 220 transition count 376
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 39 rules applied. Total rules applied 73 place count 187 transition count 370
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 5 rules applied. Total rules applied 78 place count 184 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 80 place count 182 transition count 368
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 80 place count 182 transition count 360
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 96 place count 174 transition count 360
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 124 place count 146 transition count 324
Iterating global reduction 4 with 28 rules applied. Total rules applied 152 place count 146 transition count 324
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 152 place count 146 transition count 321
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 158 place count 143 transition count 321
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 214 place count 114 transition count 294
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 216 place count 112 transition count 290
Iterating global reduction 4 with 2 rules applied. Total rules applied 218 place count 112 transition count 290
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 221 place count 112 transition count 287
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 110 transition count 285
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 108 transition count 283
Applied a total of 227 rules in 46 ms. Remains 108 /224 variables (removed 116) and now considering 283/413 (removed 130) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 108/224 places, 283/413 transitions.
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 12 ms
[2024-06-02 20:59:10] [INFO ] Input system was already deterministic with 283 transitions.
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 18 ms
[2024-06-02 20:59:10] [INFO ] Flatten gal took : 19 ms
[2024-06-02 20:59:10] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-06-02 20:59:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 224 places, 413 transitions and 1853 arcs took 5 ms.
Total runtime 79607 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 : MedleyA-PT-19-CTLCardinality-2024-00
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-01
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-02
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-03
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-05
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-06
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-09
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-10
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-12
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-13
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-14
Could not compute solution for formula : MedleyA-PT-19-CTLCardinality-2024-15

BK_STOP 1717361951156

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name MedleyA-PT-19-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/773/ctl_0_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/773/ctl_1_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/773/ctl_2_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/773/ctl_3_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/773/ctl_4_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/773/ctl_5_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/773/ctl_6_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/773/ctl_7_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-12
ctl formula formula --ctl=/tmp/773/ctl_8_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-13
ctl formula formula --ctl=/tmp/773/ctl_9_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-14
ctl formula formula --ctl=/tmp/773/ctl_10_
ctl formula name MedleyA-PT-19-CTLCardinality-2024-15
ctl formula formula --ctl=/tmp/773/ctl_11_
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="MedleyA-PT-19"
export BK_EXAMINATION="CTLCardinality"
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 MedleyA-PT-19, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921300145"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-19.tgz
mv MedleyA-PT-19 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;