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 776K
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 97K 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.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.0K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 23K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 351 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 7 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rw-r--r-- 1 mcc users 205K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool itstoolsl
Input is Philosophers-PT-000050, examination is ReachabilityDeadlock
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r117-csrt-152666477400783
=====================================================================

--------------------
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 Philosophers-PT-000050-ReachabilityDeadlock-0

=== Now, execution of the tool begins

BK_START 1527275125717

Flatten gal took : 166 ms
Performed 50 Post agglomeration using F-continuation condition.
Constant places removed 50 places and 0 transitions.
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 200 transition count 200
Applied a total of 50 rules in 42 ms. Remains 200 /250 variables (removed 50) and now considering 200/250 (removed 50) transitions.
// Phase 1: matrix 200 rows 200 cols
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/convert-linux64, -i, /tmp/graph3552700043592047757.txt, -o, /tmp/graph3552700043592047757.bin, -w, /tmp/graph3552700043592047757.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.201805241334/bin/louvain-linux64, /tmp/graph3552700043592047757.bin, -l, -1, -v, -w, /tmp/graph3552700043592047757.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 200 rows 200 cols
invariant :Fork_26 + Catch2_26 + Catch1_27 = 1
invariant :Think_23 + Catch2_23 + Catch1_23 = 1
invariant :Fork_39 + Catch2_39 + Catch1_40 = 1
invariant :Think_48 + Catch2_48 + Catch1_48 = 1
invariant :Fork_16 + Catch2_16 + Catch1_17 = 1
invariant :Think_15 + Catch2_15 + Catch1_15 = 1
invariant :Fork_3 + Catch2_3 + Catch1_4 = 1
invariant :Fork_47 + Catch2_47 + Catch1_48 = 1
invariant :Fork_27 + Catch2_27 + Catch1_28 = 1
invariant :Fork_21 + Catch2_21 + Catch1_22 = 1
invariant :Think_5 + Catch2_5 + Catch1_5 = 1
invariant :Think_47 + Catch2_47 + Catch1_47 = 1
invariant :Think_11 + Catch2_11 + Catch1_11 = 1
invariant :Think_35 + Catch2_35 + Catch1_35 = 1
invariant :Fork_35 + Catch2_35 + Catch1_36 = 1
invariant :Fork_45 + Catch2_45 + Catch1_46 = 1
invariant :Think_1 + Catch2_1 + Catch1_1 = 1
invariant :Think_6 + Catch2_6 + Catch1_6 = 1
invariant :Think_22 + Catch2_22 + Catch1_22 = 1
invariant :Think_30 + Catch2_30 + Catch1_30 = 1
invariant :Think_34 + Catch2_34 + Catch1_34 = 1
invariant :Fork_5 + Catch2_5 + Catch1_6 = 1
invariant :Fork_22 + Catch2_22 + Catch1_23 = 1
invariant :Think_31 + Catch2_31 + Catch1_31 = 1
invariant :Fork_15 + Catch2_15 + Catch1_16 = 1
invariant :Think_46 + Catch2_46 + Catch1_46 = 1
invariant :Think_14 + Catch2_14 + Catch1_14 = 1
invariant :Think_16 + Catch2_16 + Catch1_16 = 1
invariant :Think_24 + Catch2_24 + Catch1_24 = 1
invariant :Think_45 + Catch2_45 + Catch1_45 = 1
invariant :Fork_46 + Catch2_46 + Catch1_47 = 1
invariant :Think_29 + Catch2_29 + Catch1_29 = 1
invariant :Think_10 + Catch2_10 + Catch1_10 = 1
invariant :Think_43 + Catch2_43 + Catch1_43 = 1
invariant :Fork_32 + Catch2_32 + Catch1_33 = 1
invariant :Think_42 + Catch2_42 + Catch1_42 = 1
invariant :Think_26 + Catch2_26 + Catch1_26 = 1
invariant :Fork_1 + Catch2_1 + Catch1_2 = 1
invariant :Fork_28 + Catch2_28 + Catch1_29 = 1
invariant :Fork_7 + Catch2_7 + Catch1_8 = 1
invariant :Fork_38 + Catch2_38 + Catch1_39 = 1
invariant :Fork_11 + Catch2_11 + Catch1_12 = 1
invariant :Think_2 + Catch2_2 + Catch1_2 = 1
invariant :Think_9 + Catch2_9 + Catch1_9 = 1
invariant :Think_3 + Catch2_3 + Catch1_3 = 1
invariant :Fork_24 + Catch2_24 + Catch1_25 = 1
invariant :Think_21 + Catch2_21 + Catch1_21 = 1
invariant :Fork_41 + Catch2_41 + Catch1_42 = 1
invariant :Fork_43 + Catch2_43 + Catch1_44 = 1
invariant :Fork_50 + Catch1_1 + Catch2_50 = 1
invariant :Think_4 + Catch2_4 + Catch1_4 = 1
invariant :Fork_19 + Catch2_19 + Catch1_20 = 1
invariant :Think_33 + Catch2_33 + Catch1_33 = 1
invariant :Fork_10 + Catch2_10 + Catch1_11 = 1
invariant :Think_27 + Catch2_27 + Catch1_27 = 1
invariant :Fork_4 + Catch2_4 + Catch1_5 = 1
invariant :Fork_29 + Catch2_29 + Catch1_30 = 1
invariant :Think_20 + Catch2_20 + Catch1_20 = 1
invariant :Think_8 + Catch2_8 + Catch1_8 = 1
invariant :Fork_30 + Catch2_30 + Catch1_31 = 1
invariant :Fork_49 + Catch2_49 + Catch1_50 = 1
invariant :Fork_33 + Catch2_33 + Catch1_34 = 1
invariant :Fork_42 + Catch2_42 + Catch1_43 = 1
invariant :Think_50 + Catch2_50 + Catch1_50 = 1
invariant :Think_41 + Catch2_41 + Catch1_41 = 1
invariant :Think_25 + Catch2_25 + Catch1_25 = 1
invariant :Fork_13 + Catch2_13 + Catch1_14 = 1
invariant :Fork_25 + Catch2_25 + Catch1_26 = 1
invariant :Fork_23 + Catch2_23 + Catch1_24 = 1
invariant :Fork_40 + Catch2_40 + Catch1_41 = 1
invariant :Fork_8 + Catch2_8 + Catch1_9 = 1
invariant :Think_32 + Catch2_32 + Catch1_32 = 1
invariant :Fork_20 + Catch2_20 + Catch1_21 = 1
invariant :Fork_31 + Catch2_31 + Catch1_32 = 1
invariant :Fork_36 + Catch2_36 + Catch1_37 = 1
invariant :Fork_9 + Catch2_9 + Catch1_10 = 1
invariant :Fork_34 + Catch2_34 + Catch1_35 = 1
invariant :Think_44 + Catch2_44 + Catch1_44 = 1
invariant :Fork_37 + Catch2_37 + Catch1_38 = 1
invariant :Think_17 + Catch2_17 + Catch1_17 = 1
invariant :Think_39 + Catch2_39 + Catch1_39 = 1
invariant :Fork_44 + Catch2_44 + Catch1_45 = 1
invariant :Think_13 + Catch2_13 + Catch1_13 = 1
invariant :Think_18 + Catch2_18 + Catch1_18 = 1
invariant :Fork_18 + Catch2_18 + Catch1_19 = 1
invariant :Think_38 + Catch2_38 + Catch1_38 = 1
invariant :Think_37 + Catch2_37 + Catch1_37 = 1
invariant :Fork_48 + Catch2_48 + Catch1_49 = 1
invariant :Think_19 + Catch2_19 + Catch1_19 = 1
invariant :Think_40 + Catch2_40 + Catch1_40 = 1
invariant :Think_7 + Catch2_7 + Catch1_7 = 1
invariant :Think_12 + Catch2_12 + Catch1_12 = 1
invariant :Fork_14 + Catch2_14 + Catch1_15 = 1
invariant :Think_49 + Catch2_49 + Catch1_49 = 1
invariant :Think_28 + Catch2_28 + Catch1_28 = 1
invariant :Fork_2 + Catch2_2 + Catch1_3 = 1
invariant :Fork_17 + Catch2_17 + Catch1_18 = 1
invariant :Fork_6 + Catch2_6 + Catch1_7 = 1
invariant :Think_36 + Catch2_36 + Catch1_36 = 1
invariant :Fork_12 + Catch2_12 + Catch1_13 = 1
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityDeadlock.pnml.gal, -t, CGAL, -ctl, DEADLOCK], workingDir=/home/mcc/execution]

