About the Execution of ITS-Tools for Philosophers-PT-000050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5684.340 | 3600000.00 | 4294481.00 | 403.30 | FFFFFF?????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2019-input.r107-oct2-155272231600816.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................
=====================================================================
Generated by BenchKit 2-3954
Executing tool itstools
Input is Philosophers-PT-000050, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r107-oct2-155272231600816
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 23K Feb 12 04:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 12 04:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 8 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 8 03:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 9.9K Feb 5 00:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Feb 5 00:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 4 22:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 4 22:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Feb 4 08:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 4 08:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 1 02:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 1 02:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 6.1K Feb 4 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K Feb 4 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 205K 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 Philosophers-PT-000050-LTLCardinality-00
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-01
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-02
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-03
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-04
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-05
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-06
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-07
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-08
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-09
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-10
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-11
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-12
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-13
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-14
FORMULA_NAME Philosophers-PT-000050-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552955947645
Working with output stream class java.io.PrintStream
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.201903111103/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /home/mcc/execution/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.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.201903111103/bin/its-ltl-linux64 --gc-threshold 2000000 -i /home/mcc/execution/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock
Read 16 LTL properties
Checking formula 0 : !((X(X(G(X("((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)>=1)"))))))
Formula 0 simplified : !XXGX"((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)>=1)"
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 250 rows 250 cols
invariant :Eat_24 + Think_24 + Catch2_24 + Catch1_24 = 1
invariant :Fork_1 + -1'Think_1 + -1'Think_2 + -1'Catch2_2 + -1'Catch1_1 = -1
invariant :Fork_27 + -1'Think_27 + -1'Think_28 + -1'Catch2_28 + -1'Catch1_27 = -1
invariant :Eat_37 + Think_37 + Catch2_37 + Catch1_37 = 1
invariant :Fork_28 + -1'Think_29 + -1'Think_28 + -1'Catch2_29 + -1'Catch1_28 = -1
invariant :Eat_9 + Think_9 + Catch2_9 + Catch1_9 = 1
invariant :Fork_20 + -1'Think_21 + -1'Think_20 + -1'Catch2_21 + -1'Catch1_20 = -1
invariant :Eat_20 + Think_20 + Catch2_20 + Catch1_20 = 1
invariant :Eat_46 + Think_46 + Catch2_46 + Catch1_46 = 1
invariant :Fork_19 + -1'Think_20 + -1'Think_19 + -1'Catch2_20 + -1'Catch1_19 = -1
invariant :Fork_48 + -1'Think_48 + -1'Think_49 + -1'Catch2_49 + -1'Catch1_48 = -1
invariant :Fork_30 + -1'Think_31 + -1'Think_30 + -1'Catch2_31 + -1'Catch1_30 = -1
invariant :Fork_37 + -1'Think_37 + -1'Think_38 + -1'Catch2_38 + -1'Catch1_37 = -1
invariant :Fork_18 + -1'Think_19 + -1'Think_18 + -1'Catch2_19 + -1'Catch1_18 = -1
invariant :Eat_45 + Think_45 + Catch2_45 + Catch1_45 = 1
invariant :Fork_50 + -1'Think_1 + -1'Think_50 + -1'Catch2_1 + -1'Catch1_50 = -1
invariant :Fork_16 + -1'Think_17 + -1'Think_16 + -1'Catch2_17 + -1'Catch1_16 = -1
invariant :Eat_48 + Think_48 + Catch2_48 + Catch1_48 = 1
invariant :Fork_38 + -1'Think_39 + -1'Think_38 + -1'Catch2_39 + -1'Catch1_38 = -1
invariant :Eat_32 + Think_32 + Catch2_32 + Catch1_32 = 1
invariant :Fork_25 + -1'Think_25 + -1'Think_26 + -1'Catch2_26 + -1'Catch1_25 = -1
invariant :Eat_34 + Think_34 + Catch2_34 + Catch1_34 = 1
invariant :Fork_47 + -1'Think_47 + -1'Think_48 + -1'Catch2_48 + -1'Catch1_47 = -1
invariant :Fork_6 + -1'Think_6 + -1'Think_7 + -1'Catch2_7 + -1'Catch1_6 = -1
invariant :Fork_8 + -1'Think_8 + -1'Think_9 + -1'Catch2_9 + -1'Catch1_8 = -1
invariant :Eat_36 + Think_36 + Catch2_36 + Catch1_36 = 1
invariant :Fork_4 + -1'Think_4 + -1'Think_5 + -1'Catch2_5 + -1'Catch1_4 = -1
invariant :Eat_5 + Think_5 + Catch2_5 + Catch1_5 = 1
invariant :Eat_27 + Think_27 + Catch2_27 + Catch1_27 = 1
invariant :Eat_38 + Think_38 + Catch2_38 + Catch1_38 = 1
invariant :Fork_49 + -1'Think_50 + -1'Think_49 + -1'Catch2_50 + -1'Catch1_49 = -1
invariant :Eat_13 + Think_13 + Catch2_13 + Catch1_13 = 1
invariant :Fork_5 + -1'Think_6 + -1'Think_5 + -1'Catch2_6 + -1'Catch1_5 = -1
invariant :Eat_30 + Think_30 + Catch2_30 + Catch1_30 = 1
invariant :Fork_21 + -1'Think_22 + -1'Think_21 + -1'Catch2_22 + -1'Catch1_21 = -1
invariant :Eat_14 + Think_14 + Catch2_14 + Catch1_14 = 1
invariant :Fork_39 + -1'Think_39 + -1'Think_40 + -1'Catch2_40 + -1'Catch1_39 = -1
invariant :Fork_11 + -1'Think_12 + -1'Think_11 + -1'Catch2_12 + -1'Catch1_11 = -1
invariant :Eat_26 + Think_26 + Catch2_26 + Catch1_26 = 1
invariant :Eat_49 + Think_49 + Catch2_49 + Catch1_49 = 1
invariant :Fork_26 + -1'Think_27 + -1'Think_26 + -1'Catch2_27 + -1'Catch1_26 = -1
invariant :Fork_10 + -1'Think_11 + -1'Think_10 + -1'Catch2_11 + -1'Catch1_10 = -1
invariant :Eat_25 + Think_25 + Catch2_25 + Catch1_25 = 1
invariant :Eat_44 + Think_44 + Catch2_44 + Catch1_44 = 1
invariant :Fork_40 + -1'Think_41 + -1'Think_40 + -1'Catch2_41 + -1'Catch1_40 = -1
invariant :Fork_46 + -1'Think_46 + -1'Think_47 + -1'Catch2_47 + -1'Catch1_46 = -1
invariant :Eat_12 + Think_12 + Catch2_12 + Catch1_12 = 1
invariant :Fork_36 + -1'Think_37 + -1'Think_36 + -1'Catch2_37 + -1'Catch1_36 = -1
invariant :Fork_15 + -1'Think_16 + -1'Think_15 + -1'Catch2_16 + -1'Catch1_15 = -1
invariant :Eat_28 + Think_28 + Catch2_28 + Catch1_28 = 1
invariant :Fork_12 + -1'Think_13 + -1'Think_12 + -1'Catch2_13 + -1'Catch1_12 = -1
invariant :Eat_33 + Think_33 + Catch2_33 + Catch1_33 = 1
invariant :Eat_43 + Think_43 + Catch2_43 + Catch1_43 = 1
invariant :Fork_35 + -1'Think_35 + -1'Think_36 + -1'Catch2_36 + -1'Catch1_35 = -1
invariant :Eat_50 + Think_50 + Catch2_50 + Catch1_50 = 1
invariant :Fork_32 + -1'Think_33 + -1'Think_32 + -1'Catch2_33 + -1'Catch1_32 = -1
invariant :Eat_40 + Think_40 + Catch2_40 + Catch1_40 = 1
invariant :Fork_45 + -1'Think_45 + -1'Think_46 + -1'Catch2_46 + -1'Catch1_45 = -1
invariant :Eat_18 + Think_18 + Catch2_18 + Catch1_18 = 1
invariant :Fork_17 + -1'Think_17 + -1'Think_18 + -1'Catch2_18 + -1'Catch1_17 = -1
invariant :Fork_29 + -1'Think_29 + -1'Think_30 + -1'Catch2_30 + -1'Catch1_29 = -1
invariant :Fork_9 + -1'Think_9 + -1'Think_10 + -1'Catch2_10 + -1'Catch1_9 = -1
invariant :Fork_43 + -1'Think_43 + -1'Think_44 + -1'Catch2_44 + -1'Catch1_43 = -1
invariant :Eat_3 + Think_3 + Catch2_3 + Catch1_3 = 1
invariant :Eat_41 + Think_41 + Catch2_41 + Catch1_41 = 1
invariant :Eat_17 + Think_17 + Catch2_17 + Catch1_17 = 1
invariant :Eat_29 + Think_29 + Catch2_29 + Catch1_29 = 1
invariant :Eat_47 + Think_47 + Catch2_47 + Catch1_47 = 1
invariant :Fork_14 + -1'Think_15 + -1'Think_14 + -1'Catch2_15 + -1'Catch1_14 = -1
invariant :Fork_23 + -1'Think_24 + -1'Think_23 + -1'Catch2_24 + -1'Catch1_23 = -1
invariant :Eat_22 + Think_22 + Catch2_22 + Catch1_22 = 1
invariant :Eat_21 + Think_21 + Catch2_21 + Catch1_21 = 1
invariant :Eat_2 + Think_2 + Catch2_2 + Catch1_2 = 1
invariant :Eat_39 + Think_39 + Catch2_39 + Catch1_39 = 1
invariant :Eat_10 + Think_10 + Catch2_10 + Catch1_10 = 1
invariant :Fork_7 + -1'Think_8 + -1'Think_7 + -1'Catch2_8 + -1'Catch1_7 = -1
invariant :Fork_22 + -1'Think_23 + -1'Think_22 + -1'Catch2_23 + -1'Catch1_22 = -1
invariant :Eat_15 + Think_15 + Catch2_15 + Catch1_15 = 1
invariant :Fork_42 + -1'Think_42 + -1'Think_43 + -1'Catch2_43 + -1'Catch1_42 = -1
invariant :Fork_44 + -1'Think_44 + -1'Think_45 + -1'Catch2_45 + -1'Catch1_44 = -1
invariant :Eat_6 + Think_6 + Catch2_6 + Catch1_6 = 1
invariant :Eat_31 + Think_31 + Catch2_31 + Catch1_31 = 1
invariant :Fork_13 + -1'Think_14 + -1'Think_13 + -1'Catch2_14 + -1'Catch1_13 = -1
invariant :Eat_11 + Think_11 + Catch2_11 + Catch1_11 = 1
invariant :Eat_35 + Think_35 + Catch2_35 + Catch1_35 = 1
invariant :Eat_16 + Think_16 + Catch2_16 + Catch1_16 = 1
invariant :Fork_33 + -1'Think_34 + -1'Think_33 + -1'Catch2_34 + -1'Catch1_33 = -1
invariant :Eat_42 + Think_42 + Catch2_42 + Catch1_42 = 1
invariant :Eat_23 + Think_23 + Catch2_23 + Catch1_23 = 1
invariant :Fork_41 + -1'Think_41 + -1'Think_42 + -1'Catch2_42 + -1'Catch1_41 = -1
invariant :Eat_1 + Think_1 + Catch2_1 + Catch1_1 = 1
invariant :Eat_7 + Think_7 + Catch2_7 + Catch1_7 = 1
invariant :Fork_3 + -1'Think_4 + -1'Think_3 + -1'Catch2_4 + -1'Catch1_3 = -1
invariant :Fork_24 + -1'Think_25 + -1'Think_24 + -1'Catch2_25 + -1'Catch1_24 = -1
invariant :Fork_2 + -1'Think_2 + -1'Think_3 + -1'Catch2_3 + -1'Catch1_2 = -1
invariant :Eat_4 + Think_4 + Catch2_4 + Catch1_4 = 1
invariant :Eat_8 + Think_8 + Catch2_8 + Catch1_8 = 1
invariant :Fork_34 + -1'Think_35 + -1'Think_34 + -1'Catch2_35 + -1'Catch1_34 = -1
invariant :Fork_31 + -1'Think_31 + -1'Think_32 + -1'Catch2_32 + -1'Catch1_31 = -1
invariant :Eat_19 + Think_19 + Catch2_19 + Catch1_19 = 1
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
1931 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,19.3587,247064,1,0,155,549214,23,105,25852,720020,271
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 1 : !((F("((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)<=(((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42))")))
Formula 1 simplified : !F"((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)<=(((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42))"
Computing Next relation with stutter on 2 deadlock states
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]
Compilation finished in 3666 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 74 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>((LTLAP1==true)), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 2060 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, --ltl, <>([]([]([]((LTLAP2==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 1272 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>([](X((LTLAP3==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 842 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-03 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, <>(X(<>([]((LTLAP4==true))))), --buchi-type=spotba], workingDir=/home/mcc/execution]
LTSmin run took 20388 ms.
FORMULA Philosophers-PT-000050-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X([](X((LTLAP5==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X([](X((LTLAP5==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
255
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
84920 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,868.561,2461680,1,0,187,1.27282e+06,14,160,792999,2.29934e+06,42
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 2 : !((F(G(G(G("((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)>=3)"))))))
Formula 2 simplified : !FG"((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)>=3)"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
6217 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,930.737,2493220,1,0,451,3.1816e+06,28,355,813352,7.74316e+06,875
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 3 : !((F(G(X("((((((((((((((((((((((((((((((((((((((((((((((((((Eat_1+Eat_2)+Eat_3)+Eat_4)+Eat_5)+Eat_6)+Eat_7)+Eat_8)+Eat_9)+Eat_10)+Eat_11)+Eat_12)+Eat_13)+Eat_15)+Eat_14)+Eat_17)+Eat_16)+Eat_19)+Eat_18)+Eat_21)+Eat_20)+Eat_23)+Eat_22)+Eat_25)+Eat_24)+Eat_27)+Eat_26)+Eat_29)+Eat_28)+Eat_32)+Eat_33)+Eat_30)+Eat_31)+Eat_36)+Eat_37)+Eat_34)+Eat_35)+Eat_40)+Eat_41)+Eat_38)+Eat_39)+Eat_44)+Eat_45)+Eat_42)+Eat_43)+Eat_49)+Eat_48)+Eat_47)+Eat_46)+Eat_50)>=3)")))))
Formula 3 simplified : !FGX"((((((((((((((((((((((((((((((((((((((((((((((((((Eat_1+Eat_2)+Eat_3)+Eat_4)+Eat_5)+Eat_6)+Eat_7)+Eat_8)+Eat_9)+Eat_10)+Eat_11)+Eat_12)+Eat_13)+Eat_15)+Eat_14)+Eat_17)+Eat_16)+Eat_19)+Eat_18)+Eat_21)+Eat_20)+Eat_23)+Eat_22)+Eat_25)+Eat_24)+Eat_27)+Eat_26)+Eat_29)+Eat_28)+Eat_32)+Eat_33)+Eat_30)+Eat_31)+Eat_36)+Eat_37)+Eat_34)+Eat_35)+Eat_40)+Eat_41)+Eat_38)+Eat_39)+Eat_44)+Eat_45)+Eat_42)+Eat_43)+Eat_49)+Eat_48)+Eat_47)+Eat_46)+Eat_50)>=3)"
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
1 strongly connected components in search stack
3 transitions explored
2 items max in DFS search stack
29 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,931.027,2493220,1,0,453,3.2006e+06,38,360,814698,7.774e+06,895
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 4 : !((F(X(F(G("((((((((((((((((((((((((((((((((((((((((((((((((((Catch1_3+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_1)+Catch1_18)+Catch1_19)+Catch1_20)+Catch1_21)+Catch1_14)+Catch1_15)+Catch1_16)+Catch1_17)+Catch1_10)+Catch1_11)+Catch1_12)+Catch1_13)+Catch1_6)+Catch1_7)+Catch1_8)+Catch1_9)+Catch1_37)+Catch1_36)+Catch1_35)+Catch1_34)+Catch1_33)+Catch1_32)+Catch1_31)+Catch1_30)+Catch1_29)+Catch1_28)+Catch1_27)+Catch1_26)+Catch1_25)+Catch1_24)+Catch1_23)+Catch1_22)+Catch1_50)+Catch1_48)+Catch1_49)+Catch1_46)+Catch1_47)+Catch1_44)+Catch1_45)+Catch1_42)+Catch1_43)+Catch1_40)+Catch1_41)+Catch1_38)+Catch1_39)>=2)"))))))
Formula 4 simplified : !FXFG"((((((((((((((((((((((((((((((((((((((((((((((((((Catch1_3+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_1)+Catch1_18)+Catch1_19)+Catch1_20)+Catch1_21)+Catch1_14)+Catch1_15)+Catch1_16)+Catch1_17)+Catch1_10)+Catch1_11)+Catch1_12)+Catch1_13)+Catch1_6)+Catch1_7)+Catch1_8)+Catch1_9)+Catch1_37)+Catch1_36)+Catch1_35)+Catch1_34)+Catch1_33)+Catch1_32)+Catch1_31)+Catch1_30)+Catch1_29)+Catch1_28)+Catch1_27)+Catch1_26)+Catch1_25)+Catch1_24)+Catch1_23)+Catch1_22)+Catch1_50)+Catch1_48)+Catch1_49)+Catch1_46)+Catch1_47)+Catch1_44)+Catch1_45)+Catch1_42)+Catch1_43)+Catch1_40)+Catch1_41)+Catch1_38)+Catch1_39)>=2)"
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
3 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
4276 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,973.784,2659864,1,0,884,4.7352e+06,51,703,832548,1.16163e+07,1730
an accepting run exists (use option '-e' to print it)
Formula 4 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 5 : !((X(G(X("((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)>=1)")))))
Formula 5 simplified : !XGX"((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)>=1)"
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
2520 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,998.991,2711852,1,0,909,4.8348e+06,19,749,12927,1.17654e+07,145
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLCardinality-05 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Checking formula 6 : !(((G(G("((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)<=(((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49))")))U(F(G("((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)<=(((((((((((((((((((((((((((((((((((((((((((((((((Catch1_3+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_1)+Catch1_18)+Catch1_19)+Catch1_20)+Catch1_21)+Catch1_14)+Catch1_15)+Catch1_16)+Catch1_17)+Catch1_10)+Catch1_11)+Catch1_12)+Catch1_13)+Catch1_6)+Catch1_7)+Catch1_8)+Catch1_9)+Catch1_37)+Catch1_36)+Catch1_35)+Catch1_34)+Catch1_33)+Catch1_32)+Catch1_31)+Catch1_30)+Catch1_29)+Catch1_28)+Catch1_27)+Catch1_26)+Catch1_25)+Catch1_24)+Catch1_23)+Catch1_22)+Catch1_50)+Catch1_48)+Catch1_49)+Catch1_46)+Catch1_47)+Catch1_44)+Catch1_45)+Catch1_42)+Catch1_43)+Catch1_40)+Catch1_41)+Catch1_38)+Catch1_39))")))))
Formula 6 simplified : !(G"((((((((((((((((((((((((((((((((((((((((((((((((((Catch2_1+Catch2_2)+Catch2_3)+Catch2_4)+Catch2_5)+Catch2_6)+Catch2_7)+Catch2_19)+Catch2_18)+Catch2_17)+Catch2_16)+Catch2_23)+Catch2_22)+Catch2_21)+Catch2_20)+Catch2_11)+Catch2_10)+Catch2_9)+Catch2_8)+Catch2_15)+Catch2_14)+Catch2_13)+Catch2_12)+Catch2_34)+Catch2_35)+Catch2_32)+Catch2_33)+Catch2_38)+Catch2_39)+Catch2_36)+Catch2_37)+Catch2_26)+Catch2_27)+Catch2_24)+Catch2_25)+Catch2_30)+Catch2_31)+Catch2_28)+Catch2_29)+Catch2_49)+Catch2_48)+Catch2_50)+Catch2_45)+Catch2_44)+Catch2_47)+Catch2_46)+Catch2_41)+Catch2_40)+Catch2_43)+Catch2_42)<=(((((((((((((((((((((((((((((((((((((((((((((((((Think_1+Think_8)+Think_9)+Think_6)+Think_7)+Think_4)+Think_5)+Think_2)+Think_3)+Think_17)+Think_16)+Think_15)+Think_14)+Think_13)+Think_12)+Think_11)+Think_10)+Think_25)+Think_24)+Think_23)+Think_22)+Think_21)+Think_20)+Think_19)+Think_18)+Think_35)+Think_34)+Think_37)+Think_36)+Think_39)+Think_38)+Think_41)+Think_40)+Think_27)+Think_26)+Think_29)+Think_28)+Think_31)+Think_30)+Think_33)+Think_32)+Think_50)+Think_42)+Think_43)+Think_44)+Think_45)+Think_46)+Think_47)+Think_48)+Think_49))" U FG"((((((((((((((((((((((((((((((((((((((((((((((((((Fork_3+Fork_2)+Fork_1)+Fork_7)+Fork_6)+Fork_5)+Fork_4)+Fork_11)+Fork_10)+Fork_9)+Fork_8)+Fork_16)+Fork_17)+Fork_18)+Fork_19)+Fork_12)+Fork_13)+Fork_14)+Fork_15)+Fork_24)+Fork_25)+Fork_26)+Fork_27)+Fork_20)+Fork_21)+Fork_22)+Fork_23)+Fork_33)+Fork_32)+Fork_35)+Fork_34)+Fork_29)+Fork_28)+Fork_31)+Fork_30)+Fork_41)+Fork_40)+Fork_43)+Fork_42)+Fork_37)+Fork_36)+Fork_39)+Fork_38)+Fork_50)+Fork_48)+Fork_49)+Fork_46)+Fork_47)+Fork_44)+Fork_45)<=(((((((((((((((((((((((((((((((((((((((((((((((((Catch1_3+Catch1_2)+Catch1_5)+Catch1_4)+Catch1_1)+Catch1_18)+Catch1_19)+Catch1_20)+Catch1_21)+Catch1_14)+Catch1_15)+Catch1_16)+Catch1_17)+Catch1_10)+Catch1_11)+Catch1_12)+Catch1_13)+Catch1_6)+Catch1_7)+Catch1_8)+Catch1_9)+Catch1_37)+Catch1_36)+Catch1_35)+Catch1_34)+Catch1_33)+Catch1_32)+Catch1_31)+Catch1_30)+Catch1_29)+Catch1_28)+Catch1_27)+Catch1_26)+Catch1_25)+Catch1_24)+Catch1_23)+Catch1_22)+Catch1_50)+Catch1_48)+Catch1_49)+Catch1_46)+Catch1_47)+Catch1_44)+Catch1_45)+Catch1_42)+Catch1_43)+Catch1_40)+Catch1_41)+Catch1_38)+Catch1_39))")
Computing Next relation with stutter on 2 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -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 LTLCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -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 19, 2019 12:39:09 AM fr.lip6.move.gal.application.Application start
INFO: Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -smt]
Mar 19, 2019 12:39:09 AM fr.lip6.move.gal.application.MccTranslator transformPNML
INFO: Parsing pnml file : /home/mcc/execution/model.pnml
Mar 19, 2019 12:39:09 AM fr.lip6.move.gal.nupn.PTNetReader loadFromXML
INFO: Load time of PNML (sax parser for PT used): 79 ms
Mar 19, 2019 12:39:09 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 places.
Mar 19, 2019 12:39:10 AM fr.lip6.move.gal.pnml.togal.PTGALTransformer handlePage
INFO: Transformed 250 transitions.
Mar 19, 2019 12:39:10 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/model.pnml.img.gal : 23 ms
Mar 19, 2019 12:39:10 AM fr.lip6.move.gal.instantiate.GALRewriter flatten
INFO: Flatten gal took : 155 ms
Mar 19, 2019 12:39:10 AM fr.lip6.move.serialization.SerializationUtil systemToFile
INFO: Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
Mar 19, 2019 12:39:10 AM fr.lip6.move.serialization.SerializationUtil serializePropertiesForITSLTLTools
INFO: Time to serialize properties into /home/mcc/execution/LTLCardinality.ltl : 2 ms
Mar 19, 2019 12:39:10 AM fr.lip6.move.gal.semantics.DeterministicNextBuilder getDeterministicNext
INFO: Input system was already deterministic with 250 transitions.
Mar 19, 2019 12:39:11 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver computeAndDeclareInvariants
INFO: Computed 100 place invariants in 129 ms
Mar 19, 2019 12:39:16 AM fr.lip6.move.gal.gal2smt.bmc.KInductionSolver init
INFO: Proved 250 variables to be positive in 5606 ms
Mar 19, 2019 12:39:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may disable matrix : 250 transitions.
Mar 19, 2019 12:39:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of disable matrix completed :0/250 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 12:39:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete disable matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 12:39:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeAblingMatrix
INFO: Computing symmetric may enable matrix : 250 transitions.
Mar 19, 2019 12:39:16 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Complete enable matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Mar 19, 2019 12:39:38 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeCoEnablingMatrix
INFO: Computing symmetric co enabling matrix : 250 transitions.
Mar 19, 2019 12:39:38 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(0/250) took 123 ms. Total solver calls (SAT/UNSAT): 4(0/4)
Mar 19, 2019 12:39:42 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(30/250) took 3305 ms. Total solver calls (SAT/UNSAT): 124(0/124)
Mar 19, 2019 12:39:45 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(55/250) took 6322 ms. Total solver calls (SAT/UNSAT): 256(48/208)
Mar 19, 2019 12:39:48 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(92/250) took 9491 ms. Total solver calls (SAT/UNSAT): 458(129/329)
Mar 19, 2019 12:39:51 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(115/250) took 12595 ms. Total solver calls (SAT/UNSAT): 562(181/381)
Mar 19, 2019 12:39:54 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(143/250) took 15820 ms. Total solver calls (SAT/UNSAT): 679(261/418)
Mar 19, 2019 12:39:57 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(159/250) took 18972 ms. Total solver calls (SAT/UNSAT): 741(297/444)
Mar 19, 2019 12:40:00 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of co-enabling matrix(176/250) took 21980 ms. Total solver calls (SAT/UNSAT): 811(361/450)
Mar 19, 2019 12:40:03 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Finished co-enabling matrix. took 24385 ms. Total solver calls (SAT/UNSAT): 950(500/450)
Mar 19, 2019 12:40:03 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver computeDoNotAccord
INFO: Computing Do-Not-Accords matrix : 250 transitions.
Mar 19, 2019 12:40:03 AM fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver printStats
INFO: Computation of Completed DNA matrix. took 466 ms. Total solver calls (SAT/UNSAT): 250(0/250)
Mar 19, 2019 12:40:03 AM fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext transform
INFO: Built C files in 53193ms conformant to PINS in folder :/home/mcc/execution
pins2lts-mc, 0.000: Registering PINS so language module
pins2lts-mc( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc( 5/ 8), 0.027: library has no initializer
pins2lts-mc( 5/ 8), 0.027: loading model GAL
pins2lts-mc( 1/ 8), 0.034: library has no initializer
pins2lts-mc( 1/ 8), 0.035: loading model GAL
pins2lts-mc( 2/ 8), 0.036: library has no initializer
pins2lts-mc( 2/ 8), 0.036: loading model GAL
pins2lts-mc( 3/ 8), 0.036: library has no initializer
pins2lts-mc( 3/ 8), 0.036: loading model GAL
pins2lts-mc( 4/ 8), 0.035: library has no initializer
pins2lts-mc( 4/ 8), 0.046: loading model GAL
pins2lts-mc( 0/ 8), 0.036: library has no initializer
pins2lts-mc( 0/ 8), 0.048: loading model GAL
pins2lts-mc( 6/ 8), 0.036: library has no initializer
pins2lts-mc( 7/ 8), 0.036: library has no initializer
pins2lts-mc( 7/ 8), 0.048: loading model GAL
pins2lts-mc( 6/ 8), 0.048: loading model GAL
pins2lts-mc( 1/ 8), 0.053: completed loading model GAL
pins2lts-mc( 3/ 8), 0.054: completed loading model GAL
pins2lts-mc( 1/ 8), 0.054: LTL layer: formula: X([](X((LTLAP5==true))))
pins2lts-mc( 5/ 8), 0.054: completed loading model GAL
pins2lts-mc( 2/ 8), 0.058: completed loading model GAL
pins2lts-mc( 1/ 8), 0.059: "X([](X((LTLAP5==true))))" is not a file, parsing as formula...
pins2lts-mc( 7/ 8), 0.061: completed loading model GAL
pins2lts-mc( 4/ 8), 0.060: completed loading model GAL
pins2lts-mc( 0/ 8), 0.061: completed loading model GAL
pins2lts-mc( 1/ 8), 0.061: Using Spin LTL semantics
pins2lts-mc( 6/ 8), 0.071: completed loading model GAL
pins2lts-mc( 0/ 8), 0.087: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc( 0/ 8), 0.572: DFS-FIFO for weak LTL, using special progress label 270
pins2lts-mc( 0/ 8), 0.572: There are 271 state labels and 1 edge labels
pins2lts-mc( 0/ 8), 0.572: State length is 251, there are 255 groups
pins2lts-mc( 0/ 8), 0.572: Running dfsfifo using 8 cores
pins2lts-mc( 0/ 8), 0.572: Using a tree table with 2^27 elements
pins2lts-mc( 0/ 8), 0.572: Successor permutation: rr
pins2lts-mc( 0/ 8), 0.572: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc( 5/ 8), 10.310: ~1 levels ~960 states ~92248 transitions
pins2lts-mc( 5/ 8), 11.798: ~1 levels ~1920 states ~184424 transitions
pins2lts-mc( 1/ 8), 14.926: ~1 levels ~3840 states ~368936 transitions
pins2lts-mc( 4/ 8), 18.553: ~1 levels ~7680 states ~737744 transitions
pins2lts-mc( 4/ 8), 25.744: ~1 levels ~15360 states ~1459968 transitions
pins2lts-mc( 7/ 8), 32.796: ~1 levels ~30720 states ~2890144 transitions
pins2lts-mc( 7/ 8), 43.889: ~1 levels ~61440 states ~5729616 transitions
pins2lts-mc( 7/ 8), 53.185: ~1 levels ~122880 states ~11384216 transitions
pins2lts-mc( 3/ 8), 81.957: ~1 levels ~245760 states ~23001400 transitions
pins2lts-mc( 7/ 8), 135.680: ~1 levels ~491520 states ~45334536 transitions
pins2lts-mc( 4/ 8), 148.688: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc( 0/ 8), 153.052:
pins2lts-mc( 0/ 8), 153.052: mean standard work distribution: 3.6% (states) 3.5% (transitions)
pins2lts-mc( 0/ 8), 153.052:
pins2lts-mc( 0/ 8), 153.052: Explored 492953 states 45714019 transitions, fanout: 92.735
pins2lts-mc( 0/ 8), 153.052: Total exploration time 152.380 sec (148.430 sec minimum, 150.080 sec on average)
pins2lts-mc( 0/ 8), 153.052: States per second: 3235, Transitions per second: 300000
pins2lts-mc( 0/ 8), 153.052:
pins2lts-mc( 0/ 8), 153.052: Progress states detected: 16541349
pins2lts-mc( 0/ 8), 153.052: Redundant explorations: -97.0200
pins2lts-mc( 0/ 8), 153.052:
pins2lts-mc( 0/ 8), 153.052: Queue width: 8B, total height: 19733584, memory: 150.56MB
pins2lts-mc( 0/ 8), 153.052: Tree memory: 382.2MB, 24.2 B/state, compr.: 2.4%
pins2lts-mc( 0/ 8), 153.052: Tree fill ratio (roots/leafs): 12.0%/100.0%
pins2lts-mc( 0/ 8), 153.052: Stored 250 string chucks using 0MB
pins2lts-mc( 0/ 8), 153.052: Total memory used for chunk indexing: 0MB
pins2lts-mc( 0/ 8), 153.052: Est. total memory use: 532.8MB (~1174.6MB paged-in)
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, --when, --ltl, X([](X((LTLAP5==true)))), --buchi-type=spotba], workingDir=/home/mcc/execution]
255
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:167)
at fr.lip6.move.gal.application.LTSminRunner.access$9(LTSminRunner.java:122)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:91)
at java.lang.Thread.run(Thread.java:748)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-PT-000050"
export BK_EXAMINATION="LTLCardinality"
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-3954"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000050, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r107-oct2-155272231600816"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-PT-000050.tgz
mv Philosophers-PT-000050 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 ;