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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 216K
-rw-r--r-- 1 mcc users 3.9K Mar 31 07:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 31 07:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 29 23:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 29 23:50 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.3K Apr 8 14:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 8 14:49 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 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 28 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 27 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Mar 27 07:39 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 39K 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-11a-00
FORMULA_NAME DiscoveryGPU-PT-11a-01
FORMULA_NAME DiscoveryGPU-PT-11a-02
FORMULA_NAME DiscoveryGPU-PT-11a-03
FORMULA_NAME DiscoveryGPU-PT-11a-04
FORMULA_NAME DiscoveryGPU-PT-11a-05
FORMULA_NAME DiscoveryGPU-PT-11a-06
FORMULA_NAME DiscoveryGPU-PT-11a-07
FORMULA_NAME DiscoveryGPU-PT-11a-08
FORMULA_NAME DiscoveryGPU-PT-11a-09
FORMULA_NAME DiscoveryGPU-PT-11a-10
FORMULA_NAME DiscoveryGPU-PT-11a-11
FORMULA_NAME DiscoveryGPU-PT-11a-12
FORMULA_NAME DiscoveryGPU-PT-11a-13
FORMULA_NAME DiscoveryGPU-PT-11a-14
FORMULA_NAME DiscoveryGPU-PT-11a-15

=== Now, execution of the tool begins

BK_START 1590130726875

