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 228K
-rw-r--r-- 1 mcc users 3.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K 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 6.1K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 26 09:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 10K May 26 09:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 26 09:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.2K May 26 09:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 104 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 342 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 24K 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.6K 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 63K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstools
Input is Dekker-PT-010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r236-blw3-152732477000021
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527944962065

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/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.201805151631/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 16 LTL properties
Checking formula 0 : !((G(F(G(X("(p0_7>=2)"))))))
Formula 0 simplified : !GFGX"(p0_7>=2)"
Reverse transition relation is NOT exact ! Due to transitions exit_0, exit_1, exit_2, exit_3, exit_4, exit_5, exit_6, exit_7, exit_8, exit_9, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/110/10/120
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
8 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.100177,19556,1,0,259,15620,266,123,2700,11846,257
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G(G(F("(p0_9<=flag_0_4)"))))))
Formula 1 simplified : !GF"(p0_9<=flag_0_4)"
3 unique states visited
3 strongly connected components in search stack
4 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.103459,19924,1,0,260,15835,275,123,2704,12525,268
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(G(F(F("(flag_0_2>=1)"))))))
Formula 2 simplified : !XGF"(flag_0_2>=1)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.115672,20432,1,0,262,16598,284,123,2705,13895,282
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((G(X(X(F("(flag_0_4>=2)"))))))
Formula 3 simplified : !GXXF"(flag_0_4>=2)"
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.116271,20432,1,0,262,16598,293,123,2707,13895,288
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G((F("(p3_9<=p0_3)"))U(X("(p1_8<=flag_1_5)")))))
Formula 4 simplified : !G(F"(p3_9<=p0_3)" U X"(p1_8<=flag_1_5)")
4 unique states visited
4 strongly connected components in search stack
5 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.120234,20800,1,0,268,17219,307,125,2717,15027,312
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(F(F(X("(p1_9<=flag_0_7)"))))))
Formula 5 simplified : !XFX"(p1_9<=flag_0_7)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.134247,21264,1,0,296,22090,316,135,2721,19724,370
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((F(X(("(flag_1_8<=p3_1)")U("(flag_0_1>=1)")))))
Formula 6 simplified : !FX("(flag_1_8<=p3_1)" U "(flag_0_1>=1)")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.154852,22580,1,0,317,28130,325,145,2722,24596,430
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !(("(p34<=p0_8)"))
Formula 7 simplified : !"(p34<=p0_8)"
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.155129,22580,1,0,317,28130,328,145,2725,24597,432
no accepting run found
Formula 7 is TRUE no accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-07 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F("(p0_5<=flag_1_1)")))
Formula 8 simplified : !F"(p0_5<=flag_1_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.195893,24164,1,0,337,36903,337,155,2729,33816,486
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((X(G("(p1_8<=p1_2)"))))
Formula 9 simplified : !XG"(p1_8<=p1_2)"
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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.266473,27320,1,0,361,53930,345,165,2733,50913,552
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F(F("(flag_1_0<=flag_0_5)"))))
Formula 10 simplified : !F"(flag_1_0<=flag_0_5)"
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.266883,27584,1,0,361,53930,354,165,2736,50913,556
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((G(F(G(X("(p0_0>=1)"))))))
Formula 11 simplified : !GFGX"(p0_0>=1)"
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
1 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.273411,27848,1,0,362,54363,359,165,2737,52096,562
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((G(G(("(p0_0>=2)")U("(p1_4<=flag_0_1)")))))
Formula 12 simplified : !G("(p0_0>=2)" U "(p1_4<=flag_0_1)")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
5 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.32085,29832,1,0,383,63175,375,175,2750,58776,630
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !((X("(flag_1_7>=1)")))
Formula 13 simplified : !X"(flag_1_7>=1)"
4 unique states visited
4 strongly connected components in search stack
4 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.322167,30096,1,0,385,63327,378,175,2751,58896,637
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !(("(p0_9<=flag_0_3)"))
Formula 14 simplified : !"(p0_9<=flag_0_3)"
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.322884,30096,1,0,385,63327,381,175,2754,58896,639
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((G((F("(p0_9<=p0_0)"))U(G("(flag_0_0<=flag_0_8)")))))
Formula 15 simplified : !G(F"(p0_9<=p0_0)" U G"(flag_0_0<=flag_0_8)")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 40
// Phase 1: matrix 40 rows 50 cols
invariant :flag_0_3 + p1_3 + p3_3 = 1
invariant :p0_2 + p1_2 + p3_2 = 1
invariant :p0_1 + p1_1 + p3_1 = 1
invariant :flag_0_5 + p1_5 + p3_5 = 1
invariant :flag_1_5 + -1'p1_5 + -1'p3_5 = 0
invariant :flag_0_6 + p1_6 + p3_6 = 1
invariant :flag_1_4 + -1'p1_4 + -1'p34 = 0
invariant :p0_8 + p1_8 + p3_8 = 1
invariant :flag_1_0 + -1'p1_0 + -1'p3_0 = 0
invariant :flag_0_7 + p1_7 + p3_7 = 1
invariant :flag_1_9 + -1'p1_9 + -1'p3_9 = 0
invariant :p0_3 + p1_3 + p3_3 = 1
invariant :flag_0_0 + p1_0 + p3_0 = 1
invariant :flag_1_2 + -1'p1_2 + -1'p3_2 = 0
invariant :p0_0 + p1_0 + p3_0 = 1
invariant :p0_4 + p1_4 + p34 = 1
invariant :flag_1_1 + -1'p1_1 + -1'p3_1 = 0
invariant :flag_0_1 + p1_1 + p3_1 = 1
invariant :flag_1_3 + -1'p1_3 + -1'p3_3 = 0
invariant :p0_5 + p1_5 + p3_5 = 1
invariant :flag_1_6 + -1'p1_6 + -1'p3_6 = 0
invariant :p0_9 + p1_9 + p3_9 = 1
invariant :p0_6 + p1_6 + p3_6 = 1
invariant :flag_0_4 + p1_4 + p34 = 1
invariant :p0_7 + p1_7 + p3_7 = 1
invariant :flag_1_8 + -1'p1_8 + -1'p3_8 = 0
invariant :flag_0_2 + p1_2 + p3_2 = 1
invariant :flag_0_8 + p1_8 + p3_8 = 1
invariant :flag_0_9 + p1_9 + p3_9 = 1
invariant :flag_1_7 + -1'p1_7 + -1'p3_7 = 0
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.385201,32168,1,0,401,73924,387,177,2759,70608,718
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA Dekker-PT-010-LTLCardinality-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 1527944964949

--------------------
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 LTLCardinality -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 LTLCardinality -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 1:09:23 PM fr.lip6.move.gal.application.Application start
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/, -smt]
Jun 02, 2018 1:09:23 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 02, 2018 1:09:23 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 60 ms
Jun 02, 2018 1:09:23 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 50 places.
Jun 02, 2018 1:09:23 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 120 transitions.
Jun 02, 2018 1:09:23 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 16 ms
Jun 02, 2018 1:09:24 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 80 ms
Jun 02, 2018 1:09:24 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
Jun 02, 2018 1:09:24 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 0 ms
Jun 02, 2018 1:09:24 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 120 transitions.
Jun 02, 2018 1:09:24 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 30 place invariants in 13 ms
Skipping mayMatrices nes/nds SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 35) 0)")
java.lang.RuntimeException: SMT assertion produced unexpected response (error "Failed to assert expression: java.io.IOException: Broken pipe (>= (select (select s 0) 35) 0)")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:102)
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 1:09:24 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 434ms 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="Dekker-PT-010"
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

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-010.tgz
mv Dekker-PT-010 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 Dekker-PT-010, 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 r236-blw3-152732477000021"
echo "====================================================================="
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
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 ;