Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r066-tajo-158922814200330.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 Dekker-PT-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814200330
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 27 14:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 14:36 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 14:36 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 27 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 27 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 27 14:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Apr 27 14:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 14:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 14:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 27 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 14:36 instance
-rw-r--r-- 1 mcc users 6 Apr 27 14:36 iscolored
-rw-r--r-- 1 mcc users 1.5M Apr 27 14:36 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 Dekker-PT-050-00
FORMULA_NAME Dekker-PT-050-01
FORMULA_NAME Dekker-PT-050-02
FORMULA_NAME Dekker-PT-050-03
FORMULA_NAME Dekker-PT-050-04
FORMULA_NAME Dekker-PT-050-05
FORMULA_NAME Dekker-PT-050-06
FORMULA_NAME Dekker-PT-050-07
FORMULA_NAME Dekker-PT-050-08
FORMULA_NAME Dekker-PT-050-09
FORMULA_NAME Dekker-PT-050-10
FORMULA_NAME Dekker-PT-050-11
FORMULA_NAME Dekker-PT-050-12
FORMULA_NAME Dekker-PT-050-13
FORMULA_NAME Dekker-PT-050-14
FORMULA_NAME Dekker-PT-050-15

=== Now, execution of the tool begins

BK_START 1590111016145

[2020-05-22 01:30: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-22 01:30:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 01:30:17] [INFO ] Load time of PNML (sax parser for PT used): 161 ms
[2020-05-22 01:30:17] [INFO ] Transformed 250 places.
[2020-05-22 01:30:17] [INFO ] Transformed 2600 transitions.
[2020-05-22 01:30:17] [INFO ] Found NUPN structural information;
[2020-05-22 01:30:17] [INFO ] Parsed PT model containing 250 places and 2600 transitions in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 35 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 750 ms. (steps per millisecond=133 ) properties seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-05-22 01:30:18] [INFO ] Flow matrix only has 200 transitions (discarded 2400 similar events)
// Phase 1: matrix 200 rows 250 cols
[2020-05-22 01:30:18] [INFO ] Computed 150 place invariants in 10 ms
[2020-05-22 01:30:19] [INFO ] [Real]Absence check using 100 positive place invariants in 63 ms returned sat
[2020-05-22 01:30:19] [INFO ] [Real]Absence check using 100 positive and 50 generalized place invariants in 18 ms returned sat
[2020-05-22 01:30:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:19] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2020-05-22 01:30:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2020-05-22 01:30:19] [INFO ] [Real]Added 50 Read/Feed constraints in 21 ms returned sat
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 6 places in 97 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 4 places in 45 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 4 places in 41 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 5 places in 33 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 6 places in 25 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 6 places in 28 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 4 places in 28 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 5 places in 28 ms
[2020-05-22 01:30:19] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 6 places in 21 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 15 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 30 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 29 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 5 places in 22 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 19 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 6 places in 17 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 20 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 6 places in 16 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-05-22 01:30:20] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 1249 ms
[2020-05-22 01:30:20] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 01:30:20] [INFO ] [Nat]Absence check using 100 positive place invariants in 36 ms returned sat
[2020-05-22 01:30:20] [INFO ] [Nat]Absence check using 100 positive and 50 generalized place invariants in 13 ms returned sat
[2020-05-22 01:30:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 01:30:20] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2020-05-22 01:30:20] [INFO ] [Nat]Added 50 Read/Feed constraints in 23 ms returned sat
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 6 places in 46 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 32 ms
[2020-05-22 01:30:20] [INFO ] Deduced a trap composed of 4 places in 27 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 24 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 5 places in 21 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 18 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 6 places in 15 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 23 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 5 places in 19 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 17 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 6 places in 14 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 12 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 26 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 22 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 5 places in 29 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 25 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 14 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 21 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 6 places in 18 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 6 places in 19 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:21] [INFO ] Deduced a trap composed of 4 places in 13 ms
[2020-05-22 01:30:21] [INFO ] Trap strengthening (SAT) tested/added 29/28 trap constraints in 824 ms
[2020-05-22 01:30:21] [INFO ] Computed and/alt/rep : 2550/7500/150 causal constraints in 50 ms.
[2020-05-22 01:30:22] [INFO ] Added : 51 causal constraints over 11 iterations in 489 ms. Result :sat
[2020-05-22 01:30:22] [INFO ] Flatten gal took : 385 ms
[2020-05-22 01:30:23] [INFO ] Flatten gal took : 207 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 01:30:23] [INFO ] Applying decomposition
[2020-05-22 01:30:23] [INFO ] Flatten gal took : 170 ms
[2020-05-22 01:30:23] [INFO ] Input system was already deterministic with 2600 transitions.
[2020-05-22 01:30:23] [INFO ] Too many transitions (2600) to apply POR reductions. Disabling POR matrices.
[2020-05-22 01:30:24] [INFO ] Built C files in 654ms 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]
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/graph11873345085170353673.txt, -o, /tmp/graph11873345085170353673.bin, -w, /tmp/graph11873345085170353673.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/graph11873345085170353673.bin, -l, -1, -v, -w, /tmp/graph11873345085170353673.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 01:30:24] [INFO ] Decomposing Gal with order
[2020-05-22 01:30:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 01:30:24] [INFO ] Removed a total of 8327 redundant transitions.
[2020-05-22 01:30:24] [INFO ] Flatten gal took : 296 ms
[2020-05-22 01:30:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 51 ms.
[2020-05-22 01:30:24] [INFO ] Time to serialize gal into /home/mcc/execution/LTLFireability.pnml.gal : 30 ms
[2020-05-22 01:30:24] [INFO ] Time to serialize properties into /home/mcc/execution/LTLFireability.ltl : 1 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 16 LTL properties
Checking formula 0 : !((X(("(((i13.u20.flag_1_20==1)&&(u30.flag_1_29==1))&&(u30.p1_29==1))")U(!(X(F("(((i13.u20.flag_1_20!=1)||(u30.flag_1_29!=1))||(u30.p1_29!=1))")))))))
Formula 0 simplified : !X("(((i13.u20.flag_1_20==1)&&(u30.flag_1_29==1))&&(u30.p1_29==1))" U !XF"(((i13.u20.flag_1_20!=1)||(u30.flag_1_29!=1))||(u30.p1_29!=1))")
built 1226 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
built 6 ordering constraints for composite.
Reverse transition relation is NOT exact ! Due to transitions u0.exit_0, u2.exit_2, u3.exit_3, u4.exit_4, u5.exit_5, u8.exit_8, u9.exit_9, u19.exit_19, u21.exit_21, u22.exit_22, u26.exit_25, u29.exit_28, u30.exit_29, u31.exit_30, u36.exit_35, u37.exit_37, u39.exit_40, u40.exit_42, u43.exit_44, u44.exit_45, u46.exit_48, u54.exit_15, u66.exit_36, u67.exit_38, u69.exit_41, u71.exit_47, u72.exit_49, i7.exit_10, i8.exit_11, i9.exit_13, i10.exit_14, i11.exit_18, i13.exit_20, i16.exit_24, i18.exit_26, i22.exit_34, i27.exit_43, i30.exit_46, i32.exit_1, i33.exit_6, i34.exit_7, i35.exit_12, i37.exit_16, i38.exit_17, i39.exit_23, i40.exit_27, i41.exit_31, i42.exit_32, i43.exit_33, i46.exit_39, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/2550/50/2600
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
167 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.78256,77756,1,0,161979,1361,22048,81057,389,2097,215269
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Dekker-PT-050-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((X(G(!(("(((i30.u45.flag_1_46==1)&&(u71.flag_1_47==1))&&(u71.p1_47==1))")U(F(!(X("(((i30.u45.flag_1_46==1)&&(u71.flag_1_47==1))&&(u71.p1_47==1))"))))))))||(F("(((u39.flag_1_40==1)&&(u46.flag_1_48==1))&&(u46.p1_48==1))"))))
Formula 1 simplified : !(XG!("(((i30.u45.flag_1_46==1)&&(u71.flag_1_47==1))&&(u71.p1_47==1))" U F!X"(((i30.u45.flag_1_46==1)&&(u71.flag_1_47==1))&&(u71.p1_47==1))") | F"(((u39.flag_1_40==1)&&(u46.flag_1_48==1))&&(u46.p1_48==1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
33 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,2.11898,84016,1,0,164783,1361,22713,86343,389,2097,222810
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Dekker-PT-050-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((F(G(F((X("(((i32.u1.flag_1_1==1)&&(i30.u45.flag_1_46==1))&&(i30.u70.p1_46==1))"))U((((G("(((i18.u27.flag_1_26==1)&&(i42.u33.flag_1_32==1))&&(i42.u63.p1_32==1))"))&&("(u22.flag_1_22==1)"))&&("(u39.flag_1_40==1)"))&&("(u22.p1_22==1)")))))))
Formula 2 simplified : !FGF(X"(((i32.u1.flag_1_1==1)&&(i30.u45.flag_1_46==1))&&(i30.u70.p1_46==1))" U ("(u22.flag_1_22==1)" & "(u22.p1_22==1)" & "(u39.flag_1_40==1)" & G"(((i18.u27.flag_1_26==1)&&(i42.u33.flag_1_32==1))&&(i42.u63.p1_32==1))"))
2 unique states visited
2 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
36 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,2.4864,90128,1,0,168549,1361,23827,91207,391,2097,230532
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Dekker-PT-050-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((((((F(G((F(X(F("(((u39.flag_1_40==1)&&(u72.flag_1_49==1))&&(u72.p1_49==1))"))))U(F("(((u39.flag_1_40==1)&&(u72.flag_1_49==1))&&(u72.p1_49==1))")))))&&("(u39.flag_1_40==1)"))&&("(u72.flag_1_49==1)"))&&("(u72.p1_49==1)"))U(X(X("(((u39.flag_1_40==1)&&(u72.flag_1_49==1))&&(u72.p1_49==1))")))))
Formula 3 simplified : !(("(u39.flag_1_40==1)" & "(u72.flag_1_49==1)" & "(u72.p1_49==1)" & FG(FXF"(((u39.flag_1_40==1)&&(u72.flag_1_49==1))&&(u72.p1_49==1))" U F"(((u39.flag_1_40==1)&&(u72.flag_1_49==1))&&(u72.p1_49==1))")) U XX"(((u39.flag_1_40==1)&&(u72.flag_1_49==1))&&(u72.p1_49==1))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,2.51062,90964,1,0,168884,1361,23848,91605,394,2097,231830
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Dekker-PT-050-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((F(!(X(F((((((!(("(((u4.flag_1_4==1)&&(u54.flag_1_15==1))&&(u4.p1_4==1))")U(X("(((u40.flag_1_42==1)&&(u44.flag_1_45==1))&&(u44.p1_45==1))"))))||("(u4.flag_1_4!=1)"))||("(u54.flag_1_15!=1)"))||("(u4.p1_4!=1)"))||("((u22.flag_0_22==1)&&(u22.p0_22==1))"))||("(((i39.u23.flag_1_23==1)&&(u71.flag_1_47==1))&&(u71.p1_47==1))")))))))
Formula 4 simplified : !F!XF("(((i39.u23.flag_1_23==1)&&(u71.flag_1_47==1))&&(u71.p1_47==1))" | "((u22.flag_0_22==1)&&(u22.p0_22==1))" | "(u4.flag_1_4!=1)" | "(u4.p1_4!=1)" | "(u54.flag_1_15!=1)" | !("(((u4.flag_1_4==1)&&(u54.flag_1_15==1))&&(u4.p1_4==1))" U X"(((u40.flag_1_42==1)&&(u44.flag_1_45==1))&&(u44.p1_45==1))"))
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
57 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,3.07919,98328,1,0,175660,1361,25102,101639,404,2097,247806
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Dekker-PT-050-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !((X((((X("((i30.u45.flag_0_46==1)&&(i30.u70.p0_46==1))"))U(G("(((u54.flag_1_15==1)&&(u46.flag_1_48==1))&&(u54.p1_15==1))")))&&((X("(((u2.flag_1_2==1)&&(i37.u55.flag_1_16==1))&&(i37.u16.p1_16==1))"))U("(((u54.flag_1_15==1)&&(u46.flag_1_48==1))&&(u54.p1_15==1))")))U(F(G("((i30.u45.flag_0_46==1)&&(i30.u70.p0_46==1))"))))))
Formula 5 simplified : !X(((X"((i30.u45.flag_0_46==1)&&(i30.u70.p0_46==1))" U G"(((u54.flag_1_15==1)&&(u46.flag_1_48==1))&&(u54.p1_15==1))") & (X"(((u2.flag_1_2==1)&&(i37.u55.flag_1_16==1))&&(i37.u16.p1_16==1))" U "(((u54.flag_1_15==1)&&(u46.flag_1_48==1))&&(u54.p1_15==1))")) U FG"((i30.u45.flag_0_46==1)&&(i30.u70.p0_46==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,3.379,105720,1,0,188715,1361,25383,119426,404,2097,278638
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Dekker-PT-050-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((G((F(!(F("(((u19.flag_1_19!=1)||(u37.flag_1_37!=1))||(u37.p1_37!=1))"))))||(F(G((((F("((i35.u12.flag_1_12==1)&&(i35.u52.p3_12==1))"))&&("(u19.flag_1_19==1)"))&&("(u37.flag_1_37==1)"))&&("(u37.p1_37==1)")))))))
Formula 6 simplified : !G(F!F"(((u19.flag_1_19!=1)||(u37.flag_1_37!=1))||(u37.p1_37!=1))" | FG("(u19.flag_1_19==1)" & "(u37.flag_1_37==1)" & "(u37.p1_37==1)" & F"((i35.u12.flag_1_12==1)&&(i35.u52.p3_12==1))"))
3 unique states visited
2 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
28 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,3.6622,109416,1,0,191027,1361,25962,122490,404,2097,284376
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA Dekker-PT-050-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 7 : !((((X((F("(((u29.flag_1_28==1)&&(u43.flag_1_44==1))&&(u29.p1_28==1))"))U((G("(((i41.u32.flag_1_31==1)&&(u72.flag_1_49==1))&&(i41.u62.p1_31==1))"))||("(((i41.u32.flag_1_31==1)&&(u72.flag_1_49==1))&&(i41.u62.p1_31==1))"))))||(G("(((u31.flag_1_30==1)&&(u46.flag_1_48==1))&&(u46.p1_48==1))")))||(X("(((u29.flag_1_28==1)&&(u43.flag_1_44==1))&&(u29.p1_28==1))"))))
Formula 7 simplified : !(X(F"(((u29.flag_1_28==1)&&(u43.flag_1_44==1))&&(u29.p1_28==1))" U ("(((i41.u32.flag_1_31==1)&&(u72.flag_1_49==1))&&(i41.u62.p1_31==1))" | G"(((i41.u32.flag_1_31==1)&&(u72.flag_1_49==1))&&(i41.u62.p1_31==1))")) | G"(((u31.flag_1_30==1)&&(u46.flag_1_48==1))&&(u46.p1_48==1))" | X"(((u29.flag_1_28==1)&&(u43.flag_1_44==1))&&(u29.p1_28==1))")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
50 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,4.15423,112584,1,0,193206,1361,26441,125897,404,2097,289380
an accepting run exists (use option '-e' to print it)
Formula 7 is FALSE accepting run found.
FORMULA Dekker-PT-050-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 8 : !((X(G("((((i34.u7.flag_1_7==1)&&(i35.u12.flag_1_12==1))&&(i34.u49.p1_7==1))||(((i32.u1.flag_1_1==1)&&(i16.u25.flag_1_24==1))&&(i16.u24.p1_24==1)))"))))
Formula 8 simplified : !XG"((((i34.u7.flag_1_7==1)&&(i35.u12.flag_1_12==1))&&(i34.u49.p1_7==1))||(((i32.u1.flag_1_1==1)&&(i16.u25.flag_1_24==1))&&(i16.u24.p1_24==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,4.16962,113640,1,0,193208,1361,26488,125898,404,2097,289562
an accepting run exists (use option '-e' to print it)
Formula 8 is FALSE accepting run found.
FORMULA Dekker-PT-050-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 9 : !(((G((((X("(((i10.u15.flag_1_14!=1)||(u54.flag_1_15!=1))||(u54.p1_15!=1))"))||("(i16.u25.flag_1_24!=1)"))||("(i41.u32.flag_1_31!=1)"))||("(i41.u62.p1_31!=1)")))&&(G(X("(((i13.u20.flag_1_20==1)&&(u21.flag_1_21==1))&&(i13.u58.p1_20==1))")))))
Formula 9 simplified : !(G("(i16.u25.flag_1_24!=1)" | "(i41.u32.flag_1_31!=1)" | "(i41.u62.p1_31!=1)" | X"(((i10.u15.flag_1_14!=1)||(u54.flag_1_15!=1))||(u54.p1_15!=1))") & GX"(((i13.u20.flag_1_20==1)&&(u21.flag_1_21==1))&&(i13.u58.p1_20==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,4.18973,113904,1,0,193208,1361,26574,125898,404,2097,289889
an accepting run exists (use option '-e' to print it)
Formula 9 is FALSE accepting run found.
FORMULA Dekker-PT-050-09 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 10 : !((X(X(X(!(G("(((u8.flag_1_8==1)&&(i41.u32.flag_1_31==1))&&(i41.u62.p1_31==1))")))))))
Formula 10 simplified : !XXX!G"(((u8.flag_1_8==1)&&(i41.u32.flag_1_31==1))&&(i41.u62.p1_31==1))"
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
14 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,4.33352,116544,1,0,194596,1361,27226,128093,404,2097,293606
an accepting run exists (use option '-e' to print it)
Formula 10 is FALSE accepting run found.
FORMULA Dekker-PT-050-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 11 : !((((!(X("(((u21.flag_1_21==1)&&(u26.flag_1_25==1))&&(u21.p1_21==1))")))||(!(X("(((u8.flag_1_8==1)&&(u21.flag_1_21==1))&&(u21.p1_21==1))"))))||(X(X(X((F("(((u8.flag_1_8==1)&&(u21.flag_1_21==1))&&(u21.p1_21==1))"))U("(((i32.u1.flag_1_1==1)&&(i40.u28.flag_1_27==1))&&(i40.u61.p1_27==1))")))))))
Formula 11 simplified : !(!X"(((u21.flag_1_21==1)&&(u26.flag_1_25==1))&&(u21.p1_21==1))" | !X"(((u8.flag_1_8==1)&&(u21.flag_1_21==1))&&(u21.p1_21==1))" | XXX(F"(((u8.flag_1_8==1)&&(u21.flag_1_21==1))&&(u21.p1_21==1))" U "(((i32.u1.flag_1_1==1)&&(i40.u28.flag_1_27==1))&&(i40.u61.p1_27==1))"))
2 unique states visited
0 strongly connected components in search stack
1 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,4.33672,116544,1,0,194596,1361,27249,128093,406,2097,293676
no accepting run found
Formula 11 is TRUE no accepting run found.
FORMULA Dekker-PT-050-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 12 : !((!((X("(((i37.u55.flag_1_16==1)&&(u43.flag_1_44==1))&&(u43.p1_44==1))"))U(G(((G(X("(((u54.flag_1_15!=1)||(i22.u35.flag_1_34!=1))||(u54.p1_15!=1))")))||("(((i37.u55.flag_1_16==1)&&(u43.flag_1_44==1))&&(u43.p1_44==1))"))U(X("(((u3.flag_1_3==1)&&(i10.u15.flag_1_14==1))&&(u3.p1_3==1))")))))))
Formula 12 simplified : X"(((i37.u55.flag_1_16==1)&&(u43.flag_1_44==1))&&(u43.p1_44==1))" U G(("(((i37.u55.flag_1_16==1)&&(u43.flag_1_44==1))&&(u43.p1_44==1))" | GX"(((u54.flag_1_15!=1)||(i22.u35.flag_1_34!=1))||(u54.p1_15!=1))") U X"(((u3.flag_1_3==1)&&(i10.u15.flag_1_14==1))&&(u3.p1_3==1))")
4 unique states visited
2 strongly connected components in search stack
5 transitions explored
3 items max in DFS search stack
33 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,4.67593,124728,1,0,202783,1361,28564,139509,406,2097,312652
an accepting run exists (use option '-e' to print it)
Formula 12 is FALSE accepting run found.
FORMULA Dekker-PT-050-12 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 13 : !((G((F(G((X("(((i8.u51.flag_1_11!=1)||(u29.flag_1_28!=1))||(u29.p1_28!=1))"))||(X("(((i40.u28.flag_1_27==1)&&(i22.u35.flag_1_34==1))&&(i22.u65.p1_34==1))")))))U(F("(((i32.u1.flag_1_1==1)&&(i42.u33.flag_1_32==1))&&(i42.u63.p1_32==1))")))))
Formula 13 simplified : !G(FG(X"(((i8.u51.flag_1_11!=1)||(u29.flag_1_28!=1))||(u29.p1_28!=1))" | X"(((i40.u28.flag_1_27==1)&&(i22.u35.flag_1_34==1))&&(i22.u65.p1_34==1))") U F"(((i32.u1.flag_1_1==1)&&(i42.u33.flag_1_32==1))&&(i42.u63.p1_32==1))")
3 unique states visited
3 strongly connected components in search stack
4 transitions explored
3 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,4.77507,127632,1,0,203794,1361,28964,140960,406,2097,314729
an accepting run exists (use option '-e' to print it)
Formula 13 is FALSE accepting run found.
FORMULA Dekker-PT-050-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 14 : !(((G("((u66.flag_0_36==1)&&(u66.p0_36==1))"))||((X(F("(((u22.flag_1_22==1)&&(u40.flag_1_42==1))&&(u40.p1_42==1))")))&&(X("((u66.flag_0_36==1)&&(u66.p0_36==1))")))))
Formula 14 simplified : !(G"((u66.flag_0_36==1)&&(u66.p0_36==1))" | (XF"(((u22.flag_1_22==1)&&(u40.flag_1_42==1))&&(u40.p1_42==1))" & X"((u66.flag_0_36==1)&&(u66.p0_36==1))"))
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
15 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,4.9281,130272,1,0,205931,1361,29446,143777,406,2097,319849
an accepting run exists (use option '-e' to print it)
Formula 14 is FALSE accepting run found.
FORMULA Dekker-PT-050-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 15 : !(((F("(((u8.flag_1_8==1)&&(i22.u35.flag_1_34==1))&&(u8.p1_8==1))"))U(F(!(X("(((u9.flag_1_9==1)&&(i42.u33.flag_1_32==1))&&(i42.u63.p1_32==1))"))))))
Formula 15 simplified : !(F"(((u8.flag_1_8==1)&&(i22.u35.flag_1_34==1))&&(u8.p1_8==1))" U F!X"(((u9.flag_1_9==1)&&(i42.u33.flag_1_32==1))&&(i42.u63.p1_32==1))")
2 unique states visited
0 strongly connected components in search stack
1 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,4.94602,131328,1,0,205931,1361,29485,143777,406,2097,319910
no accepting run found
Formula 15 is TRUE no accepting run found.
FORMULA Dekker-PT-050-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.

BK_STOP 1590111030518

--------------------
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="Dekker-PT-050"
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 Dekker-PT-050, 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 r066-tajo-158922814200330"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-050.tgz
mv Dekker-PT-050 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 ;