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-171620399000199.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-V20P10N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399000199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.8M
-rw-r--r-- 1 mcc users 16K Apr 13 02:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 13 02:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 400K Apr 13 02:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 13 02:37 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 8.4K 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 144K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 406K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 13 03:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 206K Apr 13 03:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 227K Apr 13 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 886K Apr 13 03:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.8K 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.8M 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-V20P10N50-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717219917411

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-V20P10N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:31:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:31:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:31:59] [INFO ] Load time of PNML (sax parser for PT used): 174 ms
[2024-06-01 05:31:59] [INFO ] Transformed 108 places.
[2024-06-01 05:31:59] [INFO ] Transformed 2228 transitions.
[2024-06-01 05:31:59] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 292 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 48 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (228 resets) in 2190 ms. (18 steps per ms) remains 9/16 properties
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (108 resets) in 630 ms. (63 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (67 resets) in 239 ms. (166 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (79 resets) in 465 ms. (85 steps per ms) remains 8/9 properties
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (85 resets) in 427 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (72 resets) in 292 ms. (136 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (88 resets) in 931 ms. (42 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (72 resets) in 273 ms. (145 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (80 resets) in 261 ms. (152 steps per ms) remains 8/8 properties
[2024-06-01 05:32:01] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-06-01 05:32:01] [INFO ] Computed 7 invariants in 21 ms
[2024-06-01 05:32:01] [INFO ] State equation strengthened by 102 read => feed constraints.
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/94 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/94 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 14/108 variables, 5/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 2 solved, 6 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 47/108 variables, 5/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 6/223 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/398 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/398 variables, 0/223 constraints. Problems are: Problem set: 2 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 398/398 variables, and 223 constraints, problems are : Problem set: 2 solved, 6 unsolved in 2805 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 6/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 4044ms problems are : Problem set: 2 solved, 6 unsolved
Parikh walk visited 0 properties in 14606 ms.
Support contains 61 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 404 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-06-01 05:32:20] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-06-01 05:32:20] [INFO ] Computed 5 invariants in 8 ms
[2024-06-01 05:32:20] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:32:46] [INFO ] Deduced a trap composed of 5 places in 329 ms of which 18 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20061 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-06-01 05:33:15] [INFO ] Deduced a trap composed of 55 places in 286 ms of which 3 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1189 is UNSAT
Problem TDEAD1190 is UNSAT
Problem TDEAD1191 is UNSAT
Problem TDEAD1192 is UNSAT
Problem TDEAD1193 is UNSAT
Problem TDEAD1194 is UNSAT
Problem TDEAD1195 is UNSAT
Problem TDEAD1196 is UNSAT
Problem TDEAD1197 is UNSAT
Problem TDEAD1198 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 20 solved, 2205 unsolved in 20044 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 58151ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 58186ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/108 places, 2208/2228 transitions.
Applied a total of 0 rules in 220 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58842 ms. Remains : 106/108 places, 2208/2228 transitions.
RANDOM walk for 40000 steps (228 resets) in 736 ms. (54 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (108 resets) in 448 ms. (89 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (67 resets) in 237 ms. (168 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (80 resets) in 414 ms. (96 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (72 resets) in 188 ms. (211 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (72 resets) in 194 ms. (205 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (82 resets) in 163 ms. (243 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 214174 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 6
Probabilistic random walk after 214174 steps, saw 56668 distinct states, run finished after 3005 ms. (steps per millisecond=71 ) properties seen :0
[2024-06-01 05:33:22] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-06-01 05:33:22] [INFO ] Computed 5 invariants in 2 ms
[2024-06-01 05:33:22] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 43/104 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 289/393 variables, 104/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 101/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/395 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/395 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 395/395 variables, and 212 constraints, problems are : Problem set: 0 solved, 6 unsolved in 684 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 43/104 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 289/393 variables, 104/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 101/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2/395 variables, 2/214 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/395 variables, 4/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/395 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/395 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 395/395 variables, and 218 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2397 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3160ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 6952 ms.
Support contains 61 out of 106 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 181 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 106/106 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 106/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 173 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-06-01 05:33:33] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:33:33] [INFO ] Invariant cache hit.
[2024-06-01 05:33:33] [INFO ] Implicit Places using invariants in 167 ms returned []
[2024-06-01 05:33:33] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:33:33] [INFO ] Invariant cache hit.
[2024-06-01 05:33:33] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:33:33] [INFO ] Implicit Places using invariants and state equation in 472 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 649 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/106 places, 2208/2208 transitions.
Applied a total of 0 rules in 206 ms. Remains 105 /105 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1029 ms. Remains : 105/106 places, 2208/2208 transitions.
RANDOM walk for 40000 steps (228 resets) in 649 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (108 resets) in 302 ms. (132 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (66 resets) in 142 ms. (279 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (79 resets) in 220 ms. (181 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (72 resets) in 199 ms. (200 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (72 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (82 resets) in 227 ms. (175 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 193247 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 6
Probabilistic random walk after 193247 steps, saw 51161 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
[2024-06-01 05:33:37] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-06-01 05:33:37] [INFO ] Computed 5 invariants in 4 ms
[2024-06-01 05:33:37] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 43/104 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 289/393 variables, 104/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 101/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/394 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/394 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/394 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 394/394 variables, and 211 constraints, problems are : Problem set: 0 solved, 6 unsolved in 799 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 43/104 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 289/393 variables, 104/109 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/393 variables, 101/210 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/393 variables, 6/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/393 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 1/394 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/394 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/394 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 394/394 variables, and 217 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2676 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 105/105 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 3579ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 10870 ms.
Support contains 61 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2208/2208 transitions.
Applied a total of 0 rules in 206 ms. Remains 105 /105 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 206 ms. Remains : 105/105 places, 2208/2208 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2208/2208 transitions.
Applied a total of 0 rules in 196 ms. Remains 105 /105 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-06-01 05:33:52] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:33:52] [INFO ] Invariant cache hit.
[2024-06-01 05:33:52] [INFO ] Implicit Places using invariants in 174 ms returned []
[2024-06-01 05:33:52] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:33:52] [INFO ] Invariant cache hit.
[2024-06-01 05:33:53] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:33:53] [INFO ] Implicit Places using invariants and state equation in 551 ms returned []
Implicit Place search using SMT with State Equation took 727 ms to find 0 implicit places.
[2024-06-01 05:33:53] [INFO ] Redundant transitions in 150 ms returned []
Running 2205 sub problems to find dead transitions.
[2024-06-01 05:33:53] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-06-01 05:33:53] [INFO ] Invariant cache hit.
[2024-06-01 05:33:53] [INFO ] State equation strengthened by 101 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
[2024-06-01 05:34:15] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 105/394 variables, and 6 constraints, problems are : Problem set: 0 solved, 2205 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/105 constraints, ReadFeed: 0/101 constraints, PredecessorRefiner: 2205/2205 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2205 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/105 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/105 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2205 unsolved
Problem TDEAD20 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 3 (OVERLAPS) 289/394 variables, 105/111 constraints. Problems are: Problem set: 2 solved, 2203 unsolved
SMT process timed out in 75921ms, After SMT, problems are : Problem set: 2 solved, 2203 unsolved
Search for dead transitions found 2 dead transitions in 75955ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 105/105 places, 2206/2208 transitions.
Applied a total of 0 rules in 237 ms. Remains 105 /105 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-06-01 05:35:09] [INFO ] Redundant transitions in 126 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77424 ms. Remains : 105/105 places, 2206/2208 transitions.
RANDOM walk for 40001 steps (228 resets) in 1084 ms. (36 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (108 resets) in 256 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (66 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (80 resets) in 230 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (72 resets) in 177 ms. (224 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (72 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (83 resets) in 149 ms. (266 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 220390 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :0 out of 6
Probabilistic random walk after 220390 steps, saw 58444 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 05:35:13] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
// Phase 1: matrix 287 rows 105 cols
[2024-06-01 05:35:13] [INFO ] Computed 6 invariants in 2 ms
[2024-06-01 05:35:13] [INFO ] State equation strengthened by 101 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 43/104 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 287/391 variables, 104/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 101/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/392 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:35:14] [INFO ] Deduced a trap composed of 6 places in 469 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/392 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/392 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/392 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 392/392 variables, and 213 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1605 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 43/104 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 287/391 variables, 104/111 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 101/212 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/391 variables, 6/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/391 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 1/392 variables, 1/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/392 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/392 variables, 0/219 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 392/392 variables, and 219 constraints, problems are : Problem set: 0 solved, 6 unsolved in 2475 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 105/105 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 1/1 constraints]
After SMT, in 4188ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 8570 ms.
Support contains 61 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2206/2206 transitions.
Applied a total of 0 rules in 198 ms. Remains 105 /105 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 105/105 places, 2206/2206 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 2206/2206 transitions.
Applied a total of 0 rules in 186 ms. Remains 105 /105 variables (removed 0) and now considering 2206/2206 (removed 0) transitions.
[2024-06-01 05:35:26] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:35:26] [INFO ] Invariant cache hit.
[2024-06-01 05:35:27] [INFO ] Implicit Places using invariants in 207 ms returned []
[2024-06-01 05:35:27] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:35:27] [INFO ] Invariant cache hit.
[2024-06-01 05:35:27] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-06-01 05:35:27] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 887 ms to find 0 implicit places.
[2024-06-01 05:35:27] [INFO ] Redundant transitions in 48 ms returned []
Running 2203 sub problems to find dead transitions.
[2024-06-01 05:35:27] [INFO ] Flow matrix only has 287 transitions (discarded 1919 similar events)
[2024-06-01 05:35:27] [INFO ] Invariant cache hit.
[2024-06-01 05:35:27] [INFO ] State equation strengthened by 101 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-00
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-01
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-02
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-03
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-04
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-05
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-06
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-07
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-08
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-09
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-10
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-11
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-12
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-13
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-14
Could not compute solution for formula : BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-15

BK_STOP 1717220139645

--------------------
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-V20P10N50-ReachabilityFireability-2024-00
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_0_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-01
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_1_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-02
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_2_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-03
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_3_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-04
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_4_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-05
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_5_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-06
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_6_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-07
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_7_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-08
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_8_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-09
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_9_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-10
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_10_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/611/inv_11_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-12
rfs formula type EF
rfs formula formula --invariant=/tmp/611/inv_12_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-13
rfs formula type EF
rfs formula formula --invariant=/tmp/611/inv_13_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-14
rfs formula type EF
rfs formula formula --invariant=/tmp/611/inv_14_
rfs formula name BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-15
rfs formula type AG
rfs formula formula --invariant=/tmp/611/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-V20P10N50"
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-V20P10N50, 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-171620399000199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V20P10N50.tgz
mv BridgeAndVehicles-PT-V20P10N50 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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;