Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r141-smll-158961510800298.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is Railroad-PT-010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r141-smll-158961510800298
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 256K
-rw-r--r-- 1 mcc users 3.4K Apr 12 08:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 12 08:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 11 09:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 11 09:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 14 12:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 14:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 10 14:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 9 21:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 9 21:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 78K Mar 24 05:38 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 Railroad-PT-010-00
FORMULA_NAME Railroad-PT-010-01
FORMULA_NAME Railroad-PT-010-02
FORMULA_NAME Railroad-PT-010-03
FORMULA_NAME Railroad-PT-010-04
FORMULA_NAME Railroad-PT-010-05
FORMULA_NAME Railroad-PT-010-06
FORMULA_NAME Railroad-PT-010-07
FORMULA_NAME Railroad-PT-010-08
FORMULA_NAME Railroad-PT-010-09
FORMULA_NAME Railroad-PT-010-10
FORMULA_NAME Railroad-PT-010-11
FORMULA_NAME Railroad-PT-010-12
FORMULA_NAME Railroad-PT-010-13
FORMULA_NAME Railroad-PT-010-14
FORMULA_NAME Railroad-PT-010-15

=== Now, execution of the tool begins

BK_START 1590072794554

[2020-05-21 14:53:17] [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, -timeout, 3600]
[2020-05-21 14:53:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-21 14:53:17] [INFO ] Load time of PNML (sax parser for PT used): 126 ms
[2020-05-21 14:53:17] [INFO ] Transformed 118 places.
[2020-05-21 14:53:17] [INFO ] Transformed 156 transitions.
[2020-05-21 14:53:17] [INFO ] Parsed PT model containing 118 places and 156 transitions in 212 ms.
Deduced a syphon composed of 31 places in 2 ms
Reduce places removed 31 places and 10 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 675 ms. (steps per millisecond=148 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 146 rows 87 cols
[2020-05-21 14:53:18] [INFO ] Computed 41 place invariants in 13 ms
[2020-05-21 14:53:18] [INFO ] [Real]Absence check using 25 positive place invariants in 31 ms returned sat
[2020-05-21 14:53:18] [INFO ] [Real]Absence check using 25 positive and 16 generalized place invariants in 6 ms returned unsat
[2020-05-21 14:53:18] [INFO ] [Real]Absence check using 25 positive place invariants in 15 ms returned sat
[2020-05-21 14:53:18] [INFO ] [Real]Absence check using 25 positive and 16 generalized place invariants in 6 ms returned unsat
Successfully simplified 2 atomic propositions for a total of 2 simplifications.
[2020-05-21 14:53:18] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-05-21 14:53:18] [INFO ] Flatten gal took : 103 ms
FORMULA Railroad-PT-010-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Railroad-PT-010-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-21 14:53:18] [INFO ] Flatten gal took : 42 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-21 14:53:18] [INFO ] Applying decomposition
[2020-05-21 14:53:18] [INFO ] Flatten gal took : 36 ms
[2020-05-21 14:53:18] [INFO ] Input system was already deterministic with 146 transitions.
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph16271956559737169017.txt, -o, /tmp/graph16271956559737169017.bin, -w, /tmp/graph16271956559737169017.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph16271956559737169017.bin, -l, -1, -v, -w, /tmp/graph16271956559737169017.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-21 14:53:19] [INFO ] Decomposing Gal with order
[2020-05-21 14:53:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-21 14:53:19] [INFO ] Removed a total of 287 redundant transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 146 rows 87 cols
[2020-05-21 14:53:19] [INFO ] Computed 41 place invariants in 8 ms
inv : pl_P44_1 - pl_P54_1 = 0
inv : pl_P36_1 + pl_P37_1 + pl_P61_1 + pl_P62_1 + pl_P63_1 = 1
inv : pl_P12_1 - pl_P66_1 = 0
inv : pl_P34_1 + pl_P54_1 + pl_P55_1 = 1
inv : pl_P15_1 + pl_P16_1 - pl_P4_1 = 0
inv : pl_P5_1 + pl_P67_1 + pl_P6_1 = 1
inv : pl_P20_2 - pl_P22_1 - pl_P63_1 = 0
inv : pl_P52_1 - pl_P56_1 = 0
inv : pl_P8_1 - pl_P9_1 = 0
inv : pl_P38_1 + pl_P3_1 + pl_P53_1 = 1
inv : pl_P15_3 + pl_P16_3 + pl_P51_1 + pl_P56_1 = 1
inv : pl_P40_1 + pl_P42_1 + pl_P4_1 = 1
inv : pl_P14_10 + 9*pl_P14_2 + 8*pl_P14_3 + 7*pl_P14_4 + 6*pl_P14_5 + 5*pl_P14_6 + 4*pl_P14_7 + 3*pl_P14_8 + 2*pl_P14_9 - pl_P16_1 - pl_P16_10 - pl_P16_2 - pl_P16_3 - pl_P16_4 - pl_P16_5 - pl_P16_6 - pl_P16_7 - pl_P16_8 - pl_P16_9 - 10*pl_P21_1 - 9*pl_P36_1 + pl_P37_1 + 10*pl_P48_1 + pl_P62_1 - 9*pl_P63_1 = -9
inv : pl_P29_1 + pl_P58_1 + pl_P59_1 = 1
inv : pl_P30_1 - pl_P47_1 = 0
inv : pl_P0_1 - pl_P6_1 = 0
inv : pl_P45_1 + pl_P51_1 + pl_P56_1 = 1
inv : pl_P25_1 + pl_P60_1 + pl_P66_1 = 1
inv : pl_P22_1 + pl_P26_1 + pl_P36_1 + pl_P37_1 + pl_P37_3 + pl_P48_1 + pl_P63_1 = 1
inv : pl_P10_1 + pl_P15_2 + pl_P16_2 + pl_P9_1 = 1
inv : pl_P15_9 + pl_P16_9 - pl_P53_1 = 0
inv : pl_P14_1 + pl_P21_1 + pl_P36_1 - pl_P48_1 + pl_P63_1 = 1
inv : pl_P20_3 + pl_P21_1 + pl_P22_1 + pl_P63_1 = 1
inv : pl_P11_1 + pl_P21_1 + pl_P22_1 + pl_P63_1 = 1
inv : pl_P19_1 + pl_P28_1 + pl_P43_1 = 1
inv : pl_P17_1 + pl_P46_1 + pl_P47_1 = 1
inv : pl_P27_1 - pl_P43_1 = 0
inv : pl_P26_1 + pl_P32_1 + pl_P36_1 + pl_P37_1 + pl_P63_1 = 1
inv : pl_P15_8 + pl_P16_8 + pl_P5_1 + pl_P6_1 = 1
inv : 8*pl_P14_10 + 9*pl_P14_11 + pl_P14_3 + 2*pl_P14_4 + 3*pl_P14_5 + 4*pl_P14_6 + 5*pl_P14_7 + 6*pl_P14_8 + 7*pl_P14_9 + pl_P16_1 + pl_P16_10 + pl_P16_2 + pl_P16_3 + pl_P16_4 + pl_P16_5 + pl_P16_6 + pl_P16_7 + pl_P16_8 + pl_P16_9 + pl_P21_1 - pl_P37_1 - pl_P48_1 - pl_P62_1 = 9
inv : pl_P15_4 + pl_P16_4 + pl_P25_1 + pl_P66_1 = 1
inv : pl_P15_10 + pl_P16_10 + pl_P28_1 + pl_P43_1 = 1
inv : pl_P40_1 + pl_P41_1 + pl_P4_1 = 1
inv : pl_P15_5 + pl_P16_5 + pl_P54_1 + pl_P55_1 = 1
inv : pl_P10_1 + pl_P23_1 + pl_P9_1 = 1
inv : pl_P20_1 - pl_P21_1 = 0
inv : pl_P2_1 + pl_P3_1 + pl_P53_1 = 1
inv : pl_P15_7 + pl_P16_7 - pl_P58_1 = 0
inv : pl_P31_1 - pl_P36_1 - pl_P37_1 - pl_P63_1 = 0
inv : pl_P15_6 + pl_P16_6 + pl_P46_1 + pl_P47_1 = 1
inv : pl_P50_1 + pl_P58_1 + pl_P59_1 = 1
Total of 41 invariants.
[2020-05-21 14:53:19] [INFO ] Computed 41 place invariants in 16 ms
[2020-05-21 14:53:19] [INFO ] Flatten gal took : 111 ms
[2020-05-21 14:53:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 18 labels/synchronizations in 21 ms.
[2020-05-21 14:53:19] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 7 ms
[2020-05-21 14:53:19] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 3 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/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.202005100927/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 12 LTL properties
Checking formula 0 : !((G("(((i2.u6.pl_P14_8<1)||(i8.u16.pl_P15_9<1))||(i3.u4.pl_P26_1<1))")))
Formula 0 simplified : !G"(((i2.u6.pl_P14_8<1)||(i8.u16.pl_P15_9<1))||(i3.u4.pl_P26_1<1))"
built 32 ordering constraints for composite.
built 5 ordering constraints for composite.
built 10 ordering constraints for composite.
built 20 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 5 ordering constraints for composite.
built 8 ordering constraints for composite.
[2020-05-21 14:53:19] [INFO ] Proved 87 variables to be positive in 354 ms
[2020-05-21 14:53:19] [INFO ] Computing symmetric may disable matrix : 146 transitions.
[2020-05-21 14:53:19] [INFO ] Computation of disable matrix completed :0/146 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 14:53:19] [INFO ] Computation of Complete disable matrix. took 37 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-21 14:53:19] [INFO ] Computing symmetric may enable matrix : 146 transitions.
[2020-05-21 14:53:19] [INFO ] Computation of Complete enable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is NOT exact ! Due to transitions tr_T28_1, tr_T37_2, tr_T37_5, tr_T37_6, tr_T37_7, tr_T37_8, tr_T37_9, tr_T4_1, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/95/8/103
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
60 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.641775,29720,1,0,31957,490,1400,33200,421,976,74940
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Railroad-PT-010-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((("(((i2.u3.pl_P14_11>=1)&&(i3.u7.pl_P15_2>=1))&&(i3.u4.pl_P26_1>=1))")U(F(X(G((F("(((i3.u5.pl_P14_6>=1)&&(i7.u13.pl_P15_1>=1))&&(i3.u4.pl_P26_1>=1))"))||("(((i2.u3.pl_P14_11>=1)&&(i3.u7.pl_P15_2>=1))&&(i3.u4.pl_P26_1>=1))")))))))
Formula 1 simplified : !("(((i2.u3.pl_P14_11>=1)&&(i3.u7.pl_P15_2>=1))&&(i3.u4.pl_P26_1>=1))" U FXG("(((i2.u3.pl_P14_11>=1)&&(i3.u7.pl_P15_2>=1))&&(i3.u4.pl_P26_1>=1))" | F"(((i3.u5.pl_P14_6>=1)&&(i7.u13.pl_P15_1>=1))&&(i3.u4.pl_P26_1>=1))"))
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
11 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.76152,34288,1,0,41302,490,1492,42895,421,976,94864
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Railroad-PT-010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(F("(((i3.u4.pl_P14_3>=1)&&(i9.u14.pl_P15_10>=1))&&(i3.u4.pl_P26_1>=1))")))))
Formula 2 simplified : !FGF"(((i3.u4.pl_P14_3>=1)&&(i9.u14.pl_P15_10>=1))&&(i3.u4.pl_P26_1>=1))"
3 unique states visited
3 strongly connected components in search stack
4 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.772542,34804,1,0,41985,490,1543,43817,422,976,96355
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Railroad-PT-010-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X(G((F(G("(((i2.u6.pl_P14_9>=1)&&(i4.u8.pl_P15_4>=1))&&(i3.u4.pl_P26_1>=1))")))&&((((!(F(!(F(X("(((i2.u6.pl_P14_9>=1)&&(i3.u4.pl_P26_1>=1))&&(i12.u24.pl_P61_1>=1))"))))))||("(i2.u3.pl_P14_11<1)"))||("(i10.u15.pl_P15_3<1)"))||("(i3.u4.pl_P26_1<1)"))))))
Formula 3 simplified : !XG(FG"(((i2.u6.pl_P14_9>=1)&&(i4.u8.pl_P15_4>=1))&&(i3.u4.pl_P26_1>=1))" & ("(i2.u3.pl_P14_11<1)" | "(i3.u4.pl_P26_1<1)" | "(i10.u15.pl_P15_3<1)" | !F!FX"(((i2.u6.pl_P14_9>=1)&&(i3.u4.pl_P26_1>=1))&&(i12.u24.pl_P61_1>=1))"))
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 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.866339,38672,1,0,48326,490,1675,50863,423,976,112752
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Railroad-PT-010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(G("(((u1.pl_P11_1>=1)&&(u1.pl_P20_3>=1))&&(u1.pl_P36_1>=1))"))))
Formula 4 simplified : !FG"(((u1.pl_P11_1>=1)&&(u1.pl_P20_3>=1))&&(u1.pl_P36_1>=1))"
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
26 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,1.12179,47648,1,0,68331,492,1712,71264,433,1019,150214
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Railroad-PT-010-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((((F("(((i3.u4.pl_P14_2>=1)&&(i8.u16.pl_P15_9>=1))&&(i3.u4.pl_P26_1>=1))"))||(G(X("(((i3.u4.pl_P14_4>=1)&&(i3.u4.pl_P26_1>=1))&&(i12.u24.pl_P61_1>=1))"))))||(X("(((i3.u5.pl_P14_6>=1)&&(i11.u9.pl_P15_5>=1))&&(i3.u4.pl_P26_1>=1))"))))
Formula 5 simplified : !(F"(((i3.u4.pl_P14_2>=1)&&(i8.u16.pl_P15_9>=1))&&(i3.u4.pl_P26_1>=1))" | GX"(((i3.u4.pl_P14_4>=1)&&(i3.u4.pl_P26_1>=1))&&(i12.u24.pl_P61_1>=1))" | X"(((i3.u5.pl_P14_6>=1)&&(i11.u9.pl_P15_5>=1))&&(i3.u4.pl_P26_1>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 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,1.1739,49432,1,0,72079,492,1776,76334,437,1019,160558
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Railroad-PT-010-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(X(G("((((i3.u4.pl_P14_4>=1)&&(i4.u8.pl_P15_4>=1))&&(i3.u4.pl_P26_1>=1))&&((i3.u5.pl_P14_7<1)||(i8.u16.pl_P15_9<1)))")))))
Formula 6 simplified : !XXG"((((i3.u4.pl_P14_4>=1)&&(i4.u8.pl_P15_4>=1))&&(i3.u4.pl_P26_1>=1))&&((i3.u5.pl_P14_7<1)||(i8.u16.pl_P15_9<1)))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,1.17902,49692,1,0,72131,492,1820,76398,437,1019,161003
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Railroad-PT-010-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((F("(((i3.u4.pl_P14_4>=1)&&(i11.u9.pl_P15_5>=1))&&(i3.u4.pl_P26_1>=1))"))U(("((i12.u24.pl_P31_1>=1)&&(u1.pl_P37_1>=1))")U("(((i3.u4.pl_P14_4>=1)&&(i11.u9.pl_P15_5>=1))&&(i3.u4.pl_P26_1>=1))")))U(X(X("(((i2.u6.pl_P14_9>=1)&&(i8.u16.pl_P15_9>=1))&&(i3.u4.pl_P26_1>=1))")))))
Formula 7 simplified : !((F"(((i3.u4.pl_P14_4>=1)&&(i11.u9.pl_P15_5>=1))&&(i3.u4.pl_P26_1>=1))" U ("((i12.u24.pl_P31_1>=1)&&(u1.pl_P37_1>=1))" U "(((i3.u4.pl_P14_4>=1)&&(i11.u9.pl_P15_5>=1))&&(i3.u4.pl_P26_1>=1))")) U XX"(((i2.u6.pl_P14_9>=1)&&(i8.u16.pl_P15_9>=1))&&(i3.u4.pl_P26_1>=1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
10 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,1.28589,53264,1,0,80756,492,1858,88068,437,1030,179440
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Railroad-PT-010-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((G(F(G(F(!(F((X("(((i2.u6.pl_P14_8>=1)&&(i4.u8.pl_P15_4>=1))&&(i3.u4.pl_P26_1>=1))"))U("(((i2.u6.pl_P14_8<1)||(i11.u9.pl_P15_5<1))||(i3.u4.pl_P26_1<1))")))))))))
Formula 8 simplified : !GFGF!F(X"(((i2.u6.pl_P14_8>=1)&&(i4.u8.pl_P15_4>=1))&&(i3.u4.pl_P26_1>=1))" U "(((i2.u6.pl_P14_8<1)||(i11.u9.pl_P15_5<1))||(i3.u4.pl_P26_1<1))")
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
30 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,1.57936,62224,1,0,100168,492,1878,112665,437,1032,202896
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Railroad-PT-010-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !((!(F(("(((i2.u6.pl_P14_9>=1)&&(i9.u14.pl_P15_10>=1))&&(i3.u4.pl_P26_1>=1))")U(X(G(X((!(F(!(X("((i7.u20.pl_P40_1>=1)&&(i12.u24.pl_P62_1>=1))")))))||(G("((i7.u20.pl_P40_1>=1)&&(i12.u24.pl_P62_1>=1))"))))))))))
Formula 9 simplified : F("(((i2.u6.pl_P14_9>=1)&&(i9.u14.pl_P15_10>=1))&&(i3.u4.pl_P26_1>=1))" U XGX(!F!X"((i7.u20.pl_P40_1>=1)&&(i12.u24.pl_P62_1>=1))" | G"((i7.u20.pl_P40_1>=1)&&(i12.u24.pl_P62_1>=1))"))
4 unique states visited
0 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
13 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,1.72039,65348,1,0,108149,492,1908,118096,437,1032,216469
no accepting run found
Formula 9 is TRUE no accepting run found.
FORMULA Railroad-PT-010-13 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !(((F(X((F(X("(((i3.u4.pl_P14_4>=1)&&(i7.u13.pl_P15_1>=1))&&(i3.u4.pl_P26_1>=1))")))||(X("(((i2.u6.pl_P14_9>=1)&&(i10.u15.pl_P15_3>=1))&&(i3.u4.pl_P26_1>=1))")))))||(G("(((i2.u3.pl_P14_11>=1)&&(i10.u15.pl_P15_3>=1))&&(i3.u4.pl_P26_1>=1))"))))
Formula 10 simplified : !(FX(FX"(((i3.u4.pl_P14_4>=1)&&(i7.u13.pl_P15_1>=1))&&(i3.u4.pl_P26_1>=1))" | X"(((i2.u6.pl_P14_9>=1)&&(i10.u15.pl_P15_3>=1))&&(i3.u4.pl_P26_1>=1))") | G"(((i2.u3.pl_P14_11>=1)&&(i10.u15.pl_P15_3>=1))&&(i3.u4.pl_P26_1>=1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
13 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,1.85408,71392,1,0,122279,493,1971,136682,437,1033,239968
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Railroad-PT-010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((X((X(!(X("((((i3.u4.pl_P14_3>=1)&&(i4.u8.pl_P15_4>=1))&&(i3.u4.pl_P26_1>=1))&&(((i3.u4.pl_P14_3<1)||(i7.u13.pl_P15_1<1))||(i3.u4.pl_P26_1<1)))"))))&&(F(X(F("(((i3.u4.pl_P14_5>=1)&&(i5.u10.pl_P15_6>=1))&&(i3.u4.pl_P26_1>=1))")))))))
Formula 11 simplified : !X(X!X"((((i3.u4.pl_P14_3>=1)&&(i4.u8.pl_P15_4>=1))&&(i3.u4.pl_P26_1>=1))&&(((i3.u4.pl_P14_3<1)||(i7.u13.pl_P15_1<1))||(i3.u4.pl_P26_1<1)))" & FXF"(((i3.u4.pl_P14_5>=1)&&(i5.u10.pl_P15_6>=1))&&(i3.u4.pl_P26_1>=1))")
6 unique states visited
4 strongly connected components in search stack
6 transitions explored
4 items max in DFS search stack
13 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,1.9774,77728,1,0,137225,493,2060,151984,441,1034,262672
an accepting run exists (use option '-e' to print it)
Formula 11 is FALSE accepting run found.
FORMULA Railroad-PT-010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an error :unknown
java.lang.RuntimeException: SMT solver raised an error :unknown
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeAblingForPredicate(NecessaryEnablingsolver.java:768)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:512)
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:831)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:73)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-21 14:53:21] [INFO ] Built C files in 2931ms conformant to PINS in folder :/home/mcc/execution
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 1590072802937

--------------------
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 -timeout 3600
+ 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 -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="Railroad-PT-010"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is Railroad-PT-010, 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 r141-smll-158961510800298"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Railroad-PT-010.tgz
mv Railroad-PT-010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;