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

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

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-V50P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 10:28:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 10:28:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 10:28:10] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2024-05-21 10:28:10] [INFO ] Transformed 138 places.
[2024-05-21 10:28:10] [INFO ] Transformed 2348 transitions.
[2024-05-21 10:28:10] [INFO ] Parsed PT model containing 138 places and 2348 transitions and 18090 arcs in 262 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 98 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (92 resets) in 3718 ms. (10 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 40002 steps (28 resets) in 11473 ms. (3 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (40 resets) in 5139 ms. (7 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (36 resets) in 3426 ms. (11 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (32 resets) in 838 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (36 resets) in 773 ms. (51 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (32 resets) in 719 ms. (55 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (33 resets) in 718 ms. (55 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (32 resets) in 649 ms. (61 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (34 resets) in 762 ms. (52 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (35 resets) in 737 ms. (54 steps per ms) remains 10/10 properties
[2024-05-21 10:28:18] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 138 cols
[2024-05-21 10:28:18] [INFO ] Computed 7 invariants in 27 ms
[2024-05-21 10:28:18] [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 1813 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-05-21 10:28:27] [INFO ] Deduced a trap composed of 5 places in 348 ms of which 21 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 5048 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 13549ms 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 298 ms. Remains 136 /138 variables (removed 2) and now considering 2348/2348 (removed 0) transitions.
Running 2345 sub problems to find dead transitions.
[2024-05-21 10:28:32] [INFO ] Flow matrix only has 290 transitions (discarded 2058 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:28:32] [INFO ] Computed 5 invariants in 7 ms
[2024-05-21 10:28:32] [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-05-21 10:28:58] [INFO ] Deduced a trap composed of 5 places in 224 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 6 constraints, problems are : Problem set: 0 solved, 2345 unsolved in 20050 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-05-21 10:29:27] [INFO ] Deduced a trap composed of 25 places in 185 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 9 solved, 2336 unsolved in 20035 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 57046ms problems are : Problem set: 9 solved, 2336 unsolved
Search for dead transitions found 9 dead transitions in 57095ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 9 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/138 places, 2339/2348 transitions.
Applied a total of 0 rules in 177 ms. Remains 136 /136 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57596 ms. Remains : 136/138 places, 2339/2348 transitions.
RANDOM walk for 40000 steps (92 resets) in 1322 ms. (30 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (39 resets) in 7518 ms. (5 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (33 resets) in 360 ms. (110 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (33 resets) in 310 ms. (128 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (35 resets) in 298 ms. (133 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 502241 steps, run timeout after 6001 ms. (steps per millisecond=83 ) properties seen :0 out of 4
Probabilistic random walk after 502241 steps, saw 133667 distinct states, run finished after 6005 ms. (steps per millisecond=83 ) properties seen :0
[2024-05-21 10:29:38] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
// Phase 1: matrix 290 rows 136 cols
[2024-05-21 10:29:38] [INFO ] Computed 5 invariants in 1 ms
[2024-05-21 10:29:38] [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 1091 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-05-21 10:29:41] [INFO ] Deduced a trap composed of 5 places in 261 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 35216 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 37535ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 4938 ms.
Support contains 136 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2339/2339 transitions.
Applied a total of 0 rules in 245 ms. Remains 136 /136 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 245 ms. Remains : 136/136 places, 2339/2339 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2339/2339 transitions.
Applied a total of 0 rules in 168 ms. Remains 136 /136 variables (removed 0) and now considering 2339/2339 (removed 0) transitions.
[2024-05-21 10:30:21] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
[2024-05-21 10:30:21] [INFO ] Invariant cache hit.
[2024-05-21 10:30:21] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 10:30:21] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
[2024-05-21 10:30:21] [INFO ] Invariant cache hit.
[2024-05-21 10:30:21] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 10:30:21] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-05-21 10:30:21] [INFO ] Redundant transitions in 118 ms returned []
Running 2336 sub problems to find dead transitions.
[2024-05-21 10:30:21] [INFO ] Flow matrix only has 290 transitions (discarded 2049 similar events)
[2024-05-21 10:30:21] [INFO ] Invariant cache hit.
[2024-05-21 10:30:21] [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, 2336 unsolved
[2024-05-21 10:30:46] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
[2024-05-21 10:31:03] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 1 ms to minimize.
Problem TDEAD1428 is UNSAT
Problem TDEAD1449 is UNSAT
Problem TDEAD1470 is UNSAT
Problem TDEAD1491 is UNSAT
Problem TDEAD1512 is UNSAT
Problem TDEAD1533 is UNSAT
Problem TDEAD1554 is UNSAT
Problem TDEAD1575 is UNSAT
Problem TDEAD1596 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1638 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1785 is UNSAT
Problem TDEAD1806 is UNSAT
Problem TDEAD1827 is UNSAT
Problem TDEAD1848 is UNSAT
Problem TDEAD1869 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/426 variables, and 7 constraints, problems are : Problem set: 22 solved, 2314 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 2336/2336 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 22 solved, 2314 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 22 solved, 2314 unsolved
Problem TDEAD1890 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2142 is UNSAT
Problem TDEAD2163 is UNSAT
Problem TDEAD2184 is UNSAT
Problem TDEAD2205 is UNSAT
Problem TDEAD2226 is UNSAT
Problem TDEAD2247 is UNSAT
Problem TDEAD2268 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/7 constraints. Problems are: Problem set: 41 solved, 2295 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/426 variables, and 7 constraints, problems are : Problem set: 41 solved, 2295 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/2336 constraints, Known Traps: 2/2 constraints]
After SMT, in 76434ms problems are : Problem set: 41 solved, 2295 unsolved
Search for dead transitions found 41 dead transitions in 76455ms
Found 41 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 41 transitions
Dead transitions reduction (with SMT) removed 41 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/136 places, 2298/2339 transitions.
Applied a total of 0 rules in 195 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 10:31:38] [INFO ] Redundant transitions in 100 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 77239 ms. Remains : 136/136 places, 2298/2339 transitions.
RANDOM walk for 40000 steps (92 resets) in 1247 ms. (32 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (40 resets) in 6703 ms. (5 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (34 resets) in 515 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (32 resets) in 578 ms. (69 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (33 resets) in 538 ms. (74 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 462087 steps, run timeout after 6001 ms. (steps per millisecond=77 ) properties seen :0 out of 4
Probabilistic random walk after 462087 steps, saw 122788 distinct states, run finished after 6001 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-21 10:31:47] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
// Phase 1: matrix 289 rows 136 cols
[2024-05-21 10:31:47] [INFO ] Computed 5 invariants in 3 ms
[2024-05-21 10:31:47] [INFO ] State equation strengthened by 41 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) 289/425 variables, 136/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/425 variables, 41/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/425 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 425/425 variables, and 182 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 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-05-21 10:31:49] [INFO ] Deduced a trap composed of 5 places in 242 ms of which 2 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) 289/425 variables, 136/142 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/425 variables, 41/183 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/425 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/425 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/425 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 425/425 variables, and 187 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27584 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 29934ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 3482 ms.
Support contains 136 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 160 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 136/136 places, 2298/2298 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2298/2298 transitions.
Applied a total of 0 rules in 154 ms. Remains 136 /136 variables (removed 0) and now considering 2298/2298 (removed 0) transitions.
[2024-05-21 10:32:20] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 10:32:20] [INFO ] Invariant cache hit.
[2024-05-21 10:32:20] [INFO ] Implicit Places using invariants in 49 ms returned []
[2024-05-21 10:32:20] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 10:32:20] [INFO ] Invariant cache hit.
[2024-05-21 10:32:20] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 10:32:20] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2024-05-21 10:32:20] [INFO ] Redundant transitions in 43 ms returned []
Running 2295 sub problems to find dead transitions.
[2024-05-21 10:32:20] [INFO ] Flow matrix only has 289 transitions (discarded 2009 similar events)
[2024-05-21 10:32:20] [INFO ] Invariant cache hit.
[2024-05-21 10:32:21] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
[2024-05-21 10:32:44] [INFO ] Deduced a trap composed of 5 places in 240 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/425 variables, and 6 constraints, problems are : Problem set: 0 solved, 2295 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2295/2295 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2295 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2295 unsolved
Problem TDEAD50 is UNSAT
Problem TDEAD155 is UNSAT
At refinement iteration 3 (OVERLAPS) 289/425 variables, 136/142 constraints. Problems are: Problem set: 2 solved, 2293 unsolved
SMT process timed out in 74570ms, After SMT, problems are : Problem set: 2 solved, 2293 unsolved
Search for dead transitions found 2 dead transitions in 74592ms
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 : 136/136 places, 2296/2298 transitions.
Applied a total of 0 rules in 159 ms. Remains 136 /136 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
[2024-05-21 10:33:35] [INFO ] Redundant transitions in 47 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 75196 ms. Remains : 136/136 places, 2296/2298 transitions.
RANDOM walk for 40000 steps (92 resets) in 1415 ms. (28 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (39 resets) in 6737 ms. (5 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (33 resets) in 684 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (32 resets) in 479 ms. (83 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (33 resets) in 530 ms. (75 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 444747 steps, run timeout after 6007 ms. (steps per millisecond=74 ) properties seen :0 out of 4
Probabilistic random walk after 444747 steps, saw 118246 distinct states, run finished after 6008 ms. (steps per millisecond=74 ) properties seen :0
[2024-05-21 10:33:44] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
// Phase 1: matrix 287 rows 136 cols
[2024-05-21 10:33:44] [INFO ] Computed 7 invariants in 5 ms
[2024-05-21 10:33:44] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 287/423 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/423 variables, 41/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/423 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 423/423 variables, and 184 constraints, problems are : Problem set: 0 solved, 4 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 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, 7/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-21 10:33:47] [INFO ] Deduced a trap composed of 5 places in 237 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 287/423 variables, 136/144 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/423 variables, 41/185 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/423 variables, 4/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/423 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/423 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 423/423 variables, and 189 constraints, problems are : Problem set: 0 solved, 4 unsolved in 27706 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 136/136 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 30288ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1969 ms.
Support contains 136 out of 136 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2296/2296 transitions.
Applied a total of 0 rules in 217 ms. Remains 136 /136 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 217 ms. Remains : 136/136 places, 2296/2296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 136/136 places, 2296/2296 transitions.
Applied a total of 0 rules in 196 ms. Remains 136 /136 variables (removed 0) and now considering 2296/2296 (removed 0) transitions.
[2024-05-21 10:34:17] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
[2024-05-21 10:34:17] [INFO ] Invariant cache hit.
[2024-05-21 10:34:17] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-21 10:34:17] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
[2024-05-21 10:34:17] [INFO ] Invariant cache hit.
[2024-05-21 10:34:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 10:34:17] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-21 10:34:17] [INFO ] Redundant transitions in 65 ms returned []
Running 2293 sub problems to find dead transitions.
[2024-05-21 10:34:17] [INFO ] Flow matrix only has 287 transitions (discarded 2009 similar events)
[2024-05-21 10:34:17] [INFO ] Invariant cache hit.
[2024-05-21 10:34:17] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 2293 unsolved
[2024-05-21 10:34:43] [INFO ] Deduced a trap composed of 5 places in 238 ms of which 1 ms to minimize.
[2024-05-21 10:34:45] [INFO ] Deduced a trap composed of 24 places in 220 ms of which 1 ms to minimize.
Problem TDEAD196 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD490 is UNSAT
Problem TDEAD511 is UNSAT
Problem TDEAD532 is UNSAT
Problem TDEAD553 is UNSAT
Problem TDEAD574 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD616 is UNSAT
Problem TDEAD637 is UNSAT
Problem TDEAD658 is UNSAT
Problem TDEAD679 is UNSAT
Problem TDEAD700 is UNSAT
Problem TDEAD721 is UNSAT
Problem TDEAD742 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD784 is UNSAT
Problem TDEAD805 is UNSAT
Problem TDEAD826 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD868 is UNSAT
Problem TDEAD889 is UNSAT
Problem TDEAD910 is UNSAT
Problem TDEAD931 is UNSAT
Problem TDEAD952 is UNSAT
Problem TDEAD973 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1141 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1225 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 136/423 variables, and 9 constraints, problems are : Problem set: 50 solved, 2243 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 2293/2293 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 50 solved, 2243 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/136 variables, 7/7 constraints. Problems are: Problem set: 50 solved, 2243 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/136 variables, 2/9 constraints. Problems are: Problem set: 50 solved, 2243 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 136/423 variables, and 9 constraints, problems are : Problem set: 50 solved, 2243 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/136 constraints, ReadFeed: 0/41 constraints, PredecessorRefiner: 0/2293 constraints, Known Traps: 2/2 constraints]
After SMT, in 75626ms problems are : Problem set: 50 solved, 2243 unsolved
Search for dead transitions found 50 dead transitions in 75667ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 136/136 places, 2246/2296 transitions.
Applied a total of 0 rules in 152 ms. Remains 136 /136 variables (removed 0) and now considering 2246/2246 (removed 0) transitions.
[2024-05-21 10:35:33] [INFO ] Redundant transitions in 45 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 76326 ms. Remains : 136/136 places, 2246/2296 transitions.
[2024-05-21 10:35:33] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 34 ms.
[2024-05-21 10:35:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 136 places, 2246 transitions and 17280 arcs took 17 ms.
[2024-05-21 10:35:33] [INFO ] Flatten gal took : 221 ms
Total runtime 443809 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V50P20N20

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 136
TRANSITIONS: 2246
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.096s, Sys 0.004s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.011s, 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: 706
MODEL NAME: /home/mcc/execution/413/model
136 places, 2246 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-V50P20N20-ReachabilityFireability-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-10 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V50P20N20-ReachabilityFireability-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716288300373

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

Error in allocating array of size 8388608 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-V50P20N20"
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-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 r047-tajo-171620397800239"
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 '' 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 ;