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-165277016600412.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 PhilosophersDyn-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277016600412
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 440K
-rw-r--r-- 1 mcc users 14K Apr 30 07:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Apr 30 07:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 30 07:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 83K Apr 30 07:18 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 5.2K May 9 08:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K May 9 08:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 9 08:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 9 08:27 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 87K 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 PhilosophersDyn-PT-03-LTLFireability-00
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-01
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-02
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-03
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-04
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-05
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-06
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-07
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-08
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-09
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-10
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-11
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-12
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-13
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-14
FORMULA_NAME PhilosophersDyn-PT-03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652843991617

Running Version 202205111006
[2022-05-18 03:19:52] [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-18 03:19:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 03:19:53] [INFO ] Load time of PNML (sax parser for PT used): 86 ms
[2022-05-18 03:19:53] [INFO ] Transformed 30 places.
[2022-05-18 03:19:53] [INFO ] Transformed 84 transitions.
[2022-05-18 03:19:53] [INFO ] Parsed PT model containing 30 places and 84 transitions in 198 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2022-05-18 03:19:53] [INFO ] Reduced 5 identical enabling conditions.
[2022-05-18 03:19:53] [INFO ] Reduced 5 identical enabling conditions.
Ensure Unique test removed 3 transitions
Reduce redundant transitions removed 3 transitions.
FORMULA PhilosophersDyn-PT-03-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PhilosophersDyn-PT-03-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 81/81 transitions.
Applied a total of 0 rules in 11 ms. Remains 30 /30 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2022-05-18 03:19:53] [INFO ] Flow matrix only has 57 transitions (discarded 24 similar events)
// Phase 1: matrix 57 rows 30 cols
[2022-05-18 03:19:53] [INFO ] Computed 11 place invariants in 11 ms
[2022-05-18 03:19:53] [INFO ] Dead Transitions using invariants and state equation in 206 ms found 30 transitions.
Found 30 dead transitions using SMT.
Drop transitions removed 30 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 30 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:53] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-18 03:19:53] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:53] [INFO ] Computed 11 place invariants in 5 ms
[2022-05-18 03:19:53] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:53] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 30/30 places, 51/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/81 transitions.
Support contains 30 out of 30 places after structural reductions.
[2022-05-18 03:19:53] [INFO ] Flatten gal took : 30 ms
[2022-05-18 03:19:53] [INFO ] Flatten gal took : 15 ms
[2022-05-18 03:19:53] [INFO ] Input system was already deterministic with 51 transitions.
Incomplete random walk after 10000 steps, including 1404 resets, run finished after 165 ms. (steps per millisecond=60 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 234 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:54] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-18 03:19:54] [INFO ] [Real]Absence check using 6 positive place invariants in 46 ms returned sat
[2022-05-18 03:19:54] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 24 ms returned sat
[2022-05-18 03:19:54] [INFO ] After 131ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
FORMULA PhilosophersDyn-PT-03-LTLFireability-14 TRUE 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(p0)))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:54] [INFO ] Computed 11 place invariants in 7 ms
[2022-05-18 03:19:54] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:54] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:54] [INFO ] Implicit Places using invariants in 52 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:54] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:54] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:54] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:54] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:54] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s12 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s8 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s8 1) (GEQ s12 1) (GEQ s14 1) (G...], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-00 finished in 617 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U !(F(p0) U !F(p0))))'
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 10 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:55] [INFO ] Computed 11 place invariants in 4 ms
[2022-05-18 03:19:55] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:55] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:55] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:55] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-18 03:19:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:55] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2022-05-18 03:19:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:55] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:55] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s6 1) (GEQ s9 1) (GEQ s12 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s22 1)) (AND (GEQ s4 1) (GEQ s21 1) (GEQ s27 1)) (AND (GEQ s12 1) (GEQ s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14362 reset in 327 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-02 finished in 585 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U F(p1)))'
Support contains 18 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:55] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:55] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:55] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:55] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:19:55] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:55] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2022-05-18 03:19:55] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:55] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:56] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (AND (GEQ s4 1) (GEQ s24 1)) (AND (GEQ s14 1) (GEQ s20 1)) (AND (GEQ s1 1) (GEQ s12 1)) (AND (GEQ s8 1) (GEQ s12 1) (GEQ s14 1) (GEQ s17 1)) (AND (...], 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 50000 reset in 223 ms.
Product exploration explored 100000 steps with 50000 reset in 246 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 : [(NOT p1), (X p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge :(X p1)
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-PT-03-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-03-LTLFireability-04 finished in 816 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:56] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:56] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:56] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:56] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:56] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:56] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:56] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:56] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s3 1) (GEQ s7 1) (GEQ s10 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 151 ms.
Product exploration explored 100000 steps with 50000 reset in 140 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 : [(NOT p0), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PhilosophersDyn-PT-03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PhilosophersDyn-PT-03-LTLFireability-05 finished in 694 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&G((F(X(p2))||p1))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:19:57] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-18 03:19:57] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 6 ms
[2022-05-18 03:19:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:57] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:19:57] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s8 1) (GEQ s12 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s8 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s8 1) (GEQ s12 1) (GEQ s14 1) (G...], 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]]
Stuttering criterion allowed to conclude after 7 steps with 1 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-06 finished in 486 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(!(p0 U (G(p1)||(p2 U p3))))))'
Support contains 21 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:57] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:57] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:19:57] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:57] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:57] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:58] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR p1 p3), (OR p1 p3), p3, p1]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=p3, acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={1} source=1 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 3}], [{ cond=p3, acceptance={0, 1} source=2 dest: 1}, { cond=(AND p2 (NOT p3)), acceptance={1} source=2 dest: 2}], [{ cond=p1, acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s8 1) (GEQ s12 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s8 1) (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s8 1) (GEQ s12 1) (GEQ s14 1) (G...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 15711 reset in 384 ms.
Stack based approach found an accepted trace after 341 steps with 55 reset with depth 7 and stack size 7 in 4 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-07 finished in 806 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(F(G(p0))))&&F((F(p2)&&p1)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:58] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:58] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:58] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:58] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:58] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:19:58] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:58] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
[2022-05-18 03:19:58] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:58] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:58] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s26 1) (GEQ s27 1)), p2:(OR (LT s13 1) (LT s26 1) (LT s27 1)), p0:(AND (GEQ s14 1) (GEQ s20 1))], 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 6 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-08 finished in 390 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(p0 U p0)&&F(X(p1))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:59] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 03:19:59] [INFO ] Implicit Places using invariants in 35 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:59] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 98 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:59] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p1), true, (OR (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=2, aps=[p1:(AND (GEQ s12 1) (GEQ s21 1) (GEQ s25 1)), p0:(AND (GEQ s1 1) (GEQ s12 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]]
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-09 finished in 290 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:19:59] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:59] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:59] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:59] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-10 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 (GEQ s8 1) (GEQ s28 1) (GEQ s29 1))], 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 PhilosophersDyn-PT-03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-10 finished in 346 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 7 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:19:59] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:19:59] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:19:59] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:19:59] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 109 ms to find 0 implicit places.
[2022-05-18 03:19:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:19:59] [INFO ] Computed 11 place invariants in 3 ms
[2022-05-18 03:19:59] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s21 1) (LT s27 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 14409 reset in 181 ms.
Stack based approach found an accepted trace after 27 steps with 4 reset with depth 6 and stack size 6 in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-11 finished in 452 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(X(X(G(X(F((G(p0)&&p1))))))))))))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 9 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:00] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:00] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:00] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:20:00] [INFO ] Implicit Places using invariants in 29 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:00] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:20:00] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:00] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2022-05-18 03:20:00] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:00] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:00] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s4 1) (LT s5 1) (LT s16 1)), p0:(OR (LT s8 1) (LT s28 1) (LT s29 1))], nbAcceptance=1, 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 14238 reset in 216 ms.
Product exploration explored 100000 steps with 14356 reset in 204 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 234 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 p0)), (X (NOT (OR (NOT p1) (NOT p0)))), (X (X (AND p1 p0))), (X (X p0)), (X (X (NOT (OR (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 310 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:01] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:01] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:20:01] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 15 ms returned sat
[2022-05-18 03:20:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:01] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2022-05-18 03:20:01] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:01] [INFO ] [Real]Added 30 Read/Feed constraints in 11 ms returned sat
[2022-05-18 03:20:01] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 7 ms.
[2022-05-18 03:20:01] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:01] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:01] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:01] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:02] [INFO ] Implicit Places using invariants in 57 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:02] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:20:02] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:02] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
[2022-05-18 03:20:02] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:02] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:02] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 240 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (OR (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X p0)), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X (AND p0 p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p0), (F (AND p0 p1))]
Knowledge based reduction with 6 factoid took 356 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:03] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-18 03:20:03] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 7 ms returned sat
[2022-05-18 03:20:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-18 03:20:03] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2022-05-18 03:20:03] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:03] [INFO ] [Real]Added 30 Read/Feed constraints in 3 ms returned sat
[2022-05-18 03:20:03] [INFO ] Computed and/alt/rep : 15/123/15 causal constraints (skipped 33 transitions) in 4 ms.
[2022-05-18 03:20:03] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Product exploration explored 100000 steps with 14408 reset in 164 ms.
Product exploration explored 100000 steps with 14329 reset in 165 ms.
Built C files in :
/tmp/ltsmin6930900737748188136
[2022-05-18 03:20:03] [INFO ] Computing symmetric may disable matrix : 51 transitions.
[2022-05-18 03:20:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 03:20:03] [INFO ] Computing symmetric may enable matrix : 51 transitions.
[2022-05-18 03:20:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 03:20:03] [INFO ] Computing Do-Not-Accords matrix : 51 transitions.
[2022-05-18 03:20:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-18 03:20:03] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6930900737748188136
Running compilation step : cd /tmp/ltsmin6930900737748188136;'/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 257 ms.
Running link step : cd /tmp/ltsmin6930900737748188136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6930900737748188136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12743142419980729824.hoa' '--buchi-type=spotba'
LTSmin run took 99 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PhilosophersDyn-PT-03-LTLFireability-12 finished in 4077 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F(p1)))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:04] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:04] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:04] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:20:04] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:04] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:20:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:04] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 100 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:04] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), 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:(AND (GEQ s1 1) (GEQ s12 1)), p0:(AND (GEQ s5 1) (GEQ s14 1) (GEQ s22 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]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-13 finished in 343 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U p1))'
Support contains 8 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 51/51 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 51/51 (removed 0) transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:04] [INFO ] Computed 11 place invariants in 2 ms
[2022-05-18 03:20:04] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:04] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:20:04] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:04] [INFO ] Computed 11 place invariants in 0 ms
[2022-05-18 03:20:04] [INFO ] State equation strengthened by 30 read => feed constraints.
[2022-05-18 03:20:04] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
// Phase 1: matrix 51 rows 30 cols
[2022-05-18 03:20:04] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-18 03:20:04] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 30/30 places, 51/51 transitions.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : PhilosophersDyn-PT-03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s0 1) (GEQ s4 1) (GEQ s10 1) (GEQ s27 1)), p0:(AND (GEQ s12 1) (GEQ s14 1) (GEQ s25 1) (GEQ s29 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]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 1 ms.
FORMULA PhilosophersDyn-PT-03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PhilosophersDyn-PT-03-LTLFireability-15 finished in 301 ms.
All properties solved by simple procedures.
Total runtime 11982 ms.

BK_STOP 1652844004905

--------------------
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="PhilosophersDyn-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 PhilosophersDyn-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 r168-tall-165277016600412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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