fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r026-tajo-162038143800380
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for BusinessProcesses-PT-08

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
696.344 69979.00 95257.00 102.00 TFTFTFFFTTTTTFFT normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r026-tajo-162038143800380.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/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 BusinessProcesses-PT-08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026-tajo-162038143800380
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 424K
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 82K 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.8K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 28 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 28 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 23 03:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 03:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 12:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 22 12:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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 91K 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 BusinessProcesses-PT-08-00
FORMULA_NAME BusinessProcesses-PT-08-01
FORMULA_NAME BusinessProcesses-PT-08-02
FORMULA_NAME BusinessProcesses-PT-08-03
FORMULA_NAME BusinessProcesses-PT-08-04
FORMULA_NAME BusinessProcesses-PT-08-05
FORMULA_NAME BusinessProcesses-PT-08-06
FORMULA_NAME BusinessProcesses-PT-08-07
FORMULA_NAME BusinessProcesses-PT-08-08
FORMULA_NAME BusinessProcesses-PT-08-09
FORMULA_NAME BusinessProcesses-PT-08-10
FORMULA_NAME BusinessProcesses-PT-08-11
FORMULA_NAME BusinessProcesses-PT-08-12
FORMULA_NAME BusinessProcesses-PT-08-13
FORMULA_NAME BusinessProcesses-PT-08-14
FORMULA_NAME BusinessProcesses-PT-08-15

=== Now, execution of the tool begins

BK_START 1620544496665

