fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r297-tall-167873950100234
Last Updated
May 14, 2023

About the Execution of LTSMin+red for Philosophers-PT-000500

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11926.352 126664.00 169388.00 707.20 [undef] Cannot compute

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950100234.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is Philosophers-PT-000500, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950100234
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 716K Feb 25 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Feb 25 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 379K Feb 25 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.4M Feb 25 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 214K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 840K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 184K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 850K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.5M Feb 25 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 234K Feb 25 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 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-000500-CTLFireability-00
FORMULA_NAME Philosophers-PT-000500-CTLFireability-01
FORMULA_NAME Philosophers-PT-000500-CTLFireability-02
FORMULA_NAME Philosophers-PT-000500-CTLFireability-03
FORMULA_NAME Philosophers-PT-000500-CTLFireability-04
FORMULA_NAME Philosophers-PT-000500-CTLFireability-05
FORMULA_NAME Philosophers-PT-000500-CTLFireability-06
FORMULA_NAME Philosophers-PT-000500-CTLFireability-07
FORMULA_NAME Philosophers-PT-000500-CTLFireability-08
FORMULA_NAME Philosophers-PT-000500-CTLFireability-09
FORMULA_NAME Philosophers-PT-000500-CTLFireability-10
FORMULA_NAME Philosophers-PT-000500-CTLFireability-11
FORMULA_NAME Philosophers-PT-000500-CTLFireability-12
FORMULA_NAME Philosophers-PT-000500-CTLFireability-13
FORMULA_NAME Philosophers-PT-000500-CTLFireability-14
FORMULA_NAME Philosophers-PT-000500-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679470579189

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000500
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 07:36:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 07:36:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 07:36:21] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2023-03-22 07:36:21] [INFO ] Transformed 2500 places.
[2023-03-22 07:36:21] [INFO ] Transformed 2500 transitions.
[2023-03-22 07:36:21] [INFO ] Parsed PT model containing 2500 places and 2500 transitions and 8000 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 102 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 44 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-22 07:36:22] [INFO ] Computed 1000 place invariants in 41 ms
[2023-03-22 07:36:23] [INFO ] Implicit Places using invariants in 878 ms returned []
[2023-03-22 07:36:23] [INFO ] Invariant cache hit.
[2023-03-22 07:36:25] [INFO ] Implicit Places using invariants and state equation in 1620 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2023-03-22 07:36:25] [INFO ] Invariant cache hit.
[2023-03-22 07:36:27] [INFO ] Dead Transitions using invariants and state equation in 1894 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4474 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2023-03-22 07:36:28] [INFO ] Flatten gal took : 374 ms
[2023-03-22 07:36:30] [INFO ] Flatten gal took : 373 ms
[2023-03-22 07:36:32] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1135 ms. (steps per millisecond=8 ) properties (out of 76) seen :62
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1748 ms. (steps per millisecond=5 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1020 ms. (steps per millisecond=9 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1029 ms. (steps per millisecond=9 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1849 ms. (steps per millisecond=5 ) properties (out of 14) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1905 ms. (steps per millisecond=5 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 999 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1160 ms. (steps per millisecond=8 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1708 ms. (steps per millisecond=5 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1689 ms. (steps per millisecond=5 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-22 07:36:47] [INFO ] Invariant cache hit.
[2023-03-22 07:36:54] [INFO ] [Real]Absence check using 1000 positive place invariants in 225 ms returned sat
[2023-03-22 07:36:55] [INFO ] After 1478ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-22 07:36:56] [INFO ] [Nat]Absence check using 1000 positive place invariants in 230 ms returned sat
[2023-03-22 07:37:16] [INFO ] After 12694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2023-03-22 07:37:19] [INFO ] After 15868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
Attempting to minimize the solution found.
Minimization took 692 ms.
[2023-03-22 07:37:20] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 12 Parikh solutions to 7 different solutions.
Parikh walk visited 11 properties in 668 ms.
Support contains 1500 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 148 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 148 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 476 ms. (steps per millisecond=21 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1777 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 153321 steps, run timeout after 6034 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 153321 steps, saw 153091 distinct states, run finished after 6038 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 07:37:29] [INFO ] Invariant cache hit.
[2023-03-22 07:37:30] [INFO ] [Real]Absence check using 1000 positive place invariants in 219 ms returned sat
[2023-03-22 07:37:31] [INFO ] After 724ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:37:31] [INFO ] [Nat]Absence check using 1000 positive place invariants in 217 ms returned sat
[2023-03-22 07:37:43] [INFO ] After 12822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1500 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 103 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 103 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 56 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-22 07:37:43] [INFO ] Invariant cache hit.
[2023-03-22 07:37:44] [INFO ] Implicit Places using invariants in 793 ms returned []
[2023-03-22 07:37:44] [INFO ] Invariant cache hit.
[2023-03-22 07:37:46] [INFO ] Implicit Places using invariants and state equation in 2072 ms returned []
Implicit Place search using SMT with State Equation took 2874 ms to find 0 implicit places.
[2023-03-22 07:37:47] [INFO ] Redundant transitions in 143 ms returned []
[2023-03-22 07:37:47] [INFO ] Invariant cache hit.
[2023-03-22 07:37:48] [INFO ] Dead Transitions using invariants and state equation in 1850 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4932 ms. Remains : 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.
Running SMT prover for 1 properties.
[2023-03-22 07:37:48] [INFO ] Invariant cache hit.
[2023-03-22 07:37:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 216 ms returned sat
[2023-03-22 07:37:50] [INFO ] After 671ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 07:37:51] [INFO ] [Nat]Absence check using 1000 positive place invariants in 228 ms returned sat
[2023-03-22 07:38:03] [INFO ] After 12988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
[2023-03-22 07:38:04] [INFO ] Flatten gal took : 200 ms
[2023-03-22 07:38:06] [INFO ] Flatten gal took : 432 ms
[2023-03-22 07:38:08] [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 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.
[2023-03-22 07:38:08] [INFO ] Flatten gal took : 103 ms
[2023-03-22 07:38:09] [INFO ] Flatten gal took : 182 ms
[2023-03-22 07:38:09] [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 33 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 33 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:09] [INFO ] Flatten gal took : 74 ms
[2023-03-22 07:38:09] [INFO ] Flatten gal took : 91 ms
[2023-03-22 07:38:09] [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 12 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:10] [INFO ] Flatten gal took : 71 ms
[2023-03-22 07:38:10] [INFO ] Flatten gal took : 85 ms
[2023-03-22 07:38:10] [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 24 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 25 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:10] [INFO ] Flatten gal took : 88 ms
[2023-03-22 07:38:10] [INFO ] Flatten gal took : 113 ms
[2023-03-22 07:38:10] [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 38 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 40 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:11] [INFO ] Flatten gal took : 63 ms
[2023-03-22 07:38:11] [INFO ] Flatten gal took : 71 ms
[2023-03-22 07:38:11] [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 27 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 29 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:11] [INFO ] Flatten gal took : 80 ms
[2023-03-22 07:38:11] [INFO ] Flatten gal took : 101 ms
[2023-03-22 07:38:11] [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 28 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 29 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:12] [INFO ] Flatten gal took : 66 ms
[2023-03-22 07:38:12] [INFO ] Flatten gal took : 78 ms
[2023-03-22 07:38:12] [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 17 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:12] [INFO ] Flatten gal took : 63 ms
[2023-03-22 07:38:12] [INFO ] Flatten gal took : 71 ms
[2023-03-22 07:38:12] [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 247 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 248 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:12] [INFO ] Flatten gal took : 58 ms
[2023-03-22 07:38:12] [INFO ] Flatten gal took : 63 ms
[2023-03-22 07:38:13] [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 93 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 93 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:13] [INFO ] Flatten gal took : 59 ms
[2023-03-22 07:38:13] [INFO ] Flatten gal took : 66 ms
[2023-03-22 07:38:13] [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 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 0 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 0 with 992 rules applied. Total rules applied 992 place count 2004 transition count 2004
Applied a total of 992 rules in 395 ms. Remains 2004 /2500 variables (removed 496) and now considering 2004/2500 (removed 496) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 395 ms. Remains : 2004/2500 places, 2004/2500 transitions.
[2023-03-22 07:38:14] [INFO ] Flatten gal took : 52 ms
[2023-03-22 07:38:14] [INFO ] Flatten gal took : 66 ms
[2023-03-22 07:38:14] [INFO ] Input system was already deterministic with 2004 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 76 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 77 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:14] [INFO ] Flatten gal took : 65 ms
[2023-03-22 07:38:14] [INFO ] Flatten gal took : 68 ms
[2023-03-22 07:38:14] [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 76 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 77 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:14] [INFO ] Flatten gal took : 58 ms
[2023-03-22 07:38:14] [INFO ] Flatten gal took : 66 ms
[2023-03-22 07:38:15] [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 76 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 76 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:15] [INFO ] Flatten gal took : 58 ms
[2023-03-22 07:38:15] [INFO ] Flatten gal took : 66 ms
[2023-03-22 07:38:15] [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 76 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 76 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:15] [INFO ] Flatten gal took : 58 ms
[2023-03-22 07:38:15] [INFO ] Flatten gal took : 62 ms
[2023-03-22 07:38:15] [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 62 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 62 ms. Remains : 2500/2500 places, 2500/2500 transitions.
[2023-03-22 07:38:15] [INFO ] Flatten gal took : 55 ms
[2023-03-22 07:38:15] [INFO ] Flatten gal took : 61 ms
[2023-03-22 07:38:16] [INFO ] Input system was already deterministic with 2500 transitions.
[2023-03-22 07:38:16] [INFO ] Flatten gal took : 274 ms
[2023-03-22 07:38:18] [INFO ] Flatten gal took : 277 ms
[2023-03-22 07:38:20] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 92 ms.
[2023-03-22 07:38:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 2500 transitions and 8000 arcs took 14 ms.
Total runtime 119591 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/521/ctl_0_ --ctl=/tmp/521/ctl_1_ --ctl=/tmp/521/ctl_2_ --ctl=/tmp/521/ctl_3_ --ctl=/tmp/521/ctl_4_ --ctl=/tmp/521/ctl_5_ --ctl=/tmp/521/ctl_6_ --ctl=/tmp/521/ctl_7_ --ctl=/tmp/521/ctl_8_ --ctl=/tmp/521/ctl_9_ --ctl=/tmp/521/ctl_10_ --ctl=/tmp/521/ctl_11_ --ctl=/tmp/521/ctl_12_ --ctl=/tmp/521/ctl_13_ --ctl=/tmp/521/ctl_14_ --ctl=/tmp/521/ctl_15_ --mu-par --mu-opt
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-00
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-01
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-02
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-03
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-04
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-05
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-06
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-07
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-08
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-09
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-10
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-11
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-12
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-13
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-14
Could not compute solution for formula : Philosophers-PT-000500-CTLFireability-15

BK_STOP 1679470705853

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name Philosophers-PT-000500-CTLFireability-00
ctl formula formula --ctl=/tmp/521/ctl_0_
ctl formula name Philosophers-PT-000500-CTLFireability-01
ctl formula formula --ctl=/tmp/521/ctl_1_
ctl formula name Philosophers-PT-000500-CTLFireability-02
ctl formula formula --ctl=/tmp/521/ctl_2_
ctl formula name Philosophers-PT-000500-CTLFireability-03
ctl formula formula --ctl=/tmp/521/ctl_3_
ctl formula name Philosophers-PT-000500-CTLFireability-04
ctl formula formula --ctl=/tmp/521/ctl_4_
ctl formula name Philosophers-PT-000500-CTLFireability-05
ctl formula formula --ctl=/tmp/521/ctl_5_
ctl formula name Philosophers-PT-000500-CTLFireability-06
ctl formula formula --ctl=/tmp/521/ctl_6_
ctl formula name Philosophers-PT-000500-CTLFireability-07
ctl formula formula --ctl=/tmp/521/ctl_7_
ctl formula name Philosophers-PT-000500-CTLFireability-08
ctl formula formula --ctl=/tmp/521/ctl_8_
ctl formula name Philosophers-PT-000500-CTLFireability-09
ctl formula formula --ctl=/tmp/521/ctl_9_
ctl formula name Philosophers-PT-000500-CTLFireability-10
ctl formula formula --ctl=/tmp/521/ctl_10_
ctl formula name Philosophers-PT-000500-CTLFireability-11
ctl formula formula --ctl=/tmp/521/ctl_11_
ctl formula name Philosophers-PT-000500-CTLFireability-12
ctl formula formula --ctl=/tmp/521/ctl_12_
ctl formula name Philosophers-PT-000500-CTLFireability-13
ctl formula formula --ctl=/tmp/521/ctl_13_
ctl formula name Philosophers-PT-000500-CTLFireability-14
ctl formula formula --ctl=/tmp/521/ctl_14_
ctl formula name Philosophers-PT-000500-CTLFireability-15
ctl formula formula --ctl=/tmp/521/ctl_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 2500 places, 2500 transitions and 8000 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.020 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 2500->2500 groups
pnml2lts-sym: Regrouping took 1.510 real 1.520 user 0.000 sys
pnml2lts-sym: state vector length is 2500; there are 2500 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym, ** error **: stack overflow

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-000500"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Philosophers-PT-000500, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r297-tall-167873950100234"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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