Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r126-tajo-158961390800714.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ProductionCell-PT-none, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r126-tajo-158961390800714
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.2K Apr 12 06:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 06:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 07:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 11 07:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 10 13:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 13:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 9 20:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 9 20:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 43K Mar 24 05:37 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 ProductionCell-PT-none-00
FORMULA_NAME ProductionCell-PT-none-01
FORMULA_NAME ProductionCell-PT-none-02
FORMULA_NAME ProductionCell-PT-none-03
FORMULA_NAME ProductionCell-PT-none-04
FORMULA_NAME ProductionCell-PT-none-05
FORMULA_NAME ProductionCell-PT-none-06
FORMULA_NAME ProductionCell-PT-none-07
FORMULA_NAME ProductionCell-PT-none-08
FORMULA_NAME ProductionCell-PT-none-09
FORMULA_NAME ProductionCell-PT-none-10
FORMULA_NAME ProductionCell-PT-none-11
FORMULA_NAME ProductionCell-PT-none-12
FORMULA_NAME ProductionCell-PT-none-13
FORMULA_NAME ProductionCell-PT-none-14
FORMULA_NAME ProductionCell-PT-none-15

=== Now, execution of the tool begins

BK_START 1589851961168

[2020-05-19 01:32:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-19 01:32:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 01:32:43] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2020-05-19 01:32:43] [INFO ] Transformed 176 places.
[2020-05-19 01:32:43] [INFO ] Transformed 134 transitions.
[2020-05-19 01:32:43] [INFO ] Found NUPN structural information;
[2020-05-19 01:32:43] [INFO ] Parsed PT model containing 176 places and 134 transitions in 85 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 18 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 190 ms. (steps per millisecond=526 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 134 rows 176 cols
[2020-05-19 01:32:43] [INFO ] Computed 50 place invariants in 10 ms
[2020-05-19 01:32:43] [INFO ] [Real]Absence check using 32 positive place invariants in 24 ms returned sat
[2020-05-19 01:32:43] [INFO ] [Real]Absence check using 32 positive and 18 generalized place invariants in 8 ms returned unsat
[2020-05-19 01:32:44] [INFO ] [Real]Absence check using 32 positive place invariants in 11 ms returned sat
[2020-05-19 01:32:44] [INFO ] [Real]Absence check using 32 positive and 18 generalized place invariants in 9 ms returned sat
[2020-05-19 01:32:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 01:32:44] [INFO ] [Real]Absence check using state equation in 115 ms returned sat
[2020-05-19 01:32:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 01:32:44] [INFO ] [Nat]Absence check using 32 positive place invariants in 55 ms returned sat
[2020-05-19 01:32:44] [INFO ] [Nat]Absence check using 32 positive and 18 generalized place invariants in 6 ms returned sat
[2020-05-19 01:32:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-19 01:32:44] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2020-05-19 01:32:44] [INFO ] Deduced a trap composed of 11 places in 116 ms
[2020-05-19 01:32:44] [INFO ] Deduced a trap composed of 15 places in 221 ms
[2020-05-19 01:32:44] [INFO ] Deduced a trap composed of 8 places in 63 ms
[2020-05-19 01:32:44] [INFO ] Deduced a trap composed of 7 places in 77 ms
[2020-05-19 01:32:45] [INFO ] Deduced a trap composed of 14 places in 66 ms
[2020-05-19 01:32:45] [INFO ] Deduced a trap composed of 12 places in 65 ms
[2020-05-19 01:32:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 719 ms
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-19 01:32:45] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-19 01:32:45] [INFO ] Flatten gal took : 58 ms
FORMULA ProductionCell-PT-none-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 01:32:45] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 01:32:45] [INFO ] Applying decomposition
[2020-05-19 01:32:45] [INFO ] Flatten gal took : 37 ms
[2020-05-19 01:32:45] [INFO ] Input system was already deterministic with 134 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph737398578584754956.txt, -o, /tmp/graph737398578584754956.bin, -w, /tmp/graph737398578584754956.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph737398578584754956.bin, -l, -1, -v, -w, /tmp/graph737398578584754956.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 01:32:45] [INFO ] Decomposing Gal with order
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 134 rows 176 cols
[2020-05-19 01:32:45] [INFO ] Computed 50 place invariants in 4 ms
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p158 + p159 = 1
inv : p0 + p3 + p4 + p5 + p8 + p9 = 1
inv : p0 + p128 + p129 = 1
inv : p0 + p55 + p56 = 1
inv : p0 + p10 + p11 = 1
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p168 + p169 = 1
inv : p0 + p113 + p114 + p115 + p116 + p117 + p118 = 1
inv : p0 + p3 + p4 + p6 + p9 + p15 + p16 + p17 + p19 + 2*p20 + 3*p21 + 4*p22 + 5*p23 - p42 - p43 - p44 - p45 - p57 - p58 - p64 - p65 + p107 - p116 - p117 - p118 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 = 1
inv : p0 + p103 + p104 + p116 + p117 + p118 = 1
inv : p57 + p58 + p60 + p61 + p62 + p63 + p64 + p65 - p107 - p121 - p125 - p126 - p127 = 0
inv : p0 + p25 + p26 + p42 + p43 + p44 + p45 = 1
inv : p0 + p30 + p31 + p32 + p42 + p43 + p44 + p45 = 1
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p166 + p167 = 1
inv : p102 + p105 - p116 - p117 - p118 = 0
inv : p0 + p111 + p112 = 1
inv : p0 + p107 + p108 + p109 + p121 + p125 + p126 + p127 = 1
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p160 + p161 = 1
inv : p0 + p130 + p131 + p132 + p133 + p134 + p135 + p136 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 = 1
inv : p106 + p110 - p121 - p125 - p126 - p127 = 0
inv : p36 - p43 - p44 - p45 = 0
inv : p0 + p59 + p107 + p121 + p125 + p126 + p127 = 1
inv : p0 + p68 - p90 - p91 - p92 - p93 - p94 - p95 - p96 - p97 - p98 - p99 - p100 - p101 + p116 + p117 + p118 + p138 + p139 + p140 + p141 + p142 + p143 + p144 = 1
inv : p84 + p85 + p86 - p136 = 0
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p172 + p173 = 1
inv : p78 + p79 + p80 + p96 + p97 + p98 - p121 - p125 - p126 - p127 + p131 + p132 + p133 + p134 + p135 + p136 + p142 + p143 + p144 = 0
inv : p0 + p119 + p120 = 1
inv : p0 + p12 + p15 + p16 + p17 + p18 + p63 = 1
inv : p72 + p73 + p74 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 - p141 - p142 - p143 - p144 = 0
inv : -p0 + p87 + p88 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 + p99 + p100 + p101 - p116 - p117 - p118 - p137 - p138 - p139 - p140 - p141 - p142 - p143 - p144 = -1
inv : p0 + p46 + p47 = 1
inv : p13 + p14 - p63 = 0
inv : p0 + p121 + p122 + p123 + p124 + p125 + p126 + p127 = 1
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p174 + p175 = 1
inv : p0 + p1 + p2 = 1
inv : p0 + p39 + p40 + p41 + p42 + p43 + p44 + p45 = 1
inv : p24 + p27 - p42 - p43 - p44 - p45 = 0
inv : p81 + p82 + p83 + p99 + p100 + p101 - p131 - p132 - p133 - p134 - p135 - p142 - p143 - p144 = 0
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p164 + p165 = 1
inv : p33 + p34 + p35 - p42 = 0
inv : p0 + p28 + p29 = 1
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p170 + p171 = 1
inv : p48 + p49 + p53 + p54 - p57 - p58 - p64 - p65 = 0
inv : p0 + p37 + p38 = 1
inv : p0 + p3 + p4 + p5 + p6 + p7 = 1
inv : p0 + p66 + p67 = 1
inv : p0 + p75 + p76 + p77 - p96 - p97 - p98 - p99 - p100 - p101 + p121 + p125 + p126 + p127 + p137 + p138 + p139 + p140 + p141 + p142 + p143 + p144 = 1
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p162 + p163 = 1
inv : p69 + p70 + p71 + p90 + p91 + p92 - p138 - p139 - p140 = 0
inv : p50 + p51 + p52 + p57 + p58 + p63 + p64 + p65 - p107 - p121 - p125 - p126 - p127 = 0
inv : p0 + p145 + p146 + p147 + p148 + p149 + p150 + p151 + p152 + p153 + p154 + p155 + p156 + p157 = 1
Total of 50 invariants.
[2020-05-19 01:32:45] [INFO ] Computed 50 place invariants in 5 ms
[2020-05-19 01:32:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 01:32:45] [INFO ] Removed a total of 52 redundant transitions.
[2020-05-19 01:32:45] [INFO ] Flatten gal took : 106 ms
[2020-05-19 01:32:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 20 ms.
[2020-05-19 01:32:45] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 4 ms
[2020-05-19 01:32:45] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLFireability.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLFireability.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLFireability.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLFireability.ltl -c -stutter-deadlock
Read 12 LTL properties
Checking formula 0 : !((((!(F(X(F(X("((i4.i0.u21.p66==1)&&(i4.i2.u31.p94==1))"))))))||("((i4.i0.u21.p66==1)&&(i4.i2.u31.p94==1))"))U(((F("((i4.i0.u21.p66==1)&&(i4.i2.u31.p94==1))"))&&("(i3.u17.p56==1)"))&&("(i4.i0.u54.p150==1)"))))
Formula 0 simplified : !(("((i4.i0.u21.p66==1)&&(i4.i2.u31.p94==1))" | !FXFX"((i4.i0.u21.p66==1)&&(i4.i2.u31.p94==1))") U ("(i3.u17.p56==1)" & "(i4.i0.u54.p150==1)" & F"((i4.i0.u21.p66==1)&&(i4.i2.u31.p94==1))"))
built 25 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 21 ordering constraints for composite.
built 12 ordering constraints for composite.
built 17 ordering constraints for composite.
built 10 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 14 ordering constraints for composite.
built 14 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 22 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions t121, u3.t43, u3.t46, u3.t52, i2.t62, i2.u14.t60, i2.u37.t85, i3.t28, i3.u17.t30, i4.i1.t128, i5.i1.u34.t27, i6.u43.t87, i6.u43.t89, i12.i1.u6.t38, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :7/112/14/133
[2020-05-19 01:32:46] [INFO ] Proved 176 variables to be positive in 703 ms
[2020-05-19 01:32:46] [INFO ] Computing symmetric may disable matrix : 134 transitions.
[2020-05-19 01:32:46] [INFO ] Computation of disable matrix completed :0/134 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:32:46] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 01:32:46] [INFO ] Computing symmetric may enable matrix : 134 transitions.
[2020-05-19 01:32:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
53 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.593584,35092,1,0,47626,864,2736,59404,484,2343,90545
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((F(!(F((F(G("(i6.u43.p127==1)")))&&(X("((i9.u44.p129==1)&&(i10.u56.p154==1))")))))))
Formula 1 simplified : !F!F(FG"(i6.u43.p127==1)" & X"((i9.u44.p129==1)&&(i10.u56.p154==1))")
39 unique states visited
27 strongly connected components in search stack
40 transitions explored
37 items max in DFS search stack
140 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,1.99137,103468,1,0,233647,879,2794,196435,486,2449,313820
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(!(X(F(((G("(i7.i0.u32.p98==1)"))||("(i12.i0.u9.p35==1)"))U("(i12.i0.u9.p35!=1)")))))))
Formula 2 simplified : !F!XF(("(i12.i0.u9.p35==1)" | G"(i7.i0.u32.p98==1)") U "(i12.i0.u9.p35!=1)")
[2020-05-19 01:32:49] [INFO ] Computing symmetric co enabling matrix : 134 transitions.
[2020-05-19 01:32:49] [INFO ] Computation of co-enabling matrix(1/134) took 114 ms. Total solver calls (SAT/UNSAT): 62(33/29)
[2020-05-19 01:32:53] [INFO ] Computation of co-enabling matrix(34/134) took 3823 ms. Total solver calls (SAT/UNSAT): 917(512/405)
[2020-05-19 01:32:56] [INFO ] Computation of co-enabling matrix(74/134) took 6907 ms. Total solver calls (SAT/UNSAT): 1480(929/551)
[2020-05-19 01:32:58] [INFO ] Computation of Finished co-enabling matrix. took 9015 ms. Total solver calls (SAT/UNSAT): 2019(1130/889)
[2020-05-19 01:32:58] [INFO ] Computing Do-Not-Accords matrix : 134 transitions.
[2020-05-19 01:32:59] [INFO ] Computation of Completed DNA matrix. took 1450 ms. Total solver calls (SAT/UNSAT): 70(0/70)
[2020-05-19 01:32:59] [INFO ] Built C files in 14271ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
Compilation finished in 2089 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 71 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(!( X(<>((( []((LTLAP5==true))) || ( (LTLAP6==true)) )U((LTLAP7==true))))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(!( X(<>((( []((LTLAP5==true))) || ( (LTLAP6==true)) )U((LTLAP7==true))))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(!( X(<>((( []((LTLAP5==true))) || ( (LTLAP6==true)) )U((LTLAP7==true))))) ), --buchi-type=spotba], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
1970 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,21.6844,773772,1,0,2.12648e+06,895,2823,1.49833e+06,488,2580,1740188
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((G("(i2.u15.p49==1)"))U(((F("(i2.u15.p49==1)"))&&("(i12.i0.u9.p35==1)"))U(X("((i5.i1.u35.p104!=1)&&((u3.p12!=1)||(u3.p22!=1)))")))))
Formula 3 simplified : !(G"(i2.u15.p49==1)" U (("(i12.i0.u9.p35==1)" & F"(i2.u15.p49==1)") U X"((i5.i1.u35.p104!=1)&&((u3.p12!=1)||(u3.p22!=1)))"))
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 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,21.6885,774756,1,0,2.12648e+06,895,2858,1.49833e+06,490,2580,1740287
no accepting run found
Formula 3 is TRUE no accepting run found.
FORMULA ProductionCell-PT-none-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !(((X(!((F("((i4.i0.u21.p67==1)&&(i4.i0.u63.p168==1))"))U(G(X("((i10.u0.p1!=1)||(i10.u1.p3!=1))"))))))&&(!(X("((i10.u0.p1==1)&&(i10.u1.p3==1))")))))
Formula 4 simplified : !(X!(F"((i4.i0.u21.p67==1)&&(i4.i0.u63.p168==1))" U GX"((i10.u0.p1!=1)||(i10.u1.p3!=1))") & !X"((i10.u0.p1==1)&&(i10.u1.p3==1))")
204 unique states visited
136 strongly connected components in search stack
211 transitions explored
204 items max in DFS search stack
22232 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,244.018,4367252,1,0,9.54136e+06,901,1427,1.18366e+07,212,2701,9017
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((F(G("(i2.u15.p49==1)")))U(F((F(X("((((u3.p12==1)&&(i12.i0.u5.p25==1))&&(i1.u8.p30==1))&&(i12.i1.u11.p39==1))")))&&("((i4.i0.u21.p66!=1)||(i7.i0.u33.p100!=1))"))))))
Formula 5 simplified : !F(FG"(i2.u15.p49==1)" U F("((i4.i0.u21.p66!=1)||(i7.i0.u33.p100!=1))" & FX"((((u3.p12==1)&&(i12.i0.u5.p25==1))&&(i1.u8.p30==1))&&(i12.i1.u11.p39==1))"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
61 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,244.644,4367252,1,0,9.54136e+06,901,1723,1.18366e+07,238,2701,162759
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((("((i4.i0.u21.p66==1)&&(i4.i0.u25.p76==1))")U(("((i2.u14.p46==1)&&(i2.u16.p51==1))")U(F("((i4.i0.u21.p66==1)&&(i4.i0.u25.p76==1))")))))
Formula 6 simplified : !("((i4.i0.u21.p66==1)&&(i4.i0.u25.p76==1))" U ("((i2.u14.p46==1)&&(i2.u16.p51==1))" U F"((i4.i0.u21.p66==1)&&(i4.i0.u25.p76==1))"))
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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,244.727,4367252,1,0,9.54136e+06,901,1775,1.18366e+07,238,2701,192820
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((!(F(("(((i12.i0.u12.p36==1)&&(i12.i0.u12.p43==1))&&(i4.i0.u24.p74==1))")U(F((X("(i4.i0.u24.p74==1)"))||("((i2.u14.p46==1)&&(i2.u15.p48==1))")))))))
Formula 7 simplified : F("(((i12.i0.u12.p36==1)&&(i12.i0.u12.p43==1))&&(i4.i0.u24.p74==1))" U F("((i2.u14.p46==1)&&(i2.u15.p48==1))" | X"(i4.i0.u24.p74==1)"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
32 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,245.044,4367252,1,0,9.54136e+06,901,1856,1.18366e+07,240,2701,263154
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((((!(F(G("(((i1.u7.p28==1)&&(i1.u8.p31==1))||((((((((((i10.u57.p157==1)&&(i11.u58.p159==1))&&(i1.u59.p161==1))&&(i12.i1.u60.p163==1))&&(i2.u61.p165==1))&&(i3.u62.p167==1))&&(i4.i0.u63.p169==1))&&(i5.i0.u64.p171==1))&&(i6.u65.p173==1))&&(i9.u66.p175==1)))"))))||("(i12.i0.u9.p35==1)"))U("(((((((((((i12.i0.u9.p35!=1)&&(i10.u57.p157==1))&&(i11.u58.p159==1))&&(i1.u59.p161==1))&&(i12.i1.u60.p163==1))&&(i2.u61.p165==1))&&(i3.u62.p167==1))&&(i4.i0.u63.p169==1))&&(i5.i0.u64.p171==1))&&(i6.u65.p173==1))&&(i9.u66.p175==1))")))
Formula 8 simplified : !(("(i12.i0.u9.p35==1)" | !FG"(((i1.u7.p28==1)&&(i1.u8.p31==1))||((((((((((i10.u57.p157==1)&&(i11.u58.p159==1))&&(i1.u59.p161==1))&&(i12.i1.u60.p163==1))&&(i2.u61.p165==1))&&(i3.u62.p167==1))&&(i4.i0.u63.p169==1))&&(i5.i0.u64.p171==1))&&(i6.u65.p173==1))&&(i9.u66.p175==1)))") U "(((((((((((i12.i0.u9.p35!=1)&&(i10.u57.p157==1))&&(i11.u58.p159==1))&&(i1.u59.p161==1))&&(i12.i1.u60.p163==1))&&(i2.u61.p165==1))&&(i3.u62.p167==1))&&(i4.i0.u63.p169==1))&&(i5.i0.u64.p171==1))&&(i6.u65.p173==1))&&(i9.u66.p175==1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
3830 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,283.344,4367252,1,0,9.54136e+06,901,1982,1.18366e+07,240,2701,2223427
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G(F(G((X((!(G("((i10.u1.p6==1)&&(i10.u1.p8==1))")))||("(i7.i0.u32.p98==1)")))||("((i3.u17.p56==1)&&(i3.u62.p166==1))"))))))
Formula 9 simplified : !GFG("((i3.u17.p56==1)&&(i3.u62.p166==1))" | X("(i7.i0.u32.p98==1)" | !G"((i10.u1.p6==1)&&(i10.u1.p8==1))"))
66 unique states visited
66 strongly connected components in search stack
67 transitions explored
66 items max in DFS search stack
793 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,291.278,4367252,1,0,9.54136e+06,901,2064,1.18366e+07,245,2701,2531099
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(!(X("((i11.u2.p11==1)&&(i1.u52.p146==1))")))))
Formula 10 simplified : !F!X"((i11.u2.p11==1)&&(i1.u52.p146==1))"
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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,291.279,4367252,1,0,9.54136e+06,901,2090,1.18366e+07,245,2701,2531117
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA ProductionCell-PT-none-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((G(X((((((G("((((i5.i1.u34.p5==1)&&(i4.i1.u22.p68==1))&&(i5.i1.u35.p103==1))&&(i5.i0.u39.p113==1))"))&&(!(F("((i9.u44.p128==1)&&(i9.u46.p132==1))"))))&&("(i5.i1.u34.p5==1)"))&&("(i4.i1.u22.p68==1)"))&&("(i5.i1.u35.p103==1)"))&&("(i5.i0.u39.p113==1)"))))U(G("((((i5.i1.u34.p5==1)&&(i4.i1.u22.p68==1))&&(i5.i1.u35.p103==1))&&(i5.i0.u39.p113==1))"))))
Formula 11 simplified : !(GX("(i4.i1.u22.p68==1)" & "(i5.i0.u39.p113==1)" & "(i5.i1.u34.p5==1)" & "(i5.i1.u35.p103==1)" & G"((((i5.i1.u34.p5==1)&&(i4.i1.u22.p68==1))&&(i5.i1.u35.p103==1))&&(i5.i0.u39.p113==1))" & !F"((i9.u44.p128==1)&&(i9.u46.p132==1))") U G"((((i5.i1.u34.p5==1)&&(i4.i1.u22.p68==1))&&(i5.i1.u35.p103==1))&&(i5.i0.u39.p113==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,291.287,4367252,1,0,9.54136e+06,901,2198,1.18366e+07,246,2701,2531512
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.

BK_STOP 1589852265031

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ProductionCell-PT-none"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ProductionCell-PT-none, 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 r126-tajo-158961390800714"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ProductionCell-PT-none.tgz
mv ProductionCell-PT-none execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "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
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;