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

About the Execution of GreatSPN+red for Philosophers-PT-000200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12552.527 3600000.00 11405560.00 5791.00 ??????T?F?FFTF?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-171654406600521.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-PT-000200, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654406600521
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.8M
-rw-r--r-- 1 mcc users 168K Apr 13 10:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 945K Apr 13 10:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 101K Apr 13 10:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 641K Apr 13 10:08 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 72K Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 284K Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 71K Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 342K Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 227K Apr 13 10:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.3M Apr 13 10:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 301K Apr 13 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.0M Apr 13 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 445K 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-PT-000200-CTLCardinality-2024-00
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-01
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-02
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-03
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-04
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-05
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-06
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-07
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-08
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-09
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-10
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-11
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-12
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-13
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-14
FORMULA_NAME Philosophers-PT-000200-CTLCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716930125207

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 21:02:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 21:02:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 21:02:08] [INFO ] Load time of PNML (sax parser for PT used): 483 ms
[2024-05-28 21:02:08] [INFO ] Transformed 1000 places.
[2024-05-28 21:02:08] [INFO ] Transformed 1000 transitions.
[2024-05-28 21:02:08] [INFO ] Found NUPN structural information;
[2024-05-28 21:02:08] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 740 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 108 ms.
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 47 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2024-05-28 21:02:08] [INFO ] Computed 400 invariants in 52 ms
[2024-05-28 21:02:09] [INFO ] Implicit Places using invariants in 1228 ms returned []
[2024-05-28 21:02:09] [INFO ] Invariant cache hit.
[2024-05-28 21:02:11] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 2638 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-05-28 21:02:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/800 variables, 800/800 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/800 variables, 200/1000 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/800 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 200/1000 variables, 200/1200 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 30445ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 30498ms
Finished structural reductions in LTL mode , in 1 iterations and 33249 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 1000 out of 1000 places after structural reductions.
[2024-05-28 21:02:42] [INFO ] Flatten gal took : 224 ms
[2024-05-28 21:02:42] [INFO ] Flatten gal took : 144 ms
[2024-05-28 21:02:42] [INFO ] Input system was already deterministic with 1000 transitions.
RANDOM walk for 40000 steps (8 resets) in 6914 ms. (5 steps per ms) remains 6/82 properties
BEST_FIRST walk for 40004 steps (8 resets) in 921 ms. (43 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 788 ms. (50 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 809 ms. (49 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 569 ms. (70 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 546 ms. (73 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1453 ms. (27 steps per ms) remains 6/6 properties
[2024-05-28 21:02:46] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/600 variables, 600/600 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/600 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp32 is UNSAT
At refinement iteration 2 (OVERLAPS) 400/1000 variables, 400/1000 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 400/1400 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1000/2000 variables, 1000/2400 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2000 variables, 0/2400 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/2000 variables, 0/2400 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2000/2000 variables, and 2400 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1827 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 800/1000 variables, 400/600 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1000 variables, 800/1400 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1000 variables, 0/1400 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1000/2000 variables, 1000/2400 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2000/2000 variables, and 2405 constraints, problems are : Problem set: 1 solved, 5 unsolved in 5010 ms.
Refiners :[Domain max(s): 1000/1000 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 1000/1000 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 7475ms problems are : Problem set: 1 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Free-agglomeration rule (complex) applied 400 times.
Iterating global reduction 0 with 400 rules applied. Total rules applied 400 place count 1000 transition count 600
Reduce places removed 400 places and 0 transitions.
Ensure Unique test removed 200 transitions
Reduce isomorphic transitions removed 200 transitions.
Iterating post reduction 0 with 600 rules applied. Total rules applied 1000 place count 600 transition count 400
Applied a total of 1000 rules in 533 ms. Remains 600 /1000 variables (removed 400) and now considering 400/1000 (removed 600) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 534 ms. Remains : 600/1000 places, 400/1000 transitions.
RANDOM walk for 40000 steps (8 resets) in 2281 ms. (17 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 711 ms. (56 steps per ms) remains 1/1 properties
// Phase 1: matrix 400 rows 600 cols
[2024-05-28 21:02:55] [INFO ] Computed 400 invariants in 4 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 400/600 variables, 400/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/600 variables, 400/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/1000 variables, 600/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1000 variables, 0/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1000/1000 variables, and 1600 constraints, problems are : Problem set: 0 solved, 1 unsolved in 775 ms.
Refiners :[Domain max(s): 600/600 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 200/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/200 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 400/600 variables, 400/600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/600 variables, 400/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/600 variables, 0/1000 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 400/1000 variables, 600/1600 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1000 variables, 1/1601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1000 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1000 variables, 0/1601 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1000/1000 variables, and 1601 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2101 ms.
Refiners :[Domain max(s): 600/600 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2946ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 129 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 12 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-05-28 21:02:58] [INFO ] Flatten gal took : 61 ms
[2024-05-28 21:02:58] [INFO ] Flatten gal took : 67 ms
[2024-05-28 21:02:58] [INFO ] Input system was already deterministic with 1000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 53 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:02:58] [INFO ] Flatten gal took : 69 ms
[2024-05-28 21:02:59] [INFO ] Flatten gal took : 75 ms
[2024-05-28 21:02:59] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 7 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:02:59] [INFO ] Flatten gal took : 42 ms
[2024-05-28 21:02:59] [INFO ] Flatten gal took : 39 ms
[2024-05-28 21:02:59] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:02:59] [INFO ] Flatten gal took : 36 ms
[2024-05-28 21:02:59] [INFO ] Flatten gal took : 41 ms
[2024-05-28 21:02:59] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 4 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:02:59] [INFO ] Flatten gal took : 32 ms
[2024-05-28 21:02:59] [INFO ] Flatten gal took : 34 ms
[2024-05-28 21:02:59] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 29 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:02:59] [INFO ] Flatten gal took : 30 ms
[2024-05-28 21:02:59] [INFO ] Flatten gal took : 42 ms
[2024-05-28 21:03:00] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:00] [INFO ] Flatten gal took : 31 ms
[2024-05-28 21:03:00] [INFO ] Flatten gal took : 35 ms
[2024-05-28 21:03:00] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 49 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 49 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:00] [INFO ] Flatten gal took : 29 ms
[2024-05-28 21:03:00] [INFO ] Flatten gal took : 31 ms
[2024-05-28 21:03:00] [INFO ] Input system was already deterministic with 1000 transitions.
RANDOM walk for 945 steps (0 resets) in 539 ms. (1 steps per ms) remains 0/1 properties
FORMULA Philosophers-PT-000200-CTLCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:00] [INFO ] Flatten gal took : 27 ms
[2024-05-28 21:03:00] [INFO ] Flatten gal took : 31 ms
[2024-05-28 21:03:00] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 56 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:00] [INFO ] Flatten gal took : 27 ms
[2024-05-28 21:03:00] [INFO ] Flatten gal took : 29 ms
[2024-05-28 21:03:00] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 49 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 26 ms
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 29 ms
[2024-05-28 21:03:01] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 51 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 29 ms
[2024-05-28 21:03:01] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 24 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 27 ms
[2024-05-28 21:03:01] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 199 Post agglomeration using F-continuation condition.Transition count delta: 199
Deduced a syphon composed of 199 places in 0 ms
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 0 with 398 rules applied. Total rules applied 398 place count 801 transition count 801
Applied a total of 398 rules in 136 ms. Remains 801 /1000 variables (removed 199) and now considering 801/1000 (removed 199) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 137 ms. Remains : 801/1000 places, 801/1000 transitions.
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 23 ms
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 33 ms
[2024-05-28 21:03:01] [INFO ] Input system was already deterministic with 801 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 21 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 34 ms
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 30 ms
[2024-05-28 21:03:01] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 27 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 27 ms
[2024-05-28 21:03:01] [INFO ] Flatten gal took : 40 ms
[2024-05-28 21:03:02] [INFO ] Input system was already deterministic with 1000 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 31 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 1000/1000 places, 1000/1000 transitions.
[2024-05-28 21:03:02] [INFO ] Flatten gal took : 25 ms
[2024-05-28 21:03:02] [INFO ] Flatten gal took : 27 ms
[2024-05-28 21:03:02] [INFO ] Input system was already deterministic with 1000 transitions.
[2024-05-28 21:03:02] [INFO ] Flatten gal took : 32 ms
[2024-05-28 21:03:02] [INFO ] Flatten gal took : 32 ms
[2024-05-28 21:03:02] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 15 ms.
[2024-05-28 21:03:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1000 transitions and 3200 arcs took 12 ms.
Total runtime 55162 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Philosophers-PT-000200

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.005s, 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: 570
MODEL NAME: /home/mcc/execution/410/model
1000 places, 1000 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.
Building monolithic NSF...
FORMULA Philosophers-PT-000200-CTLCardinality-2024-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-000200-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-000200-CTLCardinality-2024-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-000200-CTLCardinality-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-000200-CTLCardinality-2024-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA Philosophers-PT-000200-CTLCardinality-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL

BK_TIME_CONFINEMENT_REACHED

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

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-PT-000200"
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-PT-000200, 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-171654406600521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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