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.r047-tajo-171620397700199.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 greatspnxred
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 r047-tajo-171620397700199
=====================================================================

--------------------
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 1716285208644

Invoking MCC driver with
BK_TOOL=greatspnxred
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 greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 09:53:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 09:53:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 09:53:30] [INFO ] Load time of PNML (sax parser for PT used): 190 ms
[2024-05-21 09:53:30] [INFO ] Transformed 108 places.
[2024-05-21 09:53:30] [INFO ] Transformed 2228 transitions.
[2024-05-21 09:53:30] [INFO ] Parsed PT model containing 108 places and 2228 transitions and 17190 arcs in 317 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 78 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (229 resets) in 3154 ms. (12 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 597 ms. (66 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (66 resets) in 298 ms. (133 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (80 resets) in 726 ms. (55 steps per ms) remains 8/9 properties
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (86 resets) in 427 ms. (93 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (72 resets) in 317 ms. (125 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (88 resets) in 1551 ms. (25 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (72 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (84 resets) in 250 ms. (159 steps per ms) remains 8/8 properties
[2024-05-21 09:53:33] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 09:53:33] [INFO ] Computed 7 invariants in 31 ms
[2024-05-21 09:53:33] [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 989 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 2093 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 3469ms problems are : Problem set: 2 solved, 6 unsolved
Parikh walk visited 0 properties in 12119 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.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 326 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 09:53:49] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 09:53:49] [INFO ] Computed 5 invariants in 13 ms
[2024-05-21 09:53:49] [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-05-21 09:54:12] [INFO ] Deduced a trap composed of 5 places in 306 ms of which 10 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 20066 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-05-21 09:54:43] [INFO ] Deduced a trap composed of 55 places in 251 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 20059 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 57430ms problems are : Problem set: 20 solved, 2205 unsolved
Search for dead transitions found 20 dead transitions in 57461ms
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 198 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 58028 ms. Remains : 106/108 places, 2208/2228 transitions.
RANDOM walk for 40000 steps (228 resets) in 965 ms. (41 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (108 resets) in 396 ms. (100 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (66 resets) in 176 ms. (226 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (80 resets) in 257 ms. (155 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (73 resets) in 278 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (72 resets) in 167 ms. (238 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (83 resets) in 214 ms. (186 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 231218 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 6
Probabilistic random walk after 231218 steps, saw 61428 distinct states, run finished after 3004 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-21 09:54:50] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 106 cols
[2024-05-21 09:54:50] [INFO ] Computed 5 invariants in 2 ms
[2024-05-21 09:54:50] [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 967 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 2924 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 3987ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 5823 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 169 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 169 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 163 ms. Remains 106 /106 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-21 09:55:00] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:55:00] [INFO ] Invariant cache hit.
[2024-05-21 09:55:01] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-21 09:55:01] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:55:01] [INFO ] Invariant cache hit.
[2024-05-21 09:55:01] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 09:55:01] [INFO ] Implicit Places using invariants and state equation in 530 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 714 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 190 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 1069 ms. Remains : 105/106 places, 2208/2208 transitions.
RANDOM walk for 40000 steps (228 resets) in 809 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (108 resets) in 275 ms. (144 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (67 resets) in 211 ms. (188 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (79 resets) in 357 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (72 resets) in 314 ms. (126 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (72 resets) in 231 ms. (172 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (83 resets) in 265 ms. (150 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 248474 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :0 out of 6
Probabilistic random walk after 248474 steps, saw 65428 distinct states, run finished after 3001 ms. (steps per millisecond=82 ) properties seen :0
[2024-05-21 09:55:05] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
// Phase 1: matrix 289 rows 105 cols
[2024-05-21 09:55:05] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 09:55:05] [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 734 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 2241 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 3071ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 9896 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 199 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 199 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 195 ms. Remains 105 /105 variables (removed 0) and now considering 2208/2208 (removed 0) transitions.
[2024-05-21 09:55:19] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:55:19] [INFO ] Invariant cache hit.
[2024-05-21 09:55:19] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-05-21 09:55:19] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:55:19] [INFO ] Invariant cache hit.
[2024-05-21 09:55:19] [INFO ] State equation strengthened by 101 read => feed constraints.
[2024-05-21 09:55:19] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 689 ms to find 0 implicit places.
[2024-05-21 09:55:20] [INFO ] Redundant transitions in 134 ms returned []
Running 2205 sub problems to find dead transitions.
[2024-05-21 09:55:20] [INFO ] Flow matrix only has 289 transitions (discarded 1919 similar events)
[2024-05-21 09:55:20] [INFO ] Invariant cache hit.
[2024-05-21 09:55:20] [INFO ] State equation strengthened by 101 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V20P10N50

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 108
TRANSITIONS: 2228
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.078s, Sys 0.000s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.025s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 614
MODEL NAME: /home/mcc/execution/model
108 places, 2228 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-02 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V20P10N50-ReachabilityFireability-2024-05 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716286533709

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 4194304 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="greatspnxred"
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 greatspnxred"
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 r047-tajo-171620397700199"
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 ;