About the Execution of ITS-Tools for Philosophers-COL-000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 308.636 | 12055.00 | 20687.00 | 188.90 | FFFTFFFFFFTFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r168-tall-165277016300188.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 Philosophers-COL-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016300188
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 5.4K Apr 29 11:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Apr 29 11:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 29 11:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 29 11:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 9 08:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 9 08:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 9.9K 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 Philosophers-COL-000010-LTLFireability-00
FORMULA_NAME Philosophers-COL-000010-LTLFireability-01
FORMULA_NAME Philosophers-COL-000010-LTLFireability-02
FORMULA_NAME Philosophers-COL-000010-LTLFireability-03
FORMULA_NAME Philosophers-COL-000010-LTLFireability-04
FORMULA_NAME Philosophers-COL-000010-LTLFireability-05
FORMULA_NAME Philosophers-COL-000010-LTLFireability-06
FORMULA_NAME Philosophers-COL-000010-LTLFireability-07
FORMULA_NAME Philosophers-COL-000010-LTLFireability-08
FORMULA_NAME Philosophers-COL-000010-LTLFireability-09
FORMULA_NAME Philosophers-COL-000010-LTLFireability-10
FORMULA_NAME Philosophers-COL-000010-LTLFireability-11
FORMULA_NAME Philosophers-COL-000010-LTLFireability-12
FORMULA_NAME Philosophers-COL-000010-LTLFireability-13
FORMULA_NAME Philosophers-COL-000010-LTLFireability-14
FORMULA_NAME Philosophers-COL-000010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652801349615
Running Version 202205111006
[2022-05-17 15:29:10] [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-17 15:29:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 15:29:10] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2022-05-17 15:29:11] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 15:29:11] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 551 ms
[2022-05-17 15:29:11] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 50 PT places and 50.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 15:29:11] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2022-05-17 15:29:11] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000010-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000010-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 267 steps, including 22 resets, run visited all 4 properties in 14 ms. (steps per millisecond=19 )
[2022-05-17 15:29:11] [INFO ] Flatten gal took : 17 ms
[2022-05-17 15:29:11] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 10) 10) 10)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 15:29:11] [INFO ] Unfolded HLPN to a Petri net with 50 places and 50 transitions 160 arcs in 7 ms.
[2022-05-17 15:29:11] [INFO ] Unfolded 13 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000010-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:11] [INFO ] Computed 20 place invariants in 13 ms
[2022-05-17 15:29:11] [INFO ] Implicit Places using invariants in 114 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:11] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 15:29:11] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:11] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-17 15:29:11] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Support contains 50 out of 50 places after structural reductions.
[2022-05-17 15:29:11] [INFO ] Flatten gal took : 9 ms
[2022-05-17 15:29:12] [INFO ] Flatten gal took : 14 ms
[2022-05-17 15:29:12] [INFO ] Input system was already deterministic with 50 transitions.
Finished random walk after 24 steps, including 0 resets, run visited all 12 properties in 27 ms. (steps per millisecond=0 )
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' '!(F((G(p0) U (F(X(X(X(p1))))&&!(G(p1)&&p0)))))'
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:12] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:12] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:12] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 15:29:12] [INFO ] Implicit Places using invariants and state equation in 66 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:12] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:12] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p1) p0), (NOT p1), (AND p0 p1), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s3 1) (GEQ s12 1)) (AND (GEQ s0 1) (GEQ s19 1)) (AND (GEQ s1 1) (GEQ s10 1)) (AND (GEQ s5 1) (GEQ s14 1)) (AND (GEQ s2 1) (GEQ s11 1)) (A...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 12559 reset in 316 ms.
Stack based approach found an accepted trace after 27 steps with 3 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Philosophers-COL-000010-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-00 finished in 841 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(((G(X(F(p0)))&&p1)||p2)))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:13] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 15:29:13] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:13] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:13] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2022-05-17 15:29:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:13] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:13] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 174 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s10 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 498 steps with 28 reset in 7 ms.
FORMULA Philosophers-COL-000010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-01 finished in 341 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X((F(p1)&&p2)))||F(G(p2))))'
Support contains 40 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 1 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:13] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 15:29:13] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:13] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:13] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:13] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 15:29:13] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 199 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ 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, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 46 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-02 finished in 381 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(G(p1))||p0))))'
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:13] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:14] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:14] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-17 15:29:14] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 153 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p1:(AND (LT s49 1) (LT s48 1) (LT s41 1) (LT s40 1) (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT s46 1)), p0:(OR (GEQ s49 1) (GEQ s48 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-04 finished in 338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(!(F(!F(p0))&&G((X(p0)&&p0)))) U p0)))'
Support contains 10 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:14] [INFO ] Implicit Places using invariants in 51 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 118 ms to find 0 implicit places.
[2022-05-17 15:29:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:14] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s49 1) (GEQ s48 1) (GEQ s41 1) (GEQ s40 1) (GEQ s43 1) (GEQ s42 1) (GEQ s45 1) (GEQ s44 1) (GEQ s47 1) (GEQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 5435 steps with 722 reset in 15 ms.
FORMULA Philosophers-COL-000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-06 finished in 280 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G((F(p1)&&p0)))||X(G(p2)))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 3 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:14] [INFO ] Implicit Places using invariants in 39 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:14] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2022-05-17 15:29:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:14] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 77 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (GEQ s19 1) (GEQ s30 1)) (AND (GEQ s13 1) (GEQ s34 1)) (AND (GEQ s16 1) (GEQ s37 1)) (AND (GEQ s17 1) (GEQ s38 1)) (AND (GEQ s12 1) (GEQ s33 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 51 steps with 1 reset in 1 ms.
FORMULA Philosophers-COL-000010-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-07 finished in 242 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(X(F(!(p0 U (F(p2)||p1))))))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:14] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:14] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2022-05-17 15:29:14] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:14] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:14] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR p1 p2), (OR p1 p2), p2]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p0 p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(OR p1 p2), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=p2, acceptance={0, 1} source=2 dest: 1}, { cond=(NOT p2), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 683 reset in 309 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 Philosophers-COL-000010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-08 finished in 584 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0 U !F(p1)))&&X(p2))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:15] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:15] [INFO ] Implicit Places using invariants in 41 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:15] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:15] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:15] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:15] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), true, p1]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND p2 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (LT s49 1) (LT s48 1) (LT s41 1) (LT s40 1) (LT s43 1) (LT s42 1) (LT s45 1) (LT s44 1) (LT s47 1) (LT s46 1)), p1:(OR (AND (GEQ s11 1) (GEQ s21 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1035 steps with 3 reset in 5 ms.
FORMULA Philosophers-COL-000010-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-09 finished in 263 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(X(p0)))||(X(p1)&&p1))))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 0 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:15] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:15] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:15] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 15:29:15] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:15] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:15] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 4}], [{ cond=p1, acceptance={} source=6 dest: 3}, { cond=(NOT p1), acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (AND (GEQ s11 1) (GEQ s21 1)) (AND (GEQ s15 1) (GEQ s25 1)) (AND (GEQ s19 1) (GEQ s29 1)) (AND (GEQ s13 1) (GEQ s23 1)) (AND (GEQ s17 1) (GEQ s27 1...], 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 28357 reset in 252 ms.
Product exploration explored 100000 steps with 28371 reset in 275 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)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 7 states, 11 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 227 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 18 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 242 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 220 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:17] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:17] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:17] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:17] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:17] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:17] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 101 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 226 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 10 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p1) p0)]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p1))), (X (X p1)), (F p1), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 1 factoid took 183 ms. Reduced automaton from 6 states, 9 edges and 2 AP to 6 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 395 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 457 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 28332 reset in 266 ms.
Product exploration explored 100000 steps with 28336 reset in 233 ms.
Built C files in :
/tmp/ltsmin12271095938373378254
[2022-05-17 15:29:20] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12271095938373378254
Running compilation step : cd /tmp/ltsmin12271095938373378254;'/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 245 ms.
Running link step : cd /tmp/ltsmin12271095938373378254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin12271095938373378254;'/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/stateBased10804361634632119292.hoa' '--buchi-type=spotba'
LTSmin run took 211 ms.
FORMULA Philosophers-COL-000010-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-COL-000010-LTLFireability-10 finished in 5018 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(F(G(p1)))||p0)))'
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 6 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:20] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:20] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:20] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:20] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2022-05-17 15:29:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:20] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-17 15:29:20] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s7 1) (GEQ s17 1)) (AND (GEQ s9 1) (GEQ s19 1)) (AND (GEQ s6 1) (GEQ s16 1)) (AND (GEQ s8 1) (GEQ s18 1)) (AND (GEQ s0 1) (GEQ s10 1)) (A...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 55 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-11 finished in 200 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||p1)))'
Support contains 30 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 4 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:20] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:20] [INFO ] Implicit Places using invariants in 31 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:20] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:20] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
[2022-05-17 15:29:20] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:20] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:21] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7423 reset in 258 ms.
Stack based approach found an accepted trace after 204 steps with 14 reset with depth 6 and stack size 6 in 1 ms.
FORMULA Philosophers-COL-000010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-12 finished in 432 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(p0)))))'
Support contains 20 out of 50 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 50 /50 variables (removed 0) and now considering 50/50 (removed 0) transitions.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:21] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-17 15:29:21] [INFO ] Implicit Places using invariants in 40 ms returned []
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:21] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-17 15:29:21] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
// Phase 1: matrix 50 rows 50 cols
[2022-05-17 15:29:21] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-17 15:29:21] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 50/50 places, 50/50 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000010-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (OR (LT s3 1) (LT s12 1)) (OR (LT s0 1) (LT s19 1)) (OR (LT s1 1) (LT s10 1)) (OR (LT s5 1) (LT s14 1)) (OR (LT s2 1) (LT s11 1)) (OR (LT s4 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000010-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000010-LTLFireability-15 finished in 268 ms.
All properties solved by simple procedures.
Total runtime 10829 ms.
BK_STOP 1652801361670
--------------------
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="Philosophers-COL-000010"
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 Philosophers-COL-000010, 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 r168-tall-165277016300188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000010.tgz
mv Philosophers-COL-000010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;