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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.8K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:23 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Apr 11 16:23 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K Apr 11 16:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 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 49K 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-208-CTLFireability-2024-00
FORMULA_NAME Parking-PT-208-CTLFireability-2024-01
FORMULA_NAME Parking-PT-208-CTLFireability-2024-02
FORMULA_NAME Parking-PT-208-CTLFireability-2024-03
FORMULA_NAME Parking-PT-208-CTLFireability-2024-04
FORMULA_NAME Parking-PT-208-CTLFireability-2024-05
FORMULA_NAME Parking-PT-208-CTLFireability-2024-06
FORMULA_NAME Parking-PT-208-CTLFireability-2024-07
FORMULA_NAME Parking-PT-208-CTLFireability-2024-08
FORMULA_NAME Parking-PT-208-CTLFireability-2024-09
FORMULA_NAME Parking-PT-208-CTLFireability-2024-10
FORMULA_NAME Parking-PT-208-CTLFireability-2024-11
FORMULA_NAME Parking-PT-208-CTLFireability-2023-12
FORMULA_NAME Parking-PT-208-CTLFireability-2023-13
FORMULA_NAME Parking-PT-208-CTLFireability-2023-14
FORMULA_NAME Parking-PT-208-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717244838139

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-208
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:27:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:27:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:27:20] [INFO ] Load time of PNML (sax parser for PT used): 150 ms
[2024-06-01 12:27:20] [INFO ] Transformed 137 places.
[2024-06-01 12:27:20] [INFO ] Transformed 201 transitions.
[2024-06-01 12:27:20] [INFO ] Found NUPN structural information;
[2024-06-01 12:27:20] [INFO ] Parsed PT model containing 137 places and 201 transitions and 593 arcs in 374 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 27 ms.
Ensure Unique test removed 84 transitions
Reduce redundant transitions removed 84 transitions.
Support contains 70 out of 137 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 137/137 places, 117/117 transitions.
Applied a total of 0 rules in 19 ms. Remains 137 /137 variables (removed 0) and now considering 117/117 (removed 0) transitions.
// Phase 1: matrix 117 rows 137 cols
[2024-06-01 12:27:21] [INFO ] Computed 34 invariants in 20 ms
[2024-06-01 12:27:21] [INFO ] Implicit Places using invariants in 563 ms returned [28, 44, 64, 94, 102, 110, 118, 130, 132]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 615 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 128/137 places, 117/117 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 113
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 113
Applied a total of 8 rules in 38 ms. Remains 124 /128 variables (removed 4) and now considering 113/117 (removed 4) transitions.
// Phase 1: matrix 113 rows 124 cols
[2024-06-01 12:27:21] [INFO ] Computed 25 invariants in 6 ms
[2024-06-01 12:27:22] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 12:27:22] [INFO ] Invariant cache hit.
[2024-06-01 12:27:22] [INFO ] State equation strengthened by 26 read => feed constraints.
[2024-06-01 12:27:22] [INFO ] Implicit Places using invariants and state equation in 330 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 124/137 places, 113/117 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1253 ms. Remains : 124/137 places, 113/117 transitions.
Support contains 70 out of 124 places after structural reductions.
[2024-06-01 12:27:22] [INFO ] Flatten gal took : 72 ms
[2024-06-01 12:27:22] [INFO ] Flatten gal took : 30 ms
[2024-06-01 12:27:23] [INFO ] Input system was already deterministic with 113 transitions.
RANDOM walk for 40000 steps (1166 resets) in 3743 ms. (10 steps per ms) remains 15/67 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (9 resets) in 51 ms. (76 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 15/15 properties
[2024-06-01 12:27:24] [INFO ] Invariant cache hit.
[2024-06-01 12:27:24] [INFO ] State equation strengthened by 26 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp32 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp66 is UNSAT
At refinement iteration 2 (OVERLAPS) 84/124 variables, 23/25 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 0/25 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 113/237 variables, 124/149 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 26/175 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/175 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/237 variables, 0/175 constraints. Problems are: Problem set: 5 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 237/237 variables, and 175 constraints, problems are : Problem set: 5 solved, 10 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 10 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 2 (OVERLAPS) 95/124 variables, 24/25 constraints. Problems are: Problem set: 6 solved, 9 unsolved
[2024-06-01 12:27:25] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 33 ms to minimize.
[2024-06-01 12:27:25] [INFO ] Deduced a trap composed of 26 places in 79 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/124 variables, 2/27 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/124 variables, 0/27 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 113/237 variables, 124/151 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 26/177 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 9/186 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 0/186 constraints. Problems are: Problem set: 6 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/237 variables, 0/186 constraints. Problems are: Problem set: 6 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 237/237 variables, and 186 constraints, problems are : Problem set: 6 solved, 9 unsolved in 1223 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 124/124 constraints, ReadFeed: 26/26 constraints, PredecessorRefiner: 9/15 constraints, Known Traps: 2/2 constraints]
After SMT, in 1866ms problems are : Problem set: 6 solved, 9 unsolved
Parikh walk visited 3 properties in 1816 ms.
Support contains 20 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 107
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 118 transition count 107
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 15 place count 115 transition count 104
Iterating global reduction 2 with 3 rules applied. Total rules applied 18 place count 115 transition count 104
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 28 place count 110 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
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 30 place count 109 transition count 118
Free-agglomeration rule applied 14 times.
Iterating global reduction 2 with 14 rules applied. Total rules applied 44 place count 109 transition count 104
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 58 place count 95 transition count 104
Applied a total of 58 rules in 56 ms. Remains 95 /124 variables (removed 29) and now considering 104/113 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 95/124 places, 104/113 transitions.
RANDOM walk for 40000 steps (1466 resets) in 589 ms. (67 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40003 steps (250 resets) in 186 ms. (213 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (258 resets) in 111 ms. (357 steps per ms) remains 1/2 properties
// Phase 1: matrix 104 rows 95 cols
[2024-06-01 12:27:28] [INFO ] Computed 25 invariants in 4 ms
[2024-06-01 12:27:28] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/95 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/199 variables, 95/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 72/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/199 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 192 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 95/95 constraints, ReadFeed: 72/72 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 86/95 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/95 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 104/199 variables, 95/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/199 variables, 72/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/199 variables, 1/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/199 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/199 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 193 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, State Equation: 95/95 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 346ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 23 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 1 properties in 9 ms.
Successfully simplified 6 atomic propositions for a total of 16 simplifications.
FORMULA Parking-PT-208-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:27:28] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:27:28] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Parking-PT-208-CTLFireability-2023-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Parking-PT-208-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 12:27:28] [INFO ] Flatten gal took : 29 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 113 transitions.
Support contains 56 out of 124 places (down from 62) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 21 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 120/124 places, 109/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 10 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 121/124 places, 110/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 121 transition count 110
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Applied a total of 6 rules in 7 ms. Remains 121 /124 variables (removed 3) and now considering 110/113 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 121/124 places, 110/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 19 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 120/124 places, 109/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 12 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 9 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 123 transition count 109
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 120 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 120 transition count 106
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 117 transition count 106
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 113 transition count 102
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 113 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 110 transition count 99
Applied a total of 26 rules in 22 ms. Remains 110 /124 variables (removed 14) and now considering 99/113 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 110/124 places, 99/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 121 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 121 transition count 107
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 118 transition count 107
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 114 transition count 103
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 114 transition count 103
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 112 transition count 101
Applied a total of 24 rules in 19 ms. Remains 112 /124 variables (removed 12) and now considering 101/113 (removed 12) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 19 ms. Remains : 112/124 places, 101/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 101 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 4 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 120/124 places, 109/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 14 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 124 transition count 110
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 121 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 120 transition count 109
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 8 place count 120 transition count 106
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 14 place count 117 transition count 106
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 113 transition count 102
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 113 transition count 102
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 28 place count 110 transition count 99
Applied a total of 28 rules in 21 ms. Remains 110 /124 variables (removed 14) and now considering 99/113 (removed 14) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 21 ms. Remains : 110/124 places, 99/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 99 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 4 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 120/124 places, 109/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 122 transition count 111
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 122 transition count 111
Applied a total of 4 rules in 4 ms. Remains 122 /124 variables (removed 2) and now considering 111/113 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 122/124 places, 111/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 4 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 120/124 places, 109/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 3 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 120/124 places, 109/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 109 transitions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 113/113 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 120 transition count 109
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 120 transition count 109
Applied a total of 8 rules in 3 ms. Remains 120 /124 variables (removed 4) and now considering 109/113 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 120/124 places, 109/113 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:27:29] [INFO ] Input system was already deterministic with 109 transitions.
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:27:29] [INFO ] Flatten gal took : 8 ms
[2024-06-01 12:27:29] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 6 ms.
[2024-06-01 12:27:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 124 places, 113 transitions and 375 arcs took 3 ms.
Total runtime 9314 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-208-CTLFireability-2024-00
Could not compute solution for formula : Parking-PT-208-CTLFireability-2024-01
Could not compute solution for formula : Parking-PT-208-CTLFireability-2024-02
Could not compute solution for formula : Parking-PT-208-CTLFireability-2024-03
Could not compute solution for formula : Parking-PT-208-CTLFireability-2024-04
Could not compute solution for formula : Parking-PT-208-CTLFireability-2024-07
Could not compute solution for formula : Parking-PT-208-CTLFireability-2024-08
Could not compute solution for formula : Parking-PT-208-CTLFireability-2024-09
Could not compute solution for formula : Parking-PT-208-CTLFireability-2024-10
Could not compute solution for formula : Parking-PT-208-CTLFireability-2024-11
Could not compute solution for formula : Parking-PT-208-CTLFireability-2023-12
Could not compute solution for formula : Parking-PT-208-CTLFireability-2023-13
Could not compute solution for formula : Parking-PT-208-CTLFireability-2023-14

BK_STOP 1717244850410

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

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