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 336K
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K 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.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.1K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K 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 2.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 169K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool irma4mcc-full
Input is FlexibleBarrier-PT-14a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r246-blw7-152732548200049
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527927252982


BK_STOP 1527927260841

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using FlexibleBarrier-PT-14a as instance name.
Using FlexibleBarrier as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': None, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 3534, 'Memory': 301.89, 'Tool': 'itstools'}, {'Time': 64377, 'Memory': 252.68, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 18.21646859083192x far from the best tool itstools.
LTLCardinality itstools FlexibleBarrier-PT-14a...
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-z3path, /usr/bin/z3, -yices2path, /usr/bin/yices, -ltsminpath, /usr/bin, -smt, -its, -pnfolder, /mcc-data, -examination, LTLCardinality]
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /mcc-data/model.pnml
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 59 ms
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 171 places.
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 578 transitions.
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.pnml.togal.PnmlToGalTransformer transform
INFO: Found NUPN structural information;
Jun 02, 2018 8:14:18 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/model.pnml.img.gal : 27 ms
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 133 ms
Jun 02, 2018 8:14:18 AM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
Jun 02, 2018 8:14:19 AM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 1083 redundant transitions.
Using solver Z3 to compute partial order matrices.
Built C files in :
/mcc-data
Jun 02, 2018 8:14:19 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /mcc-data/LTLCardinality.pnml.gal : 18 ms
Jun 02, 2018 8:14:19 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /mcc-data/LTLCardinality.ltl : 6 ms
Invoking ITS tools like this :CommandLine [args=[/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /mcc-data/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /mcc-data/LTLCardinality.ltl, -c, -stutter-deadlock], workingDir=/mcc-data]

its-ltl command run as :

