Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r156-oct2-158972913700146.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is RobotManipulation-PT-00002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972913700146
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 196K
-rw-r--r-- 1 mcc users 4.1K Apr 12 10:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 12 10:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 11 12:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 11 12:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 14 12:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 14 12:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Apr 10 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 9 22:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 9 22:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:38 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 RobotManipulation-PT-00002-00
FORMULA_NAME RobotManipulation-PT-00002-01
FORMULA_NAME RobotManipulation-PT-00002-02
FORMULA_NAME RobotManipulation-PT-00002-03
FORMULA_NAME RobotManipulation-PT-00002-04
FORMULA_NAME RobotManipulation-PT-00002-05
FORMULA_NAME RobotManipulation-PT-00002-06
FORMULA_NAME RobotManipulation-PT-00002-07
FORMULA_NAME RobotManipulation-PT-00002-08
FORMULA_NAME RobotManipulation-PT-00002-09
FORMULA_NAME RobotManipulation-PT-00002-10
FORMULA_NAME RobotManipulation-PT-00002-11
FORMULA_NAME RobotManipulation-PT-00002-12
FORMULA_NAME RobotManipulation-PT-00002-13
FORMULA_NAME RobotManipulation-PT-00002-14
FORMULA_NAME RobotManipulation-PT-00002-15

=== Now, execution of the tool begins

BK_START 1589878067344

