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.r051-ebro-158902546200497.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 DLCround-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r051-ebro-158902546200497
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 3.2K Mar 30 18:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 18:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 29 08:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 29 08:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 04:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 04:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 26 23:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 26 23:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 325K 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 DLCround-PT-06a-00
FORMULA_NAME DLCround-PT-06a-01
FORMULA_NAME DLCround-PT-06a-02
FORMULA_NAME DLCround-PT-06a-03
FORMULA_NAME DLCround-PT-06a-04
FORMULA_NAME DLCround-PT-06a-05
FORMULA_NAME DLCround-PT-06a-06
FORMULA_NAME DLCround-PT-06a-07
FORMULA_NAME DLCround-PT-06a-08
FORMULA_NAME DLCround-PT-06a-09
FORMULA_NAME DLCround-PT-06a-10
FORMULA_NAME DLCround-PT-06a-11
FORMULA_NAME DLCround-PT-06a-12
FORMULA_NAME DLCround-PT-06a-13
FORMULA_NAME DLCround-PT-06a-14
FORMULA_NAME DLCround-PT-06a-15

=== Now, execution of the tool begins

BK_START 1589606907131

[2020-05-16 05:28:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -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-16 05:28:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-16 05:28:31] [INFO ] Load time of PNML (sax parser for PT used): 253 ms
[2020-05-16 05:28:31] [INFO ] Transformed 197 places.
[2020-05-16 05:28:31] [INFO ] Transformed 1313 transitions.
[2020-05-16 05:28:31] [INFO ] Found NUPN structural information;
[2020-05-16 05:28:31] [INFO ] Parsed PT model containing 197 places and 1313 transitions in 361 ms.
Ensure Unique test removed 135 transitions
Reduce redundant transitions removed 135 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 74 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 958 ms. (steps per millisecond=104 ) properties seen :[1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0]
[2020-05-16 05:28:32] [INFO ] Flow matrix only has 154 transitions (discarded 1024 similar events)
// Phase 1: matrix 154 rows 197 cols
[2020-05-16 05:28:32] [INFO ] Computed 109 place invariants in 15 ms
[2020-05-16 05:28:33] [INFO ] [Real]Absence check using 109 positive place invariants in 166 ms returned sat
[2020-05-16 05:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:33] [INFO ] [Real]Absence check using state equation in 247 ms returned sat
[2020-05-16 05:28:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:33] [INFO ] [Nat]Absence check using 109 positive place invariants in 31 ms returned unsat
[2020-05-16 05:28:33] [INFO ] [Real]Absence check using 109 positive place invariants in 78 ms returned sat
[2020-05-16 05:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:33] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-05-16 05:28:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:34] [INFO ] [Nat]Absence check using 109 positive place invariants in 15 ms returned unsat
[2020-05-16 05:28:34] [INFO ] [Real]Absence check using 109 positive place invariants in 54 ms returned sat
[2020-05-16 05:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:34] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2020-05-16 05:28:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:34] [INFO ] [Nat]Absence check using 109 positive place invariants in 47 ms returned unsat
[2020-05-16 05:28:34] [INFO ] [Real]Absence check using 109 positive place invariants in 59 ms returned sat
[2020-05-16 05:28:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:34] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2020-05-16 05:28:34] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:34] [INFO ] [Nat]Absence check using 109 positive place invariants in 13 ms returned unsat
[2020-05-16 05:28:35] [INFO ] [Real]Absence check using 109 positive place invariants in 55 ms returned sat
[2020-05-16 05:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:35] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2020-05-16 05:28:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:35] [INFO ] [Nat]Absence check using 109 positive place invariants in 39 ms returned unsat
[2020-05-16 05:28:35] [INFO ] [Real]Absence check using 109 positive place invariants in 66 ms returned sat
[2020-05-16 05:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:35] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2020-05-16 05:28:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:35] [INFO ] [Nat]Absence check using 109 positive place invariants in 20 ms returned unsat
[2020-05-16 05:28:35] [INFO ] [Real]Absence check using 109 positive place invariants in 63 ms returned sat
[2020-05-16 05:28:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:36] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-05-16 05:28:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:36] [INFO ] [Nat]Absence check using 109 positive place invariants in 26 ms returned unsat
[2020-05-16 05:28:36] [INFO ] [Real]Absence check using 109 positive place invariants in 63 ms returned sat
[2020-05-16 05:28:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:36] [INFO ] [Real]Absence check using state equation in 397 ms returned sat
[2020-05-16 05:28:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:37] [INFO ] [Nat]Absence check using 109 positive place invariants in 60 ms returned unsat
[2020-05-16 05:28:37] [INFO ] [Real]Absence check using 109 positive place invariants in 94 ms returned sat
[2020-05-16 05:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:37] [INFO ] [Real]Absence check using state equation in 531 ms returned sat
[2020-05-16 05:28:37] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:37] [INFO ] [Nat]Absence check using 109 positive place invariants in 42 ms returned unsat
[2020-05-16 05:28:37] [INFO ] [Real]Absence check using 109 positive place invariants in 65 ms returned sat
[2020-05-16 05:28:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-16 05:28:38] [INFO ] [Real]Absence check using state equation in 227 ms returned sat
[2020-05-16 05:28:38] [INFO ] Solution in real domain found non-integer solution.
[2020-05-16 05:28:38] [INFO ] [Nat]Absence check using 109 positive place invariants in 182 ms returned unsat
Successfully simplified 10 atomic propositions for a total of 12 simplifications.
[2020-05-16 05:28:39] [INFO ] Initial state reduction rules for CTL removed 13 formulas.
[2020-05-16 05:28:39] [INFO ] Flatten gal took : 415 ms
FORMULA DLCround-PT-06a-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06a-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-16 05:28:39] [INFO ] Flatten gal took : 116 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-16 05:28:40] [INFO ] Applying decomposition
[2020-05-16 05:28:40] [INFO ] Flatten gal took : 115 ms
[2020-05-16 05:28:40] [INFO ] Input system was already deterministic with 1178 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/graph5845294879083576096.txt, -o, /tmp/graph5845294879083576096.bin, -w, /tmp/graph5845294879083576096.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/graph5845294879083576096.bin, -l, -1, -v, -w, /tmp/graph5845294879083576096.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-16 05:28:40] [INFO ] Decomposing Gal with order
[2020-05-16 05:28:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-16 05:28:41] [INFO ] Removed a total of 1229 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 154 out of 1178 initially.
// Phase 1: matrix 154 rows 197 cols
[2020-05-16 05:28:41] [INFO ] Computed 109 place invariants in 8 ms
inv : p0 + p151 = 1
inv : p0 + p159 = 1
inv : p0 + p135 = 1
inv : p0 + p143 = 1
inv : p0 + p192 = 1
inv : p0 + p119 = 1
inv : p0 + p184 = 1
inv : p0 + p176 = 1
inv : p0 + p127 = 1
inv : p0 + p103 = 1
inv : p0 + p160 = 1
inv : p0 + p111 = 1
inv : p0 + p168 = 1
inv : p0 + p150 = 1
inv : p0 + p8 + p9 + p10 + p11 + p12 + p13 + p14 = 1
inv : p0 + p158 = 1
inv : p0 + p134 = 1
inv : p0 + p142 = 1
inv : p0 + p183 = 1
inv : p0 + p118 = 1
inv : p0 + p191 = 1
inv : p0 + p126 = 1
inv : p0 + p102 = 1
inv : p0 + p167 = 1
inv : p0 + p110 = 1
inv : p0 + p175 = 1
inv : p0 + p145 = 1
inv : p0 + p153 = 1
inv : p0 + p15 + p16 + p17 + p18 + p19 + p20 + p21 = 1
inv : p0 + p49 + p50 + p51 + p52 + p53 + p54 + p55 + p56 + p57 + p58 = 1
inv : p0 + p129 = 1
inv : p0 + p194 = 1
inv : p0 + p137 = 1
inv : p0 + p186 = 1
inv : p0 + p178 = 1
inv : p0 + p113 = 1
inv : p0 + p121 = 1
inv : p0 + p162 = 1
inv : p0 + p170 = 1
inv : p0 + p105 = 1
inv : p0 + p144 = 1
inv : p0 + p152 = 1
inv : p0 + p89 + p90 + p91 + p92 + p93 + p94 + p95 + p96 + p97 + p98 = 1
inv : p0 + p128 = 1
inv : p0 + p193 = 1
inv : p0 + p136 = 1
inv : p0 + p185 = 1
inv : p0 + p69 + p70 + p71 + p72 + p73 + p74 + p75 + p76 + p77 + p78 = 1
inv : p0 + p112 = 1
inv : p0 + p177 = 1
inv : p0 + p120 = 1
inv : p0 + p161 = 1
inv : p0 + p104 = 1
inv : p0 + p169 = 1
inv : p0 + p29 + p30 + p31 + p32 + p33 + p34 + p35 + p36 + p37 + p38 = 1
inv : p0 + p147 = 1
inv : p0 + p155 = 1
inv : p0 + p79 + p80 + p81 + p82 + p83 + p84 + p85 + p86 + p87 + p88 = 1
inv : p0 + p131 = 1
inv : p0 + p139 = 1
inv : p0 + p196 = 1
inv : p0 + p180 = 1
inv : p0 + p115 = 1
inv : p0 + p188 = 1
inv : p0 + p123 = 1
inv : p0 + p164 = 1
inv : p0 + p99 = 1
inv : p0 + p172 = 1
inv : p0 + p107 = 1
inv : p0 + p146 = 1
inv : p0 + p154 = 1
inv : p0 + p130 = 1
inv : p0 + p195 = 1
inv : p0 + p138 = 1
inv : p0 + p187 = 1
inv : p0 + p114 = 1
inv : p0 + p179 = 1
inv : p0 + p122 = 1
inv : p0 + p163 = 1
inv : p0 + p106 = 1
inv : p0 + p171 = 1
inv : p0 + p149 = 1
inv : p0 + p157 = 1
inv : p0 + p133 = 1
inv : p0 + p141 = 1
inv : p0 + p182 = 1
inv : p0 + p117 = 1
inv : p0 + p190 = 1
inv : p0 + p125 = 1
inv : p0 + p166 = 1
inv : p0 + p101 = 1
inv : p0 + p174 = 1
inv : p0 + p109 = 1
inv : p0 + p22 + p23 + p24 + p25 + p26 + p27 + p28 = 1
inv : p0 + p148 = 1
inv : p0 + p156 = 1
inv : p0 + p132 = 1
inv : p0 + p39 + p40 + p41 + p42 + p43 + p44 + p45 + p46 + p47 + p48 = 1
inv : p0 + p59 + p60 + p61 + p62 + p63 + p64 + p65 + p66 + p67 + p68 = 1
inv : p0 + p140 = 1
inv : p0 + p181 = 1
inv : p0 + p116 = 1
inv : p0 + p189 = 1
inv : p0 + p124 = 1
inv : p0 + p100 = 1
inv : p0 + p165 = 1
inv : p0 + p1 + p2 + p3 + p4 + p5 + p6 + p7 = 1
inv : p0 + p108 = 1
inv : p0 + p173 = 1
Total of 109 invariants.
[2020-05-16 05:28:41] [INFO ] Computed 109 place invariants in 11 ms
[2020-05-16 05:28:41] [INFO ] Flatten gal took : 313 ms
[2020-05-16 05:28:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 104 labels/synchronizations in 37 ms.
[2020-05-16 05:28:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 22 ms
[2020-05-16 05:28:41] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 3 LTL properties
Checking formula 0 : !((G(F(X((("((u1.p11==0)||(u2.p17==1))")U("(((i4.u6.p160==0)||(i4.u4.p103==1))&&(i5.u7.p109!=1))"))||(G("((i10.u24.p90==0)||(i5.u9.p41==1))")))))))
Formula 0 simplified : !GFX(("((u1.p11==0)||(u2.p17==1))" U "(((i4.u6.p160==0)||(i4.u4.p103==1))&&(i5.u7.p109!=1))") | G"((i10.u24.p90==0)||(i5.u9.p41==1))")
built 50 ordering constraints for composite.
built 22 ordering constraints for composite.
built 22 ordering constraints for composite.
built 22 ordering constraints for composite.
built 22 ordering constraints for composite.
built 22 ordering constraints for composite.
built 22 ordering constraints for composite.
built 22 ordering constraints for composite.
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
15 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.234653,21548,1,0,1403,2540,1938,1872,1157,5586,4908
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DLCround-PT-06a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(X("((i7.u13.p62==0)||(i6.u11.p55==1))"))))
Formula 1 simplified : !GX"((i7.u13.p62==0)||(i6.u11.p55==1))"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.255374,21548,1,0,2374,2666,2003,3308,1158,6437,8012
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DLCround-PT-06a-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((!(G((G("(i5.u7.p109==1)"))U(G("(i5.u7.p109!=1)"))))))
Formula 2 simplified : G(G"(i5.u7.p109==1)" U G"(i5.u7.p109!=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,0.262872,22212,1,0,2374,2666,2029,3308,1159,6437,8056
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA DLCround-PT-06a-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
java.lang.RuntimeException: SMT solver raised an exception or timeout :(error "Solver has unexpectedly terminated")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.checkSat(NextBMCSolver.java:299)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:116)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.init(NecessaryEnablingsolver.java:71)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:471)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printDependencyMatrix(Gal2PinsTransformerNext.java:209)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.buildBodyFile(Gal2PinsTransformerNext.java:85)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.transform(Gal2PinsTransformerNext.java:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-16 05:28:41] [INFO ] Built C files in 1628ms 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]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1589606922128

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="DLCround-PT-06a"
export BK_EXAMINATION="LTLCardinality"
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 DLCround-PT-06a, 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 r051-ebro-158902546200497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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