Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r156-oct2-158972914300553.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SharedMemory-PT-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-oct2-158972914300553
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 16K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.5K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 41K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 47K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 5.7K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 13K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 7 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 171K Apr 27 15:14 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 SharedMemory-PT-000010-00
FORMULA_NAME SharedMemory-PT-000010-01
FORMULA_NAME SharedMemory-PT-000010-02
FORMULA_NAME SharedMemory-PT-000010-03
FORMULA_NAME SharedMemory-PT-000010-04
FORMULA_NAME SharedMemory-PT-000010-05
FORMULA_NAME SharedMemory-PT-000010-06
FORMULA_NAME SharedMemory-PT-000010-07
FORMULA_NAME SharedMemory-PT-000010-08
FORMULA_NAME SharedMemory-PT-000010-09
FORMULA_NAME SharedMemory-PT-000010-10
FORMULA_NAME SharedMemory-PT-000010-11
FORMULA_NAME SharedMemory-PT-000010-12
FORMULA_NAME SharedMemory-PT-000010-13
FORMULA_NAME SharedMemory-PT-000010-14
FORMULA_NAME SharedMemory-PT-000010-15

=== Now, execution of the tool begins

BK_START 1589913278212

[2020-05-19 18:34:39] [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/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-19 18:34:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-19 18:34:39] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2020-05-19 18:34:39] [INFO ] Transformed 131 places.
[2020-05-19 18:34:39] [INFO ] Transformed 210 transitions.
[2020-05-19 18:34:39] [INFO ] Found NUPN structural information;
[2020-05-19 18:34:39] [INFO ] Parsed PT model containing 131 places and 210 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100000 steps, including 0 resets, run finished after 419 ms. (steps per millisecond=238 ) properties seen :[1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1]
// Phase 1: matrix 210 rows 131 cols
[2020-05-19 18:34:40] [INFO ] Computed 21 place invariants in 7 ms
[2020-05-19 18:34:40] [INFO ] [Real]Absence check using 21 positive place invariants in 93 ms returned unsat
[2020-05-19 18:34:40] [INFO ] [Real]Absence check using 21 positive place invariants in 45 ms returned unsat
[2020-05-19 18:34:40] [INFO ] [Real]Absence check using 21 positive place invariants in 5 ms returned unsat
[2020-05-19 18:34:40] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned unsat
[2020-05-19 18:34:40] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned unsat
[2020-05-19 18:34:40] [INFO ] [Real]Absence check using 21 positive place invariants in 10 ms returned sat
[2020-05-19 18:34:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 18:34:40] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2020-05-19 18:34:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 18:34:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 7 ms returned unsat
[2020-05-19 18:34:41] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2020-05-19 18:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 18:34:41] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2020-05-19 18:34:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 18:34:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 6 ms returned unsat
[2020-05-19 18:34:41] [INFO ] [Real]Absence check using 21 positive place invariants in 7 ms returned sat
[2020-05-19 18:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 18:34:41] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-05-19 18:34:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 18:34:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 10 ms returned unsat
[2020-05-19 18:34:41] [INFO ] [Real]Absence check using 21 positive place invariants in 8 ms returned sat
[2020-05-19 18:34:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-19 18:34:41] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2020-05-19 18:34:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-19 18:34:41] [INFO ] [Nat]Absence check using 21 positive place invariants in 5 ms returned unsat
Successfully simplified 9 atomic propositions for a total of 11 simplifications.
[2020-05-19 18:34:41] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2020-05-19 18:34:41] [INFO ] Flatten gal took : 41 ms
FORMULA SharedMemory-PT-000010-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-05-19 18:34:41] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-19 18:34:41] [INFO ] Applying decomposition
[2020-05-19 18:34:41] [INFO ] Flatten gal took : 14 ms
[2020-05-19 18:34:41] [INFO ] Input system was already deterministic with 210 transitions.
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 210 rows 131 cols
[2020-05-19 18:34:41] [INFO ] Computed 21 place invariants in 5 ms
inv : Ext_Mem_Acc_8_1 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_8_10 + Active_8 + Queue_8 + OwnMemAcc_8 = 1
inv : Ext_Mem_Acc_1_3 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_9_3 + Memory_3 = 1
inv : Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_3_10 + Active_3 + Queue_3 + OwnMemAcc_3 = 1
inv : Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Active_4 + Queue_4 + OwnMemAcc_4 = 1
inv : Ext_Mem_Acc_2_4 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_9_4 + Memory_4 = 1
inv : Ext_Mem_Acc_4_6 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_10_6 + Memory_6 = 1
inv : Ext_Mem_Acc_1_5 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_8_5 + Memory_5 = 1
inv : Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_2_10 + Active_2 + Queue_2 + OwnMemAcc_2 = 1
inv : Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_6_10 + Active_6 + Queue_6 + OwnMemAcc_6 = 1
inv : Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_5_10 + Active_5 + Queue_5 + OwnMemAcc_5 = 1
inv : Ext_Mem_Acc_1_2 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_10_2 + Memory_2 = 1
inv : Ext_Mem_Acc_2_10 + Ext_Mem_Acc_1_10 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Memory_10 = 1
inv : Ext_Mem_Acc_3_8 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_10_8 + Memory_8 = 1
inv : Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_7_10 + Active_7 + Queue_7 + OwnMemAcc_7 = 1
inv : Ext_Mem_Acc_2_1 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_2_10 + Ext_Mem_Acc_1_10 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_8_9 + Ext_Bus + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 = 1
inv : Ext_Mem_Acc_3_7 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_10_7 + Memory_7 = 1
inv : Ext_Mem_Acc_2_1 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_10_1 + Memory_1 = 1
inv : Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Active_10 + Queue_10 + OwnMemAcc_10 = 1
inv : Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_9_10 + Active_9 + Queue_9 + OwnMemAcc_9 = 1
inv : Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_1_10 + Active_1 + Queue_1 + OwnMemAcc_1 = 1
inv : Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_8_9 + Memory_9 = 1
Total of 21 invariants.
[2020-05-19 18:34:41] [INFO ] Computed 21 place invariants in 6 ms
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/graph3340697642411099582.txt, -o, /tmp/graph3340697642411099582.bin, -w, /tmp/graph3340697642411099582.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/graph3340697642411099582.bin, -l, -1, -v, -w, /tmp/graph3340697642411099582.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-19 18:34:41] [INFO ] Decomposing Gal with order
[2020-05-19 18:34:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-19 18:34:41] [INFO ] Removed a total of 249 redundant transitions.
[2020-05-19 18:34:41] [INFO ] Flatten gal took : 117 ms
[2020-05-19 18:34:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 180 labels/synchronizations in 9 ms.
[2020-05-19 18:34:41] [INFO ] Time to serialize gal into /home/mcc/execution/LTLCardinality.pnml.gal : 4 ms
[2020-05-19 18:34:41] [INFO ] Time to serialize properties into /home/mcc/execution/LTLCardinality.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/LTLCardinality.pnml.gal, -t, CGAL, -LTL, /home/mcc/execution/LTLCardinality.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], 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/LTLCardinality.pnml.gal -t CGAL -LTL /home/mcc/execution/LTLCardinality.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 7 LTL properties
Checking formula 0 : !((!(X(G(!(X((F(X("((((((((((gi1.gu1.Active_7+gi1.gu1.Active_8)+gi1.gu1.Active_5)+gi1.gu1.Active_6)+gi1.gu1.Active_3)+gi1.gu1.Active_4)+gi1.gu1.Active_1)+gi1.gu1.Active_2)+gi1.gu1.Active_10)+gi1.gu1.Active_9)<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.Ext_Mem_Acc_2_1+gu0.Ext_Mem_Acc_3_1)+gu0.Ext_Mem_Acc_4_1)+gu0.Ext_Mem_Acc_5_1)+gu0.Ext_Mem_Acc_6_1)+gu0.Ext_Mem_Acc_7_1)+gu0.Ext_Mem_Acc_8_1)+gu0.Ext_Mem_Acc_9_1)+gu0.Ext_Mem_Acc_10_1)+gu0.Ext_Mem_Acc_1_2)+gu0.Ext_Mem_Acc_3_2)+gu0.Ext_Mem_Acc_4_2)+gu0.Ext_Mem_Acc_5_2)+gu0.Ext_Mem_Acc_7_2)+gu0.Ext_Mem_Acc_6_2)+gu0.Ext_Mem_Acc_9_2)+gu0.Ext_Mem_Acc_8_2)+gu0.Ext_Mem_Acc_1_3)+gu0.Ext_Mem_Acc_10_2)+gu0.Ext_Mem_Acc_4_3)+gu0.Ext_Mem_Acc_2_3)+gu0.Ext_Mem_Acc_6_3)+gu0.Ext_Mem_Acc_5_3)+gu0.Ext_Mem_Acc_8_3)+gu0.Ext_Mem_Acc_7_3)+gu0.Ext_Mem_Acc_10_3)+gu0.Ext_Mem_Acc_9_3)+gu0.Ext_Mem_Acc_2_4)+gu0.Ext_Mem_Acc_1_4)+gu0.Ext_Mem_Acc_6_4)+gu0.Ext_Mem_Acc_7_4)+gu0.Ext_Mem_Acc_3_4)+gu0.Ext_Mem_Acc_5_4)+gu0.Ext_Mem_Acc_10_4)+gu0.Ext_Mem_Acc_1_5)+gu0.Ext_Mem_Acc_8_4)+gu0.Ext_Mem_Acc_9_4)+gu0.Ext_Mem_Acc_4_5)+gu0.Ext_Mem_Acc_6_5)+gu0.Ext_Mem_Acc_2_5)+gu0.Ext_Mem_Acc_3_5)+gu0.Ext_Mem_Acc_9_5)+gu0.Ext_Mem_Acc_10_5)+gu0.Ext_Mem_Acc_7_5)+gu0.Ext_Mem_Acc_8_5)+gu0.Ext_Mem_Acc_4_6)+gu0.Ext_Mem_Acc_3_6)+gu0.Ext_Mem_Acc_2_6)+gu0.Ext_Mem_Acc_1_6)+gu0.Ext_Mem_Acc_9_6)+gu0.Ext_Mem_Acc_8_6)+gu0.Ext_Mem_Acc_7_6)+gu0.Ext_Mem_Acc_5_6)+gu0.Ext_Mem_Acc_3_7)+gu0.Ext_Mem_Acc_2_7)+gu0.Ext_Mem_Acc_1_7)+gu0.Ext_Mem_Acc_10_6)+gu0.Ext_Mem_Acc_8_7)+gu0.Ext_Mem_Acc_6_7)+gu0.Ext_Mem_Acc_5_7)+gu0.Ext_Mem_Acc_4_7)+gu0.Ext_Mem_Acc_3_8)+gu0.Ext_Mem_Acc_4_8)+gu0.Ext_Mem_Acc_5_8)+gu0.Ext_Mem_Acc_6_8)+gu0.Ext_Mem_Acc_9_7)+gu0.Ext_Mem_Acc_10_7)+gu0.Ext_Mem_Acc_1_8)+gu0.Ext_Mem_Acc_2_8)+gu0.Ext_Mem_Acc_2_9)+gu0.Ext_Mem_Acc_3_9)+gu0.Ext_Mem_Acc_4_9)+gu0.Ext_Mem_Acc_5_9)+gu0.Ext_Mem_Acc_7_8)+gu0.Ext_Mem_Acc_9_8)+gu0.Ext_Mem_Acc_10_8)+gu0.Ext_Mem_Acc_1_9)+gu0.Ext_Mem_Acc_2_10)+gu0.Ext_Mem_Acc_1_10)+gu0.Ext_Mem_Acc_4_10)+gu0.Ext_Mem_Acc_3_10)+gu0.Ext_Mem_Acc_7_9)+gu0.Ext_Mem_Acc_6_9)+gu0.Ext_Mem_Acc_10_9)+gu0.Ext_Mem_Acc_8_9)+gu0.Ext_Mem_Acc_9_10)+gu0.Ext_Mem_Acc_6_10)+gu0.Ext_Mem_Acc_5_10)+gu0.Ext_Mem_Acc_8_10)+gu0.Ext_Mem_Acc_7_10))")))||(X(F("(gi1.gu2.Ext_Bus<=(((((((((gi1.gu2.Queue_6+gi1.gu2.Queue_5)+gi1.gu2.Queue_4)+gi1.gu2.Queue_3)+gi1.gu2.Queue_2)+gi1.gu2.Queue_1)+gi1.gu2.Queue_10)+gi1.gu2.Queue_9)+gi1.gu2.Queue_8)+gi1.gu2.Queue_7))"))))))))))
Formula 0 simplified : XG!X(FX"((((((((((gi1.gu1.Active_7+gi1.gu1.Active_8)+gi1.gu1.Active_5)+gi1.gu1.Active_6)+gi1.gu1.Active_3)+gi1.gu1.Active_4)+gi1.gu1.Active_1)+gi1.gu1.Active_2)+gi1.gu1.Active_10)+gi1.gu1.Active_9)<=(((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((gu0.Ext_Mem_Acc_2_1+gu0.Ext_Mem_Acc_3_1)+gu0.Ext_Mem_Acc_4_1)+gu0.Ext_Mem_Acc_5_1)+gu0.Ext_Mem_Acc_6_1)+gu0.Ext_Mem_Acc_7_1)+gu0.Ext_Mem_Acc_8_1)+gu0.Ext_Mem_Acc_9_1)+gu0.Ext_Mem_Acc_10_1)+gu0.Ext_Mem_Acc_1_2)+gu0.Ext_Mem_Acc_3_2)+gu0.Ext_Mem_Acc_4_2)+gu0.Ext_Mem_Acc_5_2)+gu0.Ext_Mem_Acc_7_2)+gu0.Ext_Mem_Acc_6_2)+gu0.Ext_Mem_Acc_9_2)+gu0.Ext_Mem_Acc_8_2)+gu0.Ext_Mem_Acc_1_3)+gu0.Ext_Mem_Acc_10_2)+gu0.Ext_Mem_Acc_4_3)+gu0.Ext_Mem_Acc_2_3)+gu0.Ext_Mem_Acc_6_3)+gu0.Ext_Mem_Acc_5_3)+gu0.Ext_Mem_Acc_8_3)+gu0.Ext_Mem_Acc_7_3)+gu0.Ext_Mem_Acc_10_3)+gu0.Ext_Mem_Acc_9_3)+gu0.Ext_Mem_Acc_2_4)+gu0.Ext_Mem_Acc_1_4)+gu0.Ext_Mem_Acc_6_4)+gu0.Ext_Mem_Acc_7_4)+gu0.Ext_Mem_Acc_3_4)+gu0.Ext_Mem_Acc_5_4)+gu0.Ext_Mem_Acc_10_4)+gu0.Ext_Mem_Acc_1_5)+gu0.Ext_Mem_Acc_8_4)+gu0.Ext_Mem_Acc_9_4)+gu0.Ext_Mem_Acc_4_5)+gu0.Ext_Mem_Acc_6_5)+gu0.Ext_Mem_Acc_2_5)+gu0.Ext_Mem_Acc_3_5)+gu0.Ext_Mem_Acc_9_5)+gu0.Ext_Mem_Acc_10_5)+gu0.Ext_Mem_Acc_7_5)+gu0.Ext_Mem_Acc_8_5)+gu0.Ext_Mem_Acc_4_6)+gu0.Ext_Mem_Acc_3_6)+gu0.Ext_Mem_Acc_2_6)+gu0.Ext_Mem_Acc_1_6)+gu0.Ext_Mem_Acc_9_6)+gu0.Ext_Mem_Acc_8_6)+gu0.Ext_Mem_Acc_7_6)+gu0.Ext_Mem_Acc_5_6)+gu0.Ext_Mem_Acc_3_7)+gu0.Ext_Mem_Acc_2_7)+gu0.Ext_Mem_Acc_1_7)+gu0.Ext_Mem_Acc_10_6)+gu0.Ext_Mem_Acc_8_7)+gu0.Ext_Mem_Acc_6_7)+gu0.Ext_Mem_Acc_5_7)+gu0.Ext_Mem_Acc_4_7)+gu0.Ext_Mem_Acc_3_8)+gu0.Ext_Mem_Acc_4_8)+gu0.Ext_Mem_Acc_5_8)+gu0.Ext_Mem_Acc_6_8)+gu0.Ext_Mem_Acc_9_7)+gu0.Ext_Mem_Acc_10_7)+gu0.Ext_Mem_Acc_1_8)+gu0.Ext_Mem_Acc_2_8)+gu0.Ext_Mem_Acc_2_9)+gu0.Ext_Mem_Acc_3_9)+gu0.Ext_Mem_Acc_4_9)+gu0.Ext_Mem_Acc_5_9)+gu0.Ext_Mem_Acc_7_8)+gu0.Ext_Mem_Acc_9_8)+gu0.Ext_Mem_Acc_10_8)+gu0.Ext_Mem_Acc_1_9)+gu0.Ext_Mem_Acc_2_10)+gu0.Ext_Mem_Acc_1_10)+gu0.Ext_Mem_Acc_4_10)+gu0.Ext_Mem_Acc_3_10)+gu0.Ext_Mem_Acc_7_9)+gu0.Ext_Mem_Acc_6_9)+gu0.Ext_Mem_Acc_10_9)+gu0.Ext_Mem_Acc_8_9)+gu0.Ext_Mem_Acc_9_10)+gu0.Ext_Mem_Acc_6_10)+gu0.Ext_Mem_Acc_5_10)+gu0.Ext_Mem_Acc_8_10)+gu0.Ext_Mem_Acc_7_10))" | XF"(gi1.gu2.Ext_Bus<=(((((((((gi1.gu2.Queue_6+gi1.gu2.Queue_5)+gi1.gu2.Queue_4)+gi1.gu2.Queue_3)+gi1.gu2.Queue_2)+gi1.gu2.Queue_1)+gi1.gu2.Queue_10)+gi1.gu2.Queue_9)+gi1.gu2.Queue_8)+gi1.gu2.Queue_7))")
[2020-05-19 18:34:42] [INFO ] Proved 131 variables to be positive in 306 ms
[2020-05-19 18:34:42] [INFO ] Computing symmetric may disable matrix : 210 transitions.
[2020-05-19 18:34:42] [INFO ] Computation of disable matrix completed :0/210 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 18:34:42] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-19 18:34:42] [INFO ] Computing symmetric may enable matrix : 210 transitions.
[2020-05-19 18:34:42] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
157 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.60287,71544,1,0,29,264785,24,8,4511,55376,56
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(!(G("((((((((((gi1.gu1.Active_7+gi1.gu1.Active_8)+gi1.gu1.Active_5)+gi1.gu1.Active_6)+gi1.gu1.Active_3)+gi1.gu1.Active_4)+gi1.gu1.Active_1)+gi1.gu1.Active_2)+gi1.gu1.Active_10)+gi1.gu1.Active_9)<2)")))))
Formula 1 simplified : !X!G"((((((((((gi1.gu1.Active_7+gi1.gu1.Active_8)+gi1.gu1.Active_5)+gi1.gu1.Active_6)+gi1.gu1.Active_3)+gi1.gu1.Active_4)+gi1.gu1.Active_1)+gi1.gu1.Active_2)+gi1.gu1.Active_10)+gi1.gu1.Active_9)<2)"
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,1.60506,71544,1,0,29,264785,33,8,4540,55376,60
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 2 : !((G(!(F(X((G("((((((((((gi1.gu1.Active_7+gi1.gu1.Active_8)+gi1.gu1.Active_5)+gi1.gu1.Active_6)+gi1.gu1.Active_3)+gi1.gu1.Active_4)+gi1.gu1.Active_1)+gi1.gu1.Active_2)+gi1.gu1.Active_10)+gi1.gu1.Active_9)<=gi1.gu2.Ext_Bus)"))U(X("((((((((((gi1.gu2.Queue_6+gi1.gu2.Queue_5)+gi1.gu2.Queue_4)+gi1.gu2.Queue_3)+gi1.gu2.Queue_2)+gi1.gu2.Queue_1)+gi1.gu2.Queue_10)+gi1.gu2.Queue_9)+gi1.gu2.Queue_8)+gi1.gu2.Queue_7)<=(((((((((gi1.gu1.Active_7+gi1.gu1.Active_8)+gi1.gu1.Active_5)+gi1.gu1.Active_6)+gi1.gu1.Active_3)+gi1.gu1.Active_4)+gi1.gu1.Active_1)+gi1.gu1.Active_2)+gi1.gu1.Active_10)+gi1.gu1.Active_9))"))))))))
Formula 2 simplified : !G!FX(G"((((((((((gi1.gu1.Active_7+gi1.gu1.Active_8)+gi1.gu1.Active_5)+gi1.gu1.Active_6)+gi1.gu1.Active_3)+gi1.gu1.Active_4)+gi1.gu1.Active_1)+gi1.gu1.Active_2)+gi1.gu1.Active_10)+gi1.gu1.Active_9)<=gi1.gu2.Ext_Bus)" U X"((((((((((gi1.gu2.Queue_6+gi1.gu2.Queue_5)+gi1.gu2.Queue_4)+gi1.gu2.Queue_3)+gi1.gu2.Queue_2)+gi1.gu2.Queue_1)+gi1.gu2.Queue_10)+gi1.gu2.Queue_9)+gi1.gu2.Queue_8)+gi1.gu2.Queue_7)<=(((((((((gi1.gu1.Active_7+gi1.gu1.Active_8)+gi1.gu1.Active_5)+gi1.gu1.Active_6)+gi1.gu1.Active_3)+gi1.gu1.Active_4)+gi1.gu1.Active_1)+gi1.gu1.Active_2)+gi1.gu1.Active_10)+gi1.gu1.Active_9))")
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 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,1.88757,85380,1,0,29,305804,45,8,5159,64417,75
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 3 : !((X((G("(gi1.gu2.Ext_Bus==1)"))&&("((gi1.gu2.Queue_3==0)||(gi1.gu1.OwnMemAcc_3==1))"))))
Formula 3 simplified : !X("((gi1.gu2.Queue_3==0)||(gi1.gu1.OwnMemAcc_3==1))" & G"(gi1.gu2.Ext_Bus==1)")
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
101 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.88618,105672,1,0,51,470223,59,17,5172,194077,135
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 4 : !((X(((F(G("((gi1.gu2.Queue_8==0)||(gi1.gu1.Active_6==1))")))||("(gi1.gu2.Queue_3==0)"))||("(gi1.gu1.Active_2==1)"))))
Formula 4 simplified : !X("(gi1.gu1.Active_2==1)" | "(gi1.gu2.Queue_3==0)" | FG"((gi1.gu2.Queue_8==0)||(gi1.gu1.Active_6==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,2.88764,106092,1,0,51,470223,66,17,5176,194077,137
no accepting run found
Formula 4 is TRUE no accepting run found.
FORMULA SharedMemory-PT-000010-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 5 : !(((G(X("(gi1.gu1.Active_10==1)")))&&((X(X("(gi1.gu1.Active_10==1)")))U("(gi1.gu1.Active_2==1)"))))
Formula 5 simplified : !(GX"(gi1.gu1.Active_10==1)" & (XX"(gi1.gu1.Active_10==1)" U "(gi1.gu1.Active_2==1)"))
[2020-05-19 18:34:45] [INFO ] Computing symmetric co enabling matrix : 210 transitions.
[2020-05-19 18:34:45] [INFO ] Computation of co-enabling matrix(0/210) took 91 ms. Total solver calls (SAT/UNSAT): 183(0/183)
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
76 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.65541,140236,1,0,74,619940,74,27,5178,240285,202
an accepting run exists (use option '-e' to print it)
Formula 5 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 6 : !((X(("((gi1.gu2.Ext_Bus==0)||(gu0.Ext_Mem_Acc_2_8==1))")U(G(X(F(!(G(X(G("(gi1.gu1.OwnMemAcc_6!=1)")))))))))))
Formula 6 simplified : !X("((gi1.gu2.Ext_Bus==0)||(gu0.Ext_Mem_Acc_2_8==1))" U GXF!GXG"(gi1.gu1.OwnMemAcc_6!=1)")
4 unique states visited
4 strongly connected components in search stack
5 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,3.80548,146784,1,0,75,655943,83,27,5180,248306,213
an accepting run exists (use option '-e' to print it)
Formula 6 is FALSE accepting run found.
FORMULA SharedMemory-PT-000010-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Skipping mayMatrices nes/nds SMT solver raised an exception or timeout.
java.lang.RuntimeException: SMT solver raised an exception or timeout.
at fr.lip6.move.gal.gal2smt.bmc.NecessaryEnablingsolver.computeCoEnablingMatrix(NecessaryEnablingsolver.java:482)
at fr.lip6.move.gal.gal2pins.Gal2PinsTransformerNext.printLabels(Gal2PinsTransformerNext.java:530)
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-19 18:34:46] [INFO ] Built C files in 4751ms 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 1589913286885

--------------------
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/ -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 LTLCardinality -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="SharedMemory-PT-000010"
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-4028"
echo " Executing tool itstools"
echo " Input is SharedMemory-PT-000010, 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 r156-oct2-158972914300553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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