[2020-05-19 08:47:48] [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 08:47:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 08:47:48] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2020-05-19 08:47:48] [INFO ] Transformed 15 places.
[2020-05-19 08:47:48] [INFO ] Transformed 11 transitions.
[2020-05-19 08:47:48] [INFO ] Parsed PT model containing 15 places and 11 transitions in 50 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Finished random walk after 81 steps, including 0 resets, run visited all 21 properties in 2 ms. (steps per millisecond=40 )
[2020-05-19 08:47:49] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-19 08:47:49] [INFO ] Flatten gal took : 20 ms
FORMULA RobotManipulation-PT-00002-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00002-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 08:47:49] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 08:47:49] [INFO ] Applying decomposition
[2020-05-19 08:47:49] [INFO ] Flatten gal took : 3 ms
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/graph6330869683364373670.txt, -o, /tmp/graph6330869683364373670.bin, -w, /tmp/graph6330869683364373670.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/graph6330869683364373670.bin, -l, -1, -v, -w, /tmp/graph6330869683364373670.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 08:47:49] [INFO ] Input system was already deterministic with 11 transitions.
[2020-05-19 08:47:49] [INFO ] Decomposing Gal with order
[2020-05-19 08:47:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 08:47:49] [INFO ] Flatten gal took : 32 ms
[2020-05-19 08:47:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2020-05-19 08:47:49] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 2 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
[2020-05-19 08:47:49] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
// Phase 1: matrix 11 rows 15 cols
[2020-05-19 08:47:49] [INFO ] Computed 6 place invariants in 2 ms
inv : p_rdy + p_sc + p_m + p_rel + p_i1 + p_i2 = 5
inv : move + moved + r_moving + p_rdy + p_sc + p_rel + p_i1 + p_i2 = 5
inv : initialize + initialized - p_i2 = 0
inv : r_stopped + r_active + r_moving = 4
inv : off + r_stopped - p_i1 + initialized - p_i2 = -1
inv : -p_rdy + access - p_i1 - p_i2 = -1
Total of 6 invariants.
[2020-05-19 08:47:49] [INFO ] Computed 6 place invariants in 4 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 : !((G(X("((i2.u4.off>=1)&&(u1.r_active>=1))"))))
Formula 0 simplified : !GX"((i2.u4.off>=1)&&(u1.r_active>=1))"
built 3 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
[2020-05-19 08:47:49] [INFO ] Proved 15 variables to be positive in 64 ms
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
[2020-05-19 08:47:49] [INFO ] Computing symmetric may disable matrix : 11 transitions.
[2020-05-19 08:47:49] [INFO ] Computation of disable matrix completed :0/11 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 08:47:49] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 08:47:49] [INFO ] Computing symmetric may enable matrix : 11 transitions.
[2020-05-19 08:47:49] [INFO ] Computation of Complete enable matrix. took 0 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
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.052124,17612,1,0,2531,1170,219,6407,105,4991,3558
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00002-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((!(G(X(((X(F((G("(i2.u4.p_rdy>=1)"))U(X("(i1.u3.p_rel>=1)")))))&&("(i1.u3.p_rel>=1)"))U("((i2.u4.off>=1)&&(u1.r_active>=1))"))))))
Formula 1 simplified : GX(("(i1.u3.p_rel>=1)" & XF(G"(i2.u4.p_rdy>=1)" U X"(i1.u3.p_rel>=1)")) U "((i2.u4.off>=1)&&(u1.r_active>=1))")
2 unique states visited
0 strongly connected components in search stack
1 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,0.056192,19920,1,0,2531,1170,226,6407,106,4991,3565
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00002-01 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((((X(X(!(("((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))")U("((i2.u0.initialize>=1)&&(u1.r_stopped>=1))")))))U("((i2.u4.p_rdy<1)||(i1.u3.access<1))"))U(X("((i1.u3.moved<1)||(i1.u2.p_m<1))"))))
Formula 2 simplified : !((XX!("((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))" U "((i2.u0.initialize>=1)&&(u1.r_stopped>=1))") U "((i2.u4.p_rdy<1)||(i1.u3.access<1))") U X"((i1.u3.moved<1)||(i1.u2.p_m<1))")
2 unique states visited
0 strongly connected components in search stack
1 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,0.05799,20188,1,0,2531,1170,246,6407,108,4991,3593
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00002-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !(((F("((i2.u4.off>=1)&&(u1.r_active>=1))"))||(G(X(F(G("(i2.u4.p_rdy>=1)")))))))
Formula 3 simplified : !(F"((i2.u4.off>=1)&&(u1.r_active>=1))" | GXFG"(i2.u4.p_rdy>=1)")
13 unique states visited
13 strongly connected components in search stack
14 transitions explored
13 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.098501,21984,1,0,5400,1307,279,18479,108,5670,7459
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00002-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(G((F(("(i1.u2.p_sc>=1)")U("(u1.r_moving>=1)")))&&("((i2.u4.p_rdy<1)||(i1.u3.access<1))")))))
Formula 4 simplified : !XG("((i2.u4.p_rdy<1)||(i1.u3.access<1))" & F("(i1.u2.p_sc>=1)" U "(u1.r_moving>=1)"))
13 unique states visited
13 strongly connected components in search stack
13 transitions explored
13 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.10696,21984,1,0,6201,1320,287,19972,108,5781,9067
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00002-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((X(F(X(X("(((i2.u4.initialized>=1)&&(i2.u0.p_i2>=1))||(i1.u3.p_rel>=1))")))))&&((!(F("(i1.u3.p_rel>=1)")))U("(i1.u3.p_rel>=1)"))))
Formula 5 simplified : !(XFXX"(((i2.u4.initialized>=1)&&(i2.u0.p_i2>=1))||(i1.u3.p_rel>=1))" & (!F"(i1.u3.p_rel>=1)" U "(i1.u3.p_rel>=1)"))
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.108888,22504,1,0,6222,1320,289,19996,108,5783,9136
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00002-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((!(X((F(("((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))")U(G("((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))"))))&&(X("(i1.u3.p_rel>=1)"))))))
Formula 6 simplified : X(F("((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))" U G"((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))") & X"(i1.u3.p_rel>=1)")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.109763,22764,1,0,6222,1320,302,19996,110,5783,9144
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA RobotManipulation-PT-00002-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((G(X(G(((G(X("((i1.u3.moved>=1)&&(i1.u2.p_m>=1))")))&&(F((X(X("(i2.u0.p_i1>=1)")))||("((i2.u0.initialize>=1)&&(u1.r_stopped>=1))"))))&&("(i2.u0.p_i1>=1)"))))))
Formula 7 simplified : !GXG("(i2.u0.p_i1>=1)" & GX"((i1.u3.moved>=1)&&(i1.u2.p_m>=1))" & F("((i2.u0.initialize>=1)&&(u1.r_stopped>=1))" | XX"(i2.u0.p_i1>=1)"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.11153,22764,1,0,6249,1323,326,20037,110,5800,9298
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00002-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(((!(F("((i2.u0.initialize>=1)&&(u1.r_stopped>=1))")))||(F(X("(i1.u2.p_sc>=1)"))))U(X("(u1.r_moving>=1)")))))
Formula 8 simplified : !X((!F"((i2.u0.initialize>=1)&&(u1.r_stopped>=1))" | FX"(i1.u2.p_sc>=1)") U X"(u1.r_moving>=1)")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.113251,22764,1,0,6289,1332,355,20117,110,5823,9402
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00002-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((G((((X(((G(X("(u1.r_moving>=1)")))||("(i1.u3.p_rel>=1)"))||("((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))")))||("(i1.u3.p_rel>=1)"))||("(u1.r_moving>=1)"))||("((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))"))))
Formula 9 simplified : !G("((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))" | "(i1.u3.p_rel>=1)" | "(u1.r_moving>=1)" | X("((i2.u4.p_rdy>=1)&&(i1.u3.access>=1))" | "(i1.u3.p_rel>=1)" | GX"(u1.r_moving>=1)"))
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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.114359,22764,1,0,6289,1332,391,20117,112,5823,9439
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00002-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((F(G(("((i2.u4.initialized<1)||(i2.u0.p_i2<1))")U("(i2.u4.p_rdy<1)")))))
Formula 10 simplified : !FG("((i2.u4.initialized<1)||(i2.u0.p_i2<1))" U "(i2.u4.p_rdy<1)")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
4 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.153521,23812,1,0,8479,1466,417,29209,112,6162,12394
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00002-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !(((("((i2.u4.off>=1)&&(u1.r_active>=1))")U("(i2.u0.p_i1>=1)"))U(G(F((G("((i1.u2.move<1)||(u1.r_active<1))"))&&("(i2.u0.p_i1>=1)"))))))
Formula 11 simplified : !(("((i2.u4.off>=1)&&(u1.r_active>=1))" U "(i2.u0.p_i1>=1)") U GF("(i2.u0.p_i1>=1)" & G"((i1.u2.move<1)||(u1.r_active<1))"))
10 unique states visited
10 strongly connected components in search stack
11 transitions explored
10 items max in DFS search stack
6 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.218015,26188,1,0,11394,1686,442,47406,112,7230,15741
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA RobotManipulation-PT-00002-15 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-19 08:47:49] [INFO ] Built C files in 359ms 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 1589878069687

--------------------
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="RobotManipulation-PT-00002"
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 RobotManipulation-PT-00002, 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 r156-oct2-158972913700146"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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