Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 408K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Mar 28 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 28 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 28 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 27 10:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 27 10:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Mar 25 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 25 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 9 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 71K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R003C010-00
FORMULA_NAME ResAllocation-PT-R003C010-01
FORMULA_NAME ResAllocation-PT-R003C010-02
FORMULA_NAME ResAllocation-PT-R003C010-03
FORMULA_NAME ResAllocation-PT-R003C010-04
FORMULA_NAME ResAllocation-PT-R003C010-05
FORMULA_NAME ResAllocation-PT-R003C010-06
FORMULA_NAME ResAllocation-PT-R003C010-07
FORMULA_NAME ResAllocation-PT-R003C010-08
FORMULA_NAME ResAllocation-PT-R003C010-09
FORMULA_NAME ResAllocation-PT-R003C010-10
FORMULA_NAME ResAllocation-PT-R003C010-11
FORMULA_NAME ResAllocation-PT-R003C010-12
FORMULA_NAME ResAllocation-PT-R003C010-13
FORMULA_NAME ResAllocation-PT-R003C010-14
FORMULA_NAME ResAllocation-PT-R003C010-15

=== Now, execution of the tool begins

BK_START 1621265586413

Running Version 0
[2021-05-17 15:33:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-17 15:33:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 15:33:07] [INFO ] Load time of PNML (sax parser for PT used): 40 ms
[2021-05-17 15:33:07] [INFO ] Transformed 60 places.
[2021-05-17 15:33:07] [INFO ] Transformed 40 transitions.
[2021-05-17 15:33:07] [INFO ] Parsed PT model containing 60 places and 40 transitions in 78 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Support contains 41 out of 60 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 60/60 places, 40/40 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 60 cols
[2021-05-17 15:33:08] [INFO ] Computed 30 place invariants in 7 ms
[2021-05-17 15:33:08] [INFO ] Implicit Places using invariants in 99 ms returned [59]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 131 ms to find 1 implicit places.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:08] [INFO ] Computed 29 place invariants in 3 ms
[2021-05-17 15:33:08] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Starting structural reductions, iteration 1 : 59/60 places, 40/40 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:08] [INFO ] Computed 29 place invariants in 3 ms
[2021-05-17 15:33:08] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 59/60 places, 40/40 transitions.
[2021-05-17 15:33:08] [INFO ] Flatten gal took : 24 ms
[2021-05-17 15:33:08] [INFO ] Flatten gal took : 7 ms
[2021-05-17 15:33:08] [INFO ] Input system was already deterministic with 40 transitions.
Finished random walk after 953 steps, including 41 resets, run visited all 31 properties in 13 ms. (steps per millisecond=73 )
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 49 transition count 31
Applied a total of 19 rules in 18 ms. Remains 49 /59 variables (removed 10) and now considering 31/40 (removed 9) transitions.
// Phase 1: matrix 31 rows 49 cols
[2021-05-17 15:33:08] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-17 15:33:08] [INFO ] Implicit Places using invariants in 42 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
[2021-05-17 15:33:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 48 cols
[2021-05-17 15:33:08] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:08] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 48/59 places, 31/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2021-05-17 15:33:08] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 31 rows 48 cols
[2021-05-17 15:33:08] [INFO ] Computed 27 place invariants in 8 ms
[2021-05-17 15:33:08] [INFO ] Dead Transitions using invariants and state equation in 30 ms returned []
Finished structural reductions, in 2 iterations. Remains : 48/59 places, 31/40 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C010-00 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s31 1) (GEQ s36 1) (GEQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA ResAllocation-PT-R003C010-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-00 finished in 284 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(((!p0||F(p1))&&(X(X(p0)) U ((p2&&X(X(p0)))||X(X(G(p0)))))))))], workingDir=/home/mcc/execution]
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:08] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 15:33:08] [INFO ] Implicit Places using invariants in 65 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:08] [INFO ] Computed 27 place invariants in 2 ms
[2021-05-17 15:33:09] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Starting structural reductions, iteration 1 : 57/59 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:09] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:09] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 456 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), false, (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C010-01 automaton TGBA [mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=true, acceptance={0, 1} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={0, 1} source=0 dest: 3}], [{ cond=true, acceptance={0, 1} source=1 dest: 4}, { cond=true, acceptance={1} source=1 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 6}, { cond=(NOT p2), acceptance={0, 1} source=1 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 8}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 9}], [{ cond=true, acceptance={0, 1} source=3 dest: 10}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 11}], [{ cond=(NOT p0), acceptance={0, 1} source=4 dest: 4}, { cond=(NOT p0), acceptance={1} source=4 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={1} source=5 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=5 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=6 dest: 8}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=6 dest: 9}], [{ cond=(NOT p0), acceptance={0, 1} source=7 dest: 10}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=7 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=8 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=8 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=8 dest: 12}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=8 dest: 13}], [{ cond=(NOT p1), acceptance={0, 1} source=9 dest: 14}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=9 dest: 15}], [{ cond=p0, acceptance={0} source=10 dest: 4}, { cond=p0, acceptance={} source=10 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=10 dest: 7}], [{ cond=p0, acceptance={0} source=11 dest: 10}, { cond=(AND p0 (NOT p2)), acceptance={0} source=11 dest: 11}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=12 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=12 dest: 12}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=12 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=13 dest: 14}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=13 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={1} source=14 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=14 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=14 dest: 12}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=14 dest: 13}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=15 dest: 14}, { cond=(AND p0 (NOT p1)), acceptance={0} source=15 dest: 14}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=15 dest: 15}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=15 dest: 15}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s11 1)), p1:(AND (GEQ s11 1) (GEQ s14 1) (GEQ s17 1)), p2:(GEQ s4 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[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]]
Stuttering criterion allowed to conclude after 250 steps with 42 reset in 4 ms.
FORMULA ResAllocation-PT-R003C010-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-01 finished in 644 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((p0||X((X((p0||X((G(p1) U (G(p1)&&p2))))) U (X((p0||X((G(p1) U (G(p1)&&p4)))))&&p3)))))))], workingDir=/home/mcc/execution]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:09] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 15:33:09] [INFO ] Implicit Places using invariants in 32 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:09] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:09] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Starting structural reductions, iteration 1 : 57/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:09] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:09] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 631 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p4))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1)), true, (NOT p1), (OR (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p4))), (AND (NOT p0) (NOT p1)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ResAllocation-PT-R003C010-02 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p3), acceptance={0} source=3 dest: 3}, { cond=(NOT p3), acceptance={} source=3 dest: 4}, { cond=p3, acceptance={0} source=3 dest: 5}, { cond=p3, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) p3), acceptance={0} source=5 dest: 10}, { cond=(AND (NOT p0) p3), acceptance={} source=5 dest: 11}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=5 dest: 13}], [{ cond=(NOT p0), acceptance={} source=6 dest: 14}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}, { cond=(NOT p1), acceptance={} source=7 dest: 8}, { cond=(AND p2 p1), acceptance={} source=7 dest: 9}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=(NOT p1), acceptance={} source=9 dest: 8}, { cond=p1, acceptance={} source=9 dest: 9}], [{ cond=(OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p3 (NOT p4))), acceptance={0} source=10 dest: 10}, { cond=(OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p3 (NOT p4))), acceptance={} source=10 dest: 11}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p4))), acceptance={} source=10 dest: 12}, { cond=(OR (AND (NOT p0) (NOT p3) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p4))), acceptance={0} source=10 dest: 13}, { cond=(AND (NOT p0) p3 p1 p4), acceptance={} source=10 dest: 15}, { cond=(AND (NOT p0) (NOT p3) p1 p4), acceptance={} source=10 dest: 16}], [{ cond=(AND (NOT p0) p1 p4), acceptance={} source=11 dest: 9}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p4))), acceptance={} source=11 dest: 14}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 7}, { cond=(AND (NOT p0) p1 p4), acceptance={} source=12 dest: 9}, { cond=(AND (NOT p0) p1 (NOT p4)), acceptance={} source=12 dest: 14}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=13 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=13 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={0} source=13 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=13 dest: 6}, { cond=(AND p3 p1 (NOT p4)), acceptance={0} source=13 dest: 10}, { cond=(AND p3 p1 (NOT p4)), acceptance={} source=13 dest: 11}, { cond=(AND (NOT p3) p1 (NOT p4)), acceptance={} source=13 dest: 12}, { cond=(AND (NOT p3) p1 (NOT p4)), acceptance={0} source=13 dest: 13}, { cond=(AND p3 p1 p4), acceptance={} source=13 dest: 15}, { cond=(AND (NOT p3) p1 p4), acceptance={} source=13 dest: 16}], [{ cond=(NOT p1), acceptance={} source=14 dest: 8}, { cond=(OR (AND p2 p1) (AND p1 p4)), acceptance={} source=14 dest: 9}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={0} source=14 dest: 14}], [{ cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 9}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={0} source=15 dest: 10}, { cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=15 dest: 11}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={} source=15 dest: 12}, { cond=(AND (NOT p0) (NOT p3) (NOT p1)), acceptance={0} source=15 dest: 13}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=15 dest: 14}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={0} source=16 dest: 3}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=16 dest: 4}, { cond=(AND p3 (NOT p1)), acceptance={0} source=16 dest: 5}, { cond=(AND p3 (NOT p1)), acceptance={} source=16 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=16 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=16 dest: 9}, { cond=(AND p0 p3 p1), acceptance={} source=16 dest: 15}, { cond=(AND p0 (NOT p3) p1), acceptance={} source=16 dest: 16}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s25 1)), p3:(AND (GEQ s19 1) (GEQ s25 1)), p2:(AND (GEQ s19 1) (GEQ s25 1)), p1:(GEQ s1 1), p4:(AND (GEQ s19 1) (GEQ s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[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]]
Entered a terminal (fully accepting) state of product in 47 steps with 11 reset in 2 ms.
FORMULA ResAllocation-PT-R003C010-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-02 finished in 743 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((p0||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 4 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 53 transition count 34
Applied a total of 12 rules in 12 ms. Remains 53 /59 variables (removed 6) and now considering 34/40 (removed 6) transitions.
// Phase 1: matrix 34 rows 53 cols
[2021-05-17 15:33:10] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 15:33:10] [INFO ] Implicit Places using invariants in 65 ms returned [49, 51]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
[2021-05-17 15:33:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 51 cols
[2021-05-17 15:33:10] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:10] [INFO ] Dead Transitions using invariants and state equation in 26 ms returned []
Starting structural reductions, iteration 1 : 51/59 places, 34/40 transitions.
Applied a total of 0 rules in 6 ms. Remains 51 /51 variables (removed 0) and now considering 34/34 (removed 0) transitions.
[2021-05-17 15:33:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 34 rows 51 cols
[2021-05-17 15:33:10] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:10] [INFO ] Dead Transitions using invariants and state equation in 22 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/59 places, 34/40 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ResAllocation-PT-R003C010-03 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s25 1) (GEQ s30 1)), p0:(AND (GEQ s38 1) (GEQ s44 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 20 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-03 finished in 226 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(X((p0||X((G(p1) U (G(p1)&&p2))))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:10] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 15:33:10] [INFO ] Implicit Places using invariants in 43 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:10] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:10] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Starting structural reductions, iteration 1 : 57/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:10] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:10] [INFO ] Dead Transitions using invariants and state equation in 27 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : ResAllocation-PT-R003C010-04 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 3}], [{ cond=(AND p2 p1), acceptance={0} source=6 dest: 0}, { cond=(NOT p1), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(AND (OR (LT s23 1) (LT s26 1) (LT s29 1)) (OR (LT s31 1) (LT s37 1))), p0:(AND (GEQ s45 1) (GEQ s48 1) (GEQ s51 1)), p2:(AND (GEQ s45 1) (GEQ s48 1) (GEQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-04 finished in 297 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(p0))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 50 transition count 32
Applied a total of 17 rules in 5 ms. Remains 50 /59 variables (removed 9) and now considering 32/40 (removed 8) transitions.
// Phase 1: matrix 32 rows 50 cols
[2021-05-17 15:33:10] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-17 15:33:10] [INFO ] Implicit Places using invariants in 26 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 27 ms to find 1 implicit places.
[2021-05-17 15:33:10] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 32 rows 49 cols
[2021-05-17 15:33:10] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:10] [INFO ] Dead Transitions using invariants and state equation in 21 ms returned []
Starting structural reductions, iteration 1 : 49/59 places, 32/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 15:33:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 32 rows 49 cols
[2021-05-17 15:33:10] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/59 places, 32/40 transitions.
Stuttering acceptance computed with spot in 33 ms :[true, (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C010-05 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s26 1) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-05 finished in 136 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||X(F((X(F(!p2))&&p1))))))], workingDir=/home/mcc/execution]
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:10] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 15:33:10] [INFO ] Implicit Places using invariants in 31 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:10] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms returned []
Starting structural reductions, iteration 1 : 57/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:10] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:11] [INFO ] Dead Transitions using invariants and state equation in 32 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 98 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), p2, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (NOT p1) p2)]
Running random walk in product with property : ResAllocation-PT-R003C010-06 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1) (GEQ s10 1) (GEQ s40 1)), p2:(AND (GEQ s31 1) (GEQ s37 1)), p1:(AND (OR (LT s31 1) (LT s37 1)) (LT s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9569 reset in 322 ms.
Stack based approach found an accepted trace after 508 steps with 46 reset with depth 20 and stack size 20 in 10 ms.
FORMULA ResAllocation-PT-R003C010-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-06 finished in 531 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G((X(X(p0))||((F(p2) U X(p3))&&p1))))], workingDir=/home/mcc/execution]
Support contains 8 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:11] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 15:33:11] [INFO ] Implicit Places using invariants in 52 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 53 ms to find 2 implicit places.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:11] [INFO ] Computed 27 place invariants in 7 ms
[2021-05-17 15:33:11] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 57/59 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:11] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:11] [INFO ] Dead Transitions using invariants and state equation in 41 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 430 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (NOT p0), (AND (NOT p0) (NOT p3)), false, (NOT p0), true, (AND (NOT p0) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p0)), (AND (NOT p2) p3 (NOT p0)), (NOT p3), (AND (NOT p2) (NOT p3)), (NOT p2)]
Running random walk in product with property : ResAllocation-PT-R003C010-07 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p3), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 8}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=6 dest: 9}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=7 dest: 11}], [{ cond=(AND (NOT p2) p3 (NOT p0)), acceptance={} source=8 dest: 11}], [{ cond=(NOT p3), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=9 dest: 10}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=10 dest: 11}], [{ cond=(NOT p2), acceptance={0} source=11 dest: 11}]], initial=0, aps=[p1:(AND (GEQ s21 1) (GEQ s24 1) (GEQ s27 1)), p2:(AND (GEQ s25 1) (GEQ s31 1) (GEQ s32 1)), p3:(AND (GEQ s21 1) (GEQ s24 1) (GEQ s27 1)), p0:(AND (GEQ s27 1) (GEQ s33 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 1 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-07 finished in 619 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((!p0 U (G(!p0)||(X((F(p2)||G(p3)))&&p1))))))], workingDir=/home/mcc/execution]
Support contains 7 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:12] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 15:33:12] [INFO ] Implicit Places using invariants in 37 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 45 ms to find 1 implicit places.
// Phase 1: matrix 40 rows 58 cols
[2021-05-17 15:33:12] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-17 15:33:12] [INFO ] Dead Transitions using invariants and state equation in 33 ms returned []
Starting structural reductions, iteration 1 : 58/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 58 cols
[2021-05-17 15:33:12] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-17 15:33:12] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Finished structural reductions, in 2 iterations. Remains : 58/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 295 ms :[true, (NOT p2), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (AND (NOT p2) (NOT p3)), (AND p0 (NOT p2) (NOT p3)), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1) (NOT p2))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1))), (OR (AND p0 (NOT p2) (NOT p3)) (AND p0 (NOT p1)))]
Running random walk in product with property : ResAllocation-PT-R003C010-08 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(OR (AND p1 p0 (NOT p2)) (AND p0 (NOT p2) p3)), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 2}]], initial=6, aps=[p2:(AND (GEQ s15 1) (GEQ s21 1) (GEQ s22 1)), p1:(AND (LT s1 1) (GEQ s49 1) (GEQ s55 1) (GEQ s56 1)), p0:(GEQ s1 1), p3:(AND (GEQ s49 1) (GEQ s55 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 21 steps with 1 reset in 1 ms.
FORMULA ResAllocation-PT-R003C010-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-08 finished in 443 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((F(!p0)&&F(p1)&&X(F(!p1))))], workingDir=/home/mcc/execution]
Support contains 5 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:12] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 15:33:12] [INFO ] Implicit Places using invariants in 43 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
// Phase 1: matrix 40 rows 58 cols
[2021-05-17 15:33:12] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-17 15:33:12] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 58/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 58 cols
[2021-05-17 15:33:12] [INFO ] Computed 28 place invariants in 0 ms
[2021-05-17 15:33:12] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 58/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, p0, (NOT p1), p1]
Running random walk in product with property : ResAllocation-PT-R003C010-09 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s11 1)), p1:(AND (GEQ s51 1) (GEQ s56 1) (GEQ s57 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 114 steps with 13 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-09 finished in 246 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0||F(G(p0)))))], workingDir=/home/mcc/execution]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:12] [INFO ] Computed 29 place invariants in 6 ms
[2021-05-17 15:33:12] [INFO ] Implicit Places using invariants in 49 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:12] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:12] [INFO ] Dead Transitions using invariants and state equation in 35 ms returned []
Starting structural reductions, iteration 1 : 57/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:12] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:12] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C010-10 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(AND (GEQ s3 1) (GEQ s9 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-10 finished in 220 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(!p0)))], workingDir=/home/mcc/execution]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:12] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 15:33:13] [INFO ] Implicit Places using invariants in 39 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:13] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 29 ms returned []
Starting structural reductions, iteration 1 : 57/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:13] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 42 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, p0, p0]
Running random walk in product with property : ResAllocation-PT-R003C010-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-11 finished in 203 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X((F(p0) U p1))))], workingDir=/home/mcc/execution]
Support contains 3 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:13] [INFO ] Computed 29 place invariants in 0 ms
[2021-05-17 15:33:13] [INFO ] Implicit Places using invariants in 35 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 ms to find 2 implicit places.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:13] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 28 ms returned []
Starting structural reductions, iteration 1 : 57/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:13] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 39 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C010-12 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s19 1) (GEQ s25 1)), p0:(GEQ s16 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 2 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-12 finished in 225 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(p0)))], workingDir=/home/mcc/execution]
Support contains 6 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:13] [INFO ] Computed 29 place invariants in 7 ms
[2021-05-17 15:33:13] [INFO ] Implicit Places using invariants in 41 ms returned [55, 57]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 42 ms to find 2 implicit places.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:13] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 31 ms returned []
Starting structural reductions, iteration 1 : 57/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 57 cols
[2021-05-17 15:33:13] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 57/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C010-13 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s39 1) (LT s45 1) (LT s46 1) (AND (GEQ s37 1) (GEQ s43 1) (GEQ s44 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-13 finished in 182 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 17 rules applied. Total rules applied 17 place count 50 transition count 32
Applied a total of 17 rules in 3 ms. Remains 50 /59 variables (removed 9) and now considering 32/40 (removed 8) transitions.
// Phase 1: matrix 32 rows 50 cols
[2021-05-17 15:33:13] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-17 15:33:13] [INFO ] Implicit Places using invariants in 36 ms returned [48]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
[2021-05-17 15:33:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 32 rows 49 cols
[2021-05-17 15:33:13] [INFO ] Computed 27 place invariants in 1 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 25 ms returned []
Starting structural reductions, iteration 1 : 49/59 places, 32/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2021-05-17 15:33:13] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 32 rows 49 cols
[2021-05-17 15:33:13] [INFO ] Computed 27 place invariants in 0 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 23 ms returned []
Finished structural reductions, in 2 iterations. Remains : 49/59 places, 32/40 transitions.
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : ResAllocation-PT-R003C010-14 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s15 1) (GEQ s20 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-14 finished in 148 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G(((p0&&G(p1)) U (p2&&X(X(p3)))))))], workingDir=/home/mcc/execution]
Support contains 8 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 59 /59 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 59 cols
[2021-05-17 15:33:13] [INFO ] Computed 29 place invariants in 1 ms
[2021-05-17 15:33:13] [INFO ] Implicit Places using invariants in 34 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
// Phase 1: matrix 40 rows 58 cols
[2021-05-17 15:33:13] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 34 ms returned []
Starting structural reductions, iteration 1 : 58/59 places, 40/40 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 40/40 (removed 0) transitions.
// Phase 1: matrix 40 rows 58 cols
[2021-05-17 15:33:13] [INFO ] Computed 28 place invariants in 1 ms
[2021-05-17 15:33:13] [INFO ] Dead Transitions using invariants and state equation in 43 ms returned []
Finished structural reductions, in 2 iterations. Remains : 58/59 places, 40/40 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), true, (NOT p1), (NOT p3), (OR (NOT p3) (NOT p2)), (NOT p3), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : ResAllocation-PT-R003C010-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p2 (AND p0 p1)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 7}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 3}, { cond=(OR (AND p2 (NOT p0)) (AND p2 (NOT p1))), acceptance={0} source=5 dest: 4}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0 p1), acceptance={0} source=5 dest: 6}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (NOT p1)), acceptance={0} source=6 dest: 7}, { cond=(OR (AND p2 p1) (AND p0 p1)), acceptance={0} source=6 dest: 8}, { cond=(AND p2 p0 p1), acceptance={0} source=6 dest: 9}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=6 dest: 10}, { cond=(AND p2 (NOT p0) p1), acceptance={0} source=6 dest: 11}], [{ cond=(NOT p3), acceptance={} source=7 dest: 2}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=8 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=8 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=9 dest: 7}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p0 p1 (NOT p3))), acceptance={0} source=9 dest: 8}, { cond=(AND p2 p0 p1 (NOT p3)), acceptance={0} source=9 dest: 9}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=9 dest: 10}, { cond=(AND p2 (NOT p0) p1 (NOT p3)), acceptance={0} source=9 dest: 11}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p1) (NOT p3))), acceptance={0} source=10 dest: 2}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=10 dest: 3}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p2 (NOT p1) (NOT p3))), acceptance={0} source=10 dest: 4}, { cond=(AND (NOT p2) p0 p1 (NOT p3)), acceptance={0} source=10 dest: 5}, { cond=(AND p2 p0 p1 (NOT p3)), acceptance={0} source=10 dest: 6}], [{ cond=(NOT p3), acceptance={} source=11 dest: 7}]], initial=0, aps=[p2:(GEQ s54 1), p0:(GEQ s16 1), p1:(AND (GEQ s33 1) (GEQ s36 1) (GEQ s39 1)), p3:(AND (GEQ s49 1) (GEQ s55 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ResAllocation-PT-R003C010-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ResAllocation-PT-R003C010-15 finished in 494 ms.
All properties solved without resorting to model-checking.

BK_STOP 1621265594458

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ResAllocation-PT-R003C010"
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-R003C010, 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 r178-tajo-162089416300741"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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