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.r197-smll-162089451800077.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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 RobotManipulation-PT-00500, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-162089451800077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 18K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 156K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 84K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 27 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 14K Mar 27 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 25 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.4K 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 RobotManipulation-PT-00500-00
FORMULA_NAME RobotManipulation-PT-00500-01
FORMULA_NAME RobotManipulation-PT-00500-02
FORMULA_NAME RobotManipulation-PT-00500-03
FORMULA_NAME RobotManipulation-PT-00500-04
FORMULA_NAME RobotManipulation-PT-00500-05
FORMULA_NAME RobotManipulation-PT-00500-06
FORMULA_NAME RobotManipulation-PT-00500-07
FORMULA_NAME RobotManipulation-PT-00500-08
FORMULA_NAME RobotManipulation-PT-00500-09
FORMULA_NAME RobotManipulation-PT-00500-10
FORMULA_NAME RobotManipulation-PT-00500-11
FORMULA_NAME RobotManipulation-PT-00500-12
FORMULA_NAME RobotManipulation-PT-00500-13
FORMULA_NAME RobotManipulation-PT-00500-14
FORMULA_NAME RobotManipulation-PT-00500-15

=== Now, execution of the tool begins

BK_START 1620975194898

Running Version 0
[2021-05-14 06:53:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -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-14 06:53:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 06:53:17] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2021-05-14 06:53:18] [INFO ] Transformed 15 places.
[2021-05-14 06:53:18] [INFO ] Transformed 11 transitions.
[2021-05-14 06:53:18] [INFO ] Parsed PT model containing 15 places and 11 transitions in 131 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 06:53:18] [INFO ] Initial state test concluded for 2 properties.
FORMULA RobotManipulation-PT-00500-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00500-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Applied a total of 0 rules in 17 ms. Remains 15 /15 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 06:53:18] [INFO ] Computed 6 place invariants in 6 ms
[2021-05-14 06:53:18] [INFO ] Implicit Places using invariants in 161 ms returned []
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 06:53:18] [INFO ] Computed 6 place invariants in 5 ms
[2021-05-14 06:53:18] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 06:53:18] [INFO ] Computed 6 place invariants in 2 ms
[2021-05-14 06:53:18] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 1 iterations. Remains : 15/15 places, 11/11 transitions.
[2021-05-14 06:53:18] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2021-05-14 06:53:18] [INFO ] Flatten gal took : 38 ms
FORMULA RobotManipulation-PT-00500-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00500-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-00500-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 06:53:18] [INFO ] Flatten gal took : 8 ms
[2021-05-14 06:53:18] [INFO ] Input system was already deterministic with 11 transitions.
Incomplete random walk after 100130 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=878 ) properties (out of 14) seen :13
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 06:53:19] [INFO ] Computed 6 place invariants in 5 ms
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 3 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 06:53:19] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:53:19] [INFO ] Implicit Places using invariants in 40 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 06:53:19] [INFO ] Computed 3 place invariants in 3 ms
[2021-05-14 06:53:19] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 06:53:19] [INFO ] Computed 3 place invariants in 2 ms
[2021-05-14 06:53:19] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RobotManipulation-PT-00500-00 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(OR (LT s6 1) (LT s9 1)), p0:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 423 ms.
Product exploration explored 100000 steps with 50000 reset in 244 ms.
Knowledge obtained : [p1, (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 50000 reset in 106 ms.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Applying partial POR strategy [true, false]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 12 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 12/12 places, 11/11 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 12 transition count 11
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 12 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 11
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 10 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 10 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 8 rules in 9 ms. Remains 10 /12 variables (removed 2) and now considering 9/11 (removed 2) transitions.
[2021-05-14 06:53:21] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 10 cols
[2021-05-14 06:53:21] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 06:53:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/12 places, 9/11 transitions.
Product exploration explored 100000 steps with 50000 reset in 311 ms.
Product exploration explored 100000 steps with 50000 reset in 241 ms.
[2021-05-14 06:53:21] [INFO ] Flatten gal took : 3 ms
[2021-05-14 06:53:21] [INFO ] Flatten gal took : 2 ms
[2021-05-14 06:53:21] [INFO ] Time to serialize gal into /tmp/LTL4822201184770924272.gal : 103 ms
[2021-05-14 06:53:21] [INFO ] Time to serialize properties into /tmp/LTL12336158920002963964.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/LTL4822201184770924272.gal, -t, CGAL, -LTL, /tmp/LTL12336158920002963964.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/LTL4822201184770924272.gal -t CGAL -LTL /tmp/LTL12336158920002963964.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((p_rdy<1)||(access<1))"))||("((initialize>=1)&&(r_stopped>=1))")))))
Formula 0 simplified : !XF("((initialize>=1)&&(r_stopped>=1))" | G"((p_rdy<1)||(access<1))")
Detected timeout of ITS tools.
[2021-05-14 06:53:36] [INFO ] Flatten gal took : 4 ms
[2021-05-14 06:53:36] [INFO ] Applying decomposition
[2021-05-14 06:53:36] [INFO ] Flatten gal took : 2 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/graph14381592208701950797.txt, -o, /tmp/graph14381592208701950797.bin, -w, /tmp/graph14381592208701950797.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/graph14381592208701950797.bin, -l, -1, -v, -w, /tmp/graph14381592208701950797.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:53:37] [INFO ] Decomposing Gal with order
[2021-05-14 06:53:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:53:37] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-14 06:53:37] [INFO ] Flatten gal took : 34 ms
[2021-05-14 06:53:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2021-05-14 06:53:37] [INFO ] Time to serialize gal into /tmp/LTL6232198812734693849.gal : 2 ms
[2021-05-14 06:53:37] [INFO ] Time to serialize properties into /tmp/LTL7673898117434014353.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/LTL6232198812734693849.gal, -t, CGAL, -LTL, /tmp/LTL7673898117434014353.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/LTL6232198812734693849.gal -t CGAL -LTL /tmp/LTL7673898117434014353.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F((G("((i2.u4.p_rdy<1)||(i0.u3.access<1))"))||("((i2.u0.initialize>=1)&&(u2.r_stopped>=1))")))))
Formula 0 simplified : !XF("((i2.u0.initialize>=1)&&(u2.r_stopped>=1))" | G"((i2.u4.p_rdy<1)||(i0.u3.access<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17926723712750302067
[2021-05-14 06:53:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17926723712750302067
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/ltsmin17926723712750302067]
Compilation finished in 317 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin17926723712750302067]
Link finished in 45 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(<>(([]((LTLAPp0==true))||(LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin17926723712750302067]
LTSmin run took 517 ms.
FORMULA RobotManipulation-PT-00500-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-00500-00 finished in 33911 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 06:53:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:53:53] [INFO ] Implicit Places using invariants in 29 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 06:53:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 06:53:53] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 06:53:53] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 06:53:53] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 06:53:53] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 06:53:53] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : RobotManipulation-PT-00500-02 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s3 1) (LT s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA RobotManipulation-PT-00500-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00500-02 finished in 273 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0 U X(p1))))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 06:53:53] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:53:53] [INFO ] Implicit Places using invariants in 32 ms returned [5, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 06:53:53] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 06:53:53] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 11/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 11 cols
[2021-05-14 06:53:53] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 06:53:53] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : RobotManipulation-PT-00500-03 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=4, aps=[p0:(GEQ s8 1), p1:(LT s6 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, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 122 ms.
Product exploration explored 100000 steps with 33333 reset in 123 ms.
Knowledge obtained : [(NOT p0), p1]
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Product exploration explored 100000 steps with 33333 reset in 95 ms.
Product exploration explored 100000 steps with 33333 reset in 118 ms.
Applying partial POR strategy [false, false, true, true, false]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1)]
Support contains 2 out of 11 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 11/11 places, 11/11 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 2 place count 11 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 11 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 5 place count 10 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 10 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 10 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 7 ms. Remains 10 /11 variables (removed 1) and now considering 10/11 (removed 1) transitions.
[2021-05-14 06:53:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 10 rows 10 cols
[2021-05-14 06:53:54] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 06:53:54] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 1 iterations. Remains : 10/11 places, 10/11 transitions.
Product exploration explored 100000 steps with 33333 reset in 284 ms.
Product exploration explored 100000 steps with 33333 reset in 205 ms.
[2021-05-14 06:53:55] [INFO ] Flatten gal took : 1 ms
[2021-05-14 06:53:55] [INFO ] Flatten gal took : 1 ms
[2021-05-14 06:53:55] [INFO ] Time to serialize gal into /tmp/LTL5074720903957013430.gal : 1 ms
[2021-05-14 06:53:55] [INFO ] Time to serialize properties into /tmp/LTL1186661546152243633.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/LTL5074720903957013430.gal, -t, CGAL, -LTL, /tmp/LTL1186661546152243633.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/LTL5074720903957013430.gal -t CGAL -LTL /tmp/LTL1186661546152243633.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(("(p_rel>=1)")U(X("(p_rdy<1)")))))
Formula 0 simplified : !X("(p_rel>=1)" U X"(p_rdy<1)")
Detected timeout of ITS tools.
[2021-05-14 06:54:10] [INFO ] Flatten gal took : 3 ms
[2021-05-14 06:54:10] [INFO ] Applying decomposition
[2021-05-14 06:54:10] [INFO ] Flatten gal took : 1 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/graph7871418194834145070.txt, -o, /tmp/graph7871418194834145070.bin, -w, /tmp/graph7871418194834145070.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/graph7871418194834145070.bin, -l, -1, -v, -w, /tmp/graph7871418194834145070.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 06:54:10] [INFO ] Decomposing Gal with order
[2021-05-14 06:54:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 06:54:10] [INFO ] Removed a total of 1 redundant transitions.
[2021-05-14 06:54:10] [INFO ] Flatten gal took : 3 ms
[2021-05-14 06:54:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2021-05-14 06:54:10] [INFO ] Time to serialize gal into /tmp/LTL7125755904886984327.gal : 1 ms
[2021-05-14 06:54:10] [INFO ] Time to serialize properties into /tmp/LTL7721935214172206025.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/LTL7125755904886984327.gal, -t, CGAL, -LTL, /tmp/LTL7721935214172206025.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/LTL7125755904886984327.gal -t CGAL -LTL /tmp/LTL7721935214172206025.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(("(u0.p_rel>=1)")U(X("(i3.u3.p_rdy<1)")))))
Formula 0 simplified : !X("(u0.p_rel>=1)" U X"(i3.u3.p_rdy<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15409361791440733227
[2021-05-14 06:54:25] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15409361791440733227
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/ltsmin15409361791440733227]
Compilation finished in 144 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin15409361791440733227]
Link finished in 32 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(((LTLAPp0==true) U X((LTLAPp1==true)))), --buchi-type=spotba], workingDir=/tmp/ltsmin15409361791440733227]
LTSmin run took 318 ms.
FORMULA RobotManipulation-PT-00500-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RobotManipulation-PT-00500-03 finished in 32592 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((p0 U G((X(p1)||((p3 U p4)&&p2)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 06:54:25] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 06:54:26] [INFO ] Implicit Places using invariants in 28 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 29 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 06:54:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:54:26] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Starting structural reductions, iteration 1 : 13/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 13 /13 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 06:54:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:54:26] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Finished structural reductions, in 2 iterations. Remains : 13/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 555 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p4))), (AND (NOT p1) (NOT p4)), (AND (NOT p1) (NOT p4)), true, false, (AND (NOT p1) (NOT p4)), (NOT p4)]
Running random walk in product with property : RobotManipulation-PT-00500-04 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p3) (NOT p0))), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p4) (NOT p3) p0)), acceptance={0} source=0 dest: 3}, { cond=(AND p2 (NOT p4) p3 p0), acceptance={0} source=0 dest: 4}, { cond=(AND p2 (NOT p4) p3 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(OR (NOT p2) (AND (NOT p4) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p4) p3), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p4) (NOT p3) (NOT p0) (NOT p1))), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0 (NOT p1)) (AND (NOT p4) (NOT p3) p0 (NOT p1))), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p4) p3 p0 (NOT p1)), acceptance={0} source=3 dest: 4}, { cond=(AND p2 (NOT p4) p3 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p4) (NOT p3) p0 (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p4) (NOT p3) p0 (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p4) p3 p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p4) p3 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p4) p3 p0 (NOT p1)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p4) p3 (NOT p0) (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p4) (NOT p3) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p4) p3 (NOT p1)), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p4) (NOT p3) p0 p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p1), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p4) (NOT p3) (NOT p0) p1), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p4) (NOT p3) p0 p1), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p4) p3 p0 p1), acceptance={0} source=7 dest: 4}, { cond=(AND (NOT p4) p3 (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p4) p3 p0 p1), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p4) p3 (NOT p0) p1), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p4) p3), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p4) p3), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(GEQ s9 1), p2:(AND (GEQ s11 1) (GEQ s12 1)), p4:(AND (GEQ s1 1) (GEQ s5 1)), p3:(GEQ s10 1), p1:(AND (GEQ s11 1) (GEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00500-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00500-04 finished in 695 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(X(G(p0)))&&F(p1)))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 06:54:26] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:54:26] [INFO ] Implicit Places using invariants in 22 ms returned [10]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 06:54:26] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 06:54:26] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 06:54:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 06:54:26] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 06:54:26] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 06:54:26] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : RobotManipulation-PT-00500-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s5 1)), p0:(GEQ s10 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]]
Entered a terminal (fully accepting) state of product in 13952 steps with 0 reset in 15 ms.
FORMULA RobotManipulation-PT-00500-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00500-06 finished in 333 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(X(F(p0)))||(!p1&&(G(p0)||X(G(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 06:54:27] [INFO ] Computed 5 place invariants in 1 ms
[2021-05-14 06:54:27] [INFO ] Implicit Places using invariants in 28 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 06:54:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 06:54:27] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 2 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 06:54:27] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 06:54:27] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 06:54:27] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 06:54:27] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : RobotManipulation-PT-00500-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s10 1), p2:(OR (LT s2 1) (LT s8 1)), p0:(LT s5 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 24916 reset in 382 ms.
Stack based approach found an accepted trace after 12820 steps with 3205 reset with depth 11 and stack size 11 in 71 ms.
FORMULA RobotManipulation-PT-00500-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00500-07 finished in 833 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((X(!p1)||p0))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 06:54:27] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 06:54:27] [INFO ] Implicit Places using invariants in 27 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 06:54:27] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 06:54:27] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Starting structural reductions, iteration 1 : 13/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 12 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Applied a total of 2 rules in 1 ms. Remains 12 /13 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 12 cols
[2021-05-14 06:54:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:54:27] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 10 rows 12 cols
[2021-05-14 06:54:27] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:54:27] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 116 ms :[p1, (AND p1 (NOT p0)), (AND (NOT p0) p1), true]
Running random walk in product with property : RobotManipulation-PT-00500-10 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s5 1)), p1:(OR (LT s2 1) (LT s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 40 steps with 0 reset in 0 ms.
FORMULA RobotManipulation-PT-00500-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00500-10 finished in 260 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((X((X(!p1)&&p0))||(X(!p2) U G(p1)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 14 transition count 11
Applied a total of 1 rules in 1 ms. Remains 14 /15 variables (removed 1) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 14 cols
[2021-05-14 06:54:28] [INFO ] Computed 5 place invariants in 0 ms
[2021-05-14 06:54:28] [INFO ] Implicit Places using invariants in 18 ms returned [5, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 19 ms to find 2 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 06:54:28] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 06:54:28] [INFO ] Dead Transitions using invariants and state equation in 19 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 11 transition count 10
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 10
Applied a total of 2 rules in 1 ms. Remains 11 /12 variables (removed 1) and now considering 10/11 (removed 1) transitions.
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 06:54:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 06:54:28] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 11 cols
[2021-05-14 06:54:28] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 06:54:28] [INFO ] Implicit Places using invariants and state equation in 23 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 : 11/15 places, 10/11 transitions.
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false]
Running random walk in product with property : RobotManipulation-PT-00500-11 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LT s5 1), p0:(AND (GEQ s2 1) (GEQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1502 reset in 140 ms.
Stack based approach found an accepted trace after 39 steps with 0 reset with depth 40 and stack size 38 in 0 ms.
FORMULA RobotManipulation-PT-00500-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00500-11 finished in 341 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((G(!p0)||G(!p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 12 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 12 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 10 transition count 8
Applied a total of 8 rules in 7 ms. Remains 10 /15 variables (removed 5) and now considering 8/11 (removed 3) transitions.
// Phase 1: matrix 8 rows 10 cols
[2021-05-14 06:54:28] [INFO ] Computed 4 place invariants in 0 ms
[2021-05-14 06:54:28] [INFO ] Implicit Places using invariants in 22 ms returned [4, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 23 ms to find 2 implicit places.
[2021-05-14 06:54:28] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 8 rows 8 cols
[2021-05-14 06:54:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 06:54:28] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 8/15 places, 8/11 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 7 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 6 transition count 6
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 06:54:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 06:54:28] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 06:54:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 06:54:28] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 6/15 places, 6/11 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND p0 p1)]
Running random walk in product with property : RobotManipulation-PT-00500-12 automaton TGBA [mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LT s3 1), p1:(OR (LT s4 1) (LT s5 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 269 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA RobotManipulation-PT-00500-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00500-12 finished in 448 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 13 transition count 9
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 11 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 11 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 10 transition count 8
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 8 transition count 6
Applied a total of 12 rules in 6 ms. Remains 8 /15 variables (removed 7) and now considering 6/11 (removed 5) transitions.
// Phase 1: matrix 6 rows 8 cols
[2021-05-14 06:54:28] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:54:28] [INFO ] Implicit Places using invariants in 15 ms returned [6, 7]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 16 ms to find 2 implicit places.
[2021-05-14 06:54:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 6 cols
[2021-05-14 06:54:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 06:54:28] [INFO ] Dead Transitions using invariants and state equation in 20 ms returned []
Starting structural reductions, iteration 1 : 6/15 places, 6/11 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 5 transition count 5
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 5
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5 transition count 5
Applied a total of 3 rules in 3 ms. Remains 5 /6 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 5 cols
[2021-05-14 06:54:28] [INFO ] Computed 2 place invariants in 0 ms
[2021-05-14 06:54:28] [INFO ] Implicit Places using invariants in 14 ms returned []
// Phase 1: matrix 5 rows 5 cols
[2021-05-14 06:54:28] [INFO ] Computed 2 place invariants in 1 ms
[2021-05-14 06:54:28] [INFO ] Implicit Places using invariants and state equation in 14 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 5/15 places, 5/11 transitions.
Stuttering acceptance computed with spot in 159 ms :[p0, p0]
Running random walk in product with property : RobotManipulation-PT-00500-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s3 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]]
Product exploration explored 100000 steps with 11879 reset in 276 ms.
Stack based approach found an accepted trace after 41 steps with 8 reset with depth 7 and stack size 7 in 0 ms.
FORMULA RobotManipulation-PT-00500-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00500-13 finished in 534 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((F(p0)&&F(G((p1 U X(p2)))))))], workingDir=/home/mcc/execution]
Support contains 4 out of 15 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 15/15 places, 11/11 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 11
Applied a total of 2 rules in 1 ms. Remains 13 /15 variables (removed 2) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 13 cols
[2021-05-14 06:54:29] [INFO ] Computed 4 place invariants in 1 ms
[2021-05-14 06:54:29] [INFO ] Implicit Places using invariants in 32 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 33 ms to find 1 implicit places.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 06:54:29] [INFO ] Computed 3 place invariants in 1 ms
[2021-05-14 06:54:29] [INFO ] Dead Transitions using invariants and state equation in 47 ms returned []
Starting structural reductions, iteration 1 : 12/15 places, 11/11 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 11/11 (removed 0) transitions.
// Phase 1: matrix 11 rows 12 cols
[2021-05-14 06:54:29] [INFO ] Computed 3 place invariants in 0 ms
[2021-05-14 06:54:29] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Finished structural reductions, in 2 iterations. Remains : 12/15 places, 11/11 transitions.
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : RobotManipulation-PT-00500-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p1, acceptance={0} source=2 dest: 3}, { cond=(NOT p1), acceptance={0} source=2 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s7 1), p1:(OR (LT s6 1) (LT s9 1)), p2:(GEQ s8 1)], 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 4057 reset in 110 ms.
Stack based approach found an accepted trace after 266 steps with 13 reset with depth 12 and stack size 12 in 2 ms.
FORMULA RobotManipulation-PT-00500-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RobotManipulation-PT-00500-15 finished in 440 ms.
All properties solved without resorting to model-checking.

BK_STOP 1620975271053

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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 LTLFireability -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="RobotManipulation-PT-00500"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
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 RobotManipulation-PT-00500, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r197-smll-162089451800077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RobotManipulation-PT-00500.tgz
mv RobotManipulation-PT-00500 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;