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

About the Execution of LTSMin+red for Parking-PT-864

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
950.951 38469.00 90736.00 188.90 ?T?????????????? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 884K
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 20:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Apr 11 20:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 11 19:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Apr 11 19:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 427K May 18 16:43 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 Parking-PT-864-CTLFireability-2024-00
FORMULA_NAME Parking-PT-864-CTLFireability-2024-01
FORMULA_NAME Parking-PT-864-CTLFireability-2024-02
FORMULA_NAME Parking-PT-864-CTLFireability-2024-03
FORMULA_NAME Parking-PT-864-CTLFireability-2024-04
FORMULA_NAME Parking-PT-864-CTLFireability-2024-05
FORMULA_NAME Parking-PT-864-CTLFireability-2024-06
FORMULA_NAME Parking-PT-864-CTLFireability-2024-07
FORMULA_NAME Parking-PT-864-CTLFireability-2024-08
FORMULA_NAME Parking-PT-864-CTLFireability-2024-09
FORMULA_NAME Parking-PT-864-CTLFireability-2024-10
FORMULA_NAME Parking-PT-864-CTLFireability-2024-11
FORMULA_NAME Parking-PT-864-CTLFireability-2023-12
FORMULA_NAME Parking-PT-864-CTLFireability-2023-13
FORMULA_NAME Parking-PT-864-CTLFireability-2023-14
FORMULA_NAME Parking-PT-864-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717248895964

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-864
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:34:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:34:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:34:59] [INFO ] Load time of PNML (sax parser for PT used): 463 ms
[2024-06-01 13:34:59] [INFO ] Transformed 1185 places.
[2024-06-01 13:34:59] [INFO ] Transformed 1697 transitions.
[2024-06-01 13:34:59] [INFO ] Found NUPN structural information;
[2024-06-01 13:34:59] [INFO ] Parsed PT model containing 1185 places and 1697 transitions and 5073 arcs in 810 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 41 ms.
Ensure Unique test removed 688 transitions
Reduce redundant transitions removed 688 transitions.
Support contains 179 out of 1185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1185/1185 places, 1009/1009 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1179 transition count 1003
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1179 transition count 1003
Applied a total of 12 rules in 296 ms. Remains 1179 /1185 variables (removed 6) and now considering 1003/1009 (removed 6) transitions.
// Phase 1: matrix 1003 rows 1179 cols
[2024-06-01 13:34:59] [INFO ] Computed 280 invariants in 80 ms
[2024-06-01 13:35:02] [INFO ] Implicit Places using invariants in 2392 ms returned [152, 160, 168, 176, 184, 192, 200, 208, 240, 242, 285, 301, 309, 317, 325, 333, 341, 373, 375, 418, 426, 434, 442, 450, 458, 466, 474, 551, 559, 567, 575, 583, 591, 599, 607, 639, 641, 685, 693, 701, 709, 717, 725, 733, 741, 773, 775, 818, 826, 834, 842, 850, 858, 874, 906, 908, 976, 992, 1000, 1008, 1040, 1042, 1085, 1109, 1117, 1125, 1133, 1141, 1173, 1175]
Discarding 70 places :
Implicit Place search using SMT only with invariants took 2459 ms to find 70 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1109/1185 places, 1003/1009 transitions.
Discarding 54 places :
Symmetric choice reduction at 0 with 54 rule applications. Total rules 54 place count 1055 transition count 949
Iterating global reduction 0 with 54 rules applied. Total rules applied 108 place count 1055 transition count 949
Applied a total of 108 rules in 180 ms. Remains 1055 /1109 variables (removed 54) and now considering 949/1003 (removed 54) transitions.
// Phase 1: matrix 949 rows 1055 cols
[2024-06-01 13:35:02] [INFO ] Computed 210 invariants in 23 ms
[2024-06-01 13:35:03] [INFO ] Implicit Places using invariants in 1402 ms returned []
[2024-06-01 13:35:03] [INFO ] Invariant cache hit.
[2024-06-01 13:35:04] [INFO ] State equation strengthened by 248 read => feed constraints.
[2024-06-01 13:35:07] [INFO ] Implicit Places using invariants and state equation in 3291 ms returned []
Implicit Place search using SMT with State Equation took 4700 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 1055/1185 places, 949/1009 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7671 ms. Remains : 1055/1185 places, 949/1009 transitions.
Support contains 179 out of 1055 places after structural reductions.
[2024-06-01 13:35:07] [INFO ] Flatten gal took : 268 ms
[2024-06-01 13:35:07] [INFO ] Flatten gal took : 128 ms
[2024-06-01 13:35:08] [INFO ] Input system was already deterministic with 949 transitions.
RANDOM walk for 40000 steps (152 resets) in 3884 ms. (10 steps per ms) remains 21/102 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 120 ms. (33 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 21/21 properties
[2024-06-01 13:35:10] [INFO ] Invariant cache hit.
[2024-06-01 13:35:10] [INFO ] State equation strengthened by 248 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp94 is UNSAT
At refinement iteration 1 (OVERLAPS) 651/697 variables, 31/31 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/697 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 358/1055 variables, 179/210 constraints. Problems are: Problem set: 2 solved, 19 unsolved
[2024-06-01 13:35:12] [INFO ] Deduced a trap composed of 57 places in 233 ms of which 50 ms to minimize.
[2024-06-01 13:35:12] [INFO ] Deduced a trap composed of 71 places in 476 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1055 variables, 2/212 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1055 variables, 0/212 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 949/2004 variables, 1055/1267 constraints. Problems are: Problem set: 2 solved, 19 unsolved
SMT process timed out in 5092ms, After SMT, problems are : Problem set: 2 solved, 19 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 38 out of 1055 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 1055 transition count 922
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 1028 transition count 922
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 54 place count 1028 transition count 894
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 110 place count 1000 transition count 894
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 113 place count 997 transition count 891
Iterating global reduction 2 with 3 rules applied. Total rules applied 116 place count 997 transition count 891
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 2 with 102 rules applied. Total rules applied 218 place count 946 transition count 840
Free-agglomeration rule applied 229 times.
Iterating global reduction 2 with 229 rules applied. Total rules applied 447 place count 946 transition count 611
Reduce places removed 229 places and 0 transitions.
Iterating post reduction 2 with 229 rules applied. Total rules applied 676 place count 717 transition count 611
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 3 with 8 rules applied. Total rules applied 684 place count 717 transition count 603
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 692 place count 709 transition count 603
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 694 place count 709 transition count 603
Applied a total of 694 rules in 682 ms. Remains 709 /1055 variables (removed 346) and now considering 603/949 (removed 346) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 683 ms. Remains : 709/1055 places, 603/949 transitions.
RANDOM walk for 40000 steps (97 resets) in 876 ms. (45 steps per ms) remains 10/19 properties
BEST_FIRST walk for 40004 steps (8 resets) in 311 ms. (128 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (10 resets) in 347 ms. (114 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 299 ms. (133 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 372 ms. (107 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 210 ms. (189 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (9 resets) in 256 ms. (155 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 217 ms. (183 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 334 ms. (119 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40004 steps (11 resets) in 372 ms. (107 steps per ms) remains 6/6 properties
// Phase 1: matrix 603 rows 709 cols
[2024-06-01 13:35:17] [INFO ] Computed 210 invariants in 11 ms
[2024-06-01 13:35:17] [INFO ] State equation strengthened by 513 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 188/201 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 508/709 variables, 199/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 603/1312 variables, 709/919 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1312 variables, 513/1432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1312 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/1312 variables, 0/1432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1312/1312 variables, and 1432 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1874 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 709/709 constraints, ReadFeed: 513/513 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 188/201 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/201 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 508/709 variables, 199/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/709 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 603/1312 variables, 709/919 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1312 variables, 513/1432 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1312 variables, 6/1438 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 13:35:20] [INFO ] Deduced a trap composed of 54 places in 81 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1312 variables, 1/1439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1312 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/1312 variables, 0/1439 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1312/1312 variables, and 1439 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2918 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 709/709 constraints, ReadFeed: 513/513 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 4906ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 4 properties in 1592 ms.
Support contains 4 out of 709 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 709/709 places, 603/603 transitions.
Graph (complete) has 1459 edges and 709 vertex of which 363 are kept as prefixes of interest. Removing 346 places using SCC suffix rule.2 ms
Discarding 346 places :
Also discarding 273 output transitions
Drop transitions (Output transitions of discarded places.) removed 273 transitions
Drop transitions (Empty/Sink Transition effects.) removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 363 transition count 297
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 35 place count 362 transition count 297
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 35 place count 362 transition count 293
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 43 place count 358 transition count 293
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 357 transition count 292
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 54 place count 357 transition count 283
Reduce places removed 9 places and 0 transitions.
Graph (complete) has 685 edges and 348 vertex of which 264 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.1 ms
Discarding 84 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Iterating post reduction 2 with 10 rules applied. Total rules applied 64 place count 264 transition count 219
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 70 place count 264 transition count 213
Applied a total of 70 rules in 140 ms. Remains 264 /709 variables (removed 445) and now considering 213/603 (removed 390) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 140 ms. Remains : 264/709 places, 213/603 transitions.
RANDOM walk for 40000 steps (8 resets) in 460 ms. (86 steps per ms) remains 1/2 properties
BEST_FIRST walk for 3844 steps (0 resets) in 35 ms. (106 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-01 13:35:23] [INFO ] Flatten gal took : 74 ms
[2024-06-01 13:35:24] [INFO ] Flatten gal took : 71 ms
[2024-06-01 13:35:24] [INFO ] Input system was already deterministic with 949 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 1055 transition count 919
Reduce places removed 30 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 31 rules applied. Total rules applied 61 place count 1025 transition count 918
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 1024 transition count 918
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 62 place count 1024 transition count 888
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 122 place count 994 transition count 888
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 125 place count 991 transition count 885
Iterating global reduction 3 with 3 rules applied. Total rules applied 128 place count 991 transition count 885
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 172 place count 969 transition count 863
Applied a total of 172 rules in 219 ms. Remains 969 /1055 variables (removed 86) and now considering 863/949 (removed 86) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 219 ms. Remains : 969/1055 places, 863/949 transitions.
[2024-06-01 13:35:24] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:35:24] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:35:24] [INFO ] Input system was already deterministic with 863 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 1055 transition count 917
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 1023 transition count 917
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 64 place count 1023 transition count 885
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 128 place count 991 transition count 885
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 131 place count 988 transition count 882
Iterating global reduction 2 with 3 rules applied. Total rules applied 134 place count 988 transition count 882
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 180 place count 965 transition count 859
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 181 place count 965 transition count 859
Applied a total of 181 rules in 211 ms. Remains 965 /1055 variables (removed 90) and now considering 859/949 (removed 90) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 211 ms. Remains : 965/1055 places, 859/949 transitions.
[2024-06-01 13:35:24] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:35:24] [INFO ] Flatten gal took : 56 ms
[2024-06-01 13:35:24] [INFO ] Input system was already deterministic with 859 transitions.
RANDOM walk for 40000 steps (154 resets) in 976 ms. (40 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 278217 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :0 out of 1
Probabilistic random walk after 278217 steps, saw 97904 distinct states, run finished after 3006 ms. (steps per millisecond=92 ) properties seen :0
// Phase 1: matrix 859 rows 965 cols
[2024-06-01 13:35:28] [INFO ] Computed 210 invariants in 4 ms
[2024-06-01 13:35:28] [INFO ] State equation strengthened by 313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/965 variables, 208/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/965 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 859/1824 variables, 965/1175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1824 variables, 313/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1824 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1824 variables, 0/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1824/1824 variables, and 1488 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1027 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 965/965 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 72/74 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/965 variables, 208/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/965 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 859/1824 variables, 965/1175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1824 variables, 313/1488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1824 variables, 1/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1824 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1824 variables, 0/1489 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1824/1824 variables, and 1489 constraints, problems are : Problem set: 0 solved, 1 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 210/210 constraints, State Equation: 965/965 constraints, ReadFeed: 313/313 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1864ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2044 steps, including 9 resets, run visited all 1 properties in 38 ms. (steps per millisecond=53 )
FORMULA Parking-PT-864-CTLFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 44 ms.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1053 transition count 947
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1053 transition count 947
Applied a total of 4 rules in 60 ms. Remains 1053 /1055 variables (removed 2) and now considering 947/949 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 1053/1055 places, 947/949 transitions.
[2024-06-01 13:35:30] [INFO ] Flatten gal took : 41 ms
[2024-06-01 13:35:30] [INFO ] Flatten gal took : 44 ms
[2024-06-01 13:35:30] [INFO ] Input system was already deterministic with 947 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 55 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-06-01 13:35:30] [INFO ] Flatten gal took : 40 ms
[2024-06-01 13:35:30] [INFO ] Flatten gal took : 42 ms
[2024-06-01 13:35:30] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 57 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-06-01 13:35:30] [INFO ] Flatten gal took : 38 ms
[2024-06-01 13:35:30] [INFO ] Flatten gal took : 38 ms
[2024-06-01 13:35:31] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 56 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-06-01 13:35:31] [INFO ] Flatten gal took : 34 ms
[2024-06-01 13:35:31] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:35:31] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 58 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-06-01 13:35:31] [INFO ] Flatten gal took : 34 ms
[2024-06-01 13:35:31] [INFO ] Flatten gal took : 37 ms
[2024-06-01 13:35:31] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1053 transition count 947
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1053 transition count 947
Applied a total of 4 rules in 53 ms. Remains 1053 /1055 variables (removed 2) and now considering 947/949 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 1053/1055 places, 947/949 transitions.
[2024-06-01 13:35:31] [INFO ] Flatten gal took : 41 ms
[2024-06-01 13:35:31] [INFO ] Flatten gal took : 46 ms
[2024-06-01 13:35:31] [INFO ] Input system was already deterministic with 947 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 1054 transition count 917
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 1023 transition count 917
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 62 place count 1023 transition count 886
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 124 place count 992 transition count 886
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 127 place count 989 transition count 883
Iterating global reduction 2 with 3 rules applied. Total rules applied 130 place count 989 transition count 883
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 176 place count 966 transition count 860
Applied a total of 176 rules in 145 ms. Remains 966 /1055 variables (removed 89) and now considering 860/949 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 146 ms. Remains : 966/1055 places, 860/949 transitions.
[2024-06-01 13:35:31] [INFO ] Flatten gal took : 25 ms
[2024-06-01 13:35:32] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:35:32] [INFO ] Input system was already deterministic with 860 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 1053 transition count 947
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1053 transition count 947
Applied a total of 4 rules in 100 ms. Remains 1053 /1055 variables (removed 2) and now considering 947/949 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 101 ms. Remains : 1053/1055 places, 947/949 transitions.
[2024-06-01 13:35:32] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:35:32] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:35:32] [INFO ] Input system was already deterministic with 947 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 52 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-06-01 13:35:32] [INFO ] Flatten gal took : 49 ms
[2024-06-01 13:35:32] [INFO ] Flatten gal took : 34 ms
[2024-06-01 13:35:32] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 55 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-06-01 13:35:32] [INFO ] Flatten gal took : 30 ms
[2024-06-01 13:35:32] [INFO ] Flatten gal took : 32 ms
[2024-06-01 13:35:32] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 1055 transition count 920
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 1026 transition count 920
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 29 Pre rules applied. Total rules applied 58 place count 1026 transition count 891
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 116 place count 997 transition count 891
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 118 place count 995 transition count 889
Iterating global reduction 2 with 2 rules applied. Total rules applied 120 place count 995 transition count 889
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 164 place count 973 transition count 867
Applied a total of 164 rules in 161 ms. Remains 973 /1055 variables (removed 82) and now considering 867/949 (removed 82) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 161 ms. Remains : 973/1055 places, 867/949 transitions.
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 41 ms
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 39 ms
[2024-06-01 13:35:33] [INFO ] Input system was already deterministic with 867 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 82 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 35 ms
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 41 ms
[2024-06-01 13:35:33] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 53 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 28 ms
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 31 ms
[2024-06-01 13:35:33] [INFO ] Input system was already deterministic with 946 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1055/1055 places, 949/949 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 1052 transition count 946
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 1052 transition count 946
Applied a total of 6 rules in 53 ms. Remains 1052 /1055 variables (removed 3) and now considering 946/949 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54 ms. Remains : 1052/1055 places, 946/949 transitions.
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 32 ms
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 30 ms
[2024-06-01 13:35:33] [INFO ] Input system was already deterministic with 946 transitions.
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 35 ms
[2024-06-01 13:35:33] [INFO ] Flatten gal took : 36 ms
[2024-06-01 13:35:33] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 9 ms.
[2024-06-01 13:35:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1055 places, 949 transitions and 3192 arcs took 17 ms.
Total runtime 35576 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 : Parking-PT-864-CTLFireability-2024-00
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-02
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-03
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-04
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-05
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-06
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-07
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-08
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-09
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-10
Could not compute solution for formula : Parking-PT-864-CTLFireability-2024-11
Could not compute solution for formula : Parking-PT-864-CTLFireability-2023-12
Could not compute solution for formula : Parking-PT-864-CTLFireability-2023-13
Could not compute solution for formula : Parking-PT-864-CTLFireability-2023-14
Could not compute solution for formula : Parking-PT-864-CTLFireability-2023-15

BK_STOP 1717248934433

--------------------
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 Parking-PT-864-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/546/ctl_0_
ctl formula name Parking-PT-864-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/546/ctl_1_
ctl formula name Parking-PT-864-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/546/ctl_2_
ctl formula name Parking-PT-864-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/546/ctl_3_
ctl formula name Parking-PT-864-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/546/ctl_4_
ctl formula name Parking-PT-864-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/546/ctl_5_
ctl formula name Parking-PT-864-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/546/ctl_6_
ctl formula name Parking-PT-864-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/546/ctl_7_
ctl formula name Parking-PT-864-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/546/ctl_8_
ctl formula name Parking-PT-864-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/546/ctl_9_
ctl formula name Parking-PT-864-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/546/ctl_10_
ctl formula name Parking-PT-864-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/546/ctl_11_
ctl formula name Parking-PT-864-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/546/ctl_12_
ctl formula name Parking-PT-864-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/546/ctl_13_
ctl formula name Parking-PT-864-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/546/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Parking-PT-864"
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 Parking-PT-864, 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 r512-smll-171654406900098"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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