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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 9.8K Apr 13 02:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 13 02:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 13 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 13 02:28 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.2K Apr 22 14:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 04:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Apr 13 04:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 04:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 106K Apr 13 04:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:30 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 45K 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-V80P20N20-CTLCardinality-2024-00
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-01
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-02
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-03
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-04
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-05
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-06
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-07
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-08
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-09
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-10
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-11
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-12
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-13
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-14
FORMULA_NAME BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716280667214

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BridgeAndVehicles-COL-V80P20N20
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 08:37:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 08:37:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 08:37:49] [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 08:37:49] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-21 08:37:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 657 ms
[2024-05-21 08:37:49] [INFO ] Imported 15 HL places and 11 HL transitions for a total of 198 PT places and 551698.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
[2024-05-21 08:37:49] [INFO ] Built PT skeleton of HLPN with 15 places and 11 transitions 56 arcs in 4 ms.
[2024-05-21 08:37:49] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 12 stabilizing places and 6 stable transitions
Graph (complete) has 51 edges and 15 vertex of which 13 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.11 ms
Remains 16 properties that can be checked using skeleton over-approximation.
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 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.0 ms
RANDOM walk for 40000 steps (8 resets) in 3230 ms. (12 steps per ms) remains 33/82 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 117 ms. (33 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4000 steps (8 resets) in 13 ms. (285 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 7 ms. (500 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
// Phase 1: matrix 10 rows 12 cols
[2024-05-21 08:37:51] [INFO ] Computed 4 invariants in 3 ms
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp37 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp53 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp61 is UNSAT
Problem AtomicPropp63 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp70 is UNSAT
Problem AtomicPropp73 is UNSAT
Problem AtomicPropp74 is UNSAT
Problem AtomicPropp77 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 3/3 constraints. Problems are: Problem set: 25 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 25 solved, 8 unsolved
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp75 is UNSAT
At refinement iteration 2 (OVERLAPS) 1/12 variables, 1/4 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 10/22 variables, 12/16 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/16 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/22 variables, 0/16 constraints. Problems are: Problem set: 28 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 22/22 variables, and 16 constraints, problems are : Problem set: 28 solved, 5 unsolved in 372 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 28 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 3/9 variables, 1/3 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 6/15 variables, 9/12 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 6/21 variables, 2/14 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 5/19 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/19 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 1/22 variables, 1/20 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/22 variables, 1/21 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/22 variables, 0/21 constraints. Problems are: Problem set: 28 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/22 variables, 0/21 constraints. Problems are: Problem set: 28 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 22/22 variables, and 21 constraints, problems are : Problem set: 28 solved, 5 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 5/33 constraints, Known Traps: 0/0 constraints]
After SMT, in 627ms problems are : Problem set: 28 solved, 5 unsolved
Finished Parikh walk after 1642 steps, including 13 resets, run visited all 5 properties in 8 ms. (steps per millisecond=205 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 27 ms.
Successfully simplified 28 atomic propositions for a total of 16 simplifications.
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:37:52] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-21 08:37:52] [INFO ] Flatten gal took : 17 ms
[2024-05-21 08:37:52] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 08:37:52] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD $cA 1) 81)]] contains successor/predecessor on variables of sort voitureA
Arc [6:1*[(MOD (ADD (MOD (MINUS $cB 1) 81) 81) 81)]] contains successor/predecessor on variables of sort voitureB
Arc [13:1*[(MOD (ADD $cpt 1) 21)]] contains successor/predecessor on variables of sort compteur
Arc [14:1*[(MOD (ADD $s 1) 2)]] contains successor/predecessor on variables of sort sens
[2024-05-21 08:37:52] [INFO ] Unfolded HLPN to a Petri net with 198 places and 3728 transitions 28830 arcs in 210 ms.
[2024-05-21 08:37:52] [INFO ] Unfolded 8 HLPN properties in 5 ms.
Support contains 15 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 3728/3728 transitions.
Applied a total of 0 rules in 124 ms. Remains 198 /198 variables (removed 0) and now considering 3728/3728 (removed 0) transitions.
Running 3725 sub problems to find dead transitions.
[2024-05-21 08:37:52] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
// Phase 1: matrix 410 rows 198 cols
[2024-05-21 08:37:52] [INFO ] Computed 7 invariants in 33 ms
[2024-05-21 08:37:53] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/608 variables, and 5 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20135 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/198 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 3725/3725 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3725 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3725 unsolved
[2024-05-21 08:39:12] [INFO ] Deduced a trap composed of 5 places in 549 ms of which 10 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 196/608 variables, and 6 constraints, problems are : Problem set: 0 solved, 3725 unsolved in 20155 ms.
Refiners :[Positive P Invariants (semi-flows): 5/7 constraints, State Equation: 0/198 constraints, ReadFeed: 0/42 constraints, PredecessorRefiner: 0/3725 constraints, Known Traps: 1/1 constraints]
After SMT, in 90280ms problems are : Problem set: 0 solved, 3725 unsolved
Search for dead transitions found 0 dead transitions in 90382ms
[2024-05-21 08:39:23] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 08:39:23] [INFO ] Invariant cache hit.
[2024-05-21 08:39:23] [INFO ] Implicit Places using invariants in 780 ms returned []
[2024-05-21 08:39:23] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 08:39:23] [INFO ] Invariant cache hit.
[2024-05-21 08:39:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 08:39:25] [INFO ] Implicit Places using invariants and state equation in 1945 ms returned []
Implicit Place search using SMT with State Equation took 2738 ms to find 0 implicit places.
Running 3725 sub problems to find dead transitions.
[2024-05-21 08:39:26] [INFO ] Flow matrix only has 410 transitions (discarded 3318 similar events)
[2024-05-21 08:39:26] [INFO ] Invariant cache hit.
[2024-05-21 08:39:26] [INFO ] State equation strengthened by 42 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running BridgeAndVehicles-COL-V80P20N20

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

UNFOLDING COLORS...
MODEL CLASS: P/T NET
PLACES: 198
TRANSITIONS: 3728
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 28830
UNFOLDING TIME: 7.968

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.119
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING UNFOLDING MAP FILE /home/mcc/execution/model.unfmap ...
TOTAL TIME: 8.594
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: 614
MODEL NAME: /home/mcc/execution/model
198 places, 3728 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-V80P20N20-CTLCardinality-2024-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-07 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-03 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-12 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-13 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-14 CANNOT_COMPUTE
FORMULA BridgeAndVehicles-COL-V80P20N20-CTLCardinality-2024-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716283009383

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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

MEDDLY ERROR: Insufficient memory

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-V80P20N20"
export BK_EXAMINATION="CTLCardinality"
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-V80P20N20, examination is CTLCardinality"
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-171620397500121"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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