fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r311-tall-171662336900585
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Referendum-PT-0015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
256.548 4618.00 11305.00 32.90 FFFFFTFFFFFFTTTF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r311-tall-171662336900585.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Referendum-PT-0015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r311-tall-171662336900585
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 14K Apr 11 16:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K Apr 11 16:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 117K Apr 11 16:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.8K Apr 23 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 23 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 61K Apr 11 16:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 398K Apr 11 16:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 28K Apr 11 16:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 230K Apr 11 16:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.7K Apr 23 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.5K Apr 23 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 18K May 18 16:43 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 Referendum-PT-0015-CTLCardinality-2024-00
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-01
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-02
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-03
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-04
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-05
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-06
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-07
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-08
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-09
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-10
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-11
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-12
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-13
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-14
FORMULA_NAME Referendum-PT-0015-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716762881225

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Referendum-PT-0015
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 22:34:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-26 22:34:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 22:34:42] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2024-05-26 22:34:42] [INFO ] Transformed 46 places.
[2024-05-26 22:34:42] [INFO ] Transformed 31 transitions.
[2024-05-26 22:34:42] [INFO ] Found NUPN structural information;
[2024-05-26 22:34:42] [INFO ] Parsed PT model containing 46 places and 31 transitions and 76 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 19 ms.
Support contains 46 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Applied a total of 0 rules in 14 ms. Remains 46 /46 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 46 cols
[2024-05-26 22:34:42] [INFO ] Computed 15 invariants in 4 ms
[2024-05-26 22:34:42] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-26 22:34:42] [INFO ] Invariant cache hit.
[2024-05-26 22:34:42] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Running 30 sub problems to find dead transitions.
[2024-05-26 22:34:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/77 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (OVERLAPS) 0/77 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Real declared 77/77 variables, and 107 constraints, problems are : Problem set: 0 solved, 30 unsolved in 429 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 30 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 2 (OVERLAPS) 31/46 variables, 15/30 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/46 variables, 31/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 5 (OVERLAPS) 31/77 variables, 46/107 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/77 variables, 30/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 0/77 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 30 unsolved
No progress, stopping.
After SMT solving in domain Int declared 77/77 variables, and 137 constraints, problems are : Problem set: 0 solved, 30 unsolved in 273 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 46/46 constraints, PredecessorRefiner: 30/30 constraints, Known Traps: 0/0 constraints]
After SMT, in 728ms problems are : Problem set: 0 solved, 30 unsolved
Search for dead transitions found 0 dead transitions in 739ms
Finished structural reductions in LTL mode , in 1 iterations and 1000 ms. Remains : 46/46 places, 31/31 transitions.
Support contains 46 out of 46 places after structural reductions.
[2024-05-26 22:34:43] [INFO ] Flatten gal took : 16 ms
[2024-05-26 22:34:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA Referendum-PT-0015-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:34:43] [INFO ] Flatten gal took : 5 ms
[2024-05-26 22:34:43] [INFO ] Input system was already deterministic with 31 transitions.
RANDOM walk for 40000 steps (2352 resets) in 1996 ms. (20 steps per ms) remains 9/38 properties
BEST_FIRST walk for 40004 steps (152 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 143 ms. (277 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 343 ms. (116 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 107 ms. (370 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 91 ms. (434 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 165 ms. (240 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (152 resets) in 100 ms. (396 steps per ms) remains 9/9 properties
[2024-05-26 22:34:44] [INFO ] Invariant cache hit.
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp11 is UNSAT
After SMT solving in domain Real declared 46/77 variables, and 46 constraints, problems are : Problem set: 9 solved, 0 unsolved in 34 ms.
Refiners :[Domain max(s): 46/46 constraints, Positive P Invariants (semi-flows): 0/15 constraints, State Equation: 0/46 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 57ms problems are : Problem set: 9 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 9 atomic propositions for a total of 13 simplifications.
FORMULA Referendum-PT-0015-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:34:45] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 4 ms
FORMULA Referendum-PT-0015-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Referendum-PT-0015-CTLCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 3 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 31 transitions.
Support contains 41 out of 46 places (down from 46) after GAL structural reductions.
Computed a total of 46 stabilizing places and 31 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 46 transition count 31
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
FORMULA Referendum-PT-0015-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 31 transition count 31
Applied a total of 15 rules in 6 ms. Remains 31 /46 variables (removed 15) and now considering 31/31 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 31/46 places, 31/31 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 2 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 2 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 31 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 16 transition count 16
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 59 place count 2 transition count 2
Iterating global reduction 1 with 14 rules applied. Total rules applied 73 place count 2 transition count 2
Applied a total of 73 rules in 8 ms. Remains 2 /46 variables (removed 44) and now considering 2/31 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 2/46 places, 2/31 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 19 transition count 19
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 49 place count 9 transition count 9
Iterating global reduction 1 with 10 rules applied. Total rules applied 59 place count 9 transition count 9
Applied a total of 59 rules in 0 ms. Remains 9 /46 variables (removed 37) and now considering 9/31 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 9/46 places, 9/31 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 26 transition count 25
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 23 transition count 22
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 23 transition count 22
Applied a total of 32 rules in 0 ms. Remains 23 /46 variables (removed 23) and now considering 22/31 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 23/46 places, 22/31 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 6 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 6
Applied a total of 3 rules in 10 ms. Remains 6 /46 variables (removed 40) and now considering 6/31 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 6/46 places, 6/31 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Graph (complete) has 45 edges and 46 vertex of which 6 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.0 ms
Discarding 40 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 6
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 6
Applied a total of 3 rules in 2 ms. Remains 6 /46 variables (removed 40) and now considering 6/31 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 6/46 places, 6/31 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 6 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 30 places and 0 transitions.
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 16 transition count 16
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 57 place count 4 transition count 4
Iterating global reduction 1 with 12 rules applied. Total rules applied 69 place count 4 transition count 4
Applied a total of 69 rules in 1 ms. Remains 4 /46 variables (removed 42) and now considering 4/31 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 4/46 places, 4/31 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 1 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 29 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 17 transition count 17
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 56 place count 4 transition count 4
Iterating global reduction 1 with 13 rules applied. Total rules applied 69 place count 4 transition count 4
Applied a total of 69 rules in 1 ms. Remains 4 /46 variables (removed 42) and now considering 4/31 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 4/46 places, 4/31 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 0 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 31/31 transitions.
Reduce places removed 20 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 26 transition count 25
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 29 place count 23 transition count 22
Iterating global reduction 1 with 3 rules applied. Total rules applied 32 place count 23 transition count 22
Applied a total of 32 rules in 1 ms. Remains 23 /46 variables (removed 23) and now considering 22/31 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 23/46 places, 22/31 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 2 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 2 ms
[2024-05-26 22:34:45] [INFO ] Input system was already deterministic with 22 transitions.
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 3 ms
[2024-05-26 22:34:45] [INFO ] Flatten gal took : 2 ms
[2024-05-26 22:34:45] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-26 22:34:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 46 places, 31 transitions and 76 arcs took 1 ms.
Total runtime 2708 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Referendum-PT-0015

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.000s, 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: 534
MODEL NAME: /home/mcc/execution/411/model
46 places, 31 transitions.

Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Building monolithic NSF...
FORMULA Referendum-PT-0015-CTLCardinality-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0015-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0015-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0015-CTLCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0015-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0015-CTLCardinality-2024-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0015-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0015-CTLCardinality-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Referendum-PT-0015-CTLCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716762885843

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML

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="Referendum-PT-0015"
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 Referendum-PT-0015, 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 r311-tall-171662336900585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Referendum-PT-0015.tgz
mv Referendum-PT-0015 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 ;