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.r298-tall-167873951500286.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 marciexred
Input is PhilosophersDyn-COL-10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r298-tall-167873951500286
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.2K Feb 26 12:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 12:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 12:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 12:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Feb 26 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:34 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 32K 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 PhilosophersDyn-COL-10-ReachabilityCardinality-00
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-01
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-02
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-03
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-04
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-05
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-06
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-07
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-08
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-09
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-10
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-11
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-12
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-13
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-14
FORMULA_NAME PhilosophersDyn-COL-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679497471992

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=marciexred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PhilosophersDyn-COL-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:04:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 15:04:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:04:33] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 15:04:33] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 15:04:34] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 659 ms
[2023-03-22 15:04:34] [INFO ] Imported 8 HL places and 7 HL transitions for a total of 170 PT places and 2320.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 15:04:34] [INFO ] Built PT skeleton of HLPN with 8 places and 7 transitions 33 arcs in 3 ms.
[2023-03-22 15:04:34] [INFO ] Skeletonized 15 HLPN properties in 1 ms.
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
[2023-03-22 15:04:34] [INFO ] Flatten gal took : 15 ms
[2023-03-22 15:04:34] [INFO ] Flatten gal took : 3 ms
Domain [Philosopher(10), Philosopher(10)] of place Neighbourhood breaks symmetries in sort Philosopher
[2023-03-22 15:04:34] [INFO ] Unfolded HLPN to a Petri net with 170 places and 2310 transitions 18190 arcs in 66 ms.
[2023-03-22 15:04:34] [INFO ] Unfolded 15 HLPN properties in 2 ms.
Ensure Unique test removed 45 transitions
Reduce redundant transitions removed 45 transitions.
Incomplete random walk after 10000 steps, including 1201 resets, run finished after 695 ms. (steps per millisecond=14 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 8 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 13 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 7 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 15) seen :0
Interrupted probabilistic random walk after 169584 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169584 steps, saw 43836 distinct states, run finished after 3002 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 15 properties.
[2023-03-22 15:04:38] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
// Phase 1: matrix 1905 rows 170 cols
[2023-03-22 15:04:38] [INFO ] Computed 39 place invariants in 61 ms
[2023-03-22 15:04:40] [INFO ] [Real]Absence check using 30 positive place invariants in 7 ms returned sat
[2023-03-22 15:04:40] [INFO ] [Real]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-22 15:04:40] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:11
[2023-03-22 15:04:40] [INFO ] [Nat]Absence check using 30 positive place invariants in 6 ms returned sat
[2023-03-22 15:04:40] [INFO ] [Nat]Absence check using 30 positive and 9 generalized place invariants in 4 ms returned sat
[2023-03-22 15:04:40] [INFO ] After 486ms SMT Verify possible using state equation in natural domain returned unsat :14 sat :1
[2023-03-22 15:04:40] [INFO ] State equation strengthened by 1030 read => feed constraints.
[2023-03-22 15:04:41] [INFO ] After 511ms SMT Verify possible using 1030 Read/Feed constraints in natural domain returned unsat :14 sat :1
[2023-03-22 15:04:41] [INFO ] After 668ms SMT Verify possible using trap constraints in natural domain returned unsat :14 sat :1
Attempting to minimize the solution found.
Minimization took 197 ms.
[2023-03-22 15:04:41] [INFO ] After 1565ms SMT Verify possible using all constraints in natural domain returned unsat :14 sat :1
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-13 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-09 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PhilosophersDyn-COL-10-ReachabilityCardinality-00 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 15 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 2265/2265 transitions.
Applied a total of 0 rules in 212 ms. Remains 170 /170 variables (removed 0) and now considering 2265/2265 (removed 0) transitions.
[2023-03-22 15:04:41] [INFO ] Flow matrix only has 1905 transitions (discarded 360 similar events)
[2023-03-22 15:04:41] [INFO ] Invariant cache hit.
[2023-03-22 15:04:42] [INFO ] Dead Transitions using invariants and state equation in 812 ms found 380 transitions.
Found 380 dead transitions using SMT.
Drop transitions removed 380 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 170/170 places, 1885/2265 transitions.
Applied a total of 0 rules in 89 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1127 ms. Remains : 170/170 places, 1885/2265 transitions.
Incomplete random walk after 10000 steps, including 1195 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 138 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 379231 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{}
Probabilistic random walk after 379231 steps, saw 94784 distinct states, run finished after 3001 ms. (steps per millisecond=126 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1885 rows 170 cols
[2023-03-22 15:04:46] [INFO ] Computed 39 place invariants in 53 ms
[2023-03-22 15:04:46] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:04:46] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-22 15:04:46] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 9 ms returned sat
[2023-03-22 15:04:46] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:04:46] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 15:04:48] [INFO ] After 2082ms SMT Verify possible using 1010 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 15:04:49] [INFO ] After 3100ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 247 ms.
[2023-03-22 15:04:50] [INFO ] After 3883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 160 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 133 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 170/170 places, 1885/1885 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 122 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
[2023-03-22 15:04:50] [INFO ] Invariant cache hit.
[2023-03-22 15:04:50] [INFO ] Implicit Places using invariants in 126 ms returned []
[2023-03-22 15:04:50] [INFO ] Invariant cache hit.
[2023-03-22 15:04:50] [INFO ] State equation strengthened by 1010 read => feed constraints.
[2023-03-22 15:04:51] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
[2023-03-22 15:04:51] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-22 15:04:51] [INFO ] Invariant cache hit.
[2023-03-22 15:04:52] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1922 ms. Remains : 170/170 places, 1885/1885 transitions.
Applied a total of 0 rules in 29 ms. Remains 170 /170 variables (removed 0) and now considering 1885/1885 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-22 15:04:52] [INFO ] Invariant cache hit.
[2023-03-22 15:04:52] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 15:04:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-22 15:04:52] [INFO ] [Nat]Absence check using 9 positive and 30 generalized place invariants in 12 ms returned sat
[2023-03-22 15:04:52] [INFO ] After 462ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 15:04:52] [INFO ] After 556ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-22 15:04:53] [INFO ] After 702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 15:04:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2023-03-22 15:04:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 170 places, 1885 transitions and 14300 arcs took 13 ms.
[2023-03-22 15:04:53] [INFO ] Flatten gal took : 242 ms
Total runtime 19957 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: PhilosophersDyn_COL_10_unf
(NrP: 170 NrTr: 1885 NrArc: 14300)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.059sec