/usr/share/itscl/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201804131302/bin/its-ltl-linux64 --gc-threshold 2000000 -i /mcc-data/LTLCardinality.pnml.gal -t CGAL -LTL /mcc-data/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((G("(u1.p7>=2)")))
Formula 0 simplified : !G"(u1.p7>=2)"
built 120 ordering constraints for composite.
Jun 02, 2018 8:14:19 AM fr.lip6.move.gal.semantics.CompositeNextBuilder getNextForLabel
INFO: Semantic construction discarded 170 identical transitions.
Jun 02, 2018 8:14:19 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 408 transitions.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
10 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.138168,19932,1,0,6076,992,1946,6073,299,4955,7843
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(F(F("(u14.p163>=2)")))))
Formula 1 simplified : !XF"(u14.p163>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
2 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.148562,20456,1,0,7400,1055,1961,7319,299,5702,9498
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(F("(u6.p61>=1)"))))
Formula 2 simplified : !F"(u6.p61>=1)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.193967,22832,1,0,13614,1193,2125,12711,300,6814,18621
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((X("(u7.p84>=3)"))U(F("((u11.p132==0)||(u1.p2==1))")))))
Formula 3 simplified : !X(X"(u7.p84>=3)" U F"((u11.p132==0)||(u1.p2==1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.237273,25164,1,0,19049,1275,2330,18122,302,7661,26705
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(("((u7.p84==0)||(u5.p55==1))"))
Formula 4 simplified : !"((u7.p84==0)||(u5.p55==1))"
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.237871,25428,1,0,19049,1275,2336,18122,303,7661,26723
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X(X(("((u2.p22==0)||(u2.p21==1))")U("((u3.p33==0)||(u8.p87==1))")))))
Formula 5 simplified : !XX("((u2.p22==0)||(u2.p21==1))" U "((u3.p33==0)||(u8.p87==1))")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.238975,25668,1,0,19050,1275,2357,18123,311,7661,26948
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((F("(u2.p14>=3)")))
Formula 6 simplified : !F"(u2.p14>=3)"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
5 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.292603,28040,1,0,26255,1277,2568,24917,313,7736,37458
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((X("(u10.p116>=1)")))
Formula 7 simplified : !X"(u10.p116>=1)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.293472,28304,1,0,26256,1277,2573,24917,314,7736,37500
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G("((u8.p96==0)||(u7.p75==1))")))
Formula 8 simplified : !G"((u8.p96==0)||(u7.p75==1))"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.302295,28568,1,0,26256,1277,2701,24919,314,7736,37622
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((F("(u12.p136>=1)"))U(G("((u13.p148==0)||(u11.p130==1))")))))
Formula 9 simplified : !G(F"(u12.p136>=1)" U G"((u13.p148==0)||(u11.p130==1))")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 394
// Phase 1: matrix 394 rows 171 cols
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.334415,30508,1,0,30252,1467,2752,28233,316,8973,43249
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((G("((u3.p26==0)||(u2.p22==1))")))
Formula 10 simplified : !G"((u3.p26==0)||(u2.p22==1))"
invariant :u4:p37 + u4:p38 + u4:p39 + u4:p40 + u4:p41 + u4:p42 + u4:p43 + u4:p44 + u4:p45 + u4:p46 + u4:p47 + u4:p48 + u17:p0 = 1
invariant :u14:p157 + u14:p158 + u14:p159 + u14:p160 + u14:p161 + u14:p162 + u14:p163 + u14:p164 + u14:p165 + u14:p166 + u14:p167 + u14:p168 + u17:p0 = 1
Jun 02, 2018 8:14:19 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 16 place invariants in 87 ms
invariant :u1:p1 + u1:p2 + u1:p3 + u1:p4 + u1:p5 + u1:p6 + u1:p7 + u1:p8 + u1:p9 + u1:p10 + u1:p11 + u1:p12 + u17:p0 = 1
invariant :u11:p121 + u11:p122 + u11:p123 + u11:p124 + u11:p125 + u11:p126 + u11:p127 + u11:p128 + u11:p129 + u11:p130 + u11:p131 + u11:p132 + u17:p0 = 1
invariant :u2:p13 + u2:p14 + u2:p15 + u2:p16 + u2:p17 + u2:p18 + u2:p19 + u2:p20 + u2:p21 + u2:p22 + u2:p23 + u2:p24 + u17:p0 = 1
invariant :u12:p133 + u12:p134 + u12:p135 + u12:p136 + u12:p137 + u12:p138 + u12:p139 + u12:p140 + u12:p141 + u12:p142 + u12:p143 + u12:p144 + u17:p0 = 1
invariant :u16:p170 + u17:p0 = 1
invariant :u9:p97 + u9:p98 + u9:p99 + u9:p100 + u9:p101 + u9:p102 + u9:p103 + u9:p104 + u9:p105 + u9:p106 + u9:p107 + u9:p108 + u17:p0 = 1
invariant :u10:p109 + u10:p110 + u10:p111 + u10:p112 + u10:p113 + u10:p114 + u10:p115 + u10:p116 + u10:p117 + u10:p118 + u10:p119 + u10:p120 + u17:p0 = 1
invariant :u7:p73 + u7:p74 + u7:p75 + u7:p76 + u7:p77 + u7:p78 + u7:p79 + u7:p80 + u7:p81 + u7:p82 + u7:p83 + u7:p84 + u17:p0 = 1
invariant :u8:p85 + u8:p86 + u8:p87 + u8:p88 + u8:p89 + u8:p90 + u8:p91 + u8:p92 + u8:p93 + u8:p94 + u8:p95 + u8:p96 + u17:p0 = 1
invariant :u5:p49 + u5:p50 + u5:p51 + u5:p52 + u5:p53 + u5:p54 + u5:p55 + u5:p56 + u5:p57 + u5:p58 + u5:p59 + u5:p60 + u17:p0 = 1
invariant :u15:p169 + u17:p0 = 1
invariant :u6:p61 + u6:p62 + u6:p63 + u6:p64 + u6:p65 + u6:p66 + u6:p67 + u6:p68 + u6:p69 + u6:p70 + u6:p71 + u6:p72 + u17:p0 = 1
invariant :u3:p25 + u3:p26 + u3:p27 + u3:p28 + u3:p29 + u3:p30 + u3:p31 + u3:p32 + u3:p33 + u3:p34 + u3:p35 + u3:p36 + u17:p0 = 1
invariant :u13:p145 + u13:p146 + u13:p147 + u13:p148 + u13:p149 + u13:p150 + u13:p151 + u13:p152 + u13:p153 + u13:p154 + u13:p155 + u13:p156 + u17:p0 = 1
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
8 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.41148,34468,1,0,40060,2014,2961,38307,317,14600,56065
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X(X(("(u11.p123>=2)")U("((u5.p52==0)||(u1.p5==1))")))))
Formula 11 simplified : !XX("(u11.p123>=2)" U "((u5.p52==0)||(u1.p5==1))")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.412581,34732,1,0,40060,2014,2977,38307,320,14600,56127
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !(("(u10.p118>=2)"))
Formula 12 simplified : !"(u10.p118>=2)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.412932,34996,1,0,40060,2014,2982,38307,322,14600,56135
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !(("(u10.p109>=1)"))
Formula 13 simplified : !"(u10.p109>=1)"
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.413213,34996,1,0,40060,2014,2985,38307,322,14600,56142
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !((F(F(("((u4.p48==0)||(u3.p25==1))")U("(u1.p12>=3)")))))
Formula 14 simplified : !F("((u4.p48==0)||(u3.p25==1))" U "(u1.p12>=3)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.463651,37108,1,0,47168,2014,3059,45019,324,14623,66657
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((("(u8.p95>=2)")U("((u1.p6==0)||(u9.p104==1))"))U(G(F("((u8.p94==0)||(u4.p41==1))")))))
Formula 15 simplified : !(("(u8.p95>=2)" U "((u1.p6==0)||(u9.p104==1))") U GF"((u8.p94==0)||(u4.p41==1))")
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.474145,37916,1,0,47557,2020,3236,45482,324,14840,67353
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA FlexibleBarrier-PT-14a-LTLCardinality-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

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="FlexibleBarrier-PT-14a"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="irma4mcc-full"
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/FlexibleBarrier-PT-14a.tgz
mv FlexibleBarrier-PT-14a 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 irma4mcc-full"
echo " Input is FlexibleBarrier-PT-14a, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r246-blw7-152732548200049"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;