About the Execution of LTSMin+red for Parking-PT-432
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 525.808 | 23223.00 | 55585.00 | 244.30 | [undef] | Cannot compute |
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-171654406900082.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-432, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r512-smll-171654406900082
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K 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 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.4K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Apr 11 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Apr 11 17:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 11 17:32 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 192K 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-432-CTLFireability-2024-00
FORMULA_NAME Parking-PT-432-CTLFireability-2024-01
FORMULA_NAME Parking-PT-432-CTLFireability-2024-02
FORMULA_NAME Parking-PT-432-CTLFireability-2024-03
FORMULA_NAME Parking-PT-432-CTLFireability-2024-04
FORMULA_NAME Parking-PT-432-CTLFireability-2024-05
FORMULA_NAME Parking-PT-432-CTLFireability-2024-06
FORMULA_NAME Parking-PT-432-CTLFireability-2024-07
FORMULA_NAME Parking-PT-432-CTLFireability-2024-08
FORMULA_NAME Parking-PT-432-CTLFireability-2024-09
FORMULA_NAME Parking-PT-432-CTLFireability-2024-10
FORMULA_NAME Parking-PT-432-CTLFireability-2024-11
FORMULA_NAME Parking-PT-432-CTLFireability-2023-12
FORMULA_NAME Parking-PT-432-CTLFireability-2023-13
FORMULA_NAME Parking-PT-432-CTLFireability-2023-14
FORMULA_NAME Parking-PT-432-CTLFireability-2023-15
=== Now, execution of the tool begins
BK_START 1717246206270
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-432
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:50:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:50:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:50:08] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2024-06-01 12:50:08] [INFO ] Transformed 529 places.
[2024-06-01 12:50:08] [INFO ] Transformed 785 transitions.
[2024-06-01 12:50:08] [INFO ] Found NUPN structural information;
[2024-06-01 12:50:08] [INFO ] Parsed PT model containing 529 places and 785 transitions and 2329 arcs in 412 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 96 ms.
Ensure Unique test removed 328 transitions
Reduce redundant transitions removed 328 transitions.
Support contains 125 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 457/457 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 527 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 527 transition count 455
Applied a total of 4 rules in 116 ms. Remains 527 /529 variables (removed 2) and now considering 455/457 (removed 2) transitions.
// Phase 1: matrix 455 rows 527 cols
[2024-06-01 12:50:09] [INFO ] Computed 124 invariants in 45 ms
[2024-06-01 12:50:10] [INFO ] Implicit Places using invariants in 1108 ms returned [72, 80, 88, 96, 104, 120, 144, 189, 197, 205, 213, 229, 237, 245, 269, 314, 322, 330, 338, 346, 354, 362, 370, 394, 396, 440, 448, 456, 464, 472, 480, 488, 496, 520]
Discarding 34 places :
Implicit Place search using SMT only with invariants took 1167 ms to find 34 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 493/529 places, 455/457 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 470 transition count 432
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 470 transition count 432
Applied a total of 46 rules in 48 ms. Remains 470 /493 variables (removed 23) and now considering 432/455 (removed 23) transitions.
// Phase 1: matrix 432 rows 470 cols
[2024-06-01 12:50:10] [INFO ] Computed 90 invariants in 10 ms
[2024-06-01 12:50:10] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-06-01 12:50:10] [INFO ] Invariant cache hit.
[2024-06-01 12:50:10] [INFO ] State equation strengthened by 108 read => feed constraints.
[2024-06-01 12:50:11] [INFO ] Implicit Places using invariants and state equation in 1056 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 470/529 places, 432/457 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2788 ms. Remains : 470/529 places, 432/457 transitions.
Support contains 125 out of 470 places after structural reductions.
[2024-06-01 12:50:11] [INFO ] Flatten gal took : 104 ms
[2024-06-01 12:50:12] [INFO ] Flatten gal took : 46 ms
[2024-06-01 12:50:12] [INFO ] Input system was already deterministic with 432 transitions.
RANDOM walk for 40000 steps (360 resets) in 2958 ms. (13 steps per ms) remains 21/80 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 21/21 properties
[2024-06-01 12:50:13] [INFO ] Invariant cache hit.
[2024-06-01 12:50:13] [INFO ] State equation strengthened by 108 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 21 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 1 (OVERLAPS) 281/348 variables, 29/29 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/29 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 122/470 variables, 61/90 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 432/902 variables, 470/560 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/902 variables, 108/668 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/902 variables, 0/668 constraints. Problems are: Problem set: 2 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 0/902 variables, 0/668 constraints. Problems are: Problem set: 2 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 902/902 variables, and 668 constraints, problems are : Problem set: 2 solved, 19 unsolved in 2132 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 470/470 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 19 unsolved
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 284/348 variables, 29/29 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-06-01 12:50:16] [INFO ] Deduced a trap composed of 48 places in 131 ms of which 33 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 1/30 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/348 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 122/470 variables, 61/91 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-06-01 12:50:17] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 1/92 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 0/92 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 432/902 variables, 470/562 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/902 variables, 108/670 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/902 variables, 18/688 constraints. Problems are: Problem set: 3 solved, 18 unsolved
[2024-06-01 12:50:19] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 3 ms to minimize.
[2024-06-01 12:50:19] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/902 variables, 2/690 constraints. Problems are: Problem set: 3 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/902 variables, 0/690 constraints. Problems are: Problem set: 3 solved, 18 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 902/902 variables, and 690 constraints, problems are : Problem set: 3 solved, 18 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 470/470 constraints, ReadFeed: 108/108 constraints, PredecessorRefiner: 18/21 constraints, Known Traps: 4/4 constraints]
After SMT, in 7255ms problems are : Problem set: 3 solved, 18 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 58 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 432/432 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 470 transition count 422
Reduce places removed 10 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 11 rules applied. Total rules applied 21 place count 460 transition count 421
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 459 transition count 421
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 22 place count 459 transition count 411
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 42 place count 449 transition count 411
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 45 place count 446 transition count 408
Iterating global reduction 3 with 3 rules applied. Total rules applied 48 place count 446 transition count 408
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 74 place count 433 transition count 395
Free-agglomeration rule applied 72 times.
Iterating global reduction 3 with 72 rules applied. Total rules applied 146 place count 433 transition count 323
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 218 place count 361 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 219 place count 361 transition count 322
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 361 transition count 322
Applied a total of 221 rules in 169 ms. Remains 361 /470 variables (removed 109) and now considering 322/432 (removed 110) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 361/470 places, 322/432 transitions.
RANDOM walk for 40000 steps (491 resets) in 1039 ms. (38 steps per ms) remains 13/18 properties
BEST_FIRST walk for 40004 steps (42 resets) in 220 ms. (181 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (46 resets) in 171 ms. (232 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (47 resets) in 179 ms. (222 steps per ms) remains 10/12 properties
BEST_FIRST walk for 40004 steps (47 resets) in 176 ms. (226 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (44 resets) in 179 ms. (222 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (43 resets) in 178 ms. (223 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (43 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 184 ms. (216 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 193 ms. (206 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (41 resets) in 189 ms. (210 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (43 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
// Phase 1: matrix 322 rows 361 cols
[2024-06-01 12:50:21] [INFO ] Computed 90 invariants in 3 ms
[2024-06-01 12:50:21] [INFO ] State equation strengthened by 204 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 251/277 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 84/361 variables, 75/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/361 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 322/683 variables, 361/451 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/683 variables, 204/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/683 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 683/683 variables, and 655 constraints, problems are : Problem set: 0 solved, 8 unsolved in 698 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 361/361 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 251/277 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 12:50:22] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 84/361 variables, 75/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/361 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 322/683 variables, 361/452 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/683 variables, 204/656 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/683 variables, 8/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/683 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/683 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 683/683 variables, and 664 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 90/90 constraints, State Equation: 361/361 constraints, ReadFeed: 204/204 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 1833ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 5 properties in 1932 ms.
Support contains 15 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 322/322 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 361 transition count 320
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 359 transition count 319
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 358 transition count 319
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 6 place count 358 transition count 314
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 16 place count 353 transition count 314
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 20 place count 349 transition count 310
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 349 transition count 310
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 32 place count 345 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
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 34 place count 344 transition count 313
Free-agglomeration rule applied 14 times.
Iterating global reduction 3 with 14 rules applied. Total rules applied 48 place count 344 transition count 299
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 62 place count 330 transition count 299
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 330 transition count 297
Applied a total of 64 rules in 122 ms. Remains 330 /361 variables (removed 31) and now considering 297/322 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 330/361 places, 297/322 transitions.
RANDOM walk for 40000 steps (200 resets) in 255 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (10 resets) in 150 ms. (264 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (29 resets) in 98 ms. (404 steps per ms) remains 1/2 properties
BEST_FIRST walk for 34011 steps (29 resets) in 139 ms. (242 steps per ms) remains 0/1 properties
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2024-06-01 12:50:26] [INFO ] Flatten gal took : 40 ms
[2024-06-01 12:50:26] [INFO ] Flatten gal took : 40 ms
[2024-06-01 12:50:26] [INFO ] Input system was already deterministic with 432 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 424
Applied a total of 16 rules in 33 ms. Remains 462 /470 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 462/470 places, 424/432 transitions.
[2024-06-01 12:50:26] [INFO ] Flatten gal took : 28 ms
[2024-06-01 12:50:26] [INFO ] Flatten gal took : 31 ms
[2024-06-01 12:50:26] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 470 transition count 421
Reduce places removed 11 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 14 rules applied. Total rules applied 25 place count 459 transition count 418
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 456 transition count 418
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 28 place count 456 transition count 407
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 50 place count 445 transition count 407
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 57 place count 438 transition count 400
Iterating global reduction 3 with 7 rules applied. Total rules applied 64 place count 438 transition count 400
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 74 place count 433 transition count 395
Applied a total of 74 rules in 91 ms. Remains 433 /470 variables (removed 37) and now considering 395/432 (removed 37) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 94 ms. Remains : 433/470 places, 395/432 transitions.
[2024-06-01 12:50:26] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:50:26] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:50:26] [INFO ] Input system was already deterministic with 395 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 424
Applied a total of 16 rules in 50 ms. Remains 462 /470 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 462/470 places, 424/432 transitions.
[2024-06-01 12:50:26] [INFO ] Flatten gal took : 39 ms
[2024-06-01 12:50:26] [INFO ] Flatten gal took : 36 ms
[2024-06-01 12:50:26] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 424
Applied a total of 16 rules in 36 ms. Remains 462 /470 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 462/470 places, 424/432 transitions.
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 20 ms
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 21 ms
[2024-06-01 12:50:27] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 424
Applied a total of 16 rules in 33 ms. Remains 462 /470 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 462/470 places, 424/432 transitions.
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 21 ms
[2024-06-01 12:50:27] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 424
Applied a total of 16 rules in 40 ms. Remains 462 /470 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 462/470 places, 424/432 transitions.
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 21 ms
[2024-06-01 12:50:27] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 470 transition count 416
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 454 transition count 416
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 454 transition count 400
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 438 transition count 400
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 72 place count 430 transition count 392
Iterating global reduction 2 with 8 rules applied. Total rules applied 80 place count 430 transition count 392
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 90 place count 425 transition count 387
Applied a total of 90 rules in 58 ms. Remains 425 /470 variables (removed 45) and now considering 387/432 (removed 45) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 59 ms. Remains : 425/470 places, 387/432 transitions.
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 18 ms
[2024-06-01 12:50:27] [INFO ] Input system was already deterministic with 387 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 424
Applied a total of 16 rules in 18 ms. Remains 462 /470 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 462/470 places, 424/432 transitions.
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 20 ms
[2024-06-01 12:50:27] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 470 transition count 416
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 454 transition count 416
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 32 place count 454 transition count 400
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 64 place count 438 transition count 400
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 71 place count 431 transition count 393
Iterating global reduction 2 with 7 rules applied. Total rules applied 78 place count 431 transition count 393
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 88 place count 426 transition count 388
Applied a total of 88 rules in 52 ms. Remains 426 /470 variables (removed 44) and now considering 388/432 (removed 44) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 53 ms. Remains : 426/470 places, 388/432 transitions.
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:50:27] [INFO ] Input system was already deterministic with 388 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 424
Applied a total of 16 rules in 18 ms. Remains 462 /470 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 462/470 places, 424/432 transitions.
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 20 ms
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 32 ms
[2024-06-01 12:50:27] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 463 transition count 425
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 463 transition count 425
Applied a total of 14 rules in 16 ms. Remains 463 /470 variables (removed 7) and now considering 425/432 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17 ms. Remains : 463/470 places, 425/432 transitions.
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 18 ms
[2024-06-01 12:50:27] [INFO ] Flatten gal took : 36 ms
[2024-06-01 12:50:28] [INFO ] Input system was already deterministic with 425 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 464 transition count 426
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 464 transition count 426
Applied a total of 12 rules in 19 ms. Remains 464 /470 variables (removed 6) and now considering 426/432 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 464/470 places, 426/432 transitions.
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 21 ms
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:50:28] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 424
Applied a total of 16 rules in 17 ms. Remains 462 /470 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 462/470 places, 424/432 transitions.
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 22 ms
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 20 ms
[2024-06-01 12:50:28] [INFO ] Input system was already deterministic with 424 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 464 transition count 426
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 464 transition count 426
Applied a total of 12 rules in 15 ms. Remains 464 /470 variables (removed 6) and now considering 426/432 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 464/470 places, 426/432 transitions.
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 33 ms
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:50:28] [INFO ] Input system was already deterministic with 426 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 470 transition count 418
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 456 transition count 418
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 28 place count 456 transition count 404
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 56 place count 442 transition count 404
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 64 place count 434 transition count 396
Iterating global reduction 2 with 8 rules applied. Total rules applied 72 place count 434 transition count 396
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 82 place count 429 transition count 391
Applied a total of 82 rules in 64 ms. Remains 429 /470 variables (removed 41) and now considering 391/432 (removed 41) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 76 ms. Remains : 429/470 places, 391/432 transitions.
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:50:28] [INFO ] Input system was already deterministic with 391 transitions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 432/432 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 462 transition count 424
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 462 transition count 424
Applied a total of 16 rules in 13 ms. Remains 462 /470 variables (removed 8) and now considering 424/432 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 462/470 places, 424/432 transitions.
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 22 ms
[2024-06-01 12:50:28] [INFO ] Input system was already deterministic with 424 transitions.
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:50:28] [INFO ] Flatten gal took : 28 ms
[2024-06-01 12:50:28] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2024-06-01 12:50:28] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 470 places, 432 transitions and 1459 arcs took 16 ms.
Total runtime 20862 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 : Parking-PT-432-CTLFireability-2024-00
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-01
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-02
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-03
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-04
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-05
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-06
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-07
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-08
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-09
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-10
Could not compute solution for formula : Parking-PT-432-CTLFireability-2024-11
Could not compute solution for formula : Parking-PT-432-CTLFireability-2023-12
Could not compute solution for formula : Parking-PT-432-CTLFireability-2023-13
Could not compute solution for formula : Parking-PT-432-CTLFireability-2023-14
Could not compute solution for formula : Parking-PT-432-CTLFireability-2023-15
BK_STOP 1717246229493
--------------------
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-432-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/542/ctl_0_
ctl formula name Parking-PT-432-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/542/ctl_1_
ctl formula name Parking-PT-432-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/542/ctl_2_
ctl formula name Parking-PT-432-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/542/ctl_3_
ctl formula name Parking-PT-432-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/542/ctl_4_
ctl formula name Parking-PT-432-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/542/ctl_5_
ctl formula name Parking-PT-432-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/542/ctl_6_
ctl formula name Parking-PT-432-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/542/ctl_7_
ctl formula name Parking-PT-432-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/542/ctl_8_
ctl formula name Parking-PT-432-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/542/ctl_9_
ctl formula name Parking-PT-432-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/542/ctl_10_
ctl formula name Parking-PT-432-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/542/ctl_11_
ctl formula name Parking-PT-432-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/542/ctl_12_
ctl formula name Parking-PT-432-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/542/ctl_13_
ctl formula name Parking-PT-432-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/542/ctl_14_
ctl formula name Parking-PT-432-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/542/ctl_15_
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-432"
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-432, 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-171654406900082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-432.tgz
mv Parking-PT-432 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 ;