net check time: 0m 0.001sec

init dd package: 0m 2.710sec


RS generation: 6m 7.732sec


-> reachability set: #nodes 1019266 (1.0e+06) #states 199,051 (5)



starting MCC model checker
--------------------------

checking: AG [[[~ [sum(p159, p158, p157, p156, p155, p154, p153, p152, p151, p150)<=sum(p119, p118, p117, p116, p115, p114, p113, p112, p111, p110)] | 52<=sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80, p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0)] | [[~ [55<=sum(p129, p128, p127, p126, p125, p124, p123, p122, p121, p120)] & [[sum(p129, p128, p127, p126, p125, p124, p123, p122, p121, p120)<=sum(p139, p138, p137, p136, p135, p134, p133, p132, p131, p130) | sum(p159, p158, p157, p156, p155, p154, p153, p152, p151, p150)<=sum(p129, p128, p127, p126, p125, p124, p123, p122, p121, p120)] | sum(p159, p158, p157, p156, p155, p154, p153, p152, p151, p150)<=sum(p169, p168, p167, p166, p165, p164, p163, p162, p161, p160)]] | [~ [sum(p119, p118, p117, p116, p115, p114, p113, p112, p111, p110)<=10] & [[[sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80, p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0)<=65 & 46<=sum(p139, p138, p137, p136, p135, p134, p133, p132, p131, p130)] | sum(p129, p128, p127, p126, p125, p124, p123, p122, p121, p120)<=sum(p149, p148, p147, p146, p145, p144, p143, p142, p141, p140)] & [[18<=sum(p119, p118, p117, p116, p115, p114, p113, p112, p111, p110) | 67<=sum(p159, p158, p157, p156, p155, p154, p153, p152, p151, p150)] | [[[~ [sum(p159, p158, p157, p156, p155, p154, p153, p152, p151, p150)<=3] & [~ [33<=sum(p129, p128, p127, p126, p125, p124, p123, p122, p121, p120)] & 57<=sum(p119, p118, p117, p116, p115, p114, p113, p112, p111, p110)]] | [[~ [83<=sum(p119, p118, p117, p116, p115, p114, p113, p112, p111, p110)] | ~ [sum(p149, p148, p147, p146, p145, p144, p143, p142, p141, p140)<=sum(p99, p98, p97, p96, p95, p94, p93, p92, p91, p90, p89, p88, p87, p86, p85, p84, p83, p82, p81, p80, p79, p78, p77, p76, p75, p74, p73, p72, p71, p70, p69, p68, p67, p66, p65, p64, p63, p62, p61, p60, p59, p58, p57, p56, p55, p54, p53, p52, p51, p50, p49, p48, p47, p46, p45, p44, p43, p42, p41, p40, p39, p38, p37, p36, p35, p34, p33, p32, p31, p30, p29, p28, p27, p26, p25, p24, p23, p22, p21, p20, p19, p18, p17, p16, p15, p14, p13, p12, p11, p10, p9, p8, p7, p6, p5, p4, p3, p2, p1, p0)]] & 22<=sum(p169, p168, p167, p166, p165, p164, p163, p162, p161, p160)]] | ~ [sum(p149, p148, p147, p146, p145, p144, p143, p142, p141, p140)<=sum(p159, p158, p157, p156, p155, p154, p153, p152, p151, p150)]]]]]]]]
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 10420520 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16094600 kB

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//
++ 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 ReachabilityCardinality -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.008sec

86812 146417 179665 214446 258679 329994 384828 418359 445446 476597 503412 529822 559422 598212 609614 621807 643139 653368 664573 742820 802304 815592 825381 830455 838561 867117 882941 916398 929715 950417 970871 982397 1003315 1019611
iterations count:3496003 (1854), effective:7578 (4)

initing FirstDep: 0m 0.007sec

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="PhilosophersDyn-COL-10"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is PhilosophersDyn-COL-10, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r298-tall-167873951500286"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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