[2020-05-22 06:58:48] [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:58:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 06:58:48] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2020-05-22 06:58:48] [INFO ] Transformed 113 places.
[2020-05-22 06:58:48] [INFO ] Transformed 155 transitions.
[2020-05-22 06:58:48] [INFO ] Found NUPN structural information;
[2020-05-22 06:58:48] [INFO ] Parsed PT model containing 113 places and 155 transitions in 81 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 850 resets, run finished after 187 ms. (steps per millisecond=534 ) properties seen :[1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0]
[2020-05-22 06:58:48] [INFO ] Flow matrix only has 144 transitions (discarded 11 similar events)
// Phase 1: matrix 144 rows 113 cols
[2020-05-22 06:58:48] [INFO ] Computed 2 place invariants in 5 ms
[2020-05-22 06:58:48] [INFO ] [Real]Absence check using 2 positive place invariants in 15 ms returned sat
[2020-05-22 06:58:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2020-05-22 06:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:58:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned unsat
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-05-22 06:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-05-22 06:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:58:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned unsat
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-05-22 06:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2020-05-22 06:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:58:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-05-22 06:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2020-05-22 06:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:58:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned unsat
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2020-05-22 06:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-05-22 06:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:58:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned unsat
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-05-22 06:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-05-22 06:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:58:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned unsat
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-05-22 06:58:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 06:58:49] [INFO ] [Real]Absence check using state equation in 51 ms returned sat
[2020-05-22 06:58:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 06:58:49] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2020-05-22 06:58:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 06:58:49] [INFO ] [Nat]Absence check using state equation in 34 ms returned unsat
Successfully simplified 7 atomic propositions for a total of 8 simplifications.
[2020-05-22 06:58:49] [INFO ] Initial state reduction rules for CTL removed 11 formulas.
[2020-05-22 06:58:50] [INFO ] Flatten gal took : 59 ms
FORMULA DiscoveryGPU-PT-11a-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DiscoveryGPU-PT-11a-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-22 06:58:50] [INFO ] Flatten gal took : 16 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 06:58:50] [INFO ] Applying decomposition
[2020-05-22 06:58:50] [INFO ] Flatten gal took : 15 ms
[2020-05-22 06:58:50] [INFO ] Input system was already deterministic with 155 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/graph9346289255099332015.txt, -o, /tmp/graph9346289255099332015.bin, -w, /tmp/graph9346289255099332015.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/graph9346289255099332015.bin, -l, -1, -v, -w, /tmp/graph9346289255099332015.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 06:58:50] [INFO ] Decomposing Gal with order
[2020-05-22 06:58:50] [INFO ] Rewriting arrays to variables to allow decomposition.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 144 out of 155 initially.
// Phase 1: matrix 144 rows 113 cols
[2020-05-22 06:58:50] [INFO ] Computed 2 place invariants in 2 ms
inv : p0 + p111 = 1
inv : p0 + p112 = 1
Total of 2 invariants.
[2020-05-22 06:58:50] [INFO ] Computed 2 place invariants in 15 ms
[2020-05-22 06:58:50] [INFO ] Removed a total of 92 redundant transitions.
[2020-05-22 06:58:50] [INFO ] Flatten gal took : 45 ms
[2020-05-22 06:58:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 10 ms.
[2020-05-22 06:58:50] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 7 ms
[2020-05-22 06:58:50] [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 5 LTL properties
Checking formula 0 : !((X(X((F(G(!(F(G("((i7.u30.p80==0)||(i6.u23.p62==1))"))))))U((G("(i6.u25.p67==1)"))||("((i3.u11.p32!=0)&&(i7.u29.p77!=1))"))))))
Formula 0 simplified : !XX(FG!FG"((i7.u30.p80==0)||(i6.u23.p62==1))" U ("((i3.u11.p32!=0)&&(i7.u29.p77!=1))" | G"(i6.u25.p67==1)"))
built 20 ordering constraints for composite.
built 13 ordering constraints for composite.
built 9 ordering constraints for composite.
built 10 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 14 ordering constraints for composite.
built 12 ordering constraints for composite.
built 12 ordering constraints for composite.
built 11 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 9 ordering constraints for composite.
built 12 ordering constraints for composite.
[2020-05-22 06:58:50] [INFO ] Proved 113 variables to be positive in 186 ms
[2020-05-22 06:58:50] [INFO ] Computing symmetric may disable matrix : 155 transitions.
[2020-05-22 06:58:50] [INFO ] Computation of disable matrix completed :0/155 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:58:50] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 06:58:50] [INFO ] Computing symmetric may enable matrix : 155 transitions.
[2020-05-22 06:58:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions i0.u0.t143, i0.u3.t145, i0.u19.t149, i0.u35.t153, i1.u5.t146, i2.i0.u7.t142, i2.i1.u9.t141, i3.u11.t147, i3.u13.t148, i4.i0.u15.t140, i4.i1.u17.t139, i5.u1.t144, i5.u21.t150, i6.u23.t138, i6.u25.t137, i7.u27.t151, i7.u29.t152, i8.i0.u31.t136, i8.i1.u33.t135, i9.u37.t154, i10.u39.t134, i10.u41.t133, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/96/22/118
Computing Next relation with stutter on 1 deadlock states
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,0.359704,28220,1,0,26317,228,1604,31866,162,881,33878
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(!(G(!((G(F("((i5.u1.p6==0)||(i4.i0.u15.p43==1))")))U("((i5.u1.p6==0)||(i4.i0.u15.p43==1))"))))))))
Formula 1 simplified : !XG!G!(GF"((i5.u1.p6==0)||(i4.i0.u15.p43==1))" U "((i5.u1.p6==0)||(i4.i0.u15.p43==1))")
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 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.370463,28456,1,0,26925,230,1642,33184,164,892,35421
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(X("(i1.u6.p0==1)"))))
Formula 2 simplified : !FX"(i1.u6.p0==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
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.400315,29776,1,0,30156,230,1690,36395,166,894,39293
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(X(F(G(F(X(G("((i7.u30.p79==0)||(i9.u36.p95==1))")))))))))
Formula 3 simplified : !XXFGFXG"((i7.u30.p79==0)||(i9.u36.p95==1))"
Computing Next relation with stutter on 1 deadlock states
5 unique states visited
5 strongly connected components in search stack
6 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.408401,30024,1,0,30834,231,1720,37498,167,896,40793
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA DiscoveryGPU-PT-11a-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(X(X(("((i9.u37.p96==0)||(i6.u26.p68==1))")||((((!(F("((i6.u24.p65==0)||(i2.i1.u10.p28==1))")))&&(!(G("((i3.u12.p34==0)||(i0.u19.p51==1))"))))&&("(i9.u37.p96!=0)"))&&("(i6.u26.p68!=1)")))))))
Formula 4 simplified : !XXX("((i9.u37.p96==0)||(i6.u26.p68==1))" | ("(i6.u26.p68!=1)" & "(i9.u37.p96!=0)" & !F"((i6.u24.p65==0)||(i2.i1.u10.p28==1))" & !G"((i3.u12.p34==0)||(i0.u19.p51==1))"))
Computing Next relation with stutter on 1 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 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.412711,30656,1,0,30843,231,1785,37509,169,896,40929
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA DiscoveryGPU-PT-11a-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[2020-05-22 06:58:50] [WARNING] Script execution failed on command (declare-fun s0 () (Array Int Int)) with error
[2020-05-22 06:58:50] [WARNING] Script execution failed on command (declare-fun s1 () (Array Int Int)) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
[2020-05-22 06:58:50] [WARNING] Script execution failed on command (assert (and (>= (select s0 43) 1) (= (store (store s0 42 (+ (select s0 42) 1)) 43 (- (select s0 43) 1)) s1))) with error (error "Failed to assert expression: java.io.IOException: Broken pipe (and (>= (select s0 43) 1) (= (store (store s0 42 (+ (select s0 42) 1)) 43 (- (select s0 43) 1)) s1))")
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:512)
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:58:50] [INFO ] Built C files in 737ms 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 1590130731044

--------------------
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-11a"
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-11a, 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-158922814700665"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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