Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
..............................................................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.1K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 110 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 348 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 14K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Eratosthenes-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r248-blw7-152732549600004
=====================================================================

--------------------
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 Eratosthenes-PT-020-LTLFireability-00
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-01
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-02
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-03
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-04
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-05
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-06
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-07
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-08
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-09
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-10
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-11
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-12
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-13
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-14
FORMULA_NAME Eratosthenes-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1527956743115

Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805151631/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.201805151631/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 16 LTL properties
Checking formula 0 : !((G((G("(p18>=1)"))U(("((p6>=1)&&(p18>=1))")U("((p12>=1)&&(p6>=1))")))))
Formula 0 simplified : !G(G"(p18>=1)" U ("((p6>=1)&&(p18>=1))" U "((p12>=1)&&(p6>=1))"))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 1 deadlock states
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 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.027615,18500,1,0,64,1278,44,62,238,1908,188
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((X(G(X(("(p8>=1)")U("(p16>=1)"))))))
Formula 1 simplified : !XGX("(p8>=1)" U "(p16>=1)")
Computing Next relation with stutter on 1 deadlock states
15 unique states visited
15 strongly connected components in search stack
16 transitions explored
15 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.030235,18500,1,0,64,1442,54,81,244,2396,253
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(("(p10>=1)"))
Formula 2 simplified : !"(p10>=1)"
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.030508,18500,1,0,64,1442,57,81,245,2396,255
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G("((p16>=1)&&(p8>=1))")))
Formula 3 simplified : !G"((p16>=1)&&(p8>=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.034654,18500,1,0,102,2116,63,119,247,3528,344
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((X(X(G(X(F("((p4>=1)&&(p20>=1))")))))))
Formula 4 simplified : !XXGXF"((p4>=1)&&(p20>=1))"
Computing Next relation with stutter on 1 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.035488,18708,1,0,103,2151,72,120,251,3576,355
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F("(p15>=1)")))
Formula 5 simplified : !F"(p15>=1)"
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.035776,18708,1,0,103,2151,81,120,252,3576,359
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("((p12>=1)&&(p6>=1))"))
Formula 6 simplified : !"((p12>=1)&&(p6>=1))"
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.036052,18708,1,0,103,2151,82,120,252,3576,361
no accepting run found
Formula 6 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((("((p10>=1)&&(p20>=1))")U(G(X(X("((p6>=1)&&(p18>=1))"))))))
Formula 7 simplified : !("((p10>=1)&&(p20>=1))" U GXX"((p6>=1)&&(p18>=1))")
Computing Next relation with stutter on 1 deadlock states
16 unique states visited
16 strongly connected components in search stack
17 transitions explored
16 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.039462,19464,1,0,112,2218,89,139,254,3682,452
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !(((G("(p14>=1)"))U((G("(p14>=1)"))U(G("(p16>=1)")))))
Formula 8 simplified : !(G"(p14>=1)" U (G"(p14>=1)" U G"(p16>=1)"))
Computing Next relation with stutter on 1 deadlock states
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.043995,19464,1,0,169,2979,108,196,263,4881,659
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(G(F(F(X("((p9>=1)&&(p18>=1))")))))))
Formula 9 simplified : !XGFX"((p9>=1)&&(p18>=1))"
Computing Next relation with stutter on 1 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.044586,19464,1,0,169,2979,117,196,266,4881,665
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((X(X(X(X(F("(p20>=1)")))))))
Formula 10 simplified : !XXXXF"(p20>=1)"
Computing Next relation with stutter on 1 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 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.0469,19664,1,0,198,3320,126,226,266,5681,749
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(F((G("((p16>=1)&&(p4>=1))"))U(F("(p6>=1)"))))))
Formula 11 simplified : !GF(G"((p16>=1)&&(p4>=1))" U F"(p6>=1)")
Computing Next relation with stutter on 1 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.048434,19664,1,0,208,3576,135,245,266,6029,807
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(("(p6>=1)")U(G(F("(p18>=1)"))))))
Formula 12 simplified : !G("(p6>=1)" U GF"(p18>=1)")
Computing Next relation with stutter on 1 deadlock states
14 unique states visited
14 strongly connected components in search stack
15 transitions explored
14 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.049933,19664,1,0,217,3739,142,262,266,6269,862
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((F(F((X("(p14>=1)"))U("(p14>=1)")))))
Formula 13 simplified : !F(X"(p14>=1)" U "(p14>=1)")
Computing Next relation with stutter on 1 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 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.050193,19664,1,0,217,3739,149,262,266,6269,866
no accepting run found
Formula 13 is TRUE no accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(((X(("(p4>=1)")U("((p16>=1)&&(p4>=1))")))U(("((p16>=1)&&(p4>=1))")U(G("((p12>=1)&&(p6>=1))")))))
Formula 14 simplified : !(X("(p4>=1)" U "((p16>=1)&&(p4>=1))") U ("((p16>=1)&&(p4>=1))" U G"((p12>=1)&&(p6>=1))"))
Computing Next relation with stutter on 1 deadlock states
11 unique states visited
11 strongly connected components in search stack
11 transitions explored
11 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.056686,19880,1,0,263,4511,157,315,270,7636,1059
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(X("(p14>=1)"))))
Formula 15 simplified : !FX"(p14>=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.058518,19880,1,0,302,4903,157,355,270,8321,1167
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Eratosthenes-PT-020-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O3, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1527956745424

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -consoleLog -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/ -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.application.Application start
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/, -smt]
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 24 ms
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 19 places.
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 27 transitions.
Jun 02, 2018 4:25:44 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 5 ms
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 4 fixed domain variables (out of 19 variables) in GAL type Eratosthenes_PT_020
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 4 constant array cells/variables (out of 19 variables) in type Eratosthenes_PT_020
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: p11,p19,p17,p13,
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.instantiate.DomainAnalyzer computeVariableDomains
INFO: Found a total of 8 fixed domain variables (out of 19 variables) in GAL type Eratosthenes_PT_020
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: Found a total of 8 constant array cells/variables (out of 19 variables) in type Eratosthenes_PT_020
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.instantiate.Simplifier printConstantVars
INFO: p7,p3,p2,p11,p19,p17,p5,p13,
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Removed 8 constant variables :p7=1, p3=1, p2=1, p11=1, p19=1, p17=1, p5=1, p13=1
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.instantiate.Simplifier simplifyConstantVariables
INFO: Simplified 34 expressions due to constant valuations.
Jun 02, 2018 4:25:44 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 25 ms
Jun 02, 2018 4:25:45 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Jun 02, 2018 4:25:45 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 0 ms
Jun 02, 2018 4:25:45 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 27 transitions.
Jun 02, 2018 4:25:45 PM org.smtlib.impl.Script execute
WARNING: Script execution failed on command (define-fun _enabled__15 ((step Int)) Bool (_enabledsrc__15 (select s step))) with error (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Skipping mayMatrices nes/nds Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: Error when declaring system variables to SMT solver.(error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.NextBMCSolver.init(NextBMCSolver.java:93)
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:59)
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:830)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:71)
at java.lang.Thread.run(Thread.java:748)
Jun 02, 2018 4:25:45 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 127ms conformant to PINS in folder :/home/mcc/execution

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="Eratosthenes-PT-020"
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

tar xzf /home/mcc/BenchKit/INPUTS/Eratosthenes-PT-020.tgz
mv Eratosthenes-PT-020 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool itstools"
echo " Input is Eratosthenes-PT-020, 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 r248-blw7-152732549600004"
echo "====================================================================="
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
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 ;