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-171654406900090.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-832, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406900090
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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.7K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Apr 11 19:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 19:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Apr 11 18:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 18:16 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 251K 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-832-CTLFireability-2024-00
FORMULA_NAME Parking-PT-832-CTLFireability-2024-01
FORMULA_NAME Parking-PT-832-CTLFireability-2024-02
FORMULA_NAME Parking-PT-832-CTLFireability-2024-03
FORMULA_NAME Parking-PT-832-CTLFireability-2024-04
FORMULA_NAME Parking-PT-832-CTLFireability-2024-05
FORMULA_NAME Parking-PT-832-CTLFireability-2024-06
FORMULA_NAME Parking-PT-832-CTLFireability-2024-07
FORMULA_NAME Parking-PT-832-CTLFireability-2024-08
FORMULA_NAME Parking-PT-832-CTLFireability-2024-09
FORMULA_NAME Parking-PT-832-CTLFireability-2024-10
FORMULA_NAME Parking-PT-832-CTLFireability-2024-11
FORMULA_NAME Parking-PT-832-CTLFireability-2023-12
FORMULA_NAME Parking-PT-832-CTLFireability-2023-13
FORMULA_NAME Parking-PT-832-CTLFireability-2023-14
FORMULA_NAME Parking-PT-832-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717247594424

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-832
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 13:13:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 13:13:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 13:13:16] [INFO ] Load time of PNML (sax parser for PT used): 208 ms
[2024-06-01 13:13:16] [INFO ] Transformed 737 places.
[2024-06-01 13:13:16] [INFO ] Transformed 993 transitions.
[2024-06-01 13:13:16] [INFO ] Found NUPN structural information;
[2024-06-01 13:13:16] [INFO ] Parsed PT model containing 737 places and 993 transitions and 2993 arcs in 382 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Ensure Unique test removed 384 transitions
Reduce redundant transitions removed 384 transitions.
Support contains 157 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 609/609 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 732 transition count 604
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 732 transition count 604
Applied a total of 10 rules in 156 ms. Remains 732 /737 variables (removed 5) and now considering 604/609 (removed 5) transitions.
// Phase 1: matrix 604 rows 732 cols
[2024-06-01 13:13:16] [INFO ] Computed 184 invariants in 39 ms
[2024-06-01 13:13:18] [INFO ] Implicit Places using invariants in 1132 ms returned [136, 144, 152, 160, 184, 186, 221, 229, 237, 261, 263, 290, 298, 306, 338, 340, 376, 384, 392, 416, 445, 453, 461, 469, 493, 495, 523, 531, 539, 547, 571, 573, 600, 608, 616, 624, 648, 677, 685, 725, 727]
Discarding 41 places :
Implicit Place search using SMT only with invariants took 1180 ms to find 41 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 691/737 places, 604/609 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 666 transition count 579
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 666 transition count 579
Applied a total of 50 rules in 66 ms. Remains 666 /691 variables (removed 25) and now considering 579/604 (removed 25) transitions.
// Phase 1: matrix 579 rows 666 cols
[2024-06-01 13:13:18] [INFO ] Computed 143 invariants in 7 ms
[2024-06-01 13:13:18] [INFO ] Implicit Places using invariants in 489 ms returned []
[2024-06-01 13:13:18] [INFO ] Invariant cache hit.
[2024-06-01 13:13:19] [INFO ] State equation strengthened by 152 read => feed constraints.
[2024-06-01 13:13:19] [INFO ] Implicit Places using invariants and state equation in 1303 ms returned []
Implicit Place search using SMT with State Equation took 1796 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 666/737 places, 579/609 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3225 ms. Remains : 666/737 places, 579/609 transitions.
Support contains 157 out of 666 places after structural reductions.
[2024-06-01 13:13:20] [INFO ] Flatten gal took : 133 ms
[2024-06-01 13:13:20] [INFO ] Flatten gal took : 61 ms
[2024-06-01 13:13:20] [INFO ] Input system was already deterministic with 579 transitions.
Support contains 154 out of 666 places (down from 157) after GAL structural reductions.
RANDOM walk for 40000 steps (202 resets) in 3397 ms. (11 steps per ms) remains 16/87 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 16/16 properties
[2024-06-01 13:13:21] [INFO ] Invariant cache hit.
[2024-06-01 13:13:21] [INFO ] State equation strengthened by 152 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp65 is UNSAT
At refinement iteration 1 (OVERLAPS) 347/396 variables, 31/31 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 270/666 variables, 112/143 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/666 variables, 0/143 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 579/1245 variables, 666/809 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1245 variables, 152/961 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1245 variables, 0/961 constraints. Problems are: Problem set: 1 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 0/1245 variables, 0/961 constraints. Problems are: Problem set: 1 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1245/1245 variables, and 961 constraints, problems are : Problem set: 1 solved, 15 unsolved in 2029 ms.
Refiners :[Positive P Invariants (semi-flows): 143/143 constraints, State Equation: 666/666 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Problem AtomicPropp79 is UNSAT
At refinement iteration 1 (OVERLAPS) 347/393 variables, 30/30 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/393 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 273/666 variables, 113/143 constraints. Problems are: Problem set: 2 solved, 14 unsolved
[2024-06-01 13:13:24] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 14 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/666 variables, 1/144 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/666 variables, 0/144 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 579/1245 variables, 666/810 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1245 variables, 152/962 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1245 variables, 14/976 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1245 variables, 0/976 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 0/1245 variables, 0/976 constraints. Problems are: Problem set: 2 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1245/1245 variables, and 976 constraints, problems are : Problem set: 2 solved, 14 unsolved in 3345 ms.
Refiners :[Positive P Invariants (semi-flows): 143/143 constraints, State Equation: 666/666 constraints, ReadFeed: 152/152 constraints, PredecessorRefiner: 14/16 constraints, Known Traps: 1/1 constraints]
After SMT, in 5463ms problems are : Problem set: 2 solved, 14 unsolved
Fused 14 Parikh solutions to 13 different solutions.
Parikh walk visited 6 properties in 14045 ms.
Support contains 20 out of 666 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 666/666 places, 579/579 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 666 transition count 564
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 651 transition count 564
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 30 place count 651 transition count 549
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 60 place count 636 transition count 549
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 64 place count 632 transition count 545
Iterating global reduction 2 with 4 rules applied. Total rules applied 68 place count 632 transition count 545
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 134 place count 599 transition count 512
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -38
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 138 place count 597 transition count 550
Free-agglomeration rule applied 140 times.
Iterating global reduction 2 with 140 rules applied. Total rules applied 278 place count 597 transition count 410
Reduce places removed 140 places and 0 transitions.
Iterating post reduction 2 with 140 rules applied. Total rules applied 418 place count 457 transition count 410
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 422 place count 457 transition count 406
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 426 place count 453 transition count 406
Applied a total of 426 rules in 410 ms. Remains 453 /666 variables (removed 213) and now considering 406/579 (removed 173) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 411 ms. Remains : 453/666 places, 406/579 transitions.
RANDOM walk for 40000 steps (8 resets) in 372 ms. (107 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 254 ms. (156 steps per ms) remains 4/5 properties
// Phase 1: matrix 406 rows 453 cols
[2024-06-01 13:13:42] [INFO ] Computed 143 invariants in 7 ms
[2024-06-01 13:13:42] [INFO ] State equation strengthened by 345 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 87/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 356/453 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 406/859 variables, 453/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/859 variables, 345/941 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 0/859 variables, 0/941 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 859/859 variables, and 941 constraints, problems are : Problem set: 0 solved, 4 unsolved in 637 ms.
Refiners :[Positive P Invariants (semi-flows): 143/143 constraints, State Equation: 453/453 constraints, ReadFeed: 345/345 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 87/97 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 356/453 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 406/859 variables, 453/596 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/859 variables, 345/941 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/859 variables, 4/945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/859 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 0/859 variables, 0/945 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 859/859 variables, and 945 constraints, problems are : Problem set: 0 solved, 4 unsolved in 971 ms.
Refiners :[Positive P Invariants (semi-flows): 143/143 constraints, State Equation: 453/453 constraints, ReadFeed: 345/345 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 1681ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 3 properties in 197 ms.
Support contains 4 out of 453 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 453/453 places, 406/406 transitions.
Graph (complete) has 934 edges and 453 vertex of which 357 are kept as prefixes of interest. Removing 96 places using SCC suffix rule.2 ms
Discarding 96 places :
Also discarding 61 output transitions
Drop transitions (Output transitions of discarded places.) removed 61 transitions
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 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 25 rules applied. Total rules applied 26 place count 357 transition count 320
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 356 transition count 320
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 27 place count 356 transition count 319
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 29 place count 355 transition count 319
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 354 transition count 318
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 354 transition count 318
Free-agglomeration rule applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 354 transition count 312
Reduce places removed 6 places and 0 transitions.
Graph (complete) has 708 edges and 348 vertex of which 135 are kept as prefixes of interest. Removing 213 places using SCC suffix rule.1 ms
Discarding 213 places :
Also discarding 172 output transitions
Drop transitions (Output transitions of discarded places.) removed 172 transitions
Iterating post reduction 2 with 7 rules applied. Total rules applied 44 place count 135 transition count 140
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 80 place count 135 transition count 104
Applied a total of 80 rules in 66 ms. Remains 135 /453 variables (removed 318) and now considering 104/406 (removed 302) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 135/453 places, 104/406 transitions.
RANDOM walk for 40000 steps (669 resets) in 186 ms. (213 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4962 steps (9 resets) in 14 ms. (330 steps per ms) remains 0/1 properties
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
FORMULA Parking-PT-832-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 13:13:44] [INFO ] Flatten gal took : 46 ms
[2024-06-01 13:13:44] [INFO ] Flatten gal took : 43 ms
[2024-06-01 13:13:44] [INFO ] Input system was already deterministic with 579 transitions.
Support contains 145 out of 666 places (down from 146) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 574
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 574
Applied a total of 10 rules in 59 ms. Remains 661 /666 variables (removed 5) and now considering 574/579 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 661/666 places, 574/579 transitions.
[2024-06-01 13:13:44] [INFO ] Flatten gal took : 39 ms
[2024-06-01 13:13:44] [INFO ] Flatten gal took : 38 ms
[2024-06-01 13:13:44] [INFO ] Input system was already deterministic with 574 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 574
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 574
Applied a total of 10 rules in 30 ms. Remains 661 /666 variables (removed 5) and now considering 574/579 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 661/666 places, 574/579 transitions.
[2024-06-01 13:13:44] [INFO ] Flatten gal took : 31 ms
[2024-06-01 13:13:44] [INFO ] Flatten gal took : 31 ms
[2024-06-01 13:13:44] [INFO ] Input system was already deterministic with 574 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 666 transition count 564
Reduce places removed 15 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 16 rules applied. Total rules applied 31 place count 651 transition count 563
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 32 place count 650 transition count 563
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 32 place count 650 transition count 548
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 62 place count 635 transition count 548
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 631 transition count 544
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 631 transition count 544
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 104 place count 614 transition count 527
Applied a total of 104 rules in 93 ms. Remains 614 /666 variables (removed 52) and now considering 527/579 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 614/666 places, 527/579 transitions.
[2024-06-01 13:13:44] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:13:44] [INFO ] Flatten gal took : 28 ms
[2024-06-01 13:13:45] [INFO ] Input system was already deterministic with 527 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 663 transition count 576
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 663 transition count 576
Applied a total of 6 rules in 28 ms. Remains 663 /666 variables (removed 3) and now considering 576/579 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 663/666 places, 576/579 transitions.
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 27 ms
[2024-06-01 13:13:45] [INFO ] Input system was already deterministic with 576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 574
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 574
Applied a total of 10 rules in 28 ms. Remains 661 /666 variables (removed 5) and now considering 574/579 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 661/666 places, 574/579 transitions.
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 25 ms
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:13:45] [INFO ] Input system was already deterministic with 574 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 662 transition count 575
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 662 transition count 575
Applied a total of 8 rules in 28 ms. Remains 662 /666 variables (removed 4) and now considering 575/579 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 662/666 places, 575/579 transitions.
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 24 ms
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 29 ms
[2024-06-01 13:13:45] [INFO ] Input system was already deterministic with 575 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 574
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 574
Applied a total of 10 rules in 28 ms. Remains 661 /666 variables (removed 5) and now considering 574/579 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 661/666 places, 574/579 transitions.
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 23 ms
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 24 ms
[2024-06-01 13:13:45] [INFO ] Input system was already deterministic with 574 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 574
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 574
Applied a total of 10 rules in 28 ms. Remains 661 /666 variables (removed 5) and now considering 574/579 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 661/666 places, 574/579 transitions.
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 23 ms
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 47 ms
[2024-06-01 13:13:45] [INFO ] Input system was already deterministic with 574 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 574
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 574
Applied a total of 10 rules in 28 ms. Remains 661 /666 variables (removed 5) and now considering 574/579 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 661/666 places, 574/579 transitions.
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 22 ms
[2024-06-01 13:13:45] [INFO ] Input system was already deterministic with 574 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 574
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 574
Applied a total of 10 rules in 28 ms. Remains 661 /666 variables (removed 5) and now considering 574/579 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 661/666 places, 574/579 transitions.
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:13:45] [INFO ] Flatten gal took : 22 ms
[2024-06-01 13:13:46] [INFO ] Input system was already deterministic with 574 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 662 transition count 575
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 662 transition count 575
Applied a total of 8 rules in 26 ms. Remains 662 /666 variables (removed 4) and now considering 575/579 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 662/666 places, 575/579 transitions.
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 26 ms
[2024-06-01 13:13:46] [INFO ] Input system was already deterministic with 575 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 663 transition count 576
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 663 transition count 576
Applied a total of 6 rules in 25 ms. Remains 663 /666 variables (removed 3) and now considering 576/579 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 663/666 places, 576/579 transitions.
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 21 ms
[2024-06-01 13:13:46] [INFO ] Input system was already deterministic with 576 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 666 transition count 565
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 652 transition count 564
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 651 transition count 564
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 30 place count 651 transition count 550
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 58 place count 637 transition count 550
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 632 transition count 545
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 632 transition count 545
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 104 place count 614 transition count 527
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 105 place count 614 transition count 527
Applied a total of 105 rules in 93 ms. Remains 614 /666 variables (removed 52) and now considering 527/579 (removed 52) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 93 ms. Remains : 614/666 places, 527/579 transitions.
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 19 ms
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 23 ms
[2024-06-01 13:13:46] [INFO ] Input system was already deterministic with 527 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 574
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 574
Applied a total of 10 rules in 27 ms. Remains 661 /666 variables (removed 5) and now considering 574/579 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 661/666 places, 574/579 transitions.
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 22 ms
[2024-06-01 13:13:46] [INFO ] Input system was already deterministic with 574 transitions.
Starting structural reductions in LTL mode, iteration 0 : 666/666 places, 579/579 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 661 transition count 574
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 661 transition count 574
Applied a total of 10 rules in 25 ms. Remains 661 /666 variables (removed 5) and now considering 574/579 (removed 5) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 661/666 places, 574/579 transitions.
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 20 ms
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 22 ms
[2024-06-01 13:13:46] [INFO ] Input system was already deterministic with 574 transitions.
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 23 ms
[2024-06-01 13:13:46] [INFO ] Flatten gal took : 24 ms
[2024-06-01 13:13:46] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 13:13:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 666 places, 579 transitions and 1963 arcs took 7 ms.
Total runtime 30689 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-832-CTLFireability-2024-00
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-01
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-02
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-03
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-04
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-05
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-06
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-07
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-08
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-09
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-10
Could not compute solution for formula : Parking-PT-832-CTLFireability-2024-11
Could not compute solution for formula : Parking-PT-832-CTLFireability-2023-12
Could not compute solution for formula : Parking-PT-832-CTLFireability-2023-13
Could not compute solution for formula : Parking-PT-832-CTLFireability-2023-15

BK_STOP 1717247627241

--------------------
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-832-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/535/ctl_0_
ctl formula name Parking-PT-832-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/535/ctl_1_
ctl formula name Parking-PT-832-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/535/ctl_2_
ctl formula name Parking-PT-832-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/535/ctl_3_
ctl formula name Parking-PT-832-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/535/ctl_4_
ctl formula name Parking-PT-832-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/535/ctl_5_
ctl formula name Parking-PT-832-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/535/ctl_6_
ctl formula name Parking-PT-832-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/535/ctl_7_
ctl formula name Parking-PT-832-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/535/ctl_8_
ctl formula name Parking-PT-832-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/535/ctl_9_
ctl formula name Parking-PT-832-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/535/ctl_10_
ctl formula name Parking-PT-832-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/535/ctl_11_
ctl formula name Parking-PT-832-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/535/ctl_12_
ctl formula name Parking-PT-832-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/535/ctl_13_
ctl formula name Parking-PT-832-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/535/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-832"
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-832, 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-171654406900090"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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