Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r114-smll-165264477100060.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is GlobalResAllocation-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-smll-165264477100060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 12M
-rw-r--r-- 1 mcc users 22K Apr 30 05:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 30 05:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 769K Apr 30 05:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Apr 30 05:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 11K May 9 07:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 9 07:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 263K May 9 07:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 859K May 9 07:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K May 9 07:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 5.7M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652688267449

Running Version 202205111006
[2022-05-16 08:04:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 08:04:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 08:04:30] [INFO ] Load time of PNML (sax parser for PT used): 1072 ms
[2022-05-16 08:04:30] [INFO ] Transformed 33 places.
[2022-05-16 08:04:31] [INFO ] Transformed 4791 transitions.
[2022-05-16 08:04:31] [INFO ] Parsed PT model containing 33 places and 4791 transitions in 1277 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 92 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 480 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 480 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 480 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 480 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 480 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 480 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
[2022-05-16 08:04:31] [INFO ] Reduced 45 identical enabling conditions.
Ensure Unique test removed 4080 transitions
Reduce redundant transitions removed 4080 transitions.
FORMULA GlobalResAllocation-PT-03-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-PT-03-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 711/711 transitions.
Reduce isomorphic (modulo) transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 33 transition count 693
Applied a total of 36 rules in 67 ms. Remains 33 /33 variables (removed 0) and now considering 693/711 (removed 18) transitions.
// Phase 1: matrix 693 rows 33 cols
[2022-05-16 08:04:31] [INFO ] Computed 12 place invariants in 56 ms
[2022-05-16 08:04:32] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 459 transitions.
Found 459 dead transitions using SMT.
Drop transitions removed 459 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 459 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:32] [INFO ] Computed 12 place invariants in 7 ms
[2022-05-16 08:04:32] [INFO ] Implicit Places using invariants in 55 ms returned []
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:32] [INFO ] Computed 12 place invariants in 8 ms
[2022-05-16 08:04:32] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 228 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/33 places, 234/711 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 234/711 transitions.
Support contains 33 out of 33 places after structural reductions.
[2022-05-16 08:04:33] [INFO ] Flatten gal took : 169 ms
[2022-05-16 08:04:33] [INFO ] Flatten gal took : 119 ms
[2022-05-16 08:04:34] [INFO ] Input system was already deterministic with 234 transitions.
Support contains 32 out of 33 places (down from 33) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 956 ms. (steps per millisecond=10 ) properties (out of 26) seen :22
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:35] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-16 08:04:35] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-05-16 08:04:35] [INFO ] [Real]Absence check using 7 positive and 5 generalized place invariants in 2 ms returned sat
[2022-05-16 08:04:35] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA GlobalResAllocation-PT-03-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!((X((G(G(p0))&&F(X(p1))))||G(p2)))'
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:36] [INFO ] Computed 12 place invariants in 10 ms
[2022-05-16 08:04:36] [INFO ] Dead Transitions using invariants and state equation in 272 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:36] [INFO ] Computed 12 place invariants in 7 ms
[2022-05-16 08:04:36] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:36] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-16 08:04:36] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:36] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:04:36] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 714 ms :[(OR (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), true, (OR (NOT p1) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 3}, { cond=(NOT p0), acceptance={0} source=0 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 0}, { cond=(AND p2 p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 8}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={} source=2 dest: 3}, { cond=(AND p2 p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) p0), acceptance={} source=4 dest: 3}, { cond=(AND p2 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 5}], [{ cond=p2, acceptance={} source=7 dest: 1}, { cond=(NOT p2), acceptance={} source=7 dest: 6}], [{ cond=(NOT p2), acceptance={} source=8 dest: 5}, { cond=p2, acceptance={} source=8 dest: 8}]], initial=7, aps=[p0:(OR (AND (GEQ s10 2) (GEQ s27 2)) (AND (GEQ s9 1) (GEQ s12 1) (GEQ s28 2)) (AND (GEQ s10 1) (GEQ s14 1) (GEQ s27 2)) (AND (GEQ s12 1) (GEQ s22 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 3 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-00 finished in 1561 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(F(p1))&&p0))||F(((!p1 U X(!p1))&&!p1))))'
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:37] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:04:37] [INFO ] Dead Transitions using invariants and state equation in 266 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:37] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 08:04:37] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:37] [INFO ] Computed 12 place invariants in 6 ms
[2022-05-16 08:04:37] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:37] [INFO ] Computed 12 place invariants in 8 ms
[2022-05-16 08:04:38] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 285 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0)), p1, p1]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 4}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={0} source=4 dest: 5}], [{ cond=p1, acceptance={0} source=5 dest: 0}]], initial=2, aps=[p1:(AND (OR (LT s1 1) (LT s3 2)) (OR (LT s2 1) (LT s3 1) (LT s7 1)) (OR (LT s0 1) (LT s4 1) (LT s8 1)) (OR (LT s0 1) (LT s4 1) (LT s6 1)) (OR (LT s1 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3252 ms.
Product exploration explored 100000 steps with 50000 reset in 2280 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) p0), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 7 factoid took 373 ms. Reduced automaton from 6 states, 12 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GlobalResAllocation-PT-03-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-PT-03-LTLFireability-02 finished in 6892 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)||F(p1)))))'
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 17 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:44] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:04:44] [INFO ] Dead Transitions using invariants and state equation in 203 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:44] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 08:04:44] [INFO ] Implicit Places using invariants in 42 ms returned []
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:44] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-16 08:04:44] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2022-05-16 08:04:45] [INFO ] Redundant transitions in 231 ms returned [189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233]
Found 45 redundant transitions using SMT.
Drop transitions removed 45 transitions
Redundant transitions reduction (with SMT) removed 45 transitions.
// Phase 1: matrix 189 rows 33 cols
[2022-05-16 08:04:45] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:04:45] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/33 places, 189/234 transitions.
Applied a total of 0 rules in 14 ms. Remains 33 /33 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 33/33 places, 189/234 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 2)) (AND (GEQ s2 1) (GEQ s5 2) (GEQ s6 1)) (AND (GEQ s0 1) (GEQ s6 1) (GEQ s8 2)) (AND (GEQ s2 1) (GEQ s5 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 12465 reset in 1988 ms.
Stack based approach found an accepted trace after 62 steps with 7 reset with depth 9 and stack size 9 in 5 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-05 finished in 3065 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(F((X(p2)||p1)))||p0))))'
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:47] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-16 08:04:47] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:47] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-16 08:04:47] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:47] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:04:47] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:47] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 08:04:48] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 0}]], initial=3, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s6 1)) (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s1 1) (GEQ s4 1)) (AND (GEQ s1 1) (GEQ s3 1)) (AND (GEQ s1 1) (GEQ s8 1)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 32398 reset in 1656 ms.
Product exploration explored 100000 steps with 32409 reset in 1520 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 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 123 ms. Reduced automaton from 5 states, 5 edges and 3 AP to 5 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 4 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 150 ms. Reduced automaton from 5 states, 5 edges and 3 AP to 5 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 7 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:52] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-16 08:04:52] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:52] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 08:04:52] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:52] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 08:04:53] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:53] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:04:53] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 234/234 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 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 168 ms. Reduced automaton from 5 states, 5 edges and 3 AP to 5 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 p1 p2)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (AND (NOT p1) (NOT p2))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 222 ms. Reduced automaton from 5 states, 5 edges and 3 AP to 5 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 32401 reset in 1561 ms.
Product exploration explored 100000 steps with 32394 reset in 1445 ms.
Applying partial POR strategy [false, false, true, false, false]
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 18 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:04:58] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:04:58] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
[2022-05-16 08:04:58] [INFO ] Redundant transitions in 170 ms returned [189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 200, 201, 202, 203, 204, 205, 206, 207, 208, 209, 210, 211, 212, 213, 214, 215, 216, 217, 218, 219, 220, 221, 222, 223, 224, 225, 226, 227, 228, 229, 230, 231, 232, 233]
Found 45 redundant transitions using SMT.
Drop transitions removed 45 transitions
Redundant transitions reduction (with SMT) removed 45 transitions.
// Phase 1: matrix 189 rows 33 cols
[2022-05-16 08:04:58] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:04:58] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 33/33 places, 189/234 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 189/189 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 33/33 places, 189/234 transitions.
Product exploration explored 100000 steps with 32417 reset in 1802 ms.
Product exploration explored 100000 steps with 32409 reset in 1577 ms.
Built C files in :
/tmp/ltsmin7227497653449771193
[2022-05-16 08:05:02] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7227497653449771193
Running compilation step : cd /tmp/ltsmin7227497653449771193;'/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 1463 ms.
Running link step : cd /tmp/ltsmin7227497653449771193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin7227497653449771193;'/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/stateBased3236588326490035022.hoa' '--buchi-type=spotba'
LTSmin run took 397 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-PT-03-LTLFireability-06 finished in 16803 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||X(F(p1))))'
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:04] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:05:04] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:04] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:05:04] [INFO ] Implicit Places using invariants in 38 ms returned []
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:04] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:05:04] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:04] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:05:04] [INFO ] Dead Transitions using invariants and state equation in 283 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 33/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s10 2) (GEQ s27 2)) (AND (GEQ s9 1) (GEQ s12 1) (GEQ s28 2)) (AND (GEQ s10 1) (GEQ s14 1) (GEQ s27 2)) (AND (GEQ s12 1) (GEQ s22 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 2337 ms.
Product exploration explored 100000 steps with 50000 reset in 2387 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 64 ms. Reduced automaton from 2 states, 2 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GlobalResAllocation-PT-03-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-PT-03-LTLFireability-07 finished in 5662 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((X(G(F(G(F(X(G(X(p0)))))))) U p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 20 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:09] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:05:10] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:10] [INFO ] Computed 12 place invariants in 5 ms
[2022-05-16 08:05:10] [INFO ] Implicit Places using invariants in 108 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 112 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/33 places, 234/234 transitions.
Applied a total of 0 rules in 9 ms. Remains 31 /31 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s23 1) (GEQ s27 1)), p0:(GEQ s29 4)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 600 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-08 finished in 1045 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(X(G(p0))))||X(p1))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:10] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:05:11] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:11] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:05:11] [INFO ] Implicit Places using invariants in 77 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/33 places, 234/234 transitions.
Applied a total of 0 rules in 13 ms. Remains 31 /31 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(OR (LT s16 1) (LT s27 1)), p0:(AND (OR (LT s2 1) (LT s5 1) (LT s6 1)) (OR (LT s16 1) (LT s27 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 10 reset in 545 ms.
Stack based approach found an accepted trace after 46 steps with 4 reset with depth 35 and stack size 35 in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-10 finished in 939 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0)) U !X(((false U p0)&&p1))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:11] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:05:12] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:12] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:05:12] [INFO ] Implicit Places using invariants in 128 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 130 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND p0 p1), (AND p0 p1), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s2 1) (GEQ s6 1) (GEQ s7 1)), p1:(GEQ s27 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2747 ms.
Product exploration explored 100000 steps with 50000 reset in 1888 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), true]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Property proved to be true thanks to knowledge :(X (NOT (AND p0 p1)))
Knowledge based reduction with 3 factoid took 156 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA GlobalResAllocation-PT-03-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-PT-03-LTLFireability-12 finished in 5284 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!X(p0) U (X((G(p2)||p3))&&p1)))))'
Support contains 5 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:17] [INFO ] Computed 12 place invariants in 4 ms
[2022-05-16 08:05:17] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:17] [INFO ] Computed 12 place invariants in 1 ms
[2022-05-16 08:05:17] [INFO ] Implicit Places using invariants in 84 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 86 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3)))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s0 1) (GEQ s5 1) (GEQ s7 1)), p3:(AND (GEQ s1 1) (GEQ s6 1) (GEQ s7 1)), p2:(AND (GEQ s1 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 80 reset in 477 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 3 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-13 finished in 927 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p0)&&p1))||X(F(p1))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:18] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:05:18] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:18] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:05:18] [INFO ] Implicit Places using invariants in 114 ms returned [27, 28, 31]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 116 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/33 places, 234/234 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 30/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 152 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s27 4), p0:(AND (GEQ s1 1) (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, null][false, false, false]]
Product exploration explored 100000 steps with 10098 reset in 1073 ms.
Stack based approach found an accepted trace after 17 steps with 1 reset with depth 10 and stack size 10 in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-14 finished in 1523 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 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 234/234 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 234/234 (removed 0) transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:19] [INFO ] Computed 12 place invariants in 3 ms
[2022-05-16 08:05:19] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
// Phase 1: matrix 234 rows 33 cols
[2022-05-16 08:05:19] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-16 08:05:19] [INFO ] Implicit Places using invariants in 144 ms returned [27, 31]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 146 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 31/33 places, 234/234 transitions.
Applied a total of 0 rules in 10 ms. Remains 31 /31 variables (removed 0) and now considering 234/234 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 31/33 places, 234/234 transitions.
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-PT-03-LTLFireability-15 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 s9 1) (GEQ s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3736 reset in 907 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA GlobalResAllocation-PT-03-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-PT-03-LTLFireability-15 finished in 1370 ms.
All properties solved by simple procedures.
Total runtime 51305 ms.

BK_STOP 1652688321102

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="GlobalResAllocation-PT-03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is GlobalResAllocation-PT-03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-smll-165264477100060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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