Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2022-input.r186-tajo-165281572600676.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2022-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ResAllocation-PT-R015C002, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r186-tajo-165281572600676
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 280K
-rw-r--r-- 1 mcc users 6.4K Apr 30 02:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Apr 30 02:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 30 02:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 30 02:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 08:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 08:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 9 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 64K 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 ResAllocation-PT-R015C002-LTLFireability-00
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-01
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-02
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-03
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-04
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-05
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-06
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-07
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-08
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-09
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-10
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-11
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-12
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-13
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-14
FORMULA_NAME ResAllocation-PT-R015C002-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653088589945

Running Version 202205111006
[2022-05-20 23:16:31] [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-20 23:16:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 23:16:31] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-20 23:16:31] [INFO ] Transformed 60 places.
[2022-05-20 23:16:31] [INFO ] Transformed 32 transitions.
[2022-05-20 23:16:31] [INFO ] Parsed PT model containing 60 places and 32 transitions in 211 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA ResAllocation-PT-R015C002-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ResAllocation-PT-R015C002-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 60 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 60/60 places, 32/32 transitions.
Applied a total of 0 rules in 12 ms. Remains 60 /60 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 60 cols
[2022-05-20 23:16:31] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-20 23:16:31] [INFO ] Implicit Places using invariants in 163 ms returned [33, 35, 47]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 200 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 57/60 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 57/60 places, 32/32 transitions.
Support contains 46 out of 57 places after structural reductions.
[2022-05-20 23:16:32] [INFO ] Flatten gal took : 25 ms
[2022-05-20 23:16:32] [INFO ] Flatten gal took : 9 ms
[2022-05-20 23:16:32] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10000 steps, including 145 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :1
Finished Best-First random walk after 127 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=63 )
FORMULA ResAllocation-PT-R015C002-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(((p0 U p1)||G(X(((G(p3) U p3)&&p2)))))'
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 57 cols
[2022-05-20 23:16:32] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-20 23:16:32] [INFO ] Implicit Places using invariants in 62 ms returned [31, 37, 39, 43, 46, 48, 50, 52, 54, 56]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 66 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/57 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/57 places, 32/32 transitions.
Stuttering acceptance computed with spot in 391 ms :[true, (NOT p1), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (NOT p3) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3)))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p3), acceptance={} source=3 dest: 3}], [{ cond=(OR (AND (NOT p1) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=4 dest: 0}, { cond=(OR (AND (NOT p1) p0 (NOT p2)) (AND (NOT p1) p0 (NOT p3))), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2 p3), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0 p2 p3), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s7 1) (GEQ s34 1) (GEQ s35 1)), p0:(OR (NOT (AND (GEQ s2 1) (GEQ s5 1))) (AND (GEQ s7 1) (GEQ s34 1) (GEQ s35 1))), p2:(AND (GEQ s7 1) (GEQ s...], 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]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 2 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-00 finished in 521 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 57 cols
[2022-05-20 23:16:33] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-20 23:16:33] [INFO ] Implicit Places using invariants in 99 ms returned [35, 37, 39, 41, 43, 46, 48, 50, 52, 54, 56]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 101 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 46/57 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 46 /46 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 46/57 places, 32/32 transitions.
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s31 1) (GEQ s32 1)), p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 32204 reset in 262 ms.
Stuttering criterion allowed to conclude after 4506 steps with 1457 reset in 7 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-04 finished in 487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(((X(p1)||p2)&&p0))&&F(p1)))'
Support contains 9 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 57 cols
[2022-05-20 23:16:33] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-20 23:16:33] [INFO ] Implicit Places using invariants in 54 ms returned [31, 35, 39, 41, 43, 46, 48, 50, 56]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 55 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/57 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 48/57 places, 32/32 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s35 1) (GEQ s36 1)), p0:(AND (GEQ s27 1) (GEQ s46 1) (GEQ s47 1)), p2:(AND (GEQ s25 1) (GEQ s44 1) (GEQ s45 1))], 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]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-05 finished in 239 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 54 transition count 30
Applied a total of 5 rules in 12 ms. Remains 54 /57 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 54 cols
[2022-05-20 23:16:33] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-20 23:16:34] [INFO ] Implicit Places using invariants in 62 ms returned [32, 34, 36, 38, 40, 43, 45, 47, 49, 51, 53]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 64 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/57 places, 30/32 transitions.
Applied a total of 0 rules in 15 ms. Remains 43 /43 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 43/57 places, 30/32 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-06 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 (GEQ s6 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 248 steps with 13 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-06 finished in 179 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(p0)))'
Support contains 2 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 57 cols
[2022-05-20 23:16:34] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-20 23:16:34] [INFO ] Implicit Places using invariants in 74 ms returned [31, 35, 37, 39, 41, 43, 46, 48, 50, 52, 54, 56]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 76 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 45/57 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 45 /45 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 45/57 places, 32/32 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s7 1))], 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][false, false]]
Stuttering criterion allowed to conclude after 891 steps with 86 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-09 finished in 155 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(F((!(p1 U p2)||p0)))))))'
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 54 transition count 30
Applied a total of 5 rules in 9 ms. Remains 54 /57 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 54 cols
[2022-05-20 23:16:34] [INFO ] Computed 26 place invariants in 1 ms
[2022-05-20 23:16:34] [INFO ] Implicit Places using invariants in 46 ms returned [32, 34, 36, 38, 40, 43, 45, 49, 51, 53]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 47 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/57 places, 30/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 44/57 places, 30/32 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s23 1) (LT s40 1) (LT s41 1) (LT s2 1) (LT s5 1)), p2:(AND (GEQ s14 1) (GEQ s17 1)), p1:(AND (GEQ s2 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1521 reset in 234 ms.
Product exploration explored 100000 steps with 1500 reset in 198 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 p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 351 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 99 steps, including 1 resets, run visited all 2 properties in 3 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 359 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Support contains 7 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 30/30 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:36] [INFO ] Computed 16 place invariants in 14 ms
[2022-05-20 23:16:36] [INFO ] Implicit Places using invariants in 75 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:36] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:16:36] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2022-05-20 23:16:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 30 rows 44 cols
[2022-05-20 23:16:36] [INFO ] Computed 16 place invariants in 1 ms
[2022-05-20 23:16:36] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 44/44 places, 30/30 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 p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Finished random walk after 475 steps, including 7 resets, run visited all 2 properties in 4 ms. (steps per millisecond=118 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p2)), (F (AND p1 (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 401 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) p2), (AND (NOT p0) p2)]
Product exploration explored 100000 steps with 1510 reset in 169 ms.
Product exploration explored 100000 steps with 1533 reset in 171 ms.
Built C files in :
/tmp/ltsmin16930793964617523338
[2022-05-20 23:16:37] [INFO ] Computing symmetric may disable matrix : 30 transitions.
[2022-05-20 23:16:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:16:37] [INFO ] Computing symmetric may enable matrix : 30 transitions.
[2022-05-20 23:16:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:16:37] [INFO ] Computing Do-Not-Accords matrix : 30 transitions.
[2022-05-20 23:16:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 23:16:37] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16930793964617523338
Running compilation step : cd /tmp/ltsmin16930793964617523338;'/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 272 ms.
Running link step : cd /tmp/ltsmin16930793964617523338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16930793964617523338;'/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/stateBased1954645714568041884.hoa' '--buchi-type=spotba'
LTSmin run took 5794 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R015C002-LTLFireability-10 finished in 9603 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(G((F(p0)||F(p1))))&&!(p2 U p3))))'
Support contains 10 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Applied a total of 0 rules in 5 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 57 cols
[2022-05-20 23:16:43] [INFO ] Computed 27 place invariants in 0 ms
[2022-05-20 23:16:44] [INFO ] Implicit Places using invariants in 53 ms returned [35, 37, 39, 41, 43, 46, 50, 52, 54]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 54 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 48/57 places, 32/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 48 /48 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 48/57 places, 32/32 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR p3 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p3]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(OR p3 p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p3) p2), acceptance={} source=3 dest: 3}, { cond=p3, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s21 1) (LT s42 1) (LT s43 1)), p1:(OR (LT s14 1) (LT s17 1)), p3:(AND (GEQ s29 1) (GEQ s47 1)), p2:(AND (GEQ s1 1) (GEQ s31 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2973 reset in 157 ms.
Product exploration explored 100000 steps with 3000 reset in 193 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 p1 p3 (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 6 factoid took 375 ms. Reduced automaton from 4 states, 8 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 167 ms :[(OR p3 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p3]
Incomplete random walk after 10000 steps, including 145 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :2
Finished Best-First random walk after 900 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=300 )
Knowledge obtained : [(AND p0 p1 p3 (NOT p2)), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (F (AND (NOT p0) (NOT p1))), (F (NOT p3)), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 419 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 218 ms :[(OR p3 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p3]
Stuttering acceptance computed with spot in 219 ms :[(OR p3 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p3]
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:16:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 23:16:46] [INFO ] [Real]Absence check using 18 positive place invariants in 5 ms returned sat
[2022-05-20 23:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:46] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2022-05-20 23:16:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:16:46] [INFO ] [Nat]Absence check using 18 positive place invariants in 4 ms returned sat
[2022-05-20 23:16:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-20 23:16:46] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 3 ms.
[2022-05-20 23:16:46] [INFO ] Added : 25 causal constraints over 5 iterations in 44 ms. Result :sat
Could not prove EG p3
Support contains 10 out of 48 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:16:46] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-20 23:16:46] [INFO ] Implicit Places using invariants in 47 ms returned []
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:16:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 23:16:46] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 155 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:16:46] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 23:16:46] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 32/32 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 p0 p1 (NOT p2) p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3)))]
Knowledge based reduction with 6 factoid took 346 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 207 ms :[(OR p3 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p3]
Incomplete random walk after 10000 steps, including 146 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :2
Finished Best-First random walk after 338 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=169 )
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p3)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p3)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X p3)), (X (X (NOT p3))), (F (AND (NOT p0) (NOT p1))), (F (NOT p3)), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 4 states, 7 edges and 4 AP to 4 states, 7 edges and 4 AP.
Stuttering acceptance computed with spot in 142 ms :[(OR p3 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p3]
Stuttering acceptance computed with spot in 129 ms :[(OR p3 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p3]
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:16:47] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 23:16:47] [INFO ] [Real]Absence check using 18 positive place invariants in 4 ms returned sat
[2022-05-20 23:16:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:47] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2022-05-20 23:16:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 23:16:47] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-20 23:16:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 23:16:47] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2022-05-20 23:16:47] [INFO ] Computed and/alt/rep : 30/30/30 causal constraints (skipped 0 transitions) in 30 ms.
[2022-05-20 23:16:48] [INFO ] Added : 25 causal constraints over 5 iterations in 242 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 176 ms :[(OR p3 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p3]
Product exploration explored 100000 steps with 2940 reset in 133 ms.
Product exploration explored 100000 steps with 2967 reset in 175 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 113 ms :[(OR p3 (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), p3]
Support contains 10 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 32/32 transitions.
Applied a total of 0 rules in 11 ms. Remains 48 /48 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2022-05-20 23:16:48] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:16:49] [INFO ] Computed 18 place invariants in 17 ms
[2022-05-20 23:16:49] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 32/32 transitions.
Product exploration explored 100000 steps with 3123 reset in 204 ms.
Product exploration explored 100000 steps with 2968 reset in 242 ms.
Built C files in :
/tmp/ltsmin16652983894003371428
[2022-05-20 23:16:49] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16652983894003371428
Running compilation step : cd /tmp/ltsmin16652983894003371428;'/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 145 ms.
Running link step : cd /tmp/ltsmin16652983894003371428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin16652983894003371428;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15556430048918847064.hoa' '--buchi-type=spotba'
LTSmin run took 4854 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R015C002-LTLFireability-11 finished in 10672 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(p0)&&p1))||X(X(p2))))'
Support contains 8 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 57 cols
[2022-05-20 23:16:54] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-20 23:16:54] [INFO ] Implicit Places using invariants in 68 ms returned [31, 35, 37, 39, 46, 48, 50, 52, 54, 56]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 69 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/57 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 47/57 places, 32/32 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), true, (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (LT s8 1) (LT s11 1)), p2:(AND (GEQ s15 1) (GEQ s39 1) (GEQ s40 1)), p0:(OR (LT s13 1) (LT s37 1) (LT s38 1))], 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, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-12 finished in 381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(F(X(p0)) U (X(p2)&&p1)))&&X(F(p3))))'
Support contains 11 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 57 cols
[2022-05-20 23:16:54] [INFO ] Computed 27 place invariants in 0 ms
[2022-05-20 23:16:55] [INFO ] Implicit Places using invariants in 55 ms returned [31, 35, 37, 41, 48, 50, 52, 54, 56]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 56 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 48/57 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 48/57 places, 32/32 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p3) (AND p1 p2)), (NOT p3), (AND p0 p1 p2), (AND p1 p2), (AND p0 p1 p2)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(NOT p3), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={1} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=p2, acceptance={1} source=3 dest: 2}, { cond=(AND p1 p2), acceptance={0, 1} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={1} source=4 dest: 2}, { cond=(AND p1 p0 p2), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s19 1) (GEQ s42 1) (GEQ s43 1)), p3:(OR (LT s11 1) (LT s36 1) (LT s37 1)), p0:(AND (GEQ s15 1) (GEQ s39 1) (GEQ s40 1)), p2:(AND (GEQ s26 1) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 6989 reset in 149 ms.
Product exploration explored 100000 steps with 7129 reset in 146 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 p1) p3 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0))), (X p3), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X p3)), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 854 ms. Reduced automaton from 5 states, 14 edges and 4 AP to 4 states, 11 edges and 3 AP.
Stuttering acceptance computed with spot in 259 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p1 p2), (AND p0 p1 p2)]
Incomplete random walk after 10000 steps, including 146 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10000 steps, including 28 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:16:57] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-20 23:16:57] [INFO ] [Real]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-20 23:16:57] [INFO ] After 27ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2022-05-20 23:16:57] [INFO ] After 66ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 23:16:57] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2022-05-20 23:16:57] [INFO ] [Nat]Absence check using 18 positive place invariants in 3 ms returned sat
[2022-05-20 23:16:57] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2022-05-20 23:16:57] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2022-05-20 23:16:57] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 9 ms.
Support contains 8 out of 48 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 48/48 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 31
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 47 transition count 30
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 45 transition count 30
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 44 transition count 29
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 44 transition count 28
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 10 place count 42 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 41 transition count 27
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 41 transition count 26
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 15 place count 39 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 17 place count 38 transition count 25
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 38 transition count 24
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 20 place count 36 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 22 place count 35 transition count 23
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 23 place count 35 transition count 22
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 25 place count 33 transition count 22
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 28 place count 31 transition count 21
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 29 place count 31 transition count 20
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 31 place count 29 transition count 20
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 33 place count 28 transition count 19
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 34 place count 28 transition count 18
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 36 place count 26 transition count 18
Applied a total of 36 rules in 31 ms. Remains 26 /48 variables (removed 22) and now considering 18/32 (removed 14) transitions.
Finished structural reductions, in 1 iterations. Remains : 26/48 places, 18/32 transitions.
Incomplete random walk after 10000 steps, including 436 resets, run finished after 365 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 129 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 4) seen :0
Probably explored full state space saw : 1280 states, properties seen :0
Probabilistic random walk after 4928 steps, saw 1280 distinct states, run finished after 70 ms. (steps per millisecond=70 ) properties seen :0
Explored full state space saw : 1280 states, properties seen :0
Exhaustive walk after 4928 steps, saw 1280 distinct states, run finished after 59 ms. (steps per millisecond=83 ) properties seen :0
Found 4 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p3 (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT (AND p1 p0))), (X p3), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p1 p0)))), (X (X p3)), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND p1 p2))), (G (NOT (AND p0 p2))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND p1 p0 p2)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p0) p2)), (F p0), (F (AND p1 (NOT p0))), (F (AND p1 p0))]
Knowledge based reduction with 21 factoid took 1209 ms. Reduced automaton from 4 states, 11 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Stuttering acceptance computed with spot in 179 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Support contains 8 out of 48 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 48/48 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 48 /48 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:17:00] [INFO ] Computed 18 place invariants in 0 ms
[2022-05-20 23:17:00] [INFO ] Implicit Places using invariants in 746 ms returned []
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:17:00] [INFO ] Computed 18 place invariants in 1 ms
[2022-05-20 23:17:01] [INFO ] Implicit Places using invariants and state equation in 74 ms returned []
Implicit Place search using SMT with State Equation took 836 ms to find 0 implicit places.
// Phase 1: matrix 32 rows 48 cols
[2022-05-20 23:17:01] [INFO ] Computed 18 place invariants in 3 ms
[2022-05-20 23:17:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 48/48 places, 32/32 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 p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 391 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 237 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Incomplete random walk after 10000 steps, including 145 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :3
Finished Best-First random walk after 247 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=123 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p2), (F p0), (F (AND (NOT p0) p1)), (F (AND p0 p1))]
Knowledge based reduction with 8 factoid took 433 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 220 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Stuttering acceptance computed with spot in 220 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Stuttering acceptance computed with spot in 211 ms :[(AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2), (AND p0 p1 p2)]
Product exploration explored 100000 steps with 3752 reset in 191 ms.
Product exploration explored 100000 steps with 3851 reset in 200 ms.
Built C files in :
/tmp/ltsmin10422198802158317730
[2022-05-20 23:17:03] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10422198802158317730
Running compilation step : cd /tmp/ltsmin10422198802158317730;'/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 136 ms.
Running link step : cd /tmp/ltsmin10422198802158317730;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin10422198802158317730;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15319377538473633448.hoa' '--buchi-type=spotba'
LTSmin run took 6697 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ResAllocation-PT-R015C002-LTLFireability-14 finished in 15413 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((p0 U p1)))))'
Support contains 7 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 5 place count 54 transition count 30
Applied a total of 5 rules in 5 ms. Remains 54 /57 variables (removed 3) and now considering 30/32 (removed 2) transitions.
// Phase 1: matrix 30 rows 54 cols
[2022-05-20 23:17:10] [INFO ] Computed 26 place invariants in 0 ms
[2022-05-20 23:17:10] [INFO ] Implicit Places using invariants in 106 ms returned [32, 34, 36, 38, 40, 43, 45, 47, 49, 53]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 107 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 44/57 places, 30/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 44 /44 variables (removed 0) and now considering 30/30 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 44/57 places, 30/32 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ResAllocation-PT-R015C002-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s10 1) (GEQ s13 1)) (AND (GEQ s20 1) (GEQ s23 1)) (AND (GEQ s27 1) (GEQ s42 1) (GEQ s43 1))), p0:(AND (GEQ s27 1) (GEQ s42 1) (GEQ s43 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 64 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R015C002-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R015C002-LTLFireability-15 finished in 230 ms.
All properties solved by simple procedures.
Total runtime 39349 ms.

BK_STOP 1653088630791

--------------------
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="ResAllocation-PT-R015C002"
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 ResAllocation-PT-R015C002, 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 r186-tajo-165281572600676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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