fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r267-smll-171654406400425
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for Philosophers-COL-000500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
14730.827 3371767.00 9643392.00 4078.20 T??T????T??????T 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.r267-smll-171654406400425.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 Philosophers-COL-000500, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406400425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.4K Apr 13 10:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 13 10:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Apr 13 09:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 13 09:16 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 3.6K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 11:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 13 10:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 13 10:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 31K 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 Philosophers-COL-000500-CTLCardinality-2024-00
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-01
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-02
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-03
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-04
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-05
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-06
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-07
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-08
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-09
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-10
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-11
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-12
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-13
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-14
FORMULA_NAME Philosophers-COL-000500-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716866099955

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000500
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 03:15:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 03:15:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:15:02] [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-28 03:15:03] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 03:15:04] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1305 ms
[2024-05-28 03:15:04] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 2500 PT places and 2500.0 transition bindings in 37 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 39 ms.
[2024-05-28 03:15:04] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 7 ms.
[2024-05-28 03:15:04] [INFO ] Skeletonized 16 HLPN properties in 4 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 16 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40156 steps (76 resets) in 319 ms. (125 steps per ms) remains 16/60 properties
BEST_FIRST walk for 4004 steps (8 resets) in 200 ms. (19 steps per ms) remains 12/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4003 steps (8 resets) in 116 ms. (34 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 135 ms. (29 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 12/12 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 11/12 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 11/11 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 11/11 properties
// Phase 1: matrix 5 rows 5 cols
[2024-05-28 03:15:05] [INFO ] Computed 2 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 7 constraints, problems are : Problem set: 1 solved, 10 unsolved in 393 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 5/10 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 10/17 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 17 constraints, problems are : Problem set: 1 solved, 10 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 0/0 constraints]
After SMT, in 674ms problems are : Problem set: 1 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Finished Parikh walk after 200 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=100 )
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 10 properties in 2059 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-28 03:15:07] [INFO ] Flatten gal took : 22 ms
[2024-05-28 03:15:07] [INFO ] Flatten gal took : 4 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 500) 500) 500)]] contains successor/predecessor on variables of sort Philo
[2024-05-28 03:15:08] [INFO ] Unfolded HLPN to a Petri net with 2500 places and 2500 transitions 8000 arcs in 115 ms.
[2024-05-28 03:15:08] [INFO ] Unfolded 16 HLPN properties in 5 ms.
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 38 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2024-05-28 03:15:08] [INFO ] Computed 1000 invariants in 51 ms
[2024-05-28 03:15:09] [INFO ] Implicit Places using invariants in 1166 ms returned []
[2024-05-28 03:15:09] [INFO ] Invariant cache hit.
[2024-05-28 03:15:12] [INFO ] Implicit Places using invariants and state equation in 2844 ms returned []
Implicit Place search using SMT with State Equation took 4031 ms to find 0 implicit places.
Running 1500 sub problems to find dead transitions.
[2024-05-28 03:15:12] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30121 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 1500/1500 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1500 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2000 variables, 500/500 constraints. Problems are: Problem set: 0 solved, 1500 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/5000 variables, and 500 constraints, problems are : Problem set: 0 solved, 1500 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 500/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/1500 constraints, Known Traps: 0/0 constraints]
After SMT, in 61175ms problems are : Problem set: 0 solved, 1500 unsolved
Search for dead transitions found 0 dead transitions in 61239ms
Finished structural reductions in LTL mode , in 1 iterations and 65342 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2024-05-28 03:16:14] [INFO ] Flatten gal took : 379 ms
[2024-05-28 03:16:14] [INFO ] Flatten gal took : 208 ms
[2024-05-28 03:16:15] [INFO ] Input system was already deterministic with 2500 transitions.
RANDOM walk for 40000 steps (8 resets) in 26003 ms. (1 steps per ms) remains 16/59 properties
BEST_FIRST walk for 4004 steps (0 resets) in 271 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 270 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 370 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 196 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 334 ms. (11 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 385 ms. (10 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 196 ms. (20 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 201 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 200 ms. (19 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 175 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 168 ms. (23 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 609 ms. (6 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 280 ms. (14 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 323 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 416 ms. (9 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (0 resets) in 267 ms. (14 steps per ms) remains 16/16 properties
[2024-05-28 03:16:24] [INFO ] Invariant cache hit.
Problem AtomicPropp16 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/2500 variables, 1000/1000 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2500/5000 variables, and 1000 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 15/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2500 variables, 1000/1000 constraints. Problems are: Problem set: 1 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2500/5000 variables, and 1000 constraints, problems are : Problem set: 1 solved, 15 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 15/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 12245ms problems are : Problem set: 1 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 107 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 109 ms. Remains : 2500/2500 places, 2500/2500 transitions.
RANDOM walk for 40000 steps (8 resets) in 21657 ms. (1 steps per ms) remains 14/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2409 ms. (16 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2257 ms. (17 steps per ms) remains 12/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3659 ms. (10 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1934 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2433 ms. (16 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1997 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1686 ms. (23 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1999 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 4626 ms. (8 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1947 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1995 ms. (20 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 3127 ms. (12 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2157 ms. (18 steps per ms) remains 12/12 properties
[2024-05-28 03:16:50] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 12 unsolved in 45028 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2500 variables, 1000/1000 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2500 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 2500/5000 variables, 2500/3500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5000 variables, 0/3500 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 5000/5000 variables, and 3500 constraints, problems are : Problem set: 0 solved, 12 unsolved in 45033 ms.
Refiners :[Positive P Invariants (semi-flows): 1000/1000 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 91304ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 47 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000500-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 03:18:22] [INFO ] Flatten gal took : 135 ms
[2024-05-28 03:18:22] [INFO ] Flatten gal took : 140 ms
[2024-05-28 03:18:23] [INFO ] Input system was already deterministic with 2500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 139 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 140 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:23] [INFO ] Flatten gal took : 81 ms
[2024-05-28 03:18:23] [INFO ] Flatten gal took : 92 ms
[2024-05-28 03:18:23] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 17 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:23] [INFO ] Flatten gal took : 76 ms
[2024-05-28 03:18:24] [INFO ] Flatten gal took : 106 ms
[2024-05-28 03:18:24] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 500 Post agglomeration using F-continuation condition.Transition count delta: 500
Deduced a syphon composed of 500 places in 6 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 0 with 1000 rules applied. Total rules applied 1000 place count 2000 transition count 2000
Applied a total of 1000 rules in 548 ms. Remains 2000 /2500 variables (removed 500) and now considering 2000/2500 (removed 500) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 549 ms. Remains : 2000/2500 places, 2000/2500 transitions.
[2024-05-28 03:18:24] [INFO ] Flatten gal took : 65 ms
[2024-05-28 03:18:24] [INFO ] Flatten gal took : 86 ms
[2024-05-28 03:18:25] [INFO ] Input system was already deterministic with 2000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 11 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:25] [INFO ] Flatten gal took : 94 ms
[2024-05-28 03:18:25] [INFO ] Flatten gal took : 77 ms
[2024-05-28 03:18:25] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 9 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:25] [INFO ] Flatten gal took : 67 ms
[2024-05-28 03:18:25] [INFO ] Flatten gal took : 78 ms
[2024-05-28 03:18:25] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 62 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 62 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:25] [INFO ] Flatten gal took : 65 ms
[2024-05-28 03:18:25] [INFO ] Flatten gal took : 75 ms
[2024-05-28 03:18:26] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 7 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:26] [INFO ] Flatten gal took : 66 ms
[2024-05-28 03:18:26] [INFO ] Flatten gal took : 76 ms
[2024-05-28 03:18:26] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 150 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 150 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:26] [INFO ] Flatten gal took : 63 ms
[2024-05-28 03:18:26] [INFO ] Flatten gal took : 78 ms
[2024-05-28 03:18:26] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 7 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:26] [INFO ] Flatten gal took : 68 ms
[2024-05-28 03:18:27] [INFO ] Flatten gal took : 76 ms
[2024-05-28 03:18:27] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 48 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:27] [INFO ] Flatten gal took : 62 ms
[2024-05-28 03:18:27] [INFO ] Flatten gal took : 74 ms
[2024-05-28 03:18:27] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 95 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 96 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:27] [INFO ] Flatten gal took : 61 ms
[2024-05-28 03:18:27] [INFO ] Flatten gal took : 71 ms
[2024-05-28 03:18:28] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 58 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 58 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:28] [INFO ] Flatten gal took : 68 ms
[2024-05-28 03:18:28] [INFO ] Flatten gal took : 70 ms
[2024-05-28 03:18:28] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 55 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 56 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:28] [INFO ] Flatten gal took : 61 ms
[2024-05-28 03:18:28] [INFO ] Flatten gal took : 69 ms
[2024-05-28 03:18:28] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 12 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:28] [INFO ] Flatten gal took : 61 ms
[2024-05-28 03:18:28] [INFO ] Flatten gal took : 70 ms
[2024-05-28 03:18:29] [INFO ] Input system was already deterministic with 2500 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 30 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2024-05-28 03:18:29] [INFO ] Flatten gal took : 56 ms
[2024-05-28 03:18:29] [INFO ] Flatten gal took : 63 ms
[2024-05-28 03:18:29] [INFO ] Input system was already deterministic with 2500 transitions.
[2024-05-28 03:18:29] [INFO ] Flatten gal took : 79 ms
[2024-05-28 03:18:29] [INFO ] Flatten gal took : 82 ms
[2024-05-28 03:18:30] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 27 ms.
[2024-05-28 03:18:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2500 transitions and 8000 arcs took 20 ms.
Total runtime 207600 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Philosophers-COL-000500

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 2500
TRANSITIONS: 2500
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.064s, Sys 0.007s]


SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.012s, 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: 598
MODEL NAME: /home/mcc/execution/416/model
2500 places, 2500 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.
Building monolithic NSF...
FORMULA Philosophers-COL-000500-CTLCardinality-2024-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-COL-000500-CTLCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-COL-000500-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-COL-000500-CTLCardinality-2024-01 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-02 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-04 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-05 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-06 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-07 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-09 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-10 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-11 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-12 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-13 CANNOT_COMPUTE
FORMULA Philosophers-COL-000500-CTLCardinality-2024-14 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716869471722

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Error in allocating array of size 65536 at unique_table.cc, line 313
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

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="Philosophers-COL-000500"
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 Philosophers-COL-000500, 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 r267-smll-171654406400425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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