its-ctl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201805241334/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityDeadlock.pnml.gal -t CGAL -ctl DEADLOCK
No direction supplied, using forward translation only.
built 24 ordering constraints for composite.
built 19 ordering constraints for composite.
built 13 ordering constraints for composite.
built 14 ordering constraints for composite.
built 22 ordering constraints for composite.
built 11 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 10 ordering constraints for composite.
built 13 ordering constraints for composite.
built 22 ordering constraints for composite.
built 16 ordering constraints for composite.
built 10 ordering constraints for composite.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
reachable,7.92071e+20,0.079834,6584,532,35,4620,191,509,2989,64,327,0


Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
dead,2,0.118671,7700,123,18,7712,242,1198,6536,218,465,10528

System contains 2 deadlocks (shown below if less than --print-limit option) !
FORMULA Philosophers-PT-000050-ReachabilityDeadlock-0 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
[ i11={[ u51={[ Catch1_47=1 ]
} u50={[ Catch1_45=1 ]
} u49={[ Catch1_46=1 ]
} ]
} i10={[ u48={[ Catch1_30=1 ]
} u44={[ Catch1_27=1 ]
} u45={[ ]
} u22={[ Catch1_29=1 ]
} u23={[ Catch1_28=1 ]
} ]
} i9={[ u47={[ Catch1_26=1 ]
} u46={[ Catch1_25=1 ]
} u37={[ Catch1_21=1 ]
} u36={[ ]
} u35={[ Catch1_24=1 ]
} u15={[ Catch1_22=1 ]
} u2={[ Catch1_23=1 ]
} ]
} i8={[ u31={[ Catch1_44=1 ]
} u53={[ ]
} u30={[ Catch1_43=1 ]
} u52={[ Catch1_42=1 ]
} ]
} i7={[ u40={[ Catch1_13=1 ]
} u41={[ Catch1_12=1 ]
} u14={[ Catch1_11=1 ]
} ]
} i6={[ u39={[ Catch1_15=1 ]
} u13={[ Catch1_14=1 ]
} u12={[ Catch1_16=1 ]
} ]
} i5={[ u34={[ Catch1_17=1 ]
} u33={[ Catch1_18=1 ]
} u16={[ Catch1_20=1 Catch1_19=1 ]
} ]
} i4={[ u38={[ Catch1_10=1 ]
} u9={[ Catch1_9=1 ]
} u8={[ Catch1_8=1 ]
} u0={[ ]
} ]
} i3={[ u29={[ Catch1_7=1 ]
} u27={[ ]
} u28={[ Catch1_3=1 ]
} u26={[ Catch1_2=1 ]
} u10={[ Catch1_4=1 ]
} u1={[ Catch1_6=1 ]
} u11={[ Catch1_5=1 ]
} ]
} i2={[ u24={[ Catch1_31=1 ]
} u42={[ Catch1_32=1 ]
} u25={[ Catch1_33=1 ]
} u18={[ Catch1_34=1 ]
} u17={[ Catch1_35=1 ]
} ]
} i1={[ u32={[ Catch1_48=1 ]
} u6={[ Catch1_49=1 ]
} u7={[ Catch1_50=1 ]
} u5={[ Catch1_1=1 ]
} ]
} i0={[ u20={[ Catch1_39=1 ]
} u43={[ Catch1_40=1 ]
} u21={[ ]
} u4={[ Catch1_38=1 ]
} u19={[ Catch1_37=1 Catch1_36=1 ]
} u3={[ Catch1_41=1 ]
} ]
} ]
[ i11={[ u51={[ Catch2_47=1 ]
} u50={[ Catch2_45=1 ]
} u49={[ Catch2_46=1 ]
} ]
} i10={[ u48={[ Catch2_30=1 ]
} u44={[ Catch2_26=1 ]
} u45={[ Catch2_27=1 ]
} u22={[ Catch2_29=1 ]
} u23={[ Catch2_28=1 ]
} ]
} i9={[ u47={[ Catch2_25=1 ]
} u46={[ Catch2_24=1 ]
} u37={[ Catch2_20=1 ]
} u36={[ Catch2_21=1 ]
} u35={[ Catch2_23=1 ]
} u15={[ Catch2_22=1 ]
} u2={[ ]
} ]
} i8={[ u31={[ Catch2_44=1 ]
} u53={[ Catch2_43=1 ]
} u30={[ Catch2_42=1 ]
} u52={[ Catch2_41=1 ]
} ]
} i7={[ u40={[ Catch2_13=1 ]
} u41={[ Catch2_12=1 ]
} u14={[ Catch2_11=1 ]
} ]
} i6={[ u39={[ Catch2_15=1 ]
} u13={[ Catch2_14=1 ]
} u12={[ Catch2_16=1 ]
} ]
} i5={[ u34={[ Catch2_17=1 ]
} u33={[ Catch2_18=1 ]
} u16={[ Catch2_19=1 ]
} ]
} i4={[ u38={[ Catch2_10=1 ]
} u9={[ Catch2_9=1 ]
} u8={[ Catch2_8=1 ]
} u0={[ Catch2_7=1 ]
} ]
} i3={[ u29={[ Catch2_6=1 ]
} u27={[ Catch2_2=1 ]
} u28={[ Catch2_3=1 ]
} u26={[ Catch2_1=1 ]
} u10={[ ]
} u1={[ Catch2_5=1 ]
} u11={[ Catch2_4=1 ]
} ]
} i2={[ u24={[ Catch2_31=1 ]
} u42={[ Catch2_32=1 ]
} u25={[ Catch2_33=1 ]
} u18={[ Catch2_34=1 ]
} u17={[ Catch2_35=1 ]
} ]
} i1={[ u32={[ Catch2_48=1 ]
} u6={[ ]
} u7={[ Catch2_49=1 ]
} u5={[ Catch2_50=1 ]
} ]
} i0={[ u20={[ Catch2_39=1 ]
} u43={[ ]
} u21={[ Catch2_38=1 ]
} u4={[ Catch2_37=1 ]
} u19={[ Catch2_36=1 ]
} u3={[ Catch2_40=1 ]
} ]
} ]
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 1527275129552

--------------------
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 ReachabilityDeadlock -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -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 ReachabilityDeadlock -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -louvain -smt -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
May 25, 2018 7:05:27 PM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityDeadlock, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -louvain, -smt]
May 25, 2018 7:05:27 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
May 25, 2018 7:05:28 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 132 ms
May 25, 2018 7:05:28 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 places.
May 25, 2018 7:05:28 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 transitions.
May 25, 2018 7:05:28 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 46 ms
May 25, 2018 7:05:28 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 161 ms
May 25, 2018 7:05:28 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.simple.gal : 7 ms
May 25, 2018 7:05:28 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 250 transitions.
May 25, 2018 7:05:28 PM fr.lip6.move.gal.application.MccTranslator applyOrder
INFO: Applying decomposition
May 25, 2018 7:05:28 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 27 ms
May 25, 2018 7:05:28 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 200 transitions.
May 25, 2018 7:05:28 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 40 ms
Begin: Fri May 25 19:05:29 2018

Computation of communities with the Newman-Girvan Modularity quality function

level 0:
start computation: Fri May 25 19:05:29 2018
network size: 200 nodes, 700 links, 400 weight
quality increased from -0.00546875 to 0.609981
end computation: Fri May 25 19:05:29 2018
level 1:
start computation: Fri May 25 19:05:29 2018
network size: 54 nodes, 190 links, 400 weight
quality increased from 0.609981 to 0.812747
end computation: Fri May 25 19:05:29 2018
level 2:
start computation: Fri May 25 19:05:29 2018
network size: 17 nodes, 51 links, 400 weight
quality increased from 0.812747 to 0.820478
end computation: Fri May 25 19:05:29 2018
level 3:
start computation: Fri May 25 19:05:29 2018
network size: 12 nodes, 36 links, 400 weight
quality increased from 0.820478 to 0.820478
end computation: Fri May 25 19:05:29 2018
End: Fri May 25 19:05:29 2018
Total duration: 0 sec
0.820478
May 25, 2018 7:05:29 PM fr.lip6.move.gal.instantiate.CompositeBuilder decomposeWithOrder
INFO: Decomposing Gal with order
May 25, 2018 7:05:29 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 100 place invariants in 16 ms
May 25, 2018 7:05:29 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 55 ms
May 25, 2018 7:05:29 PM fr.lip6.move.gal.instantiate.CompositeBuilder rewriteArraysToAllowPartition
INFO: Rewriting arrays to variables to allow decomposition.
May 25, 2018 7:05:29 PM fr.lip6.move.gal.instantiate.Instantiator fuseIsomorphicEffects
INFO: Removed a total of 4 redundant transitions.
May 25, 2018 7:05:29 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/ReachabilityDeadlock.pnml.gal : 6 ms
Skipping mayMatrices nes/nds SMT push produced unexpected response (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
java.lang.RuntimeException: SMT push produced unexpected response (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.init(KInductionSolver.java:87)
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)
May 25, 2018 7:05:29 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 475ms 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="Philosophers-PT-000050"
export BK_EXAMINATION="ReachabilityDeadlock"
export BK_TOOL="itstoolsl"
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/Philosophers-PT-000050.tgz
mv Philosophers-PT-000050 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 itstoolsl"
echo " Input is Philosophers-PT-000050, examination is ReachabilityDeadlock"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r117-csrt-152666477400783"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityDeadlock" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityDeadlock" != "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 "ReachabilityDeadlock.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityDeadlock.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityDeadlock.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 '' ReachabilityDeadlock.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 ;