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 |
16152.188 | 137885.00 | 230348.00 | 103.70 | T?TFTTFFFF??FF?T | 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-171620399100239.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 ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399100239
=====================================================================
--------------------
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-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1717220902586
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
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:48:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:48:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:48:24] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-06-01 05:48:24] [INFO ] Transformed 138 places.
[2024-06-01 05:48:24] [INFO ] Transformed 2348 transitions.
[2024-06-01 05:48:24] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 275 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 107 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40001 steps (92 resets) in 3309 ms. (12 steps per ms) remains 10/16 properties
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (28 resets) in 10653 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (39 resets) in 4802 ms. (8 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (36 resets) in 4165 ms. (9 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (32 resets) in 715 ms. (55 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (36 resets) in 804 ms. (49 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (33 resets) in 787 ms. (50 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (32 resets) in 838 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (32 resets) in 727 ms. (54 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (33 resets) in 802 ms. (49 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (36 resets) in 750 ms. (53 steps per ms) remains 10/10 properties
[2024-06-01 05:48:31] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-06-01 05:48:31] [INFO ] Computed 7 invariants in 26 ms
[2024-06-01 05:48:32] [INFO ] State equation strengthened by 42 read => feed constraints.
Problem BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-15 is UNSAT
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 2/138 variables, 2/7 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/138 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 290/428 variables, 138/145 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 42/187 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/187 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/428 variables, 0/187 constraints. Problems are: Problem set: 6 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 428/428 variables, and 187 constraints, problems are : Problem set: 6 solved, 4 unsolved in 1450 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 6 solved, 4 unsolved
[2024-06-01 05:48:40] [INFO ] Deduced a trap composed of 5 places in 330 ms of which 22 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/6 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2/138 variables, 2/8 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/138 variables, 0/8 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 290/428 variables, 138/146 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 42/188 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 428/428 variables, and 192 constraints, problems are : Problem set: 6 solved, 4 unsolved in 5043 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 138/138 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/10 constraints, Known Traps: 1/1 constraints]
After SMT, in 13251ms problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 136 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 2348/2348 transitions.
Graph (complete) has 1302 edges and 138 vertex of which 136 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.10 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 357 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:48:45] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:48:45] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:48:45] [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:49:10] [INFO ] Deduced a trap composed of 5 places in 293 ms of which 2 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 20064 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:49:40] [INFO ] Deduced a trap composed of 25 places in 188 ms of which 1 ms to minimize.
Problem TDEAD1248 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1353 is UNSAT
Problem TDEAD1374 is UNSAT
Problem TDEAD1395 is UNSAT
Problem TDEAD1416 is UNSAT
Problem TDEAD1437 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 10 solved, 2335 unsolved in 20050 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 56850ms problems are : Problem set: 10 solved, 2335 unsolved
Search for dead transitions found 10 dead transitions in 56883ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 10 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/138 places, 2338/2348 transitions.
Applied a total of 0 rules in 221 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 57486 ms. Remains : 136/138 places, 2338/2348 transitions.
RANDOM walk for 40000 steps (92 resets) in 1264 ms. (31 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (40 resets) in 7327 ms. (5 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 462 ms. (86 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (32 resets) in 372 ms. (107 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (33 resets) in 409 ms. (97 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 368237 steps, run timeout after 6001 ms. (steps per millisecond=61 ) properties seen :0 out of 4
Probabilistic random walk after 368237 steps, saw 97909 distinct states, run finished after 6005 ms. (steps per millisecond=61 ) properties seen :0
[2024-06-01 05:49:51] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-06-01 05:49:51] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:49:51] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 290/426 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/426 variables, 42/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/426 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 426/426 variables, and 183 constraints, problems are : Problem set: 0 solved, 4 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 05:49:53] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 290/426 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/426 variables, 42/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/426 variables, 4/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/426 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/426 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 426/426 variables, and 188 constraints, problems are : Problem set: 0 solved, 4 unsolved in 28498 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 30597ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 5096 ms.
Support contains 136 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 253 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 253 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 183 ms. Remains 136 /136 variables (removed 0) and now considering 2338/2338 (removed 0) transitions.
[2024-06-01 05:50:27] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-06-01 05:50:27] [INFO ] Invariant cache hit.
[2024-06-01 05:50:27] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 05:50:27] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-06-01 05:50:27] [INFO ] Invariant cache hit.
[2024-06-01 05:50:27] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-06-01 05:50:27] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-01 05:50:27] [INFO ] Redundant transitions in 119 ms returned []
Running 2335 sub problems to find dead transitions.
[2024-06-01 05:50:27] [INFO ] Flow matrix only has 290 transitions (discarded 2048 similar events)
[2024-06-01 05:50:27] [INFO ] Invariant cache hit.
[2024-06-01 05:50:27] [INFO ] State equation strengthened by 42 read => feed constraints.
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-ReachabilityFireability-2024-00
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-01
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-02
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-03
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-04
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-05
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-06
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-07
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-08
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-09
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-10
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-11
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-12
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-13
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-14
Could not compute solution for formula : BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-15
BK_STOP 1717221040471
--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
mcc2024
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/573/inv_0_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/573/inv_1_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-02
rfs formula type EF
rfs formula formula --invariant=/tmp/573/inv_2_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/573/inv_3_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/573/inv_4_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-05
rfs formula type EF
rfs formula formula --invariant=/tmp/573/inv_5_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-06
rfs formula type EF
rfs formula formula --invariant=/tmp/573/inv_6_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/573/inv_7_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-08
rfs formula type EF
rfs formula formula --invariant=/tmp/573/inv_8_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-09
rfs formula type EF
rfs formula formula --invariant=/tmp/573/inv_9_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/573/inv_10_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-11
rfs formula type EF
rfs formula formula --invariant=/tmp/573/inv_11_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/573/inv_12_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/573/inv_13_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/573/inv_14_
rfs formula name BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/573/inv_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="ReachabilityFireability"
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 ReachabilityFireability"
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-171620399100239"
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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;