Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..................
/home/mcc/execution
total 3.3M
-rw-r--r-- 1 mcc users 89K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 321K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 73K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 342K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 39K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 133K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 125K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 105K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 374K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 127K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 593K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 22K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 828K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool ltsmin
Input is Philosophers-PT-000200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r257-csrt-152732583600228
=====================================================================

--------------------
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-LTLFireability-00
FORMULA_NAME Philosophers-PT-000200-LTLFireability-01
FORMULA_NAME Philosophers-PT-000200-LTLFireability-02
FORMULA_NAME Philosophers-PT-000200-LTLFireability-03
FORMULA_NAME Philosophers-PT-000200-LTLFireability-04
FORMULA_NAME Philosophers-PT-000200-LTLFireability-05
FORMULA_NAME Philosophers-PT-000200-LTLFireability-06
FORMULA_NAME Philosophers-PT-000200-LTLFireability-07
FORMULA_NAME Philosophers-PT-000200-LTLFireability-08
FORMULA_NAME Philosophers-PT-000200-LTLFireability-09
FORMULA_NAME Philosophers-PT-000200-LTLFireability-10
FORMULA_NAME Philosophers-PT-000200-LTLFireability-11
FORMULA_NAME Philosophers-PT-000200-LTLFireability-12
FORMULA_NAME Philosophers-PT-000200-LTLFireability-13
FORMULA_NAME Philosophers-PT-000200-LTLFireability-14
FORMULA_NAME Philosophers-PT-000200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527451905645

FORMULA Philosophers-PT-000200-LTLFireability-00 CANNOT_COMPUTE
FORMULA Philosophers-PT-000200-LTLFireability-01 CANNOT_COMPUTE
FORMULA Philosophers-PT-000200-LTLFireability-02 CANNOT_COMPUTE
FORMULA Philosophers-PT-000200-LTLFireability-03 CANNOT_COMPUTE
FORMULA Philosophers-PT-000200-LTLFireability-04 CANNOT_COMPUTE
FORMULA Philosophers-PT-000200-LTLFireability-05 CANNOT_COMPUTE
FORMULA Philosophers-PT-000200-LTLFireability-06 CANNOT_COMPUTE
FORMULA Philosophers-PT-000200-LTLFireability-07 CANNOT_COMPUTE
FORMULA Philosophers-PT-000200-LTLFireability-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Philosophers-PT-000200-LTLFireability-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Philosophers-PT-000200-LTLFireability-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Philosophers-PT-000200-LTLFireability-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Philosophers-PT-000200-LTLFireability-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Philosophers-PT-000200-LTLFireability-13 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Philosophers-PT-000200-LTLFireability-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Philosophers-PT-000200-LTLFireability-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1527453706186

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

