About the Execution of ITS-Tools.M for CircularTrains-PT-012
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
335.930 | 4503.00 | 6664.00 | 246.30 | TFTFFTFFFFTFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r190-smll-155225126700169.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3957
Executing tool itstoolsm
Input is CircularTrains-PT-012, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r190-smll-155225126700169
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 168K
-rw-r--r-- 1 mcc users 3.3K Feb 9 08:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 16K Feb 9 08:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 5 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 5 07:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 108 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 346 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 23:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K Feb 4 23:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 4 22:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.4K Feb 4 22:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 2 01:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 2 01:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Jan 29 15:23 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Jan 29 15:23 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 4 22:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 4 22:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 4 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 9.2K Mar 10 17:31 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 CircularTrains-PT-012-LTLFireability-00
FORMULA_NAME CircularTrains-PT-012-LTLFireability-01
FORMULA_NAME CircularTrains-PT-012-LTLFireability-02
FORMULA_NAME CircularTrains-PT-012-LTLFireability-03
FORMULA_NAME CircularTrains-PT-012-LTLFireability-04
FORMULA_NAME CircularTrains-PT-012-LTLFireability-05
FORMULA_NAME CircularTrains-PT-012-LTLFireability-06
FORMULA_NAME CircularTrains-PT-012-LTLFireability-07
FORMULA_NAME CircularTrains-PT-012-LTLFireability-08
FORMULA_NAME CircularTrains-PT-012-LTLFireability-09
FORMULA_NAME CircularTrains-PT-012-LTLFireability-10
FORMULA_NAME CircularTrains-PT-012-LTLFireability-11
FORMULA_NAME CircularTrains-PT-012-LTLFireability-12
FORMULA_NAME CircularTrains-PT-012-LTLFireability-13
FORMULA_NAME CircularTrains-PT-012-LTLFireability-14
FORMULA_NAME CircularTrains-PT-012-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1553633064166
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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, --load-order, /home/mcc/execution/model.ord], workingDir=/home/mcc/execution]
its-ltl command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903251645/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 --load-order /home/mcc/execution/model.ord
Read 16 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(G(F(("((Section_9>=1)&&(F10>=1))")U("((F4>=1)&&(Section_3>=1))"))))))
Formula 0 simplified : !XGF("((Section_9>=1)&&(F10>=1))" U "((F4>=1)&&(Section_3>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 12 rows 24 cols
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 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.052681,17424,1,0,46,5350,24,1,546,3481,117
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((G("((F8>=1)&&(Section_7>=1))")))
Formula 1 simplified : !G"((F8>=1)&&(Section_7>=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
invariant :Section_9 + F8 + Section_8 = 2
invariant :F3 + Section_3 + -1'Section_5 + -1'F4 = 0
STATS,0,0.053927,17828,1,0,46,5350,32,1,550,3482,124
invariant :Section_11 + Section_10 + F10 = 1
invariant :Section_12 + -1'Section_10 + -1'F10 + F11 = 1
invariant :F7 + Section_8 + Section_7 = 1
invariant :Section_2 + Section_3 + Section_10 + -1'F8 + -1'Section_5 + Section_7 + -1'F5 + -1'F11 + -1'F4 + Section_1 = -3
invariant :F12 + Section_10 + F10 + -1'F11 + Section_1 = 0
invariant :Section_6 + Section_5 + F5 = 2
invariant :F9 + Section_10 + -1'F8 + -1'Section_8 = -1
invariant :F2 + -1'Section_10 + F8 + Section_5 + -1'Section_7 + F5 + F11 + F4 + -1'Section_1 = 5
invariant :F1 + -1'Section_3 + -1'Section_10 + F8 + Section_5 + -1'Section_7 + F5 + F11 + F4 = 4
invariant :Section_4 + Section_5 + F4 = 1
invariant :F6 + -1'Section_5 + Section_7 + -1'F5 = -1
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !(((F("((F3>=1)&&(Section_2>=1))"))U((X("((F9>=1)&&(Section_8>=1))"))U(X("((F3>=1)&&(Section_2>=1))")))))
Formula 2 simplified : !(F"((F3>=1)&&(Section_2>=1))" U (X"((F9>=1)&&(Section_8>=1))" U X"((F3>=1)&&(Section_2>=1))"))
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 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.069846,18224,1,0,96,7841,41,13,554,7178,235
no accepting run found
Formula 2 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !(((X("((Section_9>=1)&&(F10>=1))"))U("((F9>=1)&&(Section_8>=1))")))
Formula 3 simplified : !(X"((Section_9>=1)&&(F10>=1))" U "((F9>=1)&&(Section_8>=1))")
14 unique states visited
14 strongly connected components in search stack
14 transitions explored
14 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.088579,18992,1,0,162,9616,52,31,565,11165,418
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((false))
Formula 4 simplified : 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.089006,18992,1,0,162,9624,52,31,565,11172,420
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((F(("((Section_5>=1)&&(F6>=1))")U(X(X("((Section_9>=1)&&(F10>=1))"))))))
Formula 5 simplified : !F("((Section_5>=1)&&(F6>=1))" U XX"((Section_9>=1)&&(F10>=1))")
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 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.102437,19256,1,0,234,11217,58,47,565,13908,571
no accepting run found
Formula 5 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !((false))
Formula 6 simplified : 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.102685,19256,1,0,234,11217,58,47,565,13908,571
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 7 : !((G((G(G("((F3>=1)&&(Section_2>=1))")))U(F(G("((Section_6>=1)&&(F7>=1))"))))))
Formula 7 simplified : !G(G"((F3>=1)&&(Section_2>=1))" U FG"((Section_6>=1)&&(F7>=1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 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.118126,19956,1,0,308,13458,71,84,569,17901,728
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 8 : !((G(G(G("((Section_6>=1)&&(F7>=1))")))))
Formula 8 simplified : !G"((Section_6>=1)&&(F7>=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.120133,20220,1,0,310,13530,71,85,569,18016,736
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 9 : !((false))
Formula 9 simplified : 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.12033,20220,1,0,310,13530,71,85,569,18016,736
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 10 : !((G(("((F2>=1)&&(Section_1>=1))")U(G(F("((Section_5>=1)&&(F6>=1))"))))))
Formula 10 simplified : !G("((F2>=1)&&(Section_1>=1))" U GF"((Section_5>=1)&&(F6>=1))")
2 unique states visited
0 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.130109,20832,1,0,350,15456,80,86,573,19563,840
no accepting run found
Formula 10 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 11 : !((F(G(G(F(G("((Section_9>=1)&&(F10>=1))")))))))
Formula 11 simplified : !FGFG"((Section_9>=1)&&(F10>=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.137086,20832,1,0,423,16240,90,122,573,21377,997
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 12 : !((F((X(G("((F2>=1)&&(Section_1>=1))")))U(F(G("((F9>=1)&&(Section_8>=1))"))))))
Formula 12 simplified : !F(XG"((F2>=1)&&(Section_1>=1))" U FG"((F9>=1)&&(Section_8>=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.147521,21308,1,0,503,17553,100,157,573,24314,1170
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 13 : !(((X(F(F("((Section_6>=1)&&(F7>=1))"))))U(F(X(G("((F11>=1)&&(Section_10>=1))"))))))
Formula 13 simplified : !(XF"((Section_6>=1)&&(F7>=1))" U FXG"((F11>=1)&&(Section_10>=1))")
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 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.154656,21504,1,0,563,18136,113,189,577,25799,1307
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 14 : !((F("((Section_12>=1)&&(F1>=1))")))
Formula 14 simplified : !F"((Section_12>=1)&&(F1>=1))"
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.155378,21768,1,0,563,18136,122,189,581,25799,1311
no accepting run found
Formula 14 is TRUE no accepting run found.
FORMULA CircularTrains-PT-012-LTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 15 : !(((F(X(X("((Section_12>=1)&&(F1>=1))"))))U(G(("((Section_9>=1)&&(F10>=1))")U("((F9>=1)&&(Section_8>=1))")))))
Formula 15 simplified : !(FXX"((Section_12>=1)&&(F1>=1))" U G("((Section_9>=1)&&(F10>=1))" U "((F9>=1)&&(Section_8>=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.161719,22592,1,0,570,18182,131,191,586,25894,1364
an accepting run exists (use option '-e' to print it)
Formula 15 is FALSE accepting run found.
FORMULA CircularTrains-PT-012-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, -O2, model.c], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
BK_STOP 1553633068669
--------------------
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
+ 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 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss8m -Xms40m -Xmx8192m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6
Mar 26, 2019 8:44:26 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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt]
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 34 ms
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 24 places.
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 12 transitions.
Mar 26, 2019 8:44:26 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 10 ms
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 27 ms
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 8 ms
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 12 transitions.
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 24 places.
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.application.StructuralToGreatSPN handlePage
INFO: Transformed 12 transitions.
Mar 26, 2019 8:44:26 PM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 1 ms
Mar 26, 2019 8:44:26 PM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 2 ms
Mar 26, 2019 8:44:26 PM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 12 transitions.
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 13 place invariants in 10 ms
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 24 variables to be positive in 88 ms
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 12 transitions.
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/12 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 12 transitions.
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 12 transitions.
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 196 ms. Total solver calls (SAT/UNSAT): 40(31/9)
Skipping mayMatrices nes/nds SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
java.lang.RuntimeException: SMT solver raised an error on invariants :(error "Failed to assert expression: java.io.IOException: Stream closed (invariants (select s 2))")
at fr.lip6.move.gal.gal2smt.bmc.KInductionSolver.addKnownInvariants(KInductionSolver.java:456)
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeDoNotAccord(NecessaryEnablingsolver.java:572)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:538)
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)
Mar 26, 2019 8:44:27 PM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 762ms 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="CircularTrains-PT-012"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstoolsm"
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-3957"
echo " Executing tool itstoolsm"
echo " Input is CircularTrains-PT-012, 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 r190-smll-155225126700169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-012.tgz
mv CircularTrains-PT-012 execution
cd execution
if [ "LTLFireability" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLFireability" = "UpperBounds" ] ; 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 '
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 ;