About the Execution of ITS-Tools for DatabaseWithMutex-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
298.243 | 14524.00 | 17976.00 | 1937.40 | FFTTFFTFTFFFTTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r064-tall-162038397600716.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 DatabaseWithMutex-PT-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038397600716
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 35K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 198K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 102K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.0K Mar 28 16:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 28 16:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 16:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 28 16:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.1K Mar 23 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 23 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 22 17:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 22 17:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 30K May 5 16:51 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 DatabaseWithMutex-PT-02-00
FORMULA_NAME DatabaseWithMutex-PT-02-01
FORMULA_NAME DatabaseWithMutex-PT-02-02
FORMULA_NAME DatabaseWithMutex-PT-02-03
FORMULA_NAME DatabaseWithMutex-PT-02-04
FORMULA_NAME DatabaseWithMutex-PT-02-05
FORMULA_NAME DatabaseWithMutex-PT-02-06
FORMULA_NAME DatabaseWithMutex-PT-02-07
FORMULA_NAME DatabaseWithMutex-PT-02-08
FORMULA_NAME DatabaseWithMutex-PT-02-09
FORMULA_NAME DatabaseWithMutex-PT-02-10
FORMULA_NAME DatabaseWithMutex-PT-02-11
FORMULA_NAME DatabaseWithMutex-PT-02-12
FORMULA_NAME DatabaseWithMutex-PT-02-13
FORMULA_NAME DatabaseWithMutex-PT-02-14
FORMULA_NAME DatabaseWithMutex-PT-02-15
=== Now, execution of the tool begins
BK_START 1620561823214
Running Version 0
[2021-05-09 12:03:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-09 12:03:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 12:03:45] [INFO ] Load time of PNML (sax parser for PT used): 30 ms
[2021-05-09 12:03:45] [INFO ] Transformed 38 places.
[2021-05-09 12:03:45] [INFO ] Transformed 32 transitions.
[2021-05-09 12:03:45] [INFO ] Found NUPN structural information;
[2021-05-09 12:03:45] [INFO ] Parsed PT model containing 38 places and 32 transitions in 68 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 12:03:45] [INFO ] Initial state test concluded for 6 properties.
FORMULA DatabaseWithMutex-PT-02-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-02-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Applied a total of 0 rules in 6 ms. Remains 38 /38 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:03:46] [INFO ] Computed 10 place invariants in 6 ms
[2021-05-09 12:03:46] [INFO ] Implicit Places using invariants in 78 ms returned []
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:03:46] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 12:03:46] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 875 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:03:46] [INFO ] Computed 10 place invariants in 8 ms
[2021-05-09 12:03:46] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 1 iterations. Remains : 38/38 places, 32/32 transitions.
[2021-05-09 12:03:46] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2021-05-09 12:03:46] [INFO ] Flatten gal took : 22 ms
FORMULA DatabaseWithMutex-PT-02-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 12:03:46] [INFO ] Flatten gal took : 6 ms
[2021-05-09 12:03:46] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 100000 steps, including 2 resets, run finished after 297 ms. (steps per millisecond=336 ) properties (out of 16) seen :15
Running SMT prover for 1 properties.
// Phase 1: matrix 32 rows 38 cols
[2021-05-09 12:03:47] [INFO ] Computed 10 place invariants in 2 ms
[2021-05-09 12:03:47] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2021-05-09 12:03:47] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0 U p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:03:47] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:03:47] [INFO ] Implicit Places using invariants in 42 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 52 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:47] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:03:47] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 10 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:47] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:03:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DatabaseWithMutex-PT-02-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ (ADD s21 s23) (ADD s5 s11)), p0:(LEQ (ADD s13 s14 s19 s22) (ADD s21 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9002 reset in 276 ms.
Stack based approach found an accepted trace after 218 steps with 19 reset with depth 10 and stack size 10 in 1 ms.
FORMULA DatabaseWithMutex-PT-02-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-00 finished in 745 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 6 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 2 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:03:48] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:03:48] [INFO ] Implicit Places using invariants in 25 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 26 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:03:48] [INFO ] Dead Transitions using invariants and state equation in 51 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:48] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 12:03:48] [INFO ] Dead Transitions using invariants and state equation in 67 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-PT-02-01 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ (ADD s21 s23) (ADD s15 s16 s18 s25))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-02-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-01 finished in 228 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((G(p0)||F((p1 U (p2||G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 16 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 4 place count 34 transition count 28
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 12 place count 30 transition count 28
Applied a total of 12 rules in 8 ms. Remains 30 /38 variables (removed 8) and now considering 28/32 (removed 4) transitions.
// Phase 1: matrix 28 rows 30 cols
[2021-05-09 12:03:48] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:03:48] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 28 rows 30 cols
[2021-05-09 12:03:48] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:03:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2021-05-09 12:03:48] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 30 cols
[2021-05-09 12:03:48] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-09 12:03:48] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Finished structural reductions, in 1 iterations. Remains : 30/38 places, 28/32 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-02-04 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 (ADD s3 s26)), p2:(AND (GT (ADD s2 s8 s10 s25) (ADD s13 s14 s18 s20)) (GT (ADD s5 s11 s28 s29) (ADD s6 s12))), p1:(GT (ADD s5 s11 s28 s29) (ADD s6 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 9883 reset in 183 ms.
Stack based approach found an accepted trace after 196 steps with 21 reset with depth 15 and stack size 15 in 1 ms.
FORMULA DatabaseWithMutex-PT-02-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-04 finished in 356 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 38 transition count 28
Reduce places removed 6 places and 0 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 10 rules applied. Total rules applied 14 place count 32 transition count 24
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 22 place count 28 transition count 20
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 26 place count 24 transition count 20
Applied a total of 26 rules in 6 ms. Remains 24 /38 variables (removed 14) and now considering 20/32 (removed 12) transitions.
// Phase 1: matrix 20 rows 24 cols
[2021-05-09 12:03:48] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 12:03:48] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 20 rows 24 cols
[2021-05-09 12:03:48] [INFO ] Computed 8 place invariants in 1 ms
[2021-05-09 12:03:48] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2021-05-09 12:03:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 24 cols
[2021-05-09 12:03:48] [INFO ] Computed 8 place invariants in 3 ms
[2021-05-09 12:03:48] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 24/38 places, 20/32 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s11 s12 s16 s19) (ADD s3 s8 s22 s23))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8366 reset in 114 ms.
Stack based approach found an accepted trace after 283 steps with 24 reset with depth 18 and stack size 17 in 0 ms.
FORMULA DatabaseWithMutex-PT-02-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-05 finished in 289 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X(F(p0)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:03:48] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:03:48] [INFO ] Implicit Places using invariants in 44 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:03:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:48] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:03:48] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-02-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(LEQ (ADD s12 s17 s20 s24) (ADD s1 s3 s8 s26))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 74 ms.
Product exploration explored 100000 steps with 25000 reset in 174 ms.
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 96 ms.
Product exploration explored 100000 steps with 25000 reset in 127 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 8 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 32
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 8 place count 32 transition count 32
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 12 place count 32 transition count 32
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 16 place count 28 transition count 28
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 20 place count 28 transition count 28
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 20 rules in 4 ms. Remains 28 /32 variables (removed 4) and now considering 28/32 (removed 4) transitions.
[2021-05-09 12:03:49] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 28 rows 28 cols
[2021-05-09 12:03:49] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:03:49] [INFO ] Dead Transitions using invariants and state equation in 18 ms returned []
Finished structural reductions, in 1 iterations. Remains : 28/32 places, 28/32 transitions.
Product exploration explored 100000 steps with 25000 reset in 169 ms.
Product exploration explored 100000 steps with 25000 reset in 173 ms.
[2021-05-09 12:03:50] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:03:50] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:03:50] [INFO ] Time to serialize gal into /tmp/LTL2524025783727330259.gal : 1 ms
[2021-05-09 12:03:50] [INFO ] Time to serialize properties into /tmp/LTL7242900792180568468.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL2524025783727330259.gal, -t, CGAL, -LTL, /tmp/LTL7242900792180568468.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2524025783727330259.gal -t CGAL -LTL /tmp/LTL7242900792180568468.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F("((((Acknowledge_2_2+Acknowledge_1_2)+Acknowledge_2_1)+Acknowledge_1_1)<=(((Modify_2_2+Modify_2_1)+Modify_1_1)+Modify_1_2))"))))))
Formula 0 simplified : !XXXF"((((Acknowledge_2_2+Acknowledge_1_2)+Acknowledge_2_1)+Acknowledge_1_1)<=(((Modify_2_2+Modify_2_1)+Modify_1_1)+Modify_1_2))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 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,0.025193,16304,1,0,8,1972,20,0,695,603,15
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-06 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property DatabaseWithMutex-PT-02-06 finished in 1469 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(G(p0)) U (p1&&X(G(p2))))))], workingDir=/home/mcc/execution]
Support contains 14 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:03:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:03:50] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:03:50] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:03:50] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:03:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:03:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Finished structural reductions, in 1 iterations. Remains : 34/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p2)]
Running random walk in product with property : DatabaseWithMutex-PT-02-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=p1, acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=p1, acceptance={} source=2 dest: 3}, { cond=p1, acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(OR p1 p2), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ (ADD s13 s18 s21 s25) (ADD s0 s7 s28 s31)), p0:(LEQ (ADD s3 s30) (ADD s14 s15 s20 s23)), p2:(LEQ (ADD s14 s15 s20 s23) (ADD s0 s7 s28 s31))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 7 reset in 99 ms.
Stack based approach found an accepted trace after 98 steps with 16 reset with depth 43 and stack size 43 in 1 ms.
FORMULA DatabaseWithMutex-PT-02-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-07 finished in 383 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((X((X(G(p1)) U (p2&&X(G(p1)))))||p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:03:50] [INFO ] Computed 6 place invariants in 1 ms
[2021-05-09 12:03:50] [INFO ] Implicit Places using invariants in 20 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 21 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:03:50] [INFO ] Dead Transitions using invariants and state equation in 48 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:50] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-09 12:03:50] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 3210 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Running random walk in product with property : DatabaseWithMutex-PT-02-08 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={0} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s21 1)), p2:(OR (EQ s5 0) (EQ s21 1)), p1:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 69 ms.
Product exploration explored 100000 steps with 50000 reset in 79 ms.
Knowledge obtained : [p0, p2, p1]
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Product exploration explored 100000 steps with 50000 reset in 80 ms.
Product exploration explored 100000 steps with 50000 reset in 105 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 128 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), true]
Support contains 3 out of 32 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 32/32 places, 32/32 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 32 transition count 32
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 13 place count 32 transition count 32
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 20 place count 32 transition count 32
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 32 place count 20 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 44 place count 20 transition count 20
Deduced a syphon composed of 8 places in 0 ms
Applied a total of 44 rules in 3 ms. Remains 20 /32 variables (removed 12) and now considering 20/32 (removed 12) transitions.
[2021-05-09 12:03:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 20 rows 20 cols
[2021-05-09 12:03:54] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:03:54] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Finished structural reductions, in 1 iterations. Remains : 20/32 places, 20/32 transitions.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
[2021-05-09 12:03:55] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:03:55] [INFO ] Flatten gal took : 3 ms
[2021-05-09 12:03:55] [INFO ] Time to serialize gal into /tmp/LTL696733361093094518.gal : 2 ms
[2021-05-09 12:03:55] [INFO ] Time to serialize properties into /tmp/LTL1309008270535475676.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL696733361093094518.gal, -t, CGAL, -LTL, /tmp/LTL1309008270535475676.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL696733361093094518.gal -t CGAL -LTL /tmp/LTL1309008270535475676.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("((all_active_1==0)||(Mutex_2==1))")||(X((X(G("(Mutex_1==1)")))U(("((all_active_1==0)||(Mutex_2==1))")&&(X(G("(Mutex_1==1)")))))))))
Formula 0 simplified : !X("((all_active_1==0)||(Mutex_2==1))" | X(XG"(Mutex_1==1)" U ("((all_active_1==0)||(Mutex_2==1))" & XG"(Mutex_1==1)")))
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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,0.022663,16844,1,0,6,1865,14,0,682,535,7
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DatabaseWithMutex-PT-02-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DatabaseWithMutex-PT-02-08 finished in 4413 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 38 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 38/38 places, 32/32 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 34 transition count 32
Applied a total of 4 rules in 1 ms. Remains 34 /38 variables (removed 4) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 34 cols
[2021-05-09 12:03:55] [INFO ] Computed 6 place invariants in 0 ms
[2021-05-09 12:03:55] [INFO ] Implicit Places using invariants in 34 ms returned [3, 30]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:55] [INFO ] Computed 4 place invariants in 2 ms
[2021-05-09 12:03:55] [INFO ] Dead Transitions using invariants and state equation in 40 ms returned []
Starting structural reductions, iteration 1 : 32/38 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 32 cols
[2021-05-09 12:03:55] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-09 12:03:55] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 32/38 places, 32/32 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DatabaseWithMutex-PT-02-09 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s21 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-02-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-02-09 finished in 182 ms.
All properties solved without resorting to model-checking.
BK_STOP 1620561837738
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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="DatabaseWithMutex-PT-02"
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"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# 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 DatabaseWithMutex-PT-02, 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 r064-tall-162038397600716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-02.tgz
mv DatabaseWithMutex-PT-02 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 '
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 ;