mcc2018
ltl formula name Philosophers-PT-000200-LTLFireability-00
ltl formula formula --ltl=/tmp/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.660 real 0.200 user 1.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_0_
ltl formula name Philosophers-PT-000200-LTLFireability-01
ltl formula formula --ltl=/tmp/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.340 real 0.130 user 0.490 sys
ltl formula name Philosophers-PT-000200-LTLFireability-02
ltl formula formula --ltl=/tmp/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.150 user 0.830 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_2_
ltl formula name Philosophers-PT-000200-LTLFireability-03
ltl formula formula --ltl=/tmp/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_3_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.640 real 0.230 user 1.010 sys
ltl formula name Philosophers-PT-000200-LTLFireability-04
ltl formula formula --ltl=/tmp/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.060 user 1.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_4_
ltl formula name Philosophers-PT-000200-LTLFireability-05
ltl formula formula --ltl=/tmp/ltl_5_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.070 user 1.050 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/ltl_5_
ltl formula name Philosophers-PT-000200-LTLFireability-06
ltl formula formula --ltl=/tmp/ltl_6_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_6_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.130 user 0.920 sys
ltl formula name Philosophers-PT-000200-LTLFireability-07
ltl formula formula --ltl=/tmp/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_7_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.500 real 0.090 user 0.940 sys
ltl formula name Philosophers-PT-000200-LTLFireability-08
ltl formula formula --ltl=/tmp/ltl_8_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_8_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.800 real 0.170 user 1.420 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 1002 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~10!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 222
pnml2lts-mc( 0/ 4): unique states count: 256
pnml2lts-mc( 0/ 4): unique transitions count: 13263
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 50
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 262
pnml2lts-mc( 0/ 4): - cum. max stack depth: 39
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 262 states 15263 transitions, fanout: 58.256
pnml2lts-mc( 0/ 4): Total exploration time 0.640 sec (0.620 sec minimum, 0.630 sec on average)
pnml2lts-mc( 0/ 4): States per second: 409, Transitions per second: 23848
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.6MB, 44.1 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1031 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.6MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000200-LTLFireability-09
ltl formula formula --ltl=/tmp/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_9_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.060 user 1.050 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 1001 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.020 sec minimum, 0.025 sec on average)
pnml2lts-mc( 0/ 4): States per second: 133, Transitions per second: 133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 288.0 B/state, compr.: 7.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1031 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000200-LTLFireability-10
ltl formula formula --ltl=/tmp/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_10_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.600 real 0.080 user 1.040 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 1001 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~8!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 28
pnml2lts-mc( 0/ 4): unique transitions count: 10979
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 32
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32 states 12581 transitions, fanout: 393.156
pnml2lts-mc( 0/ 4): Total exploration time 0.520 sec (0.480 sec minimum, 0.500 sec on average)
pnml2lts-mc( 0/ 4): States per second: 62, Transitions per second: 24194
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.5MB, 45.2 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1031 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.5MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000200-LTLFireability-11
ltl formula formula --ltl=/tmp/ltl_11_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_11_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.770 real 0.220 user 1.220 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 1005 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~22!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 90
pnml2lts-mc( 0/ 4): unique transitions count: 34195
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 12
pnml2lts-mc( 0/ 4): - claim success count: 93
pnml2lts-mc( 0/ 4): - cum. max stack depth: 93
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 93 states 35399 transitions, fanout: 380.634
pnml2lts-mc( 0/ 4): Total exploration time 1.350 sec (1.300 sec minimum, 1.320 sec on average)
pnml2lts-mc( 0/ 4): States per second: 69, Transitions per second: 26221
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.4MB, 42.3 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1031 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.4MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000200-LTLFireability-12
ltl formula formula --ltl=/tmp/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_12_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.620 real 0.170 user 0.960 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 1003 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~46!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 185
pnml2lts-mc( 0/ 4): unique transitions count: 65557
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 10
pnml2lts-mc( 0/ 4): - claim success count: 188
pnml2lts-mc( 0/ 4): - cum. max stack depth: 188
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 188 states 66761 transitions, fanout: 355.112
pnml2lts-mc( 0/ 4): Total exploration time 2.370 sec (2.350 sec minimum, 2.360 sec on average)
pnml2lts-mc( 0/ 4): States per second: 79, Transitions per second: 28169
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 2.8MB, 44.8 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1031 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 2.8MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000200-LTLFireability-13
ltl formula formula --ltl=/tmp/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/ltl_13_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.420 real 0.110 user 0.650 sys
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 1008 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.010 sec minimum, 0.023 sec on average)
pnml2lts-mc( 0/ 4): States per second: 133, Transitions per second: 133
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 288.0 B/state, compr.: 7.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1031 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000200-LTLFireability-14
ltl formula formula --ltl=/tmp/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.040 user 0.940 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/ltl_14_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 1001 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~31!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 123
pnml2lts-mc( 0/ 4): unique transitions count: 45377
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 126
pnml2lts-mc( 0/ 4): - cum. max stack depth: 126
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 126 states 46581 transitions, fanout: 369.690
pnml2lts-mc( 0/ 4): Total exploration time 1.710 sec (1.680 sec minimum, 1.692 sec on average)
pnml2lts-mc( 0/ 4): States per second: 74, Transitions per second: 27240
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 1.9MB, 44.6 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1031 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.9MB (~8192.0MB paged-in)
ltl formula name Philosophers-PT-000200-LTLFireability-15
ltl formula formula --ltl=/tmp/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 1000 transitions and 3200 arcs
pnml2lts-mc( 0/ 4): Petri net Philosophers-PT-000200 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/ltl_15_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.660 real 0.130 user 1.160 sys
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 1004 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^30 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~9!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 37
pnml2lts-mc( 0/ 4): unique transitions count: 14435
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 40
pnml2lts-mc( 0/ 4): - cum. max stack depth: 40
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 40 states 15639 transitions, fanout: 390.975
pnml2lts-mc( 0/ 4): Total exploration time 0.700 sec (0.670 sec minimum, 0.688 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57, Transitions per second: 22341
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.6MB, 44.5 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 1031 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.6MB (~8192.0MB paged-in)

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="LTLFireability"
export BK_TOOL="ltsmin"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000200.tgz
mv Philosophers-PT-000200 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool ltsmin"
echo " Input is Philosophers-PT-000200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r257-csrt-152732583600228"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;