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.r066-tajo-158922814500585.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 DiscoveryGPU-PT-06a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814500585
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 204K
-rw-r--r-- 1 mcc users 3.6K Mar 31 06:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 31 06:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 23:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 29 23:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.2K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 27 07:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 27 07:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 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 22K 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 DiscoveryGPU-PT-06a-00
FORMULA_NAME DiscoveryGPU-PT-06a-01
FORMULA_NAME DiscoveryGPU-PT-06a-02
FORMULA_NAME DiscoveryGPU-PT-06a-03
FORMULA_NAME DiscoveryGPU-PT-06a-04
FORMULA_NAME DiscoveryGPU-PT-06a-05
FORMULA_NAME DiscoveryGPU-PT-06a-06
FORMULA_NAME DiscoveryGPU-PT-06a-07
FORMULA_NAME DiscoveryGPU-PT-06a-08
FORMULA_NAME DiscoveryGPU-PT-06a-09
FORMULA_NAME DiscoveryGPU-PT-06a-10
FORMULA_NAME DiscoveryGPU-PT-06a-11
FORMULA_NAME DiscoveryGPU-PT-06a-12
FORMULA_NAME DiscoveryGPU-PT-06a-13
FORMULA_NAME DiscoveryGPU-PT-06a-14
FORMULA_NAME DiscoveryGPU-PT-06a-15

=== Now, execution of the tool begins

BK_START 1590128989610

