fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r464-smll-171620117700058
Last Updated
July 7, 2024

About the Execution of LTSMin+red for ASLink-PT-04a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
832.640 154276.00 285451.00 514.70 ?FFT?TT?T??TTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117700058.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 ASLink-PT-04a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700058
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 436K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717192088417

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:48:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:48:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:48:10] [INFO ] Load time of PNML (sax parser for PT used): 256 ms
[2024-05-31 21:48:10] [INFO ] Transformed 1016 places.
[2024-05-31 21:48:10] [INFO ] Transformed 1554 transitions.
[2024-05-31 21:48:10] [INFO ] Found NUPN structural information;
[2024-05-31 21:48:10] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 467 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 25 ms.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
Support contains 186 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 15 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 994 transition count 1538
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 25 place count 991 transition count 1535
Ensure Unique test removed 1 places
Iterating global reduction 1 with 4 rules applied. Total rules applied 29 place count 990 transition count 1535
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 31 place count 990 transition count 1533
Applied a total of 31 rules in 216 ms. Remains 990 /1016 variables (removed 26) and now considering 1533/1538 (removed 5) transitions.
// Phase 1: matrix 1533 rows 990 cols
[2024-05-31 21:48:11] [INFO ] Computed 171 invariants in 148 ms
[2024-05-31 21:48:12] [INFO ] Implicit Places using invariants in 1648 ms returned [1, 19, 23, 52, 70, 199, 215, 220, 221, 259, 388, 404, 409, 430, 448, 577, 599, 620, 638, 767, 773, 785, 790, 791, 792, 827, 829, 850, 851, 852, 853, 871, 879, 887, 893, 899, 905, 911, 919, 925, 939]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1699 ms to find 41 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 949/1016 places, 1533/1538 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 939 transition count 1523
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 939 transition count 1523
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 934 transition count 1518
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 934 transition count 1518
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 933 transition count 1517
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 933 transition count 1517
Applied a total of 32 rules in 191 ms. Remains 933 /949 variables (removed 16) and now considering 1517/1533 (removed 16) transitions.
// Phase 1: matrix 1517 rows 933 cols
[2024-05-31 21:48:13] [INFO ] Computed 130 invariants in 73 ms
[2024-05-31 21:48:13] [INFO ] Implicit Places using invariants in 792 ms returned []
[2024-05-31 21:48:13] [INFO ] Invariant cache hit.
[2024-05-31 21:48:16] [INFO ] Implicit Places using invariants and state equation in 2415 ms returned []
Implicit Place search using SMT with State Equation took 3215 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 933/1016 places, 1517/1538 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5357 ms. Remains : 933/1016 places, 1517/1538 transitions.
Support contains 186 out of 933 places after structural reductions.
[2024-05-31 21:48:16] [INFO ] Flatten gal took : 232 ms
[2024-05-31 21:48:16] [INFO ] Flatten gal took : 132 ms
[2024-05-31 21:48:17] [INFO ] Input system was already deterministic with 1517 transitions.
Support contains 184 out of 933 places (down from 186) after GAL structural reductions.
RANDOM walk for 40000 steps (277 resets) in 3484 ms. (11 steps per ms) remains 65/93 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (9 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (9 resets) in 23 ms. (166 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (9 resets) in 31 ms. (125 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4002 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (9 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 65/65 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 65/65 properties
[2024-05-31 21:48:18] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 256/394 variables, 24/24 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/394 variables, 1/25 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/394 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 34/428 variables, 6/31 constraints. Problems are: Problem set: 1 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 64 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 6 (OVERLAPS) 470/898 variables, 86/117 constraints. Problems are: Problem set: 4 solved, 61 unsolved
[2024-05-31 21:48:21] [INFO ] Deduced a trap composed of 87 places in 289 ms of which 45 ms to minimize.
[2024-05-31 21:48:22] [INFO ] Deduced a trap composed of 36 places in 272 ms of which 5 ms to minimize.
[2024-05-31 21:48:22] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-05-31 21:48:23] [INFO ] Deduced a trap composed of 76 places in 354 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 4/121 constraints. Problems are: Problem set: 4 solved, 61 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 898/2450 variables, and 121 constraints, problems are : Problem set: 4 solved, 61 unsolved in 5027 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 87/100 constraints, State Equation: 0/933 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 4 solved, 61 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 1 (OVERLAPS) 259/378 variables, 20/20 constraints. Problems are: Problem set: 4 solved, 61 unsolved
[2024-05-31 21:48:25] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 5 ms to minimize.
[2024-05-31 21:48:25] [INFO ] Deduced a trap composed of 65 places in 328 ms of which 2 ms to minimize.
[2024-05-31 21:48:25] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 2 ms to minimize.
[2024-05-31 21:48:26] [INFO ] Deduced a trap composed of 85 places in 117 ms of which 1 ms to minimize.
[2024-05-31 21:48:26] [INFO ] Deduced a trap composed of 77 places in 65 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/378 variables, 5/25 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/378 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 4 (OVERLAPS) 43/421 variables, 10/35 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/421 variables, 0/35 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 6 (OVERLAPS) 477/898 variables, 87/122 constraints. Problems are: Problem set: 4 solved, 61 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/898 variables, 4/126 constraints. Problems are: Problem set: 4 solved, 61 unsolved
[2024-05-31 21:48:29] [INFO ] Deduced a trap composed of 83 places in 286 ms of which 4 ms to minimize.
SMT process timed out in 10434ms, After SMT, problems are : Problem set: 4 solved, 61 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 119 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1517/1517 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 122 rules applied. Total rules applied 122 place count 931 transition count 1397
Reduce places removed 120 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 124 rules applied. Total rules applied 246 place count 811 transition count 1393
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 250 place count 807 transition count 1393
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 250 place count 807 transition count 1290
Deduced a syphon composed of 103 places in 1 ms
Ensure Unique test removed 33 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 489 place count 671 transition count 1290
Discarding 3 places :
Implicit places reduction removed 3 places
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 3 with 6 rules applied. Total rules applied 495 place count 668 transition count 1287
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 4 with 5 rules applied. Total rules applied 500 place count 665 transition count 1285
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 502 place count 663 transition count 1285
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 502 place count 663 transition count 1278
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 516 place count 656 transition count 1278
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 520 place count 652 transition count 1274
Iterating global reduction 6 with 4 rules applied. Total rules applied 524 place count 652 transition count 1274
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 524 place count 652 transition count 1273
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 526 place count 651 transition count 1273
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 528 place count 649 transition count 1271
Iterating global reduction 6 with 2 rules applied. Total rules applied 530 place count 649 transition count 1271
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 614 place count 607 transition count 1229
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 615 place count 606 transition count 1228
Iterating global reduction 6 with 1 rules applied. Total rules applied 616 place count 606 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 617 place count 605 transition count 1227
Iterating global reduction 6 with 1 rules applied. Total rules applied 618 place count 605 transition count 1227
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 631 place count 605 transition count 1216
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 644 place count 592 transition count 1216
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 658 place count 592 transition count 1216
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 7 with 4 rules applied. Total rules applied 662 place count 592 transition count 1216
Applied a total of 662 rules in 528 ms. Remains 592 /933 variables (removed 341) and now considering 1216/1517 (removed 301) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 529 ms. Remains : 592/933 places, 1216/1517 transitions.
RANDOM walk for 40000 steps (568 resets) in 807 ms. (49 steps per ms) remains 59/61 properties
BEST_FIRST walk for 4004 steps (14 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (12 resets) in 39 ms. (100 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 32 ms. (121 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (13 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (15 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (11 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 33 ms. (117 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 22 ms. (174 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (14 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (11 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (12 resets) in 25 ms. (154 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (13 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (12 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (12 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (15 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (15 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (11 resets) in 20 ms. (190 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (12 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 30 ms. (129 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (12 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (13 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (13 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (12 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (15 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (12 resets) in 13 ms. (285 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (11 resets) in 18 ms. (210 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (15 resets) in 14 ms. (266 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (13 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (13 resets) in 19 ms. (200 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (13 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (14 resets) in 17 ms. (222 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4002 steps (15 resets) in 16 ms. (235 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4003 steps (15 resets) in 15 ms. (250 steps per ms) remains 59/59 properties
Interrupted probabilistic random walk after 89387 steps, run timeout after 3001 ms. (steps per millisecond=29 ) properties seen :6 out of 59
Probabilistic random walk after 89387 steps, saw 50506 distinct states, run finished after 3007 ms. (steps per millisecond=29 ) properties seen :6
// Phase 1: matrix 1216 rows 592 cols
[2024-05-31 21:48:33] [INFO ] Computed 92 invariants in 16 ms
[2024-05-31 21:48:33] [INFO ] State equation strengthened by 16 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 158/254 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/254 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 21/275 variables, 9/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/275 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (OVERLAPS) 282/557 variables, 61/86 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2024-05-31 21:48:35] [INFO ] Deduced a trap composed of 29 places in 121 ms of which 2 ms to minimize.
[2024-05-31 21:48:35] [INFO ] Deduced a trap composed of 42 places in 328 ms of which 4 ms to minimize.
[2024-05-31 21:48:35] [INFO ] Deduced a trap composed of 23 places in 148 ms of which 2 ms to minimize.
[2024-05-31 21:48:35] [INFO ] Deduced a trap composed of 17 places in 169 ms of which 2 ms to minimize.
[2024-05-31 21:48:36] [INFO ] Deduced a trap composed of 24 places in 209 ms of which 3 ms to minimize.
[2024-05-31 21:48:36] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 2 ms to minimize.
Problem AtomicPropp38 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 6/92 constraints. Problems are: Problem set: 1 solved, 52 unsolved
[2024-05-31 21:48:37] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 3 ms to minimize.
[2024-05-31 21:48:37] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 2/94 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 35/592 variables, 6/100 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/592 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 11 (OVERLAPS) 1216/1808 variables, 592/692 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1808 variables, 16/708 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1808 variables, 0/708 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 14 (OVERLAPS) 0/1808 variables, 0/708 constraints. Problems are: Problem set: 1 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1808/1808 variables, and 708 constraints, problems are : Problem set: 1 solved, 52 unsolved in 13592 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 592/592 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 1 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/95 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 1 (OVERLAPS) 158/253 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 21/274 variables, 9/25 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 0/25 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 5 (OVERLAPS) 283/557 variables, 61/86 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/557 variables, 8/94 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 8 (OVERLAPS) 35/592 variables, 6/100 constraints. Problems are: Problem set: 1 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/592 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 52 unsolved
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp33 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp51 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp64 is UNSAT
Problem AtomicPropp65 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp76 is UNSAT
Problem AtomicPropp77 is UNSAT
Problem AtomicPropp78 is UNSAT
Problem AtomicPropp79 is UNSAT
Problem AtomicPropp80 is UNSAT
Problem AtomicPropp81 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp85 is UNSAT
Problem AtomicPropp86 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp92 is UNSAT
At refinement iteration 10 (OVERLAPS) 1216/1808 variables, 592/692 constraints. Problems are: Problem set: 44 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1808 variables, 16/708 constraints. Problems are: Problem set: 44 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1808 variables, 9/717 constraints. Problems are: Problem set: 44 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1808 variables, 0/717 constraints. Problems are: Problem set: 44 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/1808 variables, 0/717 constraints. Problems are: Problem set: 44 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1808/1808 variables, and 717 constraints, problems are : Problem set: 44 solved, 9 unsolved in 29511 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 592/592 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 9/53 constraints, Known Traps: 8/8 constraints]
After SMT, in 43248ms problems are : Problem set: 44 solved, 9 unsolved
Parikh walk visited 0 properties in 31852 ms.
Support contains 22 out of 592 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 592/592 places, 1216/1216 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 592 transition count 1206
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 582 transition count 1206
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 582 transition count 1204
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 580 transition count 1204
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 578 transition count 1190
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 578 transition count 1190
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 577 transition count 1190
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 566 transition count 1179
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 52 place count 566 transition count 1178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 53 place count 565 transition count 1178
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 61 place count 565 transition count 1170
Ensure Unique test removed 5 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 4 with 13 rules applied. Total rules applied 74 place count 552 transition count 1170
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 78 place count 548 transition count 1158
Iterating global reduction 5 with 4 rules applied. Total rules applied 82 place count 548 transition count 1158
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 85 place count 548 transition count 1155
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 86 place count 547 transition count 1147
Iterating global reduction 6 with 1 rules applied. Total rules applied 87 place count 547 transition count 1147
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 88 place count 546 transition count 1139
Iterating global reduction 6 with 1 rules applied. Total rules applied 89 place count 546 transition count 1139
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 92 place count 546 transition count 1139
Applied a total of 92 rules in 207 ms. Remains 546 /592 variables (removed 46) and now considering 1139/1216 (removed 77) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 546/592 places, 1139/1216 transitions.
RANDOM walk for 40000 steps (551 resets) in 667 ms. (59 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (140 resets) in 204 ms. (195 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (137 resets) in 247 ms. (161 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (143 resets) in 250 ms. (159 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (138 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (139 resets) in 181 ms. (219 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (130 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (148 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (128 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (138 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 141516 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 9
Probabilistic random walk after 141516 steps, saw 46247 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
// Phase 1: matrix 1139 rows 546 cols
[2024-05-31 21:49:52] [INFO ] Computed 86 invariants in 13 ms
[2024-05-31 21:49:52] [INFO ] State equation strengthened by 23 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 77/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 86/185 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 293/478 variables, 49/72 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 68/546 variables, 14/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1139/1685 variables, 546/632 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1685 variables, 23/655 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1685 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/1685 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 655 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1417 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 546/546 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 77/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 86/185 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 21:49:54] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 293/478 variables, 49/73 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 21:49:54] [INFO ] Deduced a trap composed of 41 places in 79 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/478 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/478 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 68/546 variables, 14/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/546 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1139/1685 variables, 546/634 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1685 variables, 23/657 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1685 variables, 9/666 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-31 21:49:58] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/1685 variables, 1/667 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/667 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 667 constraints, problems are : Problem set: 0 solved, 9 unsolved in 6590 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 546/546 constraints, ReadFeed: 23/23 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 8045ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 32200 ms.
Support contains 22 out of 546 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 546/546 places, 1139/1139 transitions.
Applied a total of 0 rules in 28 ms. Remains 546 /546 variables (removed 0) and now considering 1139/1139 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 546/546 places, 1139/1139 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 546/546 places, 1139/1139 transitions.
Applied a total of 0 rules in 39 ms. Remains 546 /546 variables (removed 0) and now considering 1139/1139 (removed 0) transitions.
[2024-05-31 21:50:33] [INFO ] Invariant cache hit.
[2024-05-31 21:50:34] [INFO ] Implicit Places using invariants in 1019 ms returned [104, 110, 113, 115, 116, 131, 132, 137, 155, 240, 247, 248, 249, 250, 251, 339, 351, 358, 359, 360, 361, 362, 434, 442, 448, 451, 453, 454, 460, 473, 507, 540, 542]
[2024-05-31 21:50:34] [INFO ] Actually due to overlaps returned [131, 137, 247, 251, 358, 132, 155, 248, 359, 250, 362, 473, 249, 361, 104, 110, 115, 360, 442, 448, 453, 507, 116, 339, 434, 454, 460, 540]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 1025 ms to find 28 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 518/546 places, 1139/1139 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 518 transition count 1122
Reduce places removed 17 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 20 rules applied. Total rules applied 37 place count 501 transition count 1119
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 40 place count 498 transition count 1119
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 40 place count 498 transition count 1104
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 72 place count 481 transition count 1104
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 73 place count 480 transition count 1104
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 88 place count 465 transition count 1089
Iterating global reduction 4 with 15 rules applied. Total rules applied 103 place count 465 transition count 1089
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 106 place count 465 transition count 1086
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 108 place count 463 transition count 1084
Iterating global reduction 5 with 2 rules applied. Total rules applied 110 place count 463 transition count 1084
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 128 place count 454 transition count 1075
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 129 place count 454 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 130 place count 453 transition count 1072
Iterating global reduction 6 with 1 rules applied. Total rules applied 131 place count 453 transition count 1072
Free-agglomeration rule applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 140 place count 453 transition count 1063
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 10 rules applied. Total rules applied 150 place count 444 transition count 1062
Applied a total of 150 rules in 177 ms. Remains 444 /518 variables (removed 74) and now considering 1062/1139 (removed 77) transitions.
// Phase 1: matrix 1062 rows 444 cols
[2024-05-31 21:50:34] [INFO ] Computed 55 invariants in 10 ms
[2024-05-31 21:50:35] [INFO ] Implicit Places using invariants in 822 ms returned [171, 189, 195, 200, 201, 257, 274, 280, 285, 344, 367]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 826 ms to find 11 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 433/546 places, 1062/1139 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 429 transition count 1058
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 429 transition count 1058
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 427 transition count 1056
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 427 transition count 1056
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 422 transition count 1051
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 27 place count 422 transition count 1046
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 32 place count 417 transition count 1046
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 417 transition count 1044
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 36 place count 415 transition count 1044
Applied a total of 36 rules in 87 ms. Remains 415 /433 variables (removed 18) and now considering 1044/1062 (removed 18) transitions.
// Phase 1: matrix 1044 rows 415 cols
[2024-05-31 21:50:35] [INFO ] Computed 44 invariants in 10 ms
[2024-05-31 21:50:36] [INFO ] Implicit Places using invariants in 632 ms returned []
[2024-05-31 21:50:36] [INFO ] Invariant cache hit.
[2024-05-31 21:50:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 21:50:37] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1883 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 415/546 places, 1044/1139 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 4038 ms. Remains : 415/546 places, 1044/1139 transitions.
Successfully simplified 48 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-04a-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-CTLFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:50:37] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2024-05-31 21:50:37] [INFO ] Flatten gal took : 107 ms
[2024-05-31 21:50:37] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ASLink-PT-04a-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-CTLFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-31 21:50:37] [INFO ] Flatten gal took : 135 ms
[2024-05-31 21:50:37] [INFO ] Input system was already deterministic with 1517 transitions.
Support contains 41 out of 933 places (down from 55) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1517/1517 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 931 transition count 1517
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 922 transition count 1480
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 922 transition count 1480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 919 transition count 1470
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 919 transition count 1470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 917 transition count 1461
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 917 transition count 1461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 915 transition count 1452
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 915 transition count 1452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 913 transition count 1443
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 913 transition count 1443
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 911 transition count 1434
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 911 transition count 1434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 909 transition count 1425
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 909 transition count 1425
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 907 transition count 1416
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 907 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 906 transition count 1408
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 906 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 905 transition count 1400
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 905 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 904 transition count 1392
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 904 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 903 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 903 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 902 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 902 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 901 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 901 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 900 transition count 1360
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 900 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 899 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 899 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 898 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 898 transition count 1344
Applied a total of 68 rules in 697 ms. Remains 898 /933 variables (removed 35) and now considering 1344/1517 (removed 173) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 711 ms. Remains : 898/933 places, 1344/1517 transitions.
[2024-05-31 21:50:38] [INFO ] Flatten gal took : 58 ms
[2024-05-31 21:50:38] [INFO ] Flatten gal took : 55 ms
[2024-05-31 21:50:38] [INFO ] Input system was already deterministic with 1344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1517/1517 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 931 transition count 1517
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 922 transition count 1480
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 922 transition count 1480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 919 transition count 1470
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 919 transition count 1470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 917 transition count 1461
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 917 transition count 1461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 915 transition count 1452
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 915 transition count 1452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 913 transition count 1443
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 913 transition count 1443
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 911 transition count 1434
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 911 transition count 1434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 909 transition count 1425
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 909 transition count 1425
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 907 transition count 1416
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 907 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 906 transition count 1408
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 906 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 905 transition count 1400
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 905 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 904 transition count 1392
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 904 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 903 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 903 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 902 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 902 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 901 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 901 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 900 transition count 1360
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 900 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 899 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 899 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 898 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 898 transition count 1344
Applied a total of 68 rules in 456 ms. Remains 898 /933 variables (removed 35) and now considering 1344/1517 (removed 173) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 470 ms. Remains : 898/933 places, 1344/1517 transitions.
[2024-05-31 21:50:39] [INFO ] Flatten gal took : 49 ms
[2024-05-31 21:50:39] [INFO ] Flatten gal took : 51 ms
[2024-05-31 21:50:39] [INFO ] Input system was already deterministic with 1344 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 933/933 places, 1517/1517 transitions.
Ensure Unique test removed 1 places
Reduce places removed 2 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 135 transitions
Trivial Post-agglo rules discarded 135 transitions
Performed 135 trivial Post agglomeration. Transition count delta: 135
Iterating post reduction 0 with 136 rules applied. Total rules applied 136 place count 930 transition count 1381
Reduce places removed 140 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 141 rules applied. Total rules applied 277 place count 790 transition count 1380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 278 place count 789 transition count 1380
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 121 Pre rules applied. Total rules applied 278 place count 789 transition count 1259
Deduced a syphon composed of 121 places in 2 ms
Ensure Unique test removed 36 places
Reduce places removed 157 places and 0 transitions.
Iterating global reduction 3 with 278 rules applied. Total rules applied 556 place count 632 transition count 1259
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 3 with 22 rules applied. Total rules applied 578 place count 626 transition count 1243
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 18 rules applied. Total rules applied 596 place count 609 transition count 1242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 597 place count 608 transition count 1242
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 14 Pre rules applied. Total rules applied 597 place count 608 transition count 1228
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 625 place count 594 transition count 1228
Discarding 13 places :
Symmetric choice reduction at 6 with 13 rule applications. Total rules 638 place count 581 transition count 1187
Iterating global reduction 6 with 13 rules applied. Total rules applied 651 place count 581 transition count 1187
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 6 with 24 rules applied. Total rules applied 675 place count 573 transition count 1171
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 7 with 12 rules applied. Total rules applied 687 place count 561 transition count 1171
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 687 place count 561 transition count 1170
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 689 place count 560 transition count 1170
Discarding 6 places :
Symmetric choice reduction at 8 with 6 rule applications. Total rules 695 place count 554 transition count 1157
Iterating global reduction 8 with 6 rules applied. Total rules applied 701 place count 554 transition count 1157
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 704 place count 554 transition count 1154
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 705 place count 553 transition count 1146
Iterating global reduction 9 with 1 rules applied. Total rules applied 706 place count 553 transition count 1146
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 707 place count 552 transition count 1138
Iterating global reduction 9 with 1 rules applied. Total rules applied 708 place count 552 transition count 1138
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 709 place count 551 transition count 1130
Iterating global reduction 9 with 1 rules applied. Total rules applied 710 place count 551 transition count 1130
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 711 place count 550 transition count 1122
Iterating global reduction 9 with 1 rules applied. Total rules applied 712 place count 550 transition count 1122
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 713 place count 549 transition count 1114
Iterating global reduction 9 with 1 rules applied. Total rules applied 714 place count 549 transition count 1114
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 715 place count 548 transition count 1106
Iterating global reduction 9 with 1 rules applied. Total rules applied 716 place count 548 transition count 1106
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 717 place count 547 transition count 1098
Iterating global reduction 9 with 1 rules applied. Total rules applied 718 place count 547 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 719 place count 546 transition count 1090
Iterating global reduction 9 with 1 rules applied. Total rules applied 720 place count 546 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 721 place count 545 transition count 1082
Iterating global reduction 9 with 1 rules applied. Total rules applied 722 place count 545 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 723 place count 544 transition count 1074
Iterating global reduction 9 with 1 rules applied. Total rules applied 724 place count 544 transition count 1074
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 725 place count 543 transition count 1066
Iterating global reduction 9 with 1 rules applied. Total rules applied 726 place count 543 transition count 1066
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 727 place count 542 transition count 1058
Iterating global reduction 9 with 1 rules applied. Total rules applied 728 place count 542 transition count 1058
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 729 place count 541 transition count 1050
Iterating global reduction 9 with 1 rules applied. Total rules applied 730 place count 541 transition count 1050
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 731 place count 540 transition count 1042
Iterating global reduction 9 with 1 rules applied. Total rules applied 732 place count 540 transition count 1042
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 733 place count 539 transition count 1034
Iterating global reduction 9 with 1 rules applied. Total rules applied 734 place count 539 transition count 1034
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 9 with 58 rules applied. Total rules applied 792 place count 510 transition count 1005
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 797 place count 505 transition count 1000
Iterating global reduction 9 with 5 rules applied. Total rules applied 802 place count 505 transition count 1000
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 803 place count 504 transition count 999
Iterating global reduction 9 with 1 rules applied. Total rules applied 804 place count 504 transition count 999
Applied a total of 804 rules in 435 ms. Remains 504 /933 variables (removed 429) and now considering 999/1517 (removed 518) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 436 ms. Remains : 504/933 places, 999/1517 transitions.
[2024-05-31 21:50:40] [INFO ] Flatten gal took : 46 ms
[2024-05-31 21:50:40] [INFO ] Flatten gal took : 56 ms
[2024-05-31 21:50:40] [INFO ] Input system was already deterministic with 999 transitions.
RANDOM walk for 40000 steps (616 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (162 resets) in 60 ms. (655 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22452 steps, run visited all 1 properties in 252 ms. (steps per millisecond=89 )
Probabilistic random walk after 22452 steps, saw 11479 distinct states, run finished after 258 ms. (steps per millisecond=87 ) properties seen :1
FORMULA ASLink-PT-04a-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1517/1517 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 931 transition count 1517
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 925 transition count 1493
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 925 transition count 1493
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 17 place count 922 transition count 1483
Iterating global reduction 1 with 3 rules applied. Total rules applied 20 place count 922 transition count 1483
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 22 place count 920 transition count 1474
Iterating global reduction 1 with 2 rules applied. Total rules applied 24 place count 920 transition count 1474
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 918 transition count 1465
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 918 transition count 1465
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 916 transition count 1456
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 916 transition count 1456
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 914 transition count 1447
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 914 transition count 1447
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 913 transition count 1446
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 913 transition count 1446
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 39 place count 912 transition count 1445
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 912 transition count 1445
Applied a total of 40 rules in 172 ms. Remains 912 /933 variables (removed 21) and now considering 1445/1517 (removed 72) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 912/933 places, 1445/1517 transitions.
[2024-05-31 21:50:40] [INFO ] Flatten gal took : 43 ms
[2024-05-31 21:50:40] [INFO ] Flatten gal took : 48 ms
[2024-05-31 21:50:41] [INFO ] Input system was already deterministic with 1445 transitions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1517/1517 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 931 transition count 1517
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 922 transition count 1480
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 922 transition count 1480
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 23 place count 919 transition count 1470
Iterating global reduction 1 with 3 rules applied. Total rules applied 26 place count 919 transition count 1470
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 28 place count 917 transition count 1461
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 917 transition count 1461
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 915 transition count 1452
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 915 transition count 1452
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 36 place count 913 transition count 1443
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 913 transition count 1443
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 911 transition count 1434
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 911 transition count 1434
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 44 place count 909 transition count 1425
Iterating global reduction 1 with 2 rules applied. Total rules applied 46 place count 909 transition count 1425
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 48 place count 907 transition count 1416
Iterating global reduction 1 with 2 rules applied. Total rules applied 50 place count 907 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 906 transition count 1408
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 906 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 905 transition count 1400
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 905 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 904 transition count 1392
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 904 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 903 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 903 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 902 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 902 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 901 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 901 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 900 transition count 1360
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 900 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 899 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 899 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 67 place count 898 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 68 place count 898 transition count 1344
Applied a total of 68 rules in 466 ms. Remains 898 /933 variables (removed 35) and now considering 1344/1517 (removed 173) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 898/933 places, 1344/1517 transitions.
[2024-05-31 21:50:41] [INFO ] Flatten gal took : 42 ms
[2024-05-31 21:50:41] [INFO ] Flatten gal took : 44 ms
[2024-05-31 21:50:41] [INFO ] Input system was already deterministic with 1344 transitions.
Starting structural reductions in LTL mode, iteration 0 : 933/933 places, 1517/1517 transitions.
Ensure Unique test removed 1 places
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 931 transition count 1517
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 923 transition count 1486
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 923 transition count 1486
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 21 place count 920 transition count 1476
Iterating global reduction 1 with 3 rules applied. Total rules applied 24 place count 920 transition count 1476
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 26 place count 918 transition count 1467
Iterating global reduction 1 with 2 rules applied. Total rules applied 28 place count 918 transition count 1467
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 30 place count 916 transition count 1458
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 916 transition count 1458
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 914 transition count 1449
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 914 transition count 1449
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 912 transition count 1440
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 912 transition count 1440
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 42 place count 910 transition count 1431
Iterating global reduction 1 with 2 rules applied. Total rules applied 44 place count 910 transition count 1431
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 46 place count 908 transition count 1422
Iterating global reduction 1 with 2 rules applied. Total rules applied 48 place count 908 transition count 1422
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 907 transition count 1414
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 907 transition count 1414
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 51 place count 906 transition count 1406
Iterating global reduction 1 with 1 rules applied. Total rules applied 52 place count 906 transition count 1406
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 53 place count 905 transition count 1398
Iterating global reduction 1 with 1 rules applied. Total rules applied 54 place count 905 transition count 1398
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 904 transition count 1390
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 904 transition count 1390
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 57 place count 903 transition count 1382
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 903 transition count 1382
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 59 place count 902 transition count 1374
Iterating global reduction 1 with 1 rules applied. Total rules applied 60 place count 902 transition count 1374
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 901 transition count 1366
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 901 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 900 transition count 1358
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 900 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 65 place count 899 transition count 1350
Iterating global reduction 1 with 1 rules applied. Total rules applied 66 place count 899 transition count 1350
Applied a total of 66 rules in 351 ms. Remains 899 /933 variables (removed 34) and now considering 1350/1517 (removed 167) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 351 ms. Remains : 899/933 places, 1350/1517 transitions.
[2024-05-31 21:50:42] [INFO ] Flatten gal took : 37 ms
[2024-05-31 21:50:42] [INFO ] Flatten gal took : 40 ms
[2024-05-31 21:50:42] [INFO ] Input system was already deterministic with 1350 transitions.
[2024-05-31 21:50:42] [INFO ] Flatten gal took : 45 ms
[2024-05-31 21:50:42] [INFO ] Flatten gal took : 48 ms
[2024-05-31 21:50:42] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-05-31 21:50:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 933 places, 1517 transitions and 5441 arcs took 16 ms.
Total runtime 152210 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 : ASLink-PT-04a-CTLFireability-2024-00
Could not compute solution for formula : ASLink-PT-04a-CTLFireability-2024-04
Could not compute solution for formula : ASLink-PT-04a-CTLFireability-2024-07
Could not compute solution for formula : ASLink-PT-04a-CTLFireability-2024-09
Could not compute solution for formula : ASLink-PT-04a-CTLFireability-2024-10

BK_STOP 1717192242693

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ASLink-PT-04a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/674/ctl_0_
ctl formula name ASLink-PT-04a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/674/ctl_1_
ctl formula name ASLink-PT-04a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/674/ctl_2_
ctl formula name ASLink-PT-04a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/674/ctl_3_
ctl formula name ASLink-PT-04a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/674/ctl_4_
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="ASLink-PT-04a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-04a, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117700058"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-04a.tgz
mv ASLink-PT-04a execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;