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

About the Execution of GreatSPN+red for CSRepetitions-COL-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11649.752 1914021.00 4865787.00 4235.50 FFF?F???F?TFTT?F 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.r069-tall-171620504000209.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 CSRepetitions-COL-07, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-tall-171620504000209
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.8K Apr 12 09:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Apr 12 09:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 12 09:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Apr 12 09:41 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 10:42 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 168K Apr 12 10:42 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 12 10:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 12 10:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:32 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16K 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 CSRepetitions-COL-07-CTLCardinality-2024-00
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-01
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-02
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-03
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-04
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-05
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-06
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-07
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-08
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-09
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-10
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-11
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-12
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-13
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-14
FORMULA_NAME CSRepetitions-COL-07-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716415365881

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CSRepetitions-COL-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:02:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 22:02:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:02:47] [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-22 22:02:47] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-22 22:02:47] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 541 ms
[2024-05-22 22:02:47] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 498 PT places and 833.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
[2024-05-22 22:02:47] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 15 arcs in 3 ms.
[2024-05-22 22:02:47] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 1 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 1 stable transitions
RANDOM walk for 40025 steps (423 resets) in 773 ms. (51 steps per ms) remains 41/64 properties
BEST_FIRST walk for 4002 steps (10 resets) in 56 ms. (70 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4030 steps (17 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (10 resets) in 29 ms. (133 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4030 steps (13 resets) in 22 ms. (175 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (9 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 54 ms. (72 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4006 steps (26 resets) in 26 ms. (148 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4049 steps (25 resets) in 25 ms. (155 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (11 resets) in 30 ms. (129 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (19 resets) in 20 ms. (190 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (12 resets) in 35 ms. (111 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4075 steps (15 resets) in 14 ms. (271 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4010 steps (17 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (18 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4050 steps (19 resets) in 26 ms. (150 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (10 resets) in 16 ms. (235 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (13 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 13 ms. (285 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 18 ms. (210 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (12 resets) in 15 ms. (250 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (28 resets) in 9 ms. (400 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (17 resets) in 10 ms. (363 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 13 ms. (286 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4025 steps (26 resets) in 11 ms. (335 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (14 resets) in 19 ms. (200 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (11 resets) in 14 ms. (266 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4039 steps (25 resets) in 9 ms. (403 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 31 ms. (125 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (19 resets) in 28 ms. (138 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4008 steps (26 resets) in 11 ms. (334 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (11 resets) in 34 ms. (114 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (12 resets) in 21 ms. (182 steps per ms) remains 41/41 properties
// Phase 1: matrix 5 rows 6 cols
[2024-05-22 22:02:48] [INFO ] Computed 2 invariants in 5 ms
[2024-05-22 22:02:48] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp44 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp47 is UNSAT
Problem AtomicPropp48 is UNSAT
Problem AtomicPropp50 is UNSAT
Problem AtomicPropp55 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp60 is UNSAT
Problem AtomicPropp62 is UNSAT
Problem AtomicPropp63 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 25 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 25 solved, 16 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp30 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp36 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp49 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp61 is UNSAT
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 41 solved, 0 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 41 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 41 atomic propositions for a total of 16 simplifications.
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:02:48] [INFO ] Initial state reduction rules for CTL removed 7 formulas.
[2024-05-22 22:02:48] [INFO ] Flatten gal took : 15 ms
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CSRepetitions-COL-07-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 22:02:48] [INFO ] Flatten gal took : 2 ms
Transition Send_Answer forces synchronizations/join behavior on parameter c of sort Client
Symmetric sort wr.t. initial and guards and successors and join/free detected :Server
Symmetric sort wr.t. initial detected :Server
Symmetric sort wr.t. initial and guards detected :Server
Applying symmetric unfolding of full symmetric sort :Server domain size was 7
[2024-05-22 22:02:49] [INFO ] Unfolded HLPN to a Petri net with 198 places and 245 transitions 735 arcs in 15 ms.
[2024-05-22 22:02:49] [INFO ] Unfolded 6 HLPN properties in 0 ms.
Support contains 198 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 7 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
// Phase 1: matrix 245 rows 198 cols
[2024-05-22 22:02:49] [INFO ] Computed 50 invariants in 17 ms
[2024-05-22 22:02:49] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-22 22:02:49] [INFO ] Invariant cache hit.
[2024-05-22 22:02:49] [INFO ] State equation strengthened by 49 read => feed constraints.
[2024-05-22 22:02:49] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Running 196 sub problems to find dead transitions.
[2024-05-22 22:02:49] [INFO ] Invariant cache hit.
[2024-05-22 22:02:49] [INFO ] State equation strengthened by 49 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (OVERLAPS) 0/443 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Real declared 443/443 variables, and 297 constraints, problems are : Problem set: 0 solved, 196 unsolved in 8711 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 2 (OVERLAPS) 49/198 variables, 49/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 4 (OVERLAPS) 245/443 variables, 198/248 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/443 variables, 49/297 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/443 variables, 196/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
At refinement iteration 8 (OVERLAPS) 0/443 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 196 unsolved
No progress, stopping.
After SMT solving in domain Int declared 443/443 variables, and 493 constraints, problems are : Problem set: 0 solved, 196 unsolved in 7597 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 49/49 constraints, PredecessorRefiner: 196/196 constraints, Known Traps: 0/0 constraints]
After SMT, in 16607ms problems are : Problem set: 0 solved, 196 unsolved
Search for dead transitions found 0 dead transitions in 16613ms
Finished structural reductions in LTL mode , in 1 iterations and 16869 ms. Remains : 198/198 places, 245/245 transitions.
Support contains 198 out of 198 places after structural reductions.
[2024-05-22 22:03:05] [INFO ] Flatten gal took : 25 ms
[2024-05-22 22:03:05] [INFO ] Flatten gal took : 21 ms
[2024-05-22 22:03:06] [INFO ] Input system was already deterministic with 245 transitions.
RANDOM walk for 40000 steps (484 resets) in 1453 ms. (27 steps per ms) remains 11/28 properties
BEST_FIRST walk for 40004 steps (15 resets) in 314 ms. (126 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (10 resets) in 159 ms. (250 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (12 resets) in 145 ms. (273 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (15 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (16 resets) in 147 ms. (270 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (10 resets) in 153 ms. (259 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (16 resets) in 77 ms. (512 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (12 resets) in 90 ms. (439 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 11/11 properties
[2024-05-22 22:03:07] [INFO ] Invariant cache hit.
[2024-05-22 22:03:07] [INFO ] State equation strengthened by 49 read => feed constraints.
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp21 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 50/50 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/198 variables, 0/50 constraints. Problems are: Problem set: 7 solved, 4 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp17 is UNSAT
After SMT solving in domain Real declared 443/443 variables, and 248 constraints, problems are : Problem set: 11 solved, 0 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 198/198 constraints, ReadFeed: 0/49 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 221ms problems are : Problem set: 11 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 11 atomic propositions for a total of 6 simplifications.
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 15 ms
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 14 ms
[2024-05-22 22:03:07] [INFO ] Input system was already deterministic with 245 transitions.
Computed a total of 0 stabilizing places and 49 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 8 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 198/198 places, 245/245 transitions.
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:03:07] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 198/198 places, 245/245 transitions.
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 12 ms
[2024-05-22 22:03:07] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 198/198 places, 245/245 transitions.
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:03:07] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 198/198 places, 245/245 transitions.
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:03:07] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 198/198 places, 245/245 transitions.
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 10 ms
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 11 ms
[2024-05-22 22:03:07] [INFO ] Input system was already deterministic with 245 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 198/198 places, 245/245 transitions.
Applied a total of 0 rules in 10 ms. Remains 198 /198 variables (removed 0) and now considering 245/245 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 198/198 places, 245/245 transitions.
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:03:07] [INFO ] Input system was already deterministic with 245 transitions.
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 9 ms
[2024-05-22 22:03:07] [INFO ] Flatten gal took : 8 ms
[2024-05-22 22:03:07] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2024-05-22 22:03:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 198 places, 245 transitions and 735 arcs took 5 ms.
Total runtime 20675 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CSRepetitions-COL-07

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 553
MODEL NAME: /home/mcc/execution/414/model
198 places, 245 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.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716417279902

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
Error in allocating array of size 8388608 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

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="CSRepetitions-COL-07"
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 CSRepetitions-COL-07, 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 r069-tall-171620504000209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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