[2020-05-22 06:29:51] [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-22 06:29:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:29:51] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2020-05-22 06:29:51] [INFO ] Transformed 63 places.
[2020-05-22 06:29:51] [INFO ] Transformed 85 transitions.
[2020-05-22 06:29:51] [INFO ] Found NUPN structural information;
[2020-05-22 06:29:51] [INFO ] Parsed PT model containing 63 places and 85 transitions in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 43 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 1536 resets, run finished after 233 ms. (steps per millisecond=429 ) properties seen :[1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-22 06:29:52] [INFO ] Flow matrix only has 79 transitions (discarded 6 similar events)
// Phase 1: matrix 79 rows 63 cols
[2020-05-22 06:29:52] [INFO ] Computed 2 place invariants in 16 ms
[2020-05-22 06:29:52] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-05-22 06:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:29:52] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2020-05-22 06:29:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:29:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned unsat
[2020-05-22 06:29:52] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-05-22 06:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:29:52] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2020-05-22 06:29:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:29:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-05-22 06:29:52] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-05-22 06:29:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2020-05-22 06:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:29:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 16 ms returned unsat
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-05-22 06:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-22 06:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:29:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using 2 positive place invariants in 27 ms returned sat
[2020-05-22 06:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2020-05-22 06:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:29:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned unsat
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-05-22 06:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2020-05-22 06:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:29:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-05-22 06:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-05-22 06:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:29:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-05-22 06:29:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:29:53] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2020-05-22 06:29:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:29:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
Successfully simplified 8 atomic propositions for a total of 9 simplifications.
[2020-05-22 06:29:53] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-22 06:29:53] [INFO ] Flatten gal took : 63 ms
FORMULA DiscoveryGPU-PT-06a-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-06a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:29:53] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
[2020-05-22 06:29:53] [INFO ] Applying decomposition
Built C files in :
/home/mcc/execution
[2020-05-22 06:29:53] [INFO ] Flatten gal took : 17 ms
[2020-05-22 06:29:53] [INFO ] Input system was already deterministic with 85 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/graph1620698233336811816.txt, -o, /tmp/graph1620698233336811816.bin, -w, /tmp/graph1620698233336811816.weights], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 79 out of 85 initially.
// Phase 1: matrix 79 rows 63 cols
[2020-05-22 06:29:53] [INFO ] Computed 2 place invariants in 1 ms
inv : p0 + p62 = 1
inv : p0 + p61 = 1
Total of 2 invariants.
[2020-05-22 06:29:53] [INFO ] Computed 2 place invariants in 2 ms
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph1620698233336811816.bin, -l, -1, -v, -w, /tmp/graph1620698233336811816.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:29:54] [INFO ] Decomposing Gal with order
[2020-05-22 06:29:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 06:29:54] [INFO ] Removed a total of 47 redundant transitions.
[2020-05-22 06:29:54] [INFO ] Flatten gal took : 32 ms
[2020-05-22 06:29:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 6 ms.
[2020-05-22 06:29:54] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-22 06:29:54] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/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 7 LTL properties
Checking formula 0 : !((!(G(X((X(G((G("((i8.u18.p50==0)||(i9.u19.p52==1))"))&&("((i8.u18.p50==0)||(i9.u19.p52==1))"))))U((!(F("((i7.u15.p41==0)||(i4.u8.p25==1))")))&&("(i4.u8.p25==1)")))))))
Formula 0 simplified : GX(XG("((i8.u18.p50==0)||(i9.u19.p52==1))" & G"((i8.u18.p50==0)||(i9.u19.p52==1))") U ("(i4.u8.p25==1)" & !F"((i7.u15.p41==0)||(i4.u8.p25==1))"))
built 24 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 7 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions i0.u1.t79, i1.u3.t78, i2.u5.t77, i3.u0.t80, i3.u7.t81, i4.u9.t82, i5.u11.t76, i6.u13.t75, i7.u15.t83, i8.u17.t84, i9.u19.t74, i10.u21.t73, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/56/12/68
Computing Next relation with stutter on 1 deadlock states
[2020-05-22 06:29:54] [INFO ] Proved 63 variables to be positive in 209 ms
[2020-05-22 06:29:54] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2020-05-22 06:29:54] [INFO ] Computation of disable matrix completed :0/85 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:29:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:29:54] [INFO ] Computing symmetric may enable matrix : 85 transitions.
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 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.062308,19144,1,0,3230,211,936,4529,166,749,6630
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-06a-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((G(("((i4.u8.p24!=0)&&(i5.u11.p33!=1))")U(((!(("((i4.u8.p24==0)||(i5.u11.p33==1))")U("((i3.u0.p1==0)||(i5.u11.p33==1))")))||("(i6.u14.p39==0)"))||("(i7.u15.p42==1)")))))
Formula 1 simplified : !G("((i4.u8.p24!=0)&&(i5.u11.p33!=1))" U ("(i6.u14.p39==0)" | "(i7.u15.p42==1)" | !("((i4.u8.p24==0)||(i5.u11.p33==1))" U "((i3.u0.p1==0)||(i5.u11.p33==1))")))
[2020-05-22 06:29:54] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
7 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.137177,23572,1,0,12244,223,1092,15200,171,854,22523
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((X(!(("((i7.u16.p44==0)||(i7.u15.p42==1))")U(X(!(G("((i3.u0.p3==0)||(i4.u8.p24==1))"))))))))
Formula 2 simplified : !X!("((i7.u16.p44==0)||(i7.u15.p42==1))" U X!G"((i3.u0.p3==0)||(i4.u8.p24==1))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.162501,24624,1,0,15043,232,1122,18341,172,945,28311
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((!(X(G("((i2.u5.p17==0)||(i1.u3.p12==1))"))))&&(!(G("(i0.u2.p7==1)")))))
Formula 3 simplified : !(!XG"((i2.u5.p17==0)||(i1.u3.p12==1))" & !G"(i0.u2.p7==1)")
Computing Next relation with stutter on 1 deadlock states
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.168529,25144,1,0,15756,232,1175,19008,173,946,29939
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(G("((i6.u14.p39==0)||(i9.u19.p53==1))")))))
Formula 4 simplified : !XXG"((i6.u14.p39==0)||(i9.u19.p53==1))"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.177379,25672,1,0,17067,234,1208,20439,173,957,32671
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((F((G((F("((i3.u0.p1==0)||(i0.u2.p7==1))"))U("((i3.u0.p1!=0)&&(i2.u6.p19!=1))")))&&(!(X("(i1.u3.p12==1)"))))))
Formula 5 simplified : !F(G(F"((i3.u0.p1==0)||(i0.u2.p7==1))" U "((i3.u0.p1!=0)&&(i2.u6.p19!=1))") & !X"(i1.u3.p12==1)")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.197883,26872,1,0,19422,235,1324,23445,173,967,37481
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X((G("(((i3.u0.p3==1)||(i3.u0.p1==0))||(i4.u8.p25==1))"))&&((X(X("((i3.u0.p1==0)||(i4.u8.p25==1))")))||(F("(i4.u8.p25==1)"))))))
Formula 6 simplified : !X(G"(((i3.u0.p3==1)||(i3.u0.p1==0))||(i4.u8.p25==1))" & (XX"((i3.u0.p1==0)||(i4.u8.p25==1))" | F"(i4.u8.p25==1)"))
Computing Next relation with stutter on 1 deadlock states
7 unique states visited
7 strongly connected components in search stack
8 transitions explored
7 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.232379,28188,1,0,23355,236,1363,27104,174,998,45221
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-06a-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:757)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:502)
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-22 06:29:54] [INFO ] Built C files in 545ms 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 1590128994638

--------------------
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="DiscoveryGPU-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 DiscoveryGPU-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 r066-tajo-158922814500585"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DiscoveryGPU-PT-06a.tgz
mv DiscoveryGPU-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 ;