About the Execution of LTSMin+red for FireWire-PT-04
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 390.560 | 13020.00 | 31698.00 | 80.40 | ?F?T??????????T? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r553-tall-171734901100194.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 FireWire-PT-04, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901100194
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 13K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 FireWire-PT-04-CTLFireability-2024-00
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-01
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-02
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-03
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-04
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-05
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-06
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-07
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-08
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-09
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-10
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-11
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-12
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-13
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-14
FORMULA_NAME FireWire-PT-04-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717353697129
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:41:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 18:41:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:41:38] [INFO ] Load time of PNML (sax parser for PT used): 77 ms
[2024-06-02 18:41:38] [INFO ] Transformed 113 places.
[2024-06-02 18:41:38] [INFO ] Transformed 364 transitions.
[2024-06-02 18:41:38] [INFO ] Found NUPN structural information;
[2024-06-02 18:41:38] [INFO ] Parsed PT model containing 113 places and 364 transitions and 1349 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Ensure Unique test removed 56 transitions
Reduce redundant transitions removed 56 transitions.
Support contains 72 out of 113 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 113/113 places, 308/308 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 113 transition count 302
Applied a total of 6 rules in 30 ms. Remains 113 /113 variables (removed 0) and now considering 302/308 (removed 6) transitions.
[2024-06-02 18:41:38] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 113 cols
[2024-06-02 18:41:38] [INFO ] Computed 8 invariants in 17 ms
[2024-06-02 18:41:38] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-06-02 18:41:38] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
[2024-06-02 18:41:38] [INFO ] Invariant cache hit.
[2024-06-02 18:41:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-06-02 18:41:39] [INFO ] Implicit Places using invariants and state equation in 233 ms returned [61, 111]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 572 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 111/113 places, 302/308 transitions.
Applied a total of 0 rules in 9 ms. Remains 111 /111 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 629 ms. Remains : 111/113 places, 302/308 transitions.
Support contains 72 out of 111 places after structural reductions.
[2024-06-02 18:41:39] [INFO ] Flatten gal took : 45 ms
[2024-06-02 18:41:39] [INFO ] Flatten gal took : 26 ms
[2024-06-02 18:41:39] [INFO ] Input system was already deterministic with 302 transitions.
Support contains 70 out of 111 places (down from 72) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 74 to 72
RANDOM walk for 40000 steps (2149 resets) in 2298 ms. (17 steps per ms) remains 42/72 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4004 steps (10 resets) in 24 ms. (160 steps per ms) remains 42/42 properties
BEST_FIRST walk for 4003 steps (54 resets) in 17 ms. (222 steps per ms) remains 41/42 properties
BEST_FIRST walk for 4003 steps (42 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (63 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (58 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (10 resets) in 13 ms. (285 steps per ms) remains 31/41 properties
BEST_FIRST walk for 4003 steps (66 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (59 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (53 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (61 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4000 steps (68 resets) in 9 ms. (400 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (62 resets) in 12 ms. (307 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (64 resets) in 10 ms. (363 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (62 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4002 steps (54 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 29/31 properties
BEST_FIRST walk for 4002 steps (17 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (9 resets) in 10 ms. (364 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (105 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (55 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (63 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (71 resets) in 23 ms. (166 steps per ms) remains 28/29 properties
[2024-06-02 18:41:40] [INFO ] Flow matrix only has 276 transitions (discarded 26 similar events)
// Phase 1: matrix 276 rows 111 cols
[2024-06-02 18:41:40] [INFO ] Computed 6 invariants in 6 ms
[2024-06-02 18:41:40] [INFO ] State equation strengthened by 40 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp71 is UNSAT
At refinement iteration 2 (OVERLAPS) 71/104 variables, 5/38 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 71/109 constraints. Problems are: Problem set: 4 solved, 24 unsolved
[2024-06-02 18:41:40] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 7 ms to minimize.
[2024-06-02 18:41:40] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:41:40] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-06-02 18:41:41] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 4/113 constraints. Problems are: Problem set: 4 solved, 24 unsolved
[2024-06-02 18:41:41] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 1/114 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/114 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 2/106 variables, 1/115 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 2/117 constraints. Problems are: Problem set: 4 solved, 24 unsolved
[2024-06-02 18:41:41] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/118 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 11 (OVERLAPS) 272/378 variables, 106/224 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 38/262 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/262 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 5/383 variables, 3/265 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 3/268 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 1/269 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/269 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 18 (OVERLAPS) 3/386 variables, 2/271 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/386 variables, 2/273 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/386 variables, 0/273 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 1/387 variables, 1/274 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/387 variables, 0/274 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 23 (OVERLAPS) 0/387 variables, 0/274 constraints. Problems are: Problem set: 4 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 387/387 variables, and 274 constraints, problems are : Problem set: 4 solved, 24 unsolved in 2294 ms.
Refiners :[Domain max(s): 111/111 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 4 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/31 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 73/104 variables, 5/36 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 73/109 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 5/114 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/114 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 2/106 variables, 1/115 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 2/117 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 1/118 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 0/118 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 272/378 variables, 106/224 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/378 variables, 38/262 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/378 variables, 24/286 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/378 variables, 0/286 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 14 (OVERLAPS) 5/383 variables, 3/289 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/383 variables, 3/292 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/383 variables, 1/293 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/383 variables, 0/293 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 18 (OVERLAPS) 3/386 variables, 2/295 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/386 variables, 2/297 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/386 variables, 0/297 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 21 (OVERLAPS) 1/387 variables, 1/298 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/387 variables, 0/298 constraints. Problems are: Problem set: 4 solved, 24 unsolved
At refinement iteration 23 (OVERLAPS) 0/387 variables, 0/298 constraints. Problems are: Problem set: 4 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 387/387 variables, and 298 constraints, problems are : Problem set: 4 solved, 24 unsolved in 3282 ms.
Refiners :[Domain max(s): 111/111 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 111/111 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 24/28 constraints, Known Traps: 6/6 constraints]
After SMT, in 5660ms problems are : Problem set: 4 solved, 24 unsolved
Fused 24 Parikh solutions to 23 different solutions.
Parikh walk visited 0 properties in 1822 ms.
Support contains 31 out of 111 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 111/111 places, 302/302 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 4 place count 111 transition count 298
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 5 place count 110 transition count 298
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 5 place count 110 transition count 297
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 7 place count 109 transition count 297
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 108 transition count 295
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 108 transition count 295
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 105 transition count 302
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 21 place count 105 transition count 296
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 105 transition count 293
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 25 place count 105 transition count 295
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 28 place count 104 transition count 293
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 30 place count 104 transition count 291
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 103 transition count 290
Applied a total of 31 rules in 80 ms. Remains 103 /111 variables (removed 8) and now considering 290/302 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 103/111 places, 290/302 transitions.
RANDOM walk for 40000 steps (2558 resets) in 771 ms. (51 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (70 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (62 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (76 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (76 resets) in 19 ms. (200 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (46 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (81 resets) in 16 ms. (235 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (71 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (60 resets) in 18 ms. (210 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (77 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (67 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (66 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (78 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (70 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (10 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (14 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (10 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (9 resets) in 8 ms. (444 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (147 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (68 resets) in 10 ms. (364 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (59 resets) in 11 ms. (333 steps per ms) remains 24/24 properties
Finished probabilistic random walk after 112729 steps, run visited all 24 properties in 395 ms. (steps per millisecond=285 )
Probabilistic random walk after 112729 steps, saw 26019 distinct states, run finished after 398 ms. (steps per millisecond=283 ) properties seen :24
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA FireWire-PT-04-CTLFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:41:48] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-02 18:41:48] [INFO ] Flatten gal took : 18 ms
FORMULA FireWire-PT-04-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-02 18:41:48] [INFO ] Flatten gal took : 17 ms
[2024-06-02 18:41:48] [INFO ] Input system was already deterministic with 302 transitions.
Support contains 64 out of 111 places (down from 67) after GAL structural reductions.
Computed a total of 6 stabilizing places and 9 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 5 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 18:41:48] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:41:48] [INFO ] Flatten gal took : 15 ms
[2024-06-02 18:41:48] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 302/302 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 111 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 110 transition count 300
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 4 place count 109 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 108 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 108 transition count 298
Applied a total of 6 rules in 18 ms. Remains 108 /111 variables (removed 3) and now considering 298/302 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 108/111 places, 298/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 13 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 298 transitions.
RANDOM walk for 36936 steps (2326 resets) in 300 ms. (122 steps per ms) remains 0/1 properties
FORMULA FireWire-PT-04-CTLFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 302/302 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 111 transition count 301
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 110 transition count 301
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 110 transition count 300
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 4 place count 109 transition count 300
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 108 transition count 298
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 108 transition count 298
Applied a total of 6 rules in 22 ms. Remains 108 /111 variables (removed 3) and now considering 298/302 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 108/111 places, 298/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 298 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 4 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 4 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 3 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 4 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 12 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 11 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 3 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 2 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 2 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 110 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 110 transition count 300
Applied a total of 2 rules in 2 ms. Remains 110 /111 variables (removed 1) and now considering 300/302 (removed 2) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 110/111 places, 300/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 10 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 300 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Reduce places removed 1 places and 1 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 110 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 109 transition count 299
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 4 place count 108 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 107 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 107 transition count 297
Applied a total of 6 rules in 16 ms. Remains 107 /111 variables (removed 4) and now considering 297/302 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 16 ms. Remains : 107/111 places, 297/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Reduce places removed 1 places and 1 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 110 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 109 transition count 299
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 4 place count 108 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 107 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 107 transition count 297
Applied a total of 6 rules in 14 ms. Remains 107 /111 variables (removed 4) and now considering 297/302 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 107/111 places, 297/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 297 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 111/111 places, 302/302 transitions.
Reduce places removed 1 places and 1 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 110 transition count 300
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 109 transition count 300
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 109 transition count 299
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 4 place count 108 transition count 299
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 107 transition count 297
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 107 transition count 297
Applied a total of 6 rules in 11 ms. Remains 107 /111 variables (removed 4) and now considering 297/302 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 107/111 places, 297/302 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 8 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Input system was already deterministic with 297 transitions.
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Flatten gal took : 9 ms
[2024-06-02 18:41:49] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-02 18:41:49] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 111 places, 302 transitions and 1097 arcs took 3 ms.
Total runtime 11558 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 : FireWire-PT-04-CTLFireability-2024-00
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-02
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-04
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-05
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-06
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-07
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-08
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-09
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-10
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-11
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-12
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-13
Could not compute solution for formula : FireWire-PT-04-CTLFireability-2024-15
BK_STOP 1717353710149
--------------------
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 FireWire-PT-04-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/525/ctl_0_
ctl formula name FireWire-PT-04-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/525/ctl_1_
ctl formula name FireWire-PT-04-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/525/ctl_2_
ctl formula name FireWire-PT-04-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/525/ctl_3_
ctl formula name FireWire-PT-04-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/525/ctl_4_
ctl formula name FireWire-PT-04-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/525/ctl_5_
ctl formula name FireWire-PT-04-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/525/ctl_6_
ctl formula name FireWire-PT-04-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/525/ctl_7_
ctl formula name FireWire-PT-04-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/525/ctl_8_
ctl formula name FireWire-PT-04-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/525/ctl_9_
ctl formula name FireWire-PT-04-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/525/ctl_10_
ctl formula name FireWire-PT-04-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/525/ctl_11_
ctl formula name FireWire-PT-04-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/525/ctl_12_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-04"
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 FireWire-PT-04, 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 r553-tall-171734901100194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-04.tgz
mv FireWire-PT-04 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 ;