About the Execution of LTSMin+red for AutonomousCar-PT-06a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 481.363 | 34602.00 | 74350.00 | 282.00 | ?????????????T?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r468-smll-171620167400298.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 AutonomousCar-PT-06a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r468-smll-171620167400298
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 17:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 193K Apr 12 17:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 17:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 12 17:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 177K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-00
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-01
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-02
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-03
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-04
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-05
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-06
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-07
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-08
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-09
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-10
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2024-11
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-12
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-13
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-14
FORMULA_NAME AutonomousCar-PT-06a-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717212993252
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-06a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 03:36:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 03:36:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 03:36:35] [INFO ] Load time of PNML (sax parser for PT used): 297 ms
[2024-06-01 03:36:35] [INFO ] Transformed 65 places.
[2024-06-01 03:36:35] [INFO ] Transformed 417 transitions.
[2024-06-01 03:36:35] [INFO ] Found NUPN structural information;
[2024-06-01 03:36:35] [INFO ] Parsed PT model containing 65 places and 417 transitions and 3356 arcs in 495 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 115 ms.
Ensure Unique test removed 159 transitions
Reduce redundant transitions removed 159 transitions.
Support contains 51 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 258/258 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 257
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 257
Applied a total of 2 rules in 54 ms. Remains 64 /65 variables (removed 1) and now considering 257/258 (removed 1) transitions.
// Phase 1: matrix 257 rows 64 cols
[2024-06-01 03:36:35] [INFO ] Computed 10 invariants in 26 ms
[2024-06-01 03:36:36] [INFO ] Implicit Places using invariants in 426 ms returned []
[2024-06-01 03:36:36] [INFO ] Invariant cache hit.
[2024-06-01 03:36:36] [INFO ] State equation strengthened by 147 read => feed constraints.
[2024-06-01 03:36:36] [INFO ] Implicit Places using invariants and state equation in 313 ms returned [60, 62]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 800 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 62/65 places, 257/258 transitions.
Applied a total of 0 rules in 5 ms. Remains 62 /62 variables (removed 0) and now considering 257/257 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 886 ms. Remains : 62/65 places, 257/258 transitions.
Support contains 51 out of 62 places after structural reductions.
[2024-06-01 03:36:37] [INFO ] Flatten gal took : 140 ms
[2024-06-01 03:36:37] [INFO ] Flatten gal took : 51 ms
[2024-06-01 03:36:37] [INFO ] Input system was already deterministic with 257 transitions.
Reduction of identical properties reduced properties to check from 85 to 84
RANDOM walk for 40000 steps (2258 resets) in 2358 ms. (16 steps per ms) remains 16/84 properties
BEST_FIRST walk for 4004 steps (19 resets) in 72 ms. (54 steps per ms) remains 15/16 properties
BEST_FIRST walk for 4003 steps (20 resets) in 40 ms. (97 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (18 resets) in 49 ms. (80 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 53 ms. (74 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (21 resets) in 25 ms. (154 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (16 resets) in 15 ms. (250 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (18 resets) in 60 ms. (65 steps per ms) remains 14/15 properties
BEST_FIRST walk for 4004 steps (20 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4002 steps (19 resets) in 14 ms. (266 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (17 resets) in 34 ms. (114 steps per ms) remains 13/14 properties
BEST_FIRST walk for 4003 steps (18 resets) in 15 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (18 resets) in 10 ms. (364 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (22 resets) in 10 ms. (364 steps per ms) remains 13/13 properties
BEST_FIRST walk for 4004 steps (16 resets) in 34 ms. (114 steps per ms) remains 13/13 properties
// Phase 1: matrix 257 rows 62 cols
[2024-06-01 03:36:38] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 03:36:38] [INFO ] State equation strengthened by 147 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp82 is UNSAT
At refinement iteration 1 (OVERLAPS) 25/56 variables, 8/8 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/8 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 254/310 variables, 56/64 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/310 variables, 146/210 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 0/210 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (OVERLAPS) 8/318 variables, 6/216 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/318 variables, 0/216 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1/319 variables, 1/217 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/319 variables, 0/217 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 319/319 variables, and 217 constraints, problems are : Problem set: 4 solved, 9 unsolved in 1221 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 30/47 variables, 7/7 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 7/54 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 251/305 variables, 54/62 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/305 variables, 146/208 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/305 variables, 0/208 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 11/316 variables, 6/214 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/316 variables, 9/223 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/316 variables, 0/223 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 2/318 variables, 2/225 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/318 variables, 0/225 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 1/319 variables, 1/226 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/319 variables, 0/226 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 15 (OVERLAPS) 0/319 variables, 0/226 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 319/319 variables, and 226 constraints, problems are : Problem set: 4 solved, 9 unsolved in 2312 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 62/62 constraints, ReadFeed: 147/147 constraints, PredecessorRefiner: 9/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 3794ms problems are : Problem set: 4 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 5 properties in 19608 ms.
Support contains 14 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 257/257 transitions.
Graph (complete) has 518 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 61 transition count 250
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 57 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 56 transition count 249
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 18 place count 51 transition count 214
Iterating global reduction 3 with 5 rules applied. Total rules applied 23 place count 51 transition count 214
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 29 place count 48 transition count 211
Free-agglomeration rule applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 33 place count 48 transition count 207
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 49 place count 44 transition count 195
Applied a total of 49 rules in 120 ms. Remains 44 /62 variables (removed 18) and now considering 195/257 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 44/62 places, 195/257 transitions.
RANDOM walk for 40000 steps (1907 resets) in 389 ms. (102 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40003 steps (189 resets) in 174 ms. (228 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (236 resets) in 126 ms. (314 steps per ms) remains 2/3 properties
// Phase 1: matrix 195 rows 44 cols
[2024-06-01 03:37:02] [INFO ] Computed 9 invariants in 3 ms
[2024-06-01 03:37:02] [INFO ] State equation strengthened by 104 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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/42 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/237 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 104/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/239 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/239 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 239/239 variables, and 157 constraints, problems are : Problem set: 0 solved, 2 unsolved in 238 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 13/23 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/42 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 195/237 variables, 42/51 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 104/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 2/239 variables, 2/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/239 variables, 2/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/239 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/239 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 239/239 variables, and 159 constraints, problems are : Problem set: 0 solved, 2 unsolved in 286 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 44/44 constraints, ReadFeed: 104/104 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 580ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 293 ms.
Support contains 10 out of 44 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 44/44 places, 195/195 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 1 rules applied. Total rules applied 1 place count 44 transition count 194
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 43 transition count 194
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 43 transition count 192
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 18 place count 41 transition count 180
Applied a total of 18 rules in 45 ms. Remains 41 /44 variables (removed 3) and now considering 180/195 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 41/44 places, 180/195 transitions.
RANDOM walk for 40000 steps (993 resets) in 386 ms. (103 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (108 resets) in 155 ms. (256 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (244 resets) in 149 ms. (266 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 1122705 steps, run visited all 2 properties in 1655 ms. (steps per millisecond=678 )
Probabilistic random walk after 1122705 steps, saw 158823 distinct states, run finished after 1663 ms. (steps per millisecond=675 ) properties seen :2
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 03:37:05] [INFO ] Flatten gal took : 39 ms
[2024-06-01 03:37:05] [INFO ] Flatten gal took : 40 ms
[2024-06-01 03:37:05] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 49 out of 62 places (down from 51) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 243
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 243
Applied a total of 4 rules in 4 ms. Remains 60 /62 variables (removed 2) and now considering 243/257 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 60/62 places, 243/257 transitions.
[2024-06-01 03:37:05] [INFO ] Flatten gal took : 32 ms
[2024-06-01 03:37:05] [INFO ] Flatten gal took : 30 ms
[2024-06-01 03:37:05] [INFO ] Input system was already deterministic with 243 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 4 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 58/62 places, 229/257 transitions.
[2024-06-01 03:37:05] [INFO ] Flatten gal took : 24 ms
[2024-06-01 03:37:05] [INFO ] Flatten gal took : 21 ms
[2024-06-01 03:37:05] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 56 transition count 215
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 56 transition count 215
Applied a total of 12 rules in 6 ms. Remains 56 /62 variables (removed 6) and now considering 215/257 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 56/62 places, 215/257 transitions.
[2024-06-01 03:37:05] [INFO ] Flatten gal took : 26 ms
[2024-06-01 03:37:05] [INFO ] Flatten gal took : 26 ms
[2024-06-01 03:37:05] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 236
Applied a total of 6 rules in 5 ms. Remains 59 /62 variables (removed 3) and now considering 236/257 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 59/62 places, 236/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 28 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 29 ms
[2024-06-01 03:37:06] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 62 transition count 252
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 57 transition count 251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 56 transition count 250
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 55 transition count 250
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 51 transition count 222
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 51 transition count 222
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 50 transition count 221
Applied a total of 24 rules in 56 ms. Remains 50 /62 variables (removed 12) and now considering 221/257 (removed 36) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 50/62 places, 221/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 24 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 31 ms
[2024-06-01 03:37:06] [INFO ] Input system was already deterministic with 221 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 236
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 236
Applied a total of 6 rules in 5 ms. Remains 59 /62 variables (removed 3) and now considering 236/257 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 59/62 places, 236/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 25 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 18 ms
[2024-06-01 03:37:06] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 57/62 places, 222/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:37:06] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 3 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 57/62 places, 222/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 14 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:37:06] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 250
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 250
Applied a total of 2 rules in 4 ms. Remains 61 /62 variables (removed 1) and now considering 250/257 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 61/62 places, 250/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 17 ms
[2024-06-01 03:37:06] [INFO ] Input system was already deterministic with 250 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 62 transition count 252
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 57 transition count 252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 57 transition count 251
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 12 place count 56 transition count 251
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 51 transition count 216
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 51 transition count 216
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 50 transition count 215
Applied a total of 24 rules in 27 ms. Remains 50 /62 variables (removed 12) and now considering 215/257 (removed 42) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 50/62 places, 215/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 19 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 20 ms
[2024-06-01 03:37:06] [INFO ] Input system was already deterministic with 215 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 57 transition count 222
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 57 transition count 222
Applied a total of 10 rules in 4 ms. Remains 57 /62 variables (removed 5) and now considering 222/257 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 57/62 places, 222/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 13 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:37:06] [INFO ] Input system was already deterministic with 222 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 58 transition count 229
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 58 transition count 229
Applied a total of 8 rules in 3 ms. Remains 58 /62 variables (removed 4) and now considering 229/257 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 58/62 places, 229/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 16 ms
[2024-06-01 03:37:06] [INFO ] Input system was already deterministic with 229 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 62 transition count 249
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 54 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 54 transition count 248
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 53 transition count 248
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 23 place count 48 transition count 213
Iterating global reduction 2 with 5 rules applied. Total rules applied 28 place count 48 transition count 213
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 46 transition count 211
Applied a total of 32 rules in 26 ms. Remains 46 /62 variables (removed 16) and now considering 211/257 (removed 46) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 46/62 places, 211/257 transitions.
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:37:06] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:37:07] [INFO ] Input system was already deterministic with 211 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 62 transition count 251
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 12 place count 56 transition count 249
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 16 place count 54 transition count 249
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 22 place count 48 transition count 207
Iterating global reduction 2 with 6 rules applied. Total rules applied 28 place count 48 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 30 place count 47 transition count 206
Applied a total of 30 rules in 25 ms. Remains 47 /62 variables (removed 15) and now considering 206/257 (removed 51) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 47/62 places, 206/257 transitions.
[2024-06-01 03:37:07] [INFO ] Flatten gal took : 15 ms
[2024-06-01 03:37:07] [INFO ] Flatten gal took : 18 ms
[2024-06-01 03:37:07] [INFO ] Input system was already deterministic with 206 transitions.
RANDOM walk for 2435 steps (174 resets) in 29 ms. (81 steps per ms) remains 0/1 properties
FORMULA AutonomousCar-PT-06a-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 257/257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 62 transition count 253
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 58 transition count 251
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 56 transition count 251
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 56 transition count 249
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 54 transition count 249
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 19 place count 51 transition count 228
Iterating global reduction 3 with 3 rules applied. Total rules applied 22 place count 51 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24 place count 50 transition count 227
Applied a total of 24 rules in 22 ms. Remains 50 /62 variables (removed 12) and now considering 227/257 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 50/62 places, 227/257 transitions.
[2024-06-01 03:37:07] [INFO ] Flatten gal took : 17 ms
[2024-06-01 03:37:07] [INFO ] Flatten gal took : 18 ms
[2024-06-01 03:37:07] [INFO ] Input system was already deterministic with 227 transitions.
[2024-06-01 03:37:07] [INFO ] Flatten gal took : 18 ms
[2024-06-01 03:37:07] [INFO ] Flatten gal took : 18 ms
[2024-06-01 03:37:07] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 13 ms.
[2024-06-01 03:37:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 257 transitions and 2165 arcs took 7 ms.
Total runtime 32366 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-00
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-01
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-02
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-03
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-04
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-05
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-06
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-07
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-08
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-09
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-10
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2024-11
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2023-12
Could not compute solution for formula : AutonomousCar-PT-06a-CTLFireability-2023-14
BK_STOP 1717213027854
--------------------
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 AutonomousCar-PT-06a-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/531/ctl_0_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/531/ctl_1_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/531/ctl_2_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/531/ctl_3_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/531/ctl_4_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/531/ctl_5_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/531/ctl_6_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/531/ctl_7_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/531/ctl_8_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/531/ctl_9_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/531/ctl_10_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/531/ctl_11_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/531/ctl_12_
ctl formula name AutonomousCar-PT-06a-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/531/ctl_13_
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="AutonomousCar-PT-06a"
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 AutonomousCar-PT-06a, 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 r468-smll-171620167400298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/AutonomousCar-PT-06a.tgz
mv AutonomousCar-PT-06a 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 '
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 ;