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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.1M
-rw-r--r-- 1 mcc users 17K Apr 13 01:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 13 01:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 298K Apr 13 01:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M Apr 13 01:00 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 14K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 127K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 399K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 47K Apr 13 01:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 237K Apr 13 01:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 596K Apr 13 01:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.3M Apr 13 01:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.0K Apr 22 14:30 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.7M 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-V80P50N10-ReachabilityCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716292482957

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-PT-V80P50N10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:54:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 11:54:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:54:44] [INFO ] Load time of PNML (sax parser for PT used): 320 ms
[2024-05-21 11:54:45] [INFO ] Transformed 188 places.
[2024-05-21 11:54:45] [INFO ] Transformed 2108 transitions.
[2024-05-21 11:54:45] [INFO ] Parsed PT model containing 188 places and 2108 transitions and 15950 arcs in 581 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 131 ms.
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40001 steps (56 resets) in 3463 ms. (11 steps per ms) remains 9/14 properties
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (20 resets) in 543 ms. (73 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (20 resets) in 379 ms. (105 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (16 resets) in 810 ms. (49 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (16 resets) in 350 ms. (113 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (16 resets) in 276 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (16 resets) in 275 ms. (144 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (16 resets) in 320 ms. (124 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (12 resets) in 906 ms. (44 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (16 resets) in 570 ms. (70 steps per ms) remains 9/9 properties
[2024-05-21 11:54:48] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
// Phase 1: matrix 370 rows 188 cols
[2024-05-21 11:54:48] [INFO ] Computed 7 invariants in 27 ms
[2024-05-21 11:54:48] [INFO ] State equation strengthened by 22 read => feed constraints.
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-00 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-06 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 4/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-08 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-09 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-10 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-13 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 120/188 variables, 3/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/188 variables, 0/7 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 370/558 variables, 188/195 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/558 variables, 22/217 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 8 solved, 1 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 8 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 2/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 212/545 variables, 166/178 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 2/180 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 22/202 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 1/203 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 0/203 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/547 variables, 1/204 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 2/206 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 0/206 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/558 variables, 11/217 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 1/218 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 0/218 constraints. Problems are: Problem set: 8 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/558 variables, 0/218 constraints. Problems are: Problem set: 8 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 218 constraints, problems are : Problem set: 8 solved, 1 unsolved in 861 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 1968ms problems are : Problem set: 8 solved, 1 unsolved
Parikh walk visited 0 properties in 582 ms.
Support contains 8 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 372 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Running 2105 sub problems to find dead transitions.
[2024-05-21 11:54:51] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 11:54:51] [INFO ] Invariant cache hit.
[2024-05-21 11:54:51] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 11:55:18] [INFO ] Deduced a trap composed of 5 places in 274 ms of which 21 ms to minimize.
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 Real declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20056 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2105 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 6 constraints, problems are : Problem set: 0 solved, 2105 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 1/1 constraints]
After SMT, in 56559ms problems are : Problem set: 0 solved, 2105 unsolved
Search for dead transitions found 0 dead transitions in 56641ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57097 ms. Remains : 188/188 places, 2108/2108 transitions.
RANDOM walk for 40000 steps (56 resets) in 549 ms. (72 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40005 steps (20 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 232459 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :0 out of 1
Probabilistic random walk after 232459 steps, saw 64389 distinct states, run finished after 3018 ms. (steps per millisecond=77 ) properties seen :0
[2024-05-21 11:55:50] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 11:55:50] [INFO ] Invariant cache hit.
[2024-05-21 11:55:50] [INFO ] State equation strengthened by 22 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 212/545 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 22/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/547 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/547 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/558 variables, 11/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/558 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/558 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 558/558 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 464 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 212/545 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 22/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/547 variables, 1/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/558 variables, 11/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/558 variables, 1/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/558 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/558 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 558/558 variables, and 218 constraints, problems are : Problem set: 0 solved, 1 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1306ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 80 ms.
Support contains 8 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 204 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 188/188 places, 2108/2108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2108/2108 transitions.
Applied a total of 0 rules in 348 ms. Remains 188 /188 variables (removed 0) and now considering 2108/2108 (removed 0) transitions.
[2024-05-21 11:55:52] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 11:55:52] [INFO ] Invariant cache hit.
[2024-05-21 11:55:53] [INFO ] Implicit Places using invariants in 459 ms returned []
[2024-05-21 11:55:53] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 11:55:53] [INFO ] Invariant cache hit.
[2024-05-21 11:55:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2024-05-21 11:55:54] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2130 ms to find 0 implicit places.
[2024-05-21 11:55:55] [INFO ] Redundant transitions in 177 ms returned []
Running 2105 sub problems to find dead transitions.
[2024-05-21 11:55:55] [INFO ] Flow matrix only has 370 transitions (discarded 1738 similar events)
[2024-05-21 11:55:55] [INFO ] Invariant cache hit.
[2024-05-21 11:55:55] [INFO ] State equation strengthened by 22 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2105 unsolved
[2024-05-21 11:56:24] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 3 ms to minimize.
[2024-05-21 11:56:40] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 1 ms to minimize.
Problem TDEAD1148 is UNSAT
Problem TDEAD1149 is UNSAT
Problem TDEAD1150 is UNSAT
Problem TDEAD1151 is UNSAT
Problem TDEAD1152 is UNSAT
Problem TDEAD1153 is UNSAT
Problem TDEAD1154 is UNSAT
Problem TDEAD1155 is UNSAT
Problem TDEAD1156 is UNSAT
Problem TDEAD1157 is UNSAT
Problem TDEAD1158 is UNSAT
Problem TDEAD1159 is UNSAT
Problem TDEAD1160 is UNSAT
Problem TDEAD1161 is UNSAT
Problem TDEAD1162 is UNSAT
Problem TDEAD1163 is UNSAT
Problem TDEAD1164 is UNSAT
Problem TDEAD1165 is UNSAT
Problem TDEAD1166 is UNSAT
Problem TDEAD1167 is UNSAT
Problem TDEAD1168 is UNSAT
Problem TDEAD1169 is UNSAT
Problem TDEAD1170 is UNSAT
Problem TDEAD1171 is UNSAT
Problem TDEAD1172 is UNSAT
Problem TDEAD1173 is UNSAT
Problem TDEAD1174 is UNSAT
Problem TDEAD1175 is UNSAT
Problem TDEAD1176 is UNSAT
Problem TDEAD1177 is UNSAT
Problem TDEAD1178 is UNSAT
Problem TDEAD1179 is UNSAT
Problem TDEAD1180 is UNSAT
Problem TDEAD1181 is UNSAT
Problem TDEAD1182 is UNSAT
Problem TDEAD1183 is UNSAT
Problem TDEAD1184 is UNSAT
Problem TDEAD1185 is UNSAT
Problem TDEAD1186 is UNSAT
Problem TDEAD1187 is UNSAT
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
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 186/558 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 2105/2105 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 80 solved, 2025 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 5/5 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 2/7 constraints. Problems are: Problem set: 80 solved, 2025 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 186/558 variables, and 7 constraints, problems are : Problem set: 80 solved, 2025 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/188 constraints, ReadFeed: 0/22 constraints, PredecessorRefiner: 0/2105 constraints, Known Traps: 2/2 constraints]
After SMT, in 78569ms problems are : Problem set: 80 solved, 2025 unsolved
Search for dead transitions found 80 dead transitions in 78608ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 188/188 places, 2028/2108 transitions.
Applied a total of 0 rules in 129 ms. Remains 188 /188 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 11:57:14] [INFO ] Redundant transitions in 43 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 81492 ms. Remains : 188/188 places, 2028/2108 transitions.
RANDOM walk for 40000 steps (56 resets) in 507 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40013 steps (20 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 284679 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :0 out of 1
Probabilistic random walk after 284679 steps, saw 78219 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
[2024-05-21 11:57:17] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
// Phase 1: matrix 369 rows 188 cols
[2024-05-21 11:57:17] [INFO ] Computed 7 invariants in 30 ms
[2024-05-21 11:57:17] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 211/544 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 21/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2/546 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/546 variables, 2/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/546 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/557 variables, 11/215 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/557 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/557 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 216 constraints, problems are : Problem set: 0 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 324/333 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/333 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 211/544 variables, 166/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/544 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/544 variables, 21/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/544 variables, 1/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/544 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/546 variables, 1/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/546 variables, 2/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/546 variables, 0/205 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/557 variables, 11/216 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/557 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/557 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/557 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 217 constraints, problems are : Problem set: 0 solved, 1 unsolved in 703 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 188/188 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1233ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 96 ms.
Support contains 8 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Applied a total of 0 rules in 220 ms. Remains 188 /188 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 233 ms. Remains : 188/188 places, 2028/2028 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 2028/2028 transitions.
Applied a total of 0 rules in 161 ms. Remains 188 /188 variables (removed 0) and now considering 2028/2028 (removed 0) transitions.
[2024-05-21 11:57:19] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 11:57:19] [INFO ] Invariant cache hit.
[2024-05-21 11:57:19] [INFO ] Implicit Places using invariants in 452 ms returned []
[2024-05-21 11:57:19] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 11:57:19] [INFO ] Invariant cache hit.
[2024-05-21 11:57:19] [INFO ] State equation strengthened by 21 read => feed constraints.
[2024-05-21 11:57:20] [INFO ] Implicit Places using invariants and state equation in 1280 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2024-05-21 11:57:20] [INFO ] Redundant transitions in 76 ms returned []
Running 2025 sub problems to find dead transitions.
[2024-05-21 11:57:20] [INFO ] Flow matrix only has 369 transitions (discarded 1659 similar events)
[2024-05-21 11:57:20] [INFO ] Invariant cache hit.
[2024-05-21 11:57:20] [INFO ] State equation strengthened by 21 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-PT-V80P50N10

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: 188
TRANSITIONS: 2108
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.073s, Sys 0.001s]


SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.009s, 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: 632
MODEL NAME: /home/mcc/execution/model
188 places, 2108 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-V80P50N10-ReachabilityCardinality-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-02 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-03 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-07 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-PT-V80P50N10-ReachabilityCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716293909972

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 ReachabilityCardinality -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-V80P50N10"
export BK_EXAMINATION="ReachabilityCardinality"
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-V80P50N10, examination is ReachabilityCardinality"
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-171620397900302"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-PT-V80P50N10.tgz
mv BridgeAndVehicles-PT-V80P50N10 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;