fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r047-tajo-171620397400063
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for BridgeAndVehicles-COL-V20P20N50

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16199.644 1942147.00 6303141.00 1025.10 TTTTFFTTTTTTFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620397400063.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-COL-V20P20N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620397400063
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Apr 13 02:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Apr 13 02:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Apr 13 02:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 13 02:26 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 4.0K Apr 22 14:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 22 14:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 03:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Apr 13 03:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 13 03:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 13 03:54 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_pt
-rw-r--r-- 1 mcc users 10 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 41K 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-COL-V20P20N50-ReachabilityFireability-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716276273539

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V20P20N50
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 07:24:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 07:24:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 07:24:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-21 07:24:36] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 07:24:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 649 ms
[2024-05-21 07:24:36] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 108 PT places and 90298.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 24 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 07:24:36] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 07:24:36] [INFO ] Skeletonized 13 HLPN properties in 1 ms.
Remains 2 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Computed a total of 9 stabilizing places and 6 stable transitions
Graph (complete) has 22 edges and 12 vertex of which 10 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
RANDOM walk for 178 steps (0 resets) in 24 ms. (7 steps per ms) remains 0/2 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-21 07:24:36] [INFO ] Flatten gal took : 49 ms
[2024-05-21 07:24:36] [INFO ] Flatten gal took : 16 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
Arc [13:1*[(MOD (ADD $cpt 1) 51)]] contains successor/predecessor on variables of sort compteur
Arc [1:1*[(MOD (ADD $cA 1) 21)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 21) 21) 21)]] contains successor/predecessor on variables of sort voitureB
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 07:24:36] [INFO ] Unfolded HLPN to a Petri net with 108 places and 2228 transitions 17190 arcs in 120 ms.
[2024-05-21 07:24:36] [INFO ] Unfolded 13 HLPN properties in 6 ms.
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (228 resets) in 8796 ms. (4 steps per ms) remains 6/12 properties
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (80 resets) in 2447 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (108 resets) in 2445 ms. (16 steps per ms) remains 6/6 properties
BEST_FIRST walk for 30582 steps (67 resets) in 20005 ms. (1 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (78 resets) in 1992 ms. (20 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (81 resets) in 2728 ms. (14 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (73 resets) in 11808 ms. (3 steps per ms) remains 6/6 properties
[2024-05-21 07:24:51] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 108 cols
[2024-05-21 07:24:51] [INFO ] Computed 7 invariants in 19 ms
[2024-05-21 07:24:51] [INFO ] State equation strengthened by 102 read => feed constraints.
Problem BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-00 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-11 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
Problem BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-14 is UNSAT
FORMULA BridgeAndVehicles-COL-V20P20N50-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/398 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/398 variables, 0/217 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 398/398 variables, and 217 constraints, problems are : Problem set: 3 solved, 3 unsolved in 2568 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 2/108 variables, 2/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 0/7 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 290/398 variables, 108/115 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/398 variables, 102/217 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 398/398 variables, and 220 constraints, problems are : Problem set: 3 solved, 3 unsolved in 6486 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 108/108 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 3/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 22071ms problems are : Problem set: 3 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 106 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 2228/2228 transitions.
Graph (complete) has 882 edges and 108 vertex of which 106 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.12 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 315 ms. Remains 106 /108 variables (removed 2) and now considering 2228/2228 (removed 0) transitions.
Running 2225 sub problems to find dead transitions.
[2024-05-21 07:25:13] [INFO ] Flow matrix only has 290 transitions (discarded 1938 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 07:25:13] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 07:25:13] [INFO ] State equation strengthened by 102 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 07:25:39] [INFO ] Deduced a trap composed of 5 places in 411 ms of which 49 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 106/396 variables, and 6 constraints, problems are : Problem set: 0 solved, 2225 unsolved in 20080 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 2225/2225 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2225 unsolved
[2024-05-21 07:26:07] [INFO ] Deduced a trap composed of 55 places in 150 ms of which 2 ms to minimize.
Problem TDEAD1188 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1341 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 106/396 variables, and 7 constraints, problems are : Problem set: 4 solved, 2221 unsolved in 20068 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 0/106 constraints, ReadFeed: 0/102 constraints, PredecessorRefiner: 0/2225 constraints, Known Traps: 2/2 constraints]
After SMT, in 57066ms problems are : Problem set: 4 solved, 2221 unsolved
Search for dead transitions found 4 dead transitions in 57092ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 106/108 places, 2224/2228 transitions.
Applied a total of 0 rules in 360 ms. Remains 106 /106 variables (removed 0) and now considering 2224/2224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57808 ms. Remains : 106/108 places, 2224/2228 transitions.
RANDOM walk for 40000 steps (228 resets) in 5795 ms. (6 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (108 resets) in 2561 ms. (15 steps per ms) remains 3/3 properties
BEST_FIRST walk for 33140 steps (74 resets) in 20005 ms. (1 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (80 resets) in 1757 ms. (22 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 882381 steps, run timeout after 24001 ms. (steps per millisecond=36 ) properties seen :0 out of 3
Probabilistic random walk after 882381 steps, saw 214387 distinct states, run finished after 24023 ms. (steps per millisecond=36 ) properties seen :0
[2024-05-21 07:26:43] [INFO ] Flow matrix only has 290 transitions (discarded 1934 similar events)
// Phase 1: matrix 290 rows 106 cols
[2024-05-21 07:26:43] [INFO ] Computed 5 invariants in 8 ms
[2024-05-21 07:26:43] [INFO ] State equation strengthened by 102 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 290/396 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/396 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 396/396 variables, and 213 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 106/106 constraints, ReadFeed: 102/102 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 290/396 variables, 106/111 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/396 variables, 102/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V20P20N50

IS_COLORED=1
IS_NUPN=

LOADING model.pnml ...
MODEL CLASS: SYMMETRIC NET
PLACES: 15
TRANSITIONS: 11
CONSTANTS: 0
TEMPLATE VARS: 0
COLOR CLASSES: 4
COLOR VARS: 4
ARCS: 56
LOADING TIME: 0.21

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 108
TRANSITIONS: 2228
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 17190
UNFOLDING TIME: 2.502

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.112
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 3.048
OK.
----------------------------------------------------------------------
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: 623
MODEL NAME: /home/mcc/execution/model
108 places, 2228 transitions.

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

BK_STOP 1716278215686

--------------------
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
Error in allocating array of size 4194304 at unique_table.cc, line 313
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-COL-V20P20N50"
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-COL-V20P20N50, 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-171620397400063"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BridgeAndVehicles-COL-V20P20N50.tgz
mv BridgeAndVehicles-COL-V20P20N50 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 ;