About the Execution of LTSMin+red for BridgeAndVehicles-PT-V50P20N20
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16195.960 | 288115.00 | 406875.00 | 283.20 | ?T?????????????F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399100234.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BridgeAndVehicles-PT-V50P20N20, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399100234
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 25K Apr 13 00:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 13 00:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 226K Apr 13 00:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 875K Apr 13 00:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 42K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 68K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 195K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 13 01:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 149K Apr 13 01:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 723K Apr 13 01:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 13 01:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.9M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717220696501
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:44:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:44:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:44:58] [INFO ] Load time of PNML (sax parser for PT used): 298 ms
[2024-06-01 05:44:58] [INFO ] Transformed 138 places.
[2024-06-01 05:44:58] [INFO ] Transformed 2348 transitions.
[2024-06-01 05:44:58] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 518 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 69 ms.
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 136 transition count 2348
Applied a total of 2 rules in 58 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-06-01 05:44:59] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:44:59] [INFO ] Computed 5 invariants in 22 ms
[2024-06-01 05:44:59] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:45:25] [INFO ] Deduced a trap composed of 5 places in 336 ms of which 27 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20127 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2345/2345 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2345 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2345 unsolved
[2024-06-01 05:45:56] [INFO ] Deduced a trap composed of 25 places in 244 ms of which 3 ms to minimize.
Problem TDEAD1248 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 1 solved, 2344 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2345 constraints, Known Traps: 2/2 constraints]
After SMT, in 57429ms problems are : Problem set: 1 solved, 2344 unsolved
Search for dead transitions found 1 dead transitions in 57524ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 1 transitions.
[2024-06-01 05:45:56] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:45:56] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:45:56] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 05:45:56] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-06-01 05:45:56] [INFO ] Invariant cache hit.
[2024-06-01 05:45:56] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:45:56] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 136/138 places, 2347/2348 transitions.
Applied a total of 0 rules in 15 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57968 ms. Remains : 136/138 places, 2347/2348 transitions.
Support contains 136 out of 136 places after structural reductions.
[2024-06-01 05:45:57] [INFO ] Flatten gal took : 323 ms
[2024-06-01 05:45:59] [INFO ] Flatten gal took : 308 ms
[2024-06-01 05:46:00] [INFO ] Input system was already deterministic with 2347 transitions.
Reduction of identical properties reduced properties to check from 52 to 51
RANDOM walk for 40000 steps (92 resets) in 4800 ms. (8 steps per ms) remains 27/51 properties
BEST_FIRST walk for 4003 steps (8 resets) in 590 ms. (6 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 27/27 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 26/27 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 25/26 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 25/25 properties
[2024-06-01 05:46:02] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-06-01 05:46:02] [INFO ] Invariant cache hit.
[2024-06-01 05:46:02] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp50 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 21 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 2 (OVERLAPS) 6/136 variables, 3/5 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 290/426 variables, 136/141 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 42/183 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 5 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 5 solved, 20 unsolved in 2470 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 48/134 variables, 4/5 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 290/424 variables, 134/139 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/181 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 1/182 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/182 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 2/426 variables, 2/184 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 19/203 constraints. Problems are: Problem set: 5 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/203 constraints. Problems are: Problem set: 5 solved, 20 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 426/426 variables, and 203 constraints, problems are : Problem set: 5 solved, 20 unsolved in 5010 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 20/25 constraints, Known Traps: 0/0 constraints]
After SMT, in 7792ms problems are : Problem set: 5 solved, 20 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 86 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2347/2347 transitions.
Applied a total of 0 rules in 441 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-06-01 05:46:10] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-06-01 05:46:10] [INFO ] Invariant cache hit.
[2024-06-01 05:46:10] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-06-01 05:46:36] [INFO ] Deduced a trap composed of 5 places in 305 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-06-01 05:47:06] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 0 ms to minimize.
Problem TDEAD1268 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1352 is UNSAT
Problem TDEAD1373 is UNSAT
Problem TDEAD1394 is UNSAT
Problem TDEAD1415 is UNSAT
Problem TDEAD1436 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 9 solved, 2335 unsolved in 20052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2344 constraints, Known Traps: 2/2 constraints]
After SMT, in 57915ms problems are : Problem set: 9 solved, 2335 unsolved
Search for dead transitions found 9 dead transitions in 57950ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/136 places, 2338/2347 transitions.
Applied a total of 0 rules in 196 ms. Remains 136 /136 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58595 ms. Remains : 136/136 places, 2338/2347 transitions.
RANDOM walk for 40000 steps (92 resets) in 801 ms. (49 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 20/20 properties
Interrupted probabilistic random walk after 155890 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :0 out of 20
Probabilistic random walk after 155890 steps, saw 42083 distinct states, run finished after 3005 ms. (steps per millisecond=51 ) properties seen :0
[2024-06-01 05:47:12] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-06-01 05:47:12] [INFO ] Invariant cache hit.
[2024-06-01 05:47:12] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 48/134 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 290/424 variables, 134/139 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 2/426 variables, 2/183 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 0 solved, 20 unsolved in 1900 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 48/134 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 290/424 variables, 134/139 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 2/426 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/426 variables, 19/203 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/426 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 0/426 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 203 constraints, problems are : Problem set: 0 solved, 20 unsolved in 6952 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 9089ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 2743 ms.
Support contains 86 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2338/2338 transitions.
Applied a total of 0 rules in 271 ms. Remains 136 /136 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 272 ms. Remains : 136/136 places, 2338/2338 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2338/2338 transitions.
Applied a total of 0 rules in 238 ms. Remains 136 /136 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
[2024-06-01 05:47:24] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-06-01 05:47:24] [INFO ] Invariant cache hit.
[2024-06-01 05:47:24] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 05:47:24] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-06-01 05:47:24] [INFO ] Invariant cache hit.
[2024-06-01 05:47:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:47:25] [INFO ] Implicit Places using invariants and state equation in 488 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 664 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 135/136 places, 2338/2338 transitions.
Applied a total of 0 rules in 266 ms. Remains 135 /135 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1169 ms. Remains : 135/136 places, 2338/2338 transitions.
RANDOM walk for 40000 steps (92 resets) in 676 ms. (59 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4001 steps (8 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 19/19 properties
Interrupted probabilistic random walk after 151507 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 19
Probabilistic random walk after 151507 steps, saw 40958 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
[2024-06-01 05:47:28] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
// Phase 1: matrix 290 rows 135 cols
[2024-06-01 05:47:28] [INFO ] Computed 5 invariants in 5 ms
[2024-06-01 05:47:28] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 49/134 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 290/424 variables, 134/139 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (OVERLAPS) 1/425 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (OVERLAPS) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 182 constraints, problems are : Problem set: 0 solved, 19 unsolved in 4733 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (OVERLAPS) 49/134 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (OVERLAPS) 290/424 variables, 134/139 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/424 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/424 variables, 19/200 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/424 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 8 (OVERLAPS) 1/425 variables, 1/201 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/425 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 10 (OVERLAPS) 0/425 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 201 constraints, problems are : Problem set: 0 solved, 19 unsolved in 9267 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 135/135 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 14227ms problems are : Problem set: 0 solved, 19 unsolved
Parikh walk visited 0 properties in 3261 ms.
Support contains 85 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 2338/2338 transitions.
Applied a total of 0 rules in 230 ms. Remains 135 /135 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 230 ms. Remains : 135/135 places, 2338/2338 transitions.
Successfully simplified 5 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:47:47] [INFO ] Flatten gal took : 188 ms
[2024-06-01 05:47:47] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 05:47:48] [INFO ] Flatten gal took : 240 ms
[2024-06-01 05:47:50] [INFO ] Input system was already deterministic with 2347 transitions.
Computed a total of 109 stabilizing places and 204 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2347/2347 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-06-01 05:47:50] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:47:50] [INFO ] Computed 5 invariants in 3 ms
[2024-06-01 05:47:50] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-06-01 05:48:19] [INFO ] Deduced a trap composed of 5 places in 328 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-06-01 05:48:50] [INFO ] Deduced a trap composed of 25 places in 247 ms of which 1 ms to minimize.
SMT process timed out in 60067ms, After SMT, problems are : Problem set: 0 solved, 2344 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in LTL mode , in 1 iterations and 60110 ms. Remains : 136/136 places, 2347/2347 transitions.
[2024-06-01 05:48:50] [INFO ] Flatten gal took : 77 ms
[2024-06-01 05:48:50] [INFO ] Flatten gal took : 111 ms
[2024-06-01 05:48:51] [INFO ] Input system was already deterministic with 2347 transitions.
Starting structural reductions in LTL mode, iteration 0 : 136/136 places, 2347/2347 transitions.
Applied a total of 0 rules in 9 ms. Remains 136 /136 variables (removed 0) and now considering 2347/2347 (removed 0) transitions.
Running 2344 sub problems to find dead transitions.
[2024-06-01 05:48:51] [INFO ] Flow matrix only has 290 transitions (discarded 2057 similar events)
[2024-06-01 05:48:51] [INFO ] Invariant cache hit.
[2024-06-01 05:48:51] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
[2024-06-01 05:49:24] [INFO ] Deduced a trap composed of 5 places in 350 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2344 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2344/2344 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2344 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2344 unsolved
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 : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-00
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-01
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-02
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-03
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-04
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-05
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-06
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-07
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-08
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-09
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-10
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-11
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-12
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-13
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-14
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-15
BK_STOP 1717220984616
--------------------
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 BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/620/ctl_0_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/620/ctl_1_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/620/ctl_2_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/620/ctl_3_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/620/ctl_4_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/620/ctl_5_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/620/ctl_6_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/620/ctl_7_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/620/ctl_8_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/620/ctl_9_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/620/ctl_10_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/620/ctl_11_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-12
ctl formula formula --ctl=/tmp/620/ctl_12_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-13
ctl formula formula --ctl=/tmp/620/ctl_13_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-14
ctl formula formula --ctl=/tmp/620/ctl_14_
ctl formula name BridgeAndVehicles-PT-V50P20N20-CTLFireability-2024-15
ctl formula formula --ctl=/tmp/620/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="BridgeAndVehicles-PT-V50P20N20"
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 BridgeAndVehicles-PT-V50P20N20, 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 r472-tajo-171620399100234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V50P20N20.tgz
mv BridgeAndVehicles-PT-V50P20N20 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 ;