Running Version 0
[2021-05-09 07:14:58] [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 07:14:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-09 07:14:58] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2021-05-09 07:14:58] [INFO ] Transformed 393 places.
[2021-05-09 07:14:58] [INFO ] Transformed 344 transitions.
[2021-05-09 07:14:58] [INFO ] Found NUPN structural information;
[2021-05-09 07:14:58] [INFO ] Parsed PT model containing 393 places and 344 transitions in 102 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2021-05-09 07:14:58] [INFO ] Initial state test concluded for 5 properties.
Deduced a syphon composed of 13 places in 10 ms
Reduce places removed 13 places and 13 transitions.
FORMULA BusinessProcesses-PT-08-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 380 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 380/380 places, 331/331 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 372 transition count 331
Discarding 61 places :
Symmetric choice reduction at 1 with 61 rule applications. Total rules 69 place count 311 transition count 270
Iterating global reduction 1 with 61 rules applied. Total rules applied 130 place count 311 transition count 270
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 131 place count 311 transition count 269
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 162 place count 280 transition count 238
Iterating global reduction 2 with 31 rules applied. Total rules applied 193 place count 280 transition count 238
Applied a total of 193 rules in 70 ms. Remains 280 /380 variables (removed 100) and now considering 238/331 (removed 93) transitions.
// Phase 1: matrix 238 rows 280 cols
[2021-05-09 07:14:58] [INFO ] Computed 50 place invariants in 11 ms
[2021-05-09 07:14:58] [INFO ] Implicit Places using invariants in 215 ms returned []
// Phase 1: matrix 238 rows 280 cols
[2021-05-09 07:14:58] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-09 07:14:59] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 477 ms to find 0 implicit places.
// Phase 1: matrix 238 rows 280 cols
[2021-05-09 07:14:59] [INFO ] Computed 50 place invariants in 7 ms
[2021-05-09 07:14:59] [INFO ] Dead Transitions using invariants and state equation in 154 ms returned []
Finished structural reductions, in 1 iterations. Remains : 280/380 places, 238/331 transitions.
[2021-05-09 07:14:59] [INFO ] Initial state reduction rules for LTL removed 5 formulas.
[2021-05-09 07:14:59] [INFO ] Flatten gal took : 47 ms
FORMULA BusinessProcesses-PT-08-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-08-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-09 07:14:59] [INFO ] Flatten gal took : 19 ms
[2021-05-09 07:14:59] [INFO ] Input system was already deterministic with 238 transitions.
Incomplete random walk after 100000 steps, including 844 resets, run finished after 185 ms. (steps per millisecond=540 ) properties (out of 10) seen :9
Running SMT prover for 1 properties.
// Phase 1: matrix 238 rows 280 cols
[2021-05-09 07:14:59] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:14:59] [INFO ] [Real]Absence check using 50 positive place invariants in 15 ms returned sat
[2021-05-09 07:14:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-09 07:14:59] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2021-05-09 07:15:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-09 07:15:00] [INFO ] [Nat]Absence check using 50 positive place invariants in 13 ms returned unsat
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
[2021-05-09 07:15:00] [INFO ] Initial state test concluded for 1 properties.
FORMULA BusinessProcesses-PT-08-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 238/238 transitions.
Graph (trivial) has 149 edges and 280 vertex of which 6 / 280 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 38 place count 274 transition count 194
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 75 place count 237 transition count 194
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 54 Pre rules applied. Total rules applied 75 place count 237 transition count 140
Deduced a syphon composed of 54 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 119 rules applied. Total rules applied 194 place count 172 transition count 140
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 208 place count 158 transition count 126
Iterating global reduction 2 with 14 rules applied. Total rules applied 222 place count 158 transition count 126
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 155 rules applied. Total rules applied 377 place count 79 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 378 place count 78 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 379 place count 77 transition count 49
Applied a total of 379 rules in 51 ms. Remains 77 /280 variables (removed 203) and now considering 49/238 (removed 189) transitions.
// Phase 1: matrix 49 rows 77 cols
[2021-05-09 07:15:00] [INFO ] Computed 35 place invariants in 1 ms
[2021-05-09 07:15:00] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 49 rows 77 cols
[2021-05-09 07:15:00] [INFO ] Computed 35 place invariants in 0 ms
[2021-05-09 07:15:00] [INFO ] Implicit Places using invariants and state equation in 80 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, 16, 18, 20, 21, 22, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 49, 50, 52, 54, 56, 58, 60]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 131 ms to find 38 implicit places.
[2021-05-09 07:15:00] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 49 rows 39 cols
[2021-05-09 07:15:00] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-09 07:15:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 39/280 places, 49/238 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 39 transition count 42
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 32 transition count 42
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 20 place count 26 transition count 36
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 26 transition count 36
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 26 transition count 33
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 23 transition count 33
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 20 transition count 30
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 41 place count 20 transition count 30
Applied a total of 41 rules in 10 ms. Remains 20 /39 variables (removed 19) and now considering 30/49 (removed 19) transitions.
// Phase 1: matrix 30 rows 20 cols
[2021-05-09 07:15:00] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 07:15:00] [INFO ] Implicit Places using invariants in 12 ms returned []
// Phase 1: matrix 30 rows 20 cols
[2021-05-09 07:15:00] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-09 07:15:00] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 20/280 places, 30/238 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-03 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:(AND (NEQ s12 0) (NEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-03 finished in 492 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(F(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 238/238 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 264 transition count 222
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 264 transition count 222
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 260 transition count 218
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 260 transition count 218
Applied a total of 40 rules in 24 ms. Remains 260 /280 variables (removed 20) and now considering 218/238 (removed 20) transitions.
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:00] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:00] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:00] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:00] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
// Phase 1: matrix 218 rows 260 cols
[2021-05-09 07:15:00] [INFO ] Computed 50 place invariants in 6 ms
[2021-05-09 07:15:01] [INFO ] Dead Transitions using invariants and state equation in 129 ms returned []
Finished structural reductions, in 1 iterations. Remains : 260/280 places, 218/238 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-08-09 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: 1}]], initial=2, aps=[p0:(OR (EQ s133 0) (EQ s93 1))], 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 303 ms.
Product exploration explored 100000 steps with 33333 reset in 324 ms.
Graph (complete) has 552 edges and 260 vertex of which 259 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Knowledge obtained : [p0]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 33333 reset in 205 ms.
Product exploration explored 100000 steps with 33333 reset in 212 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 260 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 260/260 places, 218/218 transitions.
Graph (trivial) has 128 edges and 260 vertex of which 6 / 260 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 255 transition count 212
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 29 place count 255 transition count 320
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 78 place count 255 transition count 320
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 246 transition count 293
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 246 transition count 293
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 1 with 83 rules applied. Total rules applied 179 place count 246 transition count 293
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 199 place count 226 transition count 273
Deduced a syphon composed of 131 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 219 place count 226 transition count 273
Deduced a syphon composed of 131 places in 0 ms
Applied a total of 219 rules in 52 ms. Remains 226 /260 variables (removed 34) and now considering 273/218 (removed -55) transitions.
[2021-05-09 07:15:02] [INFO ] Redundant transitions in 29 ms returned []
// Phase 1: matrix 273 rows 226 cols
[2021-05-09 07:15:02] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-09 07:15:02] [INFO ] Dead Transitions using invariants and state equation in 162 ms returned []
Finished structural reductions, in 1 iterations. Remains : 226/260 places, 273/218 transitions.
Product exploration explored 100000 steps with 33333 reset in 636 ms.
Product exploration explored 100000 steps with 33333 reset in 552 ms.
[2021-05-09 07:15:04] [INFO ] Flatten gal took : 12 ms
[2021-05-09 07:15:04] [INFO ] Flatten gal took : 12 ms
[2021-05-09 07:15:04] [INFO ] Time to serialize gal into /tmp/LTL15514777936908242693.gal : 7 ms
[2021-05-09 07:15:04] [INFO ] Time to serialize properties into /tmp/LTL12039349820104073803.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/LTL15514777936908242693.gal, -t, CGAL, -LTL, /tmp/LTL12039349820104073803.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/LTL15514777936908242693.gal -t CGAL -LTL /tmp/LTL12039349820104073803.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((p173==0)||(p120==1))")))))
Formula 0 simplified : !XXF"((p173==0)||(p120==1))"
Detected timeout of ITS tools.
[2021-05-09 07:15:19] [INFO ] Flatten gal took : 11 ms
[2021-05-09 07:15:19] [INFO ] Applying decomposition
[2021-05-09 07:15:19] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9229164708794009448.txt, -o, /tmp/graph9229164708794009448.bin, -w, /tmp/graph9229164708794009448.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9229164708794009448.bin, -l, -1, -v, -w, /tmp/graph9229164708794009448.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:15:19] [INFO ] Decomposing Gal with order
[2021-05-09 07:15:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:15:19] [INFO ] Removed a total of 89 redundant transitions.
[2021-05-09 07:15:19] [INFO ] Flatten gal took : 121 ms
[2021-05-09 07:15:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 26 ms.
[2021-05-09 07:15:19] [INFO ] Time to serialize gal into /tmp/LTL8533346750468570741.gal : 25 ms
[2021-05-09 07:15:19] [INFO ] Time to serialize properties into /tmp/LTL10882460365096303963.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/LTL8533346750468570741.gal, -t, CGAL, -LTL, /tmp/LTL10882460365096303963.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8533346750468570741.gal -t CGAL -LTL /tmp/LTL10882460365096303963.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(X(F("((i14.i1.u50.p173==0)||(i10.i1.u35.p120==1))")))))
Formula 0 simplified : !XXF"((i14.i1.u50.p173==0)||(i10.i1.u35.p120==1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11776980807377208521
[2021-05-09 07:15:34] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11776980807377208521
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin11776980807377208521]
Compilation finished in 948 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin11776980807377208521]
Link finished in 61 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(X(<>((LTLAPp0==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin11776980807377208521]
LTSmin run took 1041 ms.
FORMULA BusinessProcesses-PT-08-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-08-09 finished in 36244 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&(p1||F(p2))&&(p1||F(p3))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 238/238 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 266 transition count 224
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 266 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 263 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 263 transition count 221
Applied a total of 34 rules in 15 ms. Remains 263 /280 variables (removed 17) and now considering 221/238 (removed 17) transitions.
// Phase 1: matrix 221 rows 263 cols
[2021-05-09 07:15:36] [INFO ] Computed 50 place invariants in 1 ms
[2021-05-09 07:15:37] [INFO ] Implicit Places using invariants in 314 ms returned []
// Phase 1: matrix 221 rows 263 cols
[2021-05-09 07:15:37] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:15:37] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
// Phase 1: matrix 221 rows 263 cols
[2021-05-09 07:15:37] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-09 07:15:37] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 263/280 places, 221/238 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Running random walk in product with property : BusinessProcesses-PT-08-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (NEQ s259 0) (NEQ s166 1)), p1:(NEQ s243 1), p2:(AND (NEQ s166 0) (NEQ s259 1)), p3:(AND (NEQ s121 0) (NEQ s117 1))], nbAcceptance=0, 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 50000 reset in 297 ms.
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Graph (complete) has 557 edges and 263 vertex of which 262 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Knowledge obtained : [p0, p1, (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Product exploration explored 100000 steps with 50000 reset in 251 ms.
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p3)))]
Support contains 5 out of 263 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 263/263 places, 221/221 transitions.
Graph (trivial) has 129 edges and 263 vertex of which 6 / 263 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 31 place count 258 transition count 215
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 31 place count 258 transition count 325
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 47 rules applied. Total rules applied 78 place count 258 transition count 325
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 87 place count 249 transition count 298
Deduced a syphon composed of 68 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 96 place count 249 transition count 298
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 149 places in 1 ms
Iterating global reduction 1 with 81 rules applied. Total rules applied 177 place count 249 transition count 298
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 199 place count 227 transition count 276
Deduced a syphon composed of 127 places in 0 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 221 place count 227 transition count 276
Deduced a syphon composed of 127 places in 0 ms
Applied a total of 221 rules in 49 ms. Remains 227 /263 variables (removed 36) and now considering 276/221 (removed -55) transitions.
[2021-05-09 07:15:39] [INFO ] Redundant transitions in 34 ms returned []
// Phase 1: matrix 276 rows 227 cols
[2021-05-09 07:15:39] [INFO ] Computed 50 place invariants in 15 ms
[2021-05-09 07:15:40] [INFO ] Dead Transitions using invariants and state equation in 240 ms returned []
Finished structural reductions, in 1 iterations. Remains : 227/263 places, 276/221 transitions.
Product exploration explored 100000 steps with 50000 reset in 1172 ms.
Product exploration explored 100000 steps with 50000 reset in 893 ms.
[2021-05-09 07:15:42] [INFO ] Flatten gal took : 10 ms
[2021-05-09 07:15:42] [INFO ] Flatten gal took : 8 ms
[2021-05-09 07:15:42] [INFO ] Time to serialize gal into /tmp/LTL7606096719938425037.gal : 2 ms
[2021-05-09 07:15:42] [INFO ] Time to serialize properties into /tmp/LTL17452406238989107769.ltl : 0 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/LTL7606096719938425037.gal, -t, CGAL, -LTL, /tmp/LTL17452406238989107769.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/LTL7606096719938425037.gal -t CGAL -LTL /tmp/LTL17452406238989107769.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((("((p387!=0)||(p218!=1))")&&(("(p340!=1)")||(F("((p218!=0)&&(p387!=1))"))))&&(("(p340!=1)")||(F("((p161!=0)&&(p157!=1))")))))))
Formula 0 simplified : !XF("((p387!=0)||(p218!=1))" & ("(p340!=1)" | F"((p218!=0)&&(p387!=1))") & ("(p340!=1)" | F"((p161!=0)&&(p157!=1))"))
Detected timeout of ITS tools.
[2021-05-09 07:15:57] [INFO ] Flatten gal took : 39 ms
[2021-05-09 07:15:57] [INFO ] Applying decomposition
[2021-05-09 07:15:57] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph9547875717713443052.txt, -o, /tmp/graph9547875717713443052.bin, -w, /tmp/graph9547875717713443052.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph9547875717713443052.bin, -l, -1, -v, -w, /tmp/graph9547875717713443052.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-09 07:15:57] [INFO ] Decomposing Gal with order
[2021-05-09 07:15:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-09 07:15:57] [INFO ] Removed a total of 89 redundant transitions.
[2021-05-09 07:15:57] [INFO ] Flatten gal took : 15 ms
[2021-05-09 07:15:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2021-05-09 07:15:57] [INFO ] Time to serialize gal into /tmp/LTL5394441801898470476.gal : 7 ms
[2021-05-09 07:15:57] [INFO ] Time to serialize properties into /tmp/LTL11922469383889545745.ltl : 0 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/LTL5394441801898470476.gal, -t, CGAL, -LTL, /tmp/LTL11922469383889545745.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.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5394441801898470476.gal -t CGAL -LTL /tmp/LTL11922469383889545745.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((("((i19.i1.u75.p387!=0)||(i17.u59.p218!=1))")&&(("(i19.i1.u84.p340!=1)")||(F("((i17.u59.p218!=0)&&(i19.i1.u75.p387!=1))"))))&&(("(i19.i1.u84.p340!=1)")||(F("((i17.u46.p161!=0)&&(i13.u44.p157!=1))")))))))
Formula 0 simplified : !XF("((i19.i1.u75.p387!=0)||(i17.u59.p218!=1))" & ("(i19.i1.u84.p340!=1)" | F"((i17.u59.p218!=0)&&(i19.i1.u75.p387!=1))") & ("(i19.i1.u84.p340!=1)" | F"((i17.u46.p161!=0)&&(i13.u44.p157!=1))"))
Reverse transition relation is NOT exact ! Due to transitions t176, t210, t214, t217, t221, t223, t224, t225, t228, t233, t235, t236, i0.u72.t45, i0.u73.t42, i0.u74.t39, i1.i0.u39.t115, i1.i1.u37.t118, i2.t122, i2.u31.t133, i2.u35.t125, i3.i0.u19.t160, i3.i1.u21.t156, i4.u11.t179, i4.u15.t170, i5.u13.t174, i5.u14.t173, i6.u9.t183, i6.u10.t181, i7.u17.t165, i7.u18.t163, i8.i0.u27.t141, i8.i1.u23.t152, i9.u29.t137, i11.u33.t129, i11.u71.t48, i12.u67.t61, i12.u68.t57, i12.u69.t54, i12.u70.t51, i13.u63.t74, i13.u64.t71, i13.u65.t68, i13.u66.t65, i15.u55.t97, i15.u56.t94, i16.u50.t111, i16.u51.t109, i17.t85, i17.u57.t91, i17.u58.t88, i17.u60.t86, i18.u61.t81, i18.u62.t78, i19.i0.u25.t147, i19.i1.u75.t3, i19.i1.u77.t32, i19.i1.u84.t12, Intersection with reachable at each step enabled. (destroyed/reverse/intersect/total) :0/163/57/220
Computing Next relation with stutter on 26 deadlock states
2 unique states visited
0 strongly connected components in search stack
1 transitions explored
2 items max in DFS search stack
707 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,7.11355,243988,1,0,469355,288,2891,671310,140,729,1083401
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BusinessProcesses-PT-08-12 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-08-12 finished in 28740 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0&&X(X(G(p1)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 280 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 280/280 places, 238/238 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 265 transition count 223
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 265 transition count 223
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 262 transition count 220
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 262 transition count 220
Applied a total of 36 rules in 7 ms. Remains 262 /280 variables (removed 18) and now considering 220/238 (removed 18) transitions.
// Phase 1: matrix 220 rows 262 cols
[2021-05-09 07:16:05] [INFO ] Computed 50 place invariants in 2 ms
[2021-05-09 07:16:05] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 220 rows 262 cols
[2021-05-09 07:16:05] [INFO ] Computed 50 place invariants in 10 ms
[2021-05-09 07:16:05] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
// Phase 1: matrix 220 rows 262 cols
[2021-05-09 07:16:06] [INFO ] Computed 50 place invariants in 3 ms
[2021-05-09 07:16:06] [INFO ] Dead Transitions using invariants and state equation in 189 ms returned []
Finished structural reductions, in 1 iterations. Remains : 262/280 places, 220/238 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-08-14 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 3}, { cond=(NOT p0), acceptance={0} source=2 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(NEQ s195 1), p1:(AND (NEQ s192 0) (NEQ s230 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-08-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-08-14 finished in 794 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620544566644

--------------------
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="BusinessProcesses-PT-08"
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 BusinessProcesses-PT-08, 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 r026-tajo-162038143800380"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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