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)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool itstools
Input is CircadianClock-PT-000001, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-csrt-149436129900582
=====================================================================

--------------------
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 CircadianClock-PT-000001-LTLFireability-0
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-1
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-10
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-11
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-12
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-13
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-14
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-15
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-2
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-3
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-4
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-5
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-6
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-7
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-8
FORMULA_NAME CircadianClock-PT-000001-LTLFireability-9

=== Now, execution of the tool begins

BK_START 1496287017371


Using solver YICES2 to compute partial order matrices.
Built C files in :
/home/mcc/execution
its-ltl command run as :

/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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 : !((X(G((G(("dr>=1")&&("mr_cap>=1")))U("mr>=1")))))
Formula 0 simplified : !XG(G("dr>=1" & "mr_cap>=1") U "mr>=1")
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 16 rows 14 cols
invariant : 1'da + 1'da_a= 1
invariant : 1'mr + 1'mr_cap= 1
invariant : 1'dr + 1'dr_a= 1
invariant : 1'a + 1'a_cap= 1
invariant : 1'ma + 1'ma_cap= 1
invariant : 1'r + 1'r_cap= 1
invariant : 1'c + 1'c_cap= 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.053608,25292,1,0,32,1254,52,12,375,1580,92
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-0 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G(G((X(("da_a>=1")&&("a_cap>=1")))U(("da>=1")&&("a>=1"))))))
Formula 1 simplified : !G(X("a_cap>=1" & "da_a>=1") U ("a>=1" & "da>=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.058461,25772,1,0,34,1467,68,12,385,1825,104
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-1 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((X(G(F(F(X(("da>=1")&&("ma_cap>=1"))))))))
Formula 2 simplified : !XGFX("da>=1" & "ma_cap>=1")
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.060026,25832,1,0,35,1528,80,12,389,1910,115
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-2 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((X(X(("mr>=1")&&("r_cap>=1")))))
Formula 3 simplified : !XX("mr>=1" & "r_cap>=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.061045,25864,1,0,37,1558,86,12,393,1940,122
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-3 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((G(F(("c>=1")&&("r_cap>=1")))))
Formula 4 simplified : !GF("c>=1" & "r_cap>=1")
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.062178,25920,1,0,38,1576,98,12,397,1959,131
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-4 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(("da_a>=1")&&("ma_cap>=1"))))
Formula 5 simplified : !F("da_a>=1" & "ma_cap>=1")
2 unique states visited
2 strongly connected components in search stack
2 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.065468,25928,1,0,53,1966,108,20,400,2506,197
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-5 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(("mr>=1"))
Formula 6 simplified : !"mr>=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.06587,25928,1,0,53,1966,109,20,400,2506,199
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-6 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((X((("a>=1")&&("r>=1"))&&("c_cap>=1"))))
Formula 7 simplified : !X("a>=1" & "c_cap>=1" & "r>=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.066705,26040,1,0,53,1966,120,20,408,2506,203
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-7 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((F(F(("a>=1")&&("dr>=1")))))
Formula 8 simplified : !F("a>=1" & "dr>=1")
2 unique states visited
2 strongly connected components in search stack
2 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.067831,26040,1,0,59,1995,130,23,411,2566,229
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-8 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !(((("dr_a>=1")&&("a_cap>=1"))U((X(("da>=1")&&("ma_cap>=1")))U("mr>=1"))))
Formula 9 simplified : !(("a_cap>=1" & "dr_a>=1") U (X("da>=1" & "ma_cap>=1") U "mr>=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.070706,26640,1,0,61,1996,152,23,430,2568,243
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-9 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((F(((("dr_a>=1")&&("mr_cap>=1"))U("r>=1"))U(("c>=1")&&("r_cap>=1")))))
Formula 10 simplified : !F((("dr_a>=1" & "mr_cap>=1") U "r>=1") U ("c>=1" & "r_cap>=1"))
2 unique states visited
2 strongly connected components in search stack
2 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.073069,26652,1,0,73,2183,152,29,430,2907,293
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !(((X(("a>=1")&&("dr>=1")))U(G(G(F(("mr>=1")&&("r_cap>=1")))))))
Formula 11 simplified : !(X("a>=1" & "dr>=1") U GF("mr>=1" & "r_cap>=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.074978,26928,1,0,74,2186,158,29,430,2915,302
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F(("dr_a>=1")&&("a_cap>=1"))))
Formula 12 simplified : !F("a_cap>=1" & "dr_a>=1")
2 unique states visited
2 strongly connected components in search stack
2 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.077003,26932,1,0,90,2307,168,37,432,3249,357
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((X(F(F(("mr>=1")&&("r_cap>=1")))))U((("a>=1")&&("r>=1"))&&("c_cap>=1"))))
Formula 13 simplified : !(XF("mr>=1" & "r_cap>=1") U ("a>=1" & "c_cap>=1" & "r>=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.083324,27164,1,0,113,2600,170,50,432,3808,433
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((G(F(F(("da_a>=1")&&("a_cap>=1"))))))
Formula 14 simplified : !GF("a_cap>=1" & "da_a>=1")
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.084176,27240,1,0,113,2600,176,50,432,3808,437
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !((F(F((("dr_a>=1")&&("a_cap>=1"))U(F(("dr_a>=1")&&("a_cap>=1")))))))
Formula 15 simplified : !F(("a_cap>=1" & "dr_a>=1") U F("a_cap>=1" & "dr_a>=1"))
2 unique states visited
2 strongly connected components in search stack
2 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.084653,27240,1,0,113,2600,176,50,432,3808,437
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CircadianClock-PT-000001-LTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Exit code :0

BK_STOP 1496287020412

--------------------
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/ -smt
+ ulimit -s 65536
+ java -Dosgi.requiredJavaVersion=1.6 -Xss8m -Xms40m -Xmx8192m -Declipse.pde.launch=true -Dfile.encoding=UTF-8 -classpath /home/mcc/BenchKit//eclipse/plugins/org.eclipse.equinox.launcher_1.3.201.v20161025-1711.jar org.eclipse.equinox.launcher.Main -application fr.lip6.move.gal.application.pnmcc -data /home/mcc/BenchKit//workspace -os linux -ws gtk -arch x86_64 -nl en_US -consoleLog -pnfolder /home/mcc/execution -examination LTLFireability -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -smt
Jun 01, 2017 3:16:59 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Jun 01, 2017 3:16:59 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 35 ms
Jun 01, 2017 3:16:59 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 14 places.
Jun 01, 2017 3:16:59 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 16 transitions.
Jun 01, 2017 3:16:59 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 29 ms
Jun 01, 2017 3:16:59 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 9 ms
Jun 01, 2017 3:16:59 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 ms
Jun 01, 2017 3:16:59 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 7 place invariants in 7 ms
Jun 01, 2017 3:16:59 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 14 variables to be positive in 170 ms
Jun 01, 2017 3:17:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 16 transitions.
Jun 01, 2017 3:17:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed :0/16 took 5 ms. Total solver calls (SAT/UNSAT): 7(3/4)
Jun 01, 2017 3:17:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 47 ms. Total solver calls (SAT/UNSAT): 96(44/52)
Jun 01, 2017 3:17:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 16 transitions.
Jun 01, 2017 3:17:00 AM fr.lip6.move.gal.itstools.Runner runTool
INFO: Standard error output from running tool CommandLine [args=[/home/mcc/BenchKit/eclipse/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201705302212/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]
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

Jun 01, 2017 3:17:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 30 ms. Total solver calls (SAT/UNSAT): 96(48/48)

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="CircadianClock-PT-000001"
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/CircadianClock-PT-000001.tgz
mv CircadianClock-PT-000001 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool itstools"
echo " Input is CircadianClock-PT-000001, 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 r010-csrt-149436129900582"
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 ;