About the Execution of ITS-Tools for GlobalResAllocation-COL-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 916.144 | 26537.00 | 49149.00 | 347.60 | FFTFFFTFFFFFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477100044.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-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 GlobalResAllocation-COL-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477100044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 300K
-rw-r--r-- 1 mcc users 9.6K Apr 30 03:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 30 03:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 03:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 30 03:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 9 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 29K May 10 09:34 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 GlobalResAllocation-COL-10-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652685921550
Running Version 202205111006
[2022-05-16 07:25:23] [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]
[2022-05-16 07:25:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 07:25:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-16 07:25:24] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-16 07:25:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 982 ms
[2022-05-16 07:25:25] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 250 PT places and 1688410.0 transition bindings in 28 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
[2022-05-16 07:25:25] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 8 ms.
[2022-05-16 07:25:25] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA GlobalResAllocation-COL-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-10-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-10-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 11 steps, including 0 resets, run visited all 2 properties in 8 ms. (steps per millisecond=1 )
[2022-05-16 07:25:25] [INFO ] Flatten gal took : 29 ms
[2022-05-16 07:25:25] [INFO ] Flatten gal took : 4 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 20
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2022-05-16 07:25:25] [INFO ] Unfolded HLPN to a Petri net with 41 places and 70 transitions 290 arcs in 20 ms.
[2022-05-16 07:25:25] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GlobalResAllocation-COL-10-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-10-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 70/70 transitions.
Reduce isomorphic (modulo) transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 41 transition count 60
Applied a total of 20 rules in 10 ms. Remains 41 /41 variables (removed 0) and now considering 60/70 (removed 10) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:25] [INFO ] Computed 21 place invariants in 15 ms
[2022-05-16 07:25:25] [INFO ] Dead Transitions using invariants and state equation in 262 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:25] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-16 07:25:25] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:25] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:25] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 143 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:25] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:26] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 41/41 places, 60/70 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/70 transitions.
Support contains 41 out of 41 places after structural reductions.
[2022-05-16 07:25:26] [INFO ] Flatten gal took : 23 ms
[2022-05-16 07:25:26] [INFO ] Flatten gal took : 24 ms
[2022-05-16 07:25:26] [INFO ] Input system was already deterministic with 60 transitions.
Finished random walk after 1469 steps, including 0 resets, run visited all 10 properties in 73 ms. (steps per millisecond=20 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X((G(p0) U X(!p1))))))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 5 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:26] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 07:25:26] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:26] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:26] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:26] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 07:25:26] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:26] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:27] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 527 ms :[p1, p1, p1, p1, true, (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s10 4)) (AND (GEQ s9 1) (GEQ s10 4)) (AND (GEQ s3 1) (GEQ s10 4)) (AND (GEQ s4 1) (GEQ s10 4)) (AND (GEQ s7 1) (GEQ s10 4)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 61 steps with 12 reset in 5 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-01 finished in 937 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&F(p1))))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 10 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:27] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:27] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:27] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:27] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:27] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 07:25:27] [INFO ] Implicit Places using invariants and state equation in 81 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
[2022-05-16 07:25:27] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:27] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:28] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s3 1) (LT s10 1)) (OR (LT s4 1) (LT s10 1)) (OR (LT s5 1) (LT s10 1)) (OR (LT s8 1) (LT s10 1)) (OR (LT s9 1) (LT s10 1)) (OR (LT s1 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 3 reset in 724 ms.
Stack based approach found an accepted trace after 121 steps with 2 reset with depth 103 and stack size 103 in 2 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-03 finished in 1272 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U F(!X(X(p1))))||X(G(p0))||G(p1)))'
Support contains 30 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:28] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:25:28] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:28] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:29] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:29] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:25:29] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:29] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:25:29] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 244 ms :[p1, false, (AND p1 (NOT p0)), false, (AND p1 (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(OR (GEQ s35 4) (GEQ s36 4) (GEQ s38 4) (GEQ s37 4) (GEQ s40 4) (GEQ s39 4) (GEQ s31 4) (GEQ s32 4) (GEQ s33 4) (GEQ s34 4)), p0:(OR (AND (GEQ s20 2) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 29252 reset in 689 ms.
Stack based approach found an accepted trace after 1378 steps with 395 reset with depth 137 and stack size 137 in 12 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-04 finished in 1281 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(X(G(p0)))||!p1) U !p1))'
Support contains 41 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:30] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:30] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:30] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-16 07:25:30] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:30] [INFO ] Computed 21 place invariants in 7 ms
[2022-05-16 07:25:30] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:30] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:30] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), true, p1, (OR (NOT p0) p1)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (OR (AND (GEQ s20 2) (GEQ s30 2)) (AND (GEQ s11 2) (GEQ s21 2)) (AND (GEQ s13 2) (GEQ s23 2)) (AND (GEQ s15 2) (GEQ s25 2)) (AND (GEQ s17 2) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-05 finished in 597 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X((F(p0)||F(p1))))&&X((F(p1) U p2))))'
Support contains 21 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 3 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:30] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:30] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:30] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-16 07:25:30] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:30] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 07:25:31] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:31] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:31] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s10 4)) (AND (GEQ s9 1) (GEQ s10 4)) (AND (GEQ s3 1) (GEQ s10 4)) (AND (GEQ s4 1) (GEQ s10 4)) (AND (GEQ s7 1) (GEQ s10 4)) (A...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 739 ms.
Product exploration explored 100000 steps with 50000 reset in 441 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (X p2)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) p2)))
Knowledge based reduction with 8 factoid took 171 ms. Reduced automaton from 5 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA GlobalResAllocation-COL-10-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-10-LTLFireability-06 finished in 1966 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(X(X(X(p0)))))))'
Support contains 20 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:32] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:32] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:32] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:32] [INFO ] Implicit Places using invariants in 68 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:32] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:33] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:33] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:25:33] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 266 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-07 automaton TGBA Formula[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}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (OR (LT s20 2) (LT s30 2)) (OR (LT s11 2) (LT s21 2)) (OR (LT s13 2) (LT s23 2)) (OR (LT s15 2) (LT s25 2)) (OR (LT s17 2) (LT s27 2)) (OR (LT s19...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-07 finished in 630 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!(F(p0) U (G(p0)||p1))&&X(X(X(p2)))))))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 31 transition count 60
Applied a total of 10 rules in 2 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:33] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:33] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:33] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:33] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:33] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 07:25:33] [INFO ] Implicit Places using invariants and state equation in 69 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:33] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:33] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 31/41 places, 60/60 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 1856 ms :[(OR (NOT p2) p1 p0), (OR (NOT p2) p1 p0), p0, (NOT p2), p0, p1, p0, (AND p0 (NOT p2)), (NOT p2), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (OR (AND p0 (NOT p2)) (AND p1 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), (NOT p2), (NOT p2), (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 5}], [{ cond=(AND p0 p1), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={1} source=2 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 7}, { cond=(NOT p1), acceptance={0, 1} source=3 dest: 8}, { cond=p1, acceptance={0, 1} source=3 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 10}], [{ cond=p0, acceptance={0, 1} source=4 dest: 4}], [{ cond=p1, acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p1), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p0) p1), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 12}, { cond=(AND (NOT p0) p1), acceptance={1} source=7 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 14}, { cond=(AND p0 p1), acceptance={0, 1} source=7 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 16}, { cond=(NOT p1), acceptance={0, 1} source=8 dest: 17}, { cond=p1, acceptance={0, 1} source=8 dest: 18}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 19}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 14}, { cond=p1, acceptance={0, 1} source=9 dest: 15}, { cond=(NOT p1), acceptance={0, 1} source=9 dest: 20}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 12}, { cond=(AND p0 (NOT p1)), acceptance={0} source=10 dest: 14}, { cond=p1, acceptance={0, 1} source=10 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=11 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=11 dest: 8}, { cond=(AND p0 p1), acceptance={0, 1} source=11 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=11 dest: 10}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=11 dest: 21}, { cond=(AND (NOT p0) p1), acceptance={1} source=11 dest: 22}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=12 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=12 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=12 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=12 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=12 dest: 6}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=13 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=13 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=13 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=13 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=13 dest: 5}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=13 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=13 dest: 11}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=14 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=14 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=14 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=14 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0, 1} source=15 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=15 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=15 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=15 dest: 4}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=15 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=16 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=16 dest: 13}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=16 dest: 14}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=16 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=17 dest: 16}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=17 dest: 17}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=17 dest: 18}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=17 dest: 19}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=18 dest: 12}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=18 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=18 dest: 15}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=18 dest: 20}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=19 dest: 12}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=19 dest: 14}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=19 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=20 dest: 7}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=20 dest: 8}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=20 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=20 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=21 dest: 16}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=21 dest: 17}, { cond=(AND p0 p1), acceptance={0, 1} source=21 dest: 18}, { cond=(AND p0 (NOT p1)), acceptance={0} source=21 dest: 19}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=21 dest: 23}, { cond=(AND (NOT p0) p1), acceptance={1} source=21 dest: 24}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=22 dest: 12}, { cond=(AND (NOT p0) p1), acceptance={1} source=22 dest: 13}, { cond=(AND p0 (NOT p1)), acceptance={0} source=22 dest: 14}, { cond=(AND p0 p1), acceptance={0, 1} source=22 dest: 15}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=22 dest: 20}, { cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=22 dest: 25}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=23 dest: 16}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=23 dest: 17}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=23 dest: 18}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=23 dest: 19}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=23 dest: 23}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=23 dest: 24}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=24 dest: 12}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=24 dest: 13}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=24 dest: 14}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=24 dest: 15}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=24 dest: 20}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=24 dest: 25}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=25 dest: 7}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=25 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0, 1} source=25 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=25 dest: 10}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={1} source=25 dest: 21}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={1} source=25 dest: 22}]], initial=0, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s10 3)) (AND (GEQ s3 1) (GEQ s10 3)) (AND (GEQ s6 1) (GEQ s10 3)) (AND (GEQ s9 1) (GEQ s10 3)) (AND (GEQ s5 1) (GEQ s10 3)) (A...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2157 reset in 784 ms.
Stack based approach found an accepted trace after 1152 steps with 17 reset with depth 90 and stack size 90 in 16 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-08 finished in 3039 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(F((F(X(p0))&&X(p1))))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 1 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:36] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:36] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:36] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:36] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:36] [INFO ] Computed 21 place invariants in 5 ms
[2022-05-16 07:25:36] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:36] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:36] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (GEQ s20 2) (GEQ s30 2)) (AND (GEQ s11 2) (GEQ s21 2)) (AND (GEQ s13 2) (GEQ s23 2)) (AND (GEQ s15 2) (GEQ s25 2)) (AND (GEQ s17 2) (GEQ s27 2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 32211 reset in 325 ms.
Product exploration explored 100000 steps with 32229 reset in 338 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0)]
Knowledge based reduction with 2 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:38] [INFO ] Computed 21 place invariants in 1 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1), (X (X p1))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 2 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 1 edges and 0 AP.
FORMULA GlobalResAllocation-COL-10-LTLFireability-09 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-10-LTLFireability-09 finished in 1940 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((X(p1)&&p1)||p0))))'
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:38] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:38] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:38] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:38] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:38] [INFO ] Computed 21 place invariants in 0 ms
[2022-05-16 07:25:38] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-16 07:25:38] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:38] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:38] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s20 2) (GEQ s30 2)) (AND (GEQ s11 2) (GEQ s21 2)) (AND (GEQ s13 2) (GEQ s23 2)) (AND (GEQ s15 2) (GEQ s25 2)) (AND (GEQ s17 2) (GEQ s27 2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 313 ms.
Product exploration explored 100000 steps with 0 reset in 479 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 9 factoid took 412 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 662 steps, including 0 resets, run visited all 5 properties in 51 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND p0 p1)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 585 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 31 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:40] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:40] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:40] [INFO ] Computed 21 place invariants in 3 ms
[2022-05-16 07:25:40] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:40] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-16 07:25:40] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
[2022-05-16 07:25:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 41 cols
[2022-05-16 07:25:40] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-16 07:25:40] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 41/41 places, 60/60 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X p0), (X (AND p1 p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 9 factoid took 410 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3333 steps, including 0 resets, run visited all 5 properties in 32 ms. (steps per millisecond=104 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X p0), (X (AND p1 p0)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND (NOT p1) (NOT p0))), (F (NOT p0)), (F (AND p1 (NOT p0))), (F p1), (F (AND p1 p0))]
Knowledge based reduction with 9 factoid took 503 ms. Reduced automaton from 2 states, 6 edges and 2 AP to 2 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 488 ms.
Product exploration explored 100000 steps with 0 reset in 683 ms.
Built C files in :
/tmp/ltsmin16259009384540736102
[2022-05-16 07:25:43] [INFO ] Computing symmetric may disable matrix : 60 transitions.
[2022-05-16 07:25:43] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:25:43] [INFO ] Computing symmetric may enable matrix : 60 transitions.
[2022-05-16 07:25:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:25:43] [INFO ] Computing Do-Not-Accords matrix : 60 transitions.
[2022-05-16 07:25:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 07:25:43] [INFO ] Built C files in 31ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16259009384540736102
Running compilation step : cd /tmp/ltsmin16259009384540736102;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 568 ms.
Running link step : cd /tmp/ltsmin16259009384540736102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin16259009384540736102;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11665133538661045290.hoa' '--buchi-type=spotba'
LTSmin run took 2094 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-COL-10-LTLFireability-10 finished in 7845 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 3 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:46] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:46] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:46] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:46] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:46] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-16 07:25:46] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:46] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 07:25:46] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-13 automaton TGBA Formula[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 (OR (LT s0 1) (LT s10 4)) (OR (LT s9 1) (LT s10 4)) (OR (LT s3 1) (LT s10 4)) (OR (LT s4 1) (LT s10 4)) (OR (LT s7 1) (LT s10 4)) (OR (LT s5 1) (L...], 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 9459 reset in 546 ms.
Stack based approach found an accepted trace after 1415 steps with 136 reset with depth 13 and stack size 13 in 11 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-13 finished in 873 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(X(X(X(F(G(p0))))))))'
Support contains 10 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 60/60 transitions.
Ensure Unique test removed 10 places
Applied a total of 0 rules in 8 ms. Remains 31 /41 variables (removed 10) and now considering 60/60 (removed 0) transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:47] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:47] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:47] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-16 07:25:47] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:47] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-16 07:25:47] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2022-05-16 07:25:47] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 60 rows 31 cols
[2022-05-16 07:25:47] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-16 07:25:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 31/41 places, 60/60 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-10-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s25 4) (GEQ s26 4) (GEQ s28 4) (GEQ s27 4) (GEQ s30 4) (GEQ s29 4) (GEQ s21 4) (GEQ s22 4) (GEQ s23 4) (GEQ s24 4))], nbAcceptance=1, 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 390 ms.
Stack based approach found an accepted trace after 211 steps with 0 reset with depth 212 and stack size 211 in 1 ms.
FORMULA GlobalResAllocation-COL-10-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-10-LTLFireability-14 finished in 815 ms.
All properties solved by simple procedures.
Total runtime 24159 ms.
BK_STOP 1652685948087
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ 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
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -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=@none -Xss128m -Xms40m -Xmx8192m
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="GlobalResAllocation-COL-10"
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 GlobalResAllocation-COL-10, 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 r114-smll-165264477100044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GlobalResAllocation-COL-10.tgz
mv GlobalResAllocation-COL-10 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 '
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 ;