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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 272K
-rw-r--r-- 1 mcc users 7.8K Apr 29 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Apr 29 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 29 11:32 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 4.2K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:26 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 12K 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-000050-LTLFireability-00
FORMULA_NAME Philosophers-COL-000050-LTLFireability-01
FORMULA_NAME Philosophers-COL-000050-LTLFireability-02
FORMULA_NAME Philosophers-COL-000050-LTLFireability-03
FORMULA_NAME Philosophers-COL-000050-LTLFireability-04
FORMULA_NAME Philosophers-COL-000050-LTLFireability-05
FORMULA_NAME Philosophers-COL-000050-LTLFireability-06
FORMULA_NAME Philosophers-COL-000050-LTLFireability-07
FORMULA_NAME Philosophers-COL-000050-LTLFireability-08
FORMULA_NAME Philosophers-COL-000050-LTLFireability-09
FORMULA_NAME Philosophers-COL-000050-LTLFireability-10
FORMULA_NAME Philosophers-COL-000050-LTLFireability-11
FORMULA_NAME Philosophers-COL-000050-LTLFireability-12
FORMULA_NAME Philosophers-COL-000050-LTLFireability-13
FORMULA_NAME Philosophers-COL-000050-LTLFireability-14
FORMULA_NAME Philosophers-COL-000050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652802201588

Running Version 202205111006
[2022-05-17 15:43:24] [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:43:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 15:43:24] [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:43:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-17 15:43:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 539 ms
[2022-05-17 15:43:25] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250 PT places and 250.0 transition bindings in 20 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2022-05-17 15:43:25] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 13 ms.
[2022-05-17 15:43:25] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-COL-000050-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 2602 steps, including 50 resets, run visited all 4 properties in 16 ms. (steps per millisecond=162 )
[2022-05-17 15:43:25] [INFO ] Flatten gal took : 13 ms
[2022-05-17 15:43:25] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50) 50) 50)]] contains successor/predecessor on variables of sort Philo
[2022-05-17 15:43:25] [INFO ] Unfolded HLPN to a Petri net with 250 places and 250 transitions 800 arcs in 15 ms.
[2022-05-17 15:43:25] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:25] [INFO ] Computed 100 place invariants in 20 ms
[2022-05-17 15:43:25] [INFO ] Implicit Places using invariants in 212 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:25] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 15:43:26] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:26] [INFO ] Computed 100 place invariants in 6 ms
[2022-05-17 15:43:26] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2022-05-17 15:43:26] [INFO ] Flatten gal took : 38 ms
[2022-05-17 15:43:26] [INFO ] Flatten gal took : 36 ms
[2022-05-17 15:43:26] [INFO ] Input system was already deterministic with 250 transitions.
Finished random walk after 154 steps, including 0 resets, run visited all 10 properties in 15 ms. (steps per millisecond=10 )
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' '!(G(F((G(!(F(p0) U p0))&&X(p1)))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:27] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 15:43:27] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:27] [INFO ] Computed 100 place invariants in 11 ms
[2022-05-17 15:43:27] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
[2022-05-17 15:43:27] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:27] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 15:43:27] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 267 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 935 reset in 625 ms.
Stack based approach found an accepted trace after 133 steps with 8 reset with depth 112 and stack size 112 in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-00 finished in 1649 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(G(X(F(p0)))))||X(X(p1)))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:28] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 15:43:28] [INFO ] Implicit Places using invariants in 70 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:28] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:28] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:28] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 15:43:29] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 156 ms :[(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-000050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (AND (GEQ s34 1) (GEQ s83 1)) (AND (GEQ s39 1) (GEQ s88 1)) (AND (GEQ s29 1) (GEQ s78 1)) (AND (GEQ s2 1) (GEQ s51 1)) (AND (GEQ s7 1) (GEQ s56 1))...], nbAcceptance=1, 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 33333 reset in 701 ms.
Product exploration explored 100000 steps with 33333 reset in 764 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 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-COL-000050-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000050-LTLFireability-01 finished in 2093 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(p0 U X(p1)))&&(G(!p1)||p2))))'
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 29 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:30] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:30] [INFO ] Implicit Places using invariants in 80 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:30] [INFO ] Computed 100 place invariants in 10 ms
[2022-05-17 15:43:31] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:31] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:31] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 346 ms :[p1, p1, true, p1, p1, p1]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 2}, { cond=p2, acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=true, acceptance={} source=3 dest: 5}], [{ cond=p1, acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 2}]], initial=0, aps=[p2:(OR (AND (GEQ s34 1) (GEQ s83 1)) (AND (GEQ s39 1) (GEQ s88 1)) (AND (GEQ s29 1) (GEQ s78 1)) (AND (GEQ s2 1) (GEQ s51 1)) (AND (GEQ s7 1) (GEQ s56 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-03 finished in 763 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G(((p0 U X(G(X(p1))))||X(p2))))))'
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 12 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:31] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:31] [INFO ] Implicit Places using invariants in 58 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:31] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 15:43:31] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2022-05-17 15:43:31] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:31] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 15:43:31] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 794 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=1 dest: 3}, { cond=(NOT p2), acceptance={1} source=1 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=1 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=2 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=2 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={1} source=2 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={1} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p1)), acceptance={1} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={1} source=5 dest: 6}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={1} source=5 dest: 7}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=6 dest: 3}, { cond=(AND p2 p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={1} source=6 dest: 4}, { cond=(AND p0 p2 p1), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=6 dest: 5}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=7 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0, 1} source=7 dest: 3}, { cond=(AND p0 p2 p1), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={1} source=7 dest: 6}, { cond=(AND p0 p2 p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2 (NOT p1)), acceptance={1} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 33469 reset in 940 ms.
Product exploration explored 100000 steps with 33212 reset in 971 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 1459 ms. Reduced automaton from 8 states, 44 edges and 3 AP to 8 states, 44 edges and 3 AP.
Stuttering acceptance computed with spot in 309 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Finished random walk after 908 steps, including 0 resets, run visited all 21 properties in 24 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p2) p0 p1)), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p2) p0 (NOT p1))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0) p1)), (F (AND p0 p1)), (F (AND (NOT p2) p0)), (F (AND (NOT p0) p1)), (F (AND (NOT p2) p1)), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND p2 p0 p1)), (F p0), (F (NOT (AND p2 (NOT p1)))), (F (AND p2 p1)), (F (NOT p2)), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p2 p0 (NOT p1)))]
Knowledge based reduction with 12 factoid took 2641 ms. Reduced automaton from 8 states, 44 edges and 3 AP to 8 states, 44 edges and 3 AP.
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 337 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 19 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:39] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:40] [INFO ] Implicit Places using invariants in 88 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:40] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2022-05-17 15:43:40] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:40] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:40] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 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) p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 12 factoid took 1391 ms. Reduced automaton from 8 states, 44 edges and 3 AP to 8 states, 44 edges and 3 AP.
Stuttering acceptance computed with spot in 577 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Finished random walk after 2015 steps, including 0 resets, run visited all 21 properties in 49 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) p0))), (X p2), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT (AND p2 p0 p1))))]
False Knowledge obtained : [(X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p2 p0 (NOT p1)))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (AND p2 (NOT p0) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p2 (NOT p0) p1))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND p0 p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 p2)), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1)), (F (AND p0 (NOT p2))), (F (AND (NOT p0) p1)), (F (AND p1 (NOT p2))), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 p1 p2)), (F p0), (F (NOT (AND (NOT p1) p2))), (F (AND p1 p2)), (F (NOT p2)), (F (NOT (AND (NOT p0) (NOT p1) p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F (AND p0 (NOT p1) p2))]
Knowledge based reduction with 12 factoid took 1824 ms. Reduced automaton from 8 states, 44 edges and 3 AP to 8 states, 44 edges and 3 AP.
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Stuttering acceptance computed with spot in 365 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false, false]
Product exploration explored 100000 steps with 33418 reset in 946 ms.
Product exploration explored 100000 steps with 33284 reset in 972 ms.
Built C files in :
/tmp/ltsmin502930428343972411
[2022-05-17 15:43:48] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-05-17 15:43:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 15:43:48] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-05-17 15:43:48] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 15:43:48] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-05-17 15:43:48] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 15:43:48] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin502930428343972411
Running compilation step : cd /tmp/ltsmin502930428343972411;'/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 589 ms.
Running link step : cd /tmp/ltsmin502930428343972411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin502930428343972411;'/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/stateBased2851877168794848266.hoa' '--buchi-type=spotba'
LTSmin run took 3270 ms.
FORMULA Philosophers-COL-000050-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-COL-000050-LTLFireability-05 finished in 20637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p1))||p0) U F((X(p1)||(p2 U p1)))))'
Support contains 50 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 16 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:52] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 15:43:52] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:52] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 15:43:52] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2022-05-17 15:43:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:52] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:52] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 866 ms :[(NOT p1)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], 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 7351 reset in 1059 ms.
Product exploration explored 100000 steps with 7406 reset in 1087 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 (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Finished random walk after 12 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:56] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:56] [INFO ] [Real]Absence check using 100 positive place invariants in 28 ms returned sat
[2022-05-17 15:43:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 15:43:56] [INFO ] [Real]Absence check using state equation in 539 ms returned sat
[2022-05-17 15:43:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 15:43:56] [INFO ] [Nat]Absence check using 100 positive place invariants in 28 ms returned sat
[2022-05-17 15:43:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 15:43:57] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2022-05-17 15:43:57] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 20 ms.
[2022-05-17 15:43:57] [INFO ] Added : 0 causal constraints over 0 iterations in 55 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 50 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:57] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:57] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:57] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:57] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2022-05-17 15:43:57] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:57] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:43:57] [INFO ] Dead Transitions using invariants and state equation in 144 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 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 : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 706 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p1)]
Finished random walk after 18 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(NOT p1), (X (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p1)]
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:43:58] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 15:43:58] [INFO ] [Real]Absence check using 100 positive place invariants in 29 ms returned sat
[2022-05-17 15:43:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 15:43:59] [INFO ] [Real]Absence check using state equation in 542 ms returned sat
[2022-05-17 15:43:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 15:43:59] [INFO ] [Nat]Absence check using 100 positive place invariants in 29 ms returned sat
[2022-05-17 15:43:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 15:43:59] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2022-05-17 15:43:59] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-17 15:43:59] [INFO ] Added : 0 causal constraints over 0 iterations in 39 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7421 reset in 1058 ms.
Product exploration explored 100000 steps with 7384 reset in 1093 ms.
Built C files in :
/tmp/ltsmin11215687635934595450
[2022-05-17 15:44:01] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-05-17 15:44:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 15:44:01] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-05-17 15:44:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 15:44:01] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-05-17 15:44:01] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 15:44:01] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11215687635934595450
Running compilation step : cd /tmp/ltsmin11215687635934595450;'/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 482 ms.
Running link step : cd /tmp/ltsmin11215687635934595450;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin11215687635934595450;'/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/stateBased10052177763811455469.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 19 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:16] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:17] [INFO ] Implicit Places using invariants in 120 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:17] [INFO ] Computed 100 place invariants in 7 ms
[2022-05-17 15:44:17] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2022-05-17 15:44:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:17] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:17] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Built C files in :
/tmp/ltsmin17335046874819011732
[2022-05-17 15:44:17] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-05-17 15:44:17] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 15:44:17] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-05-17 15:44:17] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 15:44:17] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-05-17 15:44:17] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 15:44:17] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17335046874819011732
Running compilation step : cd /tmp/ltsmin17335046874819011732;'/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 469 ms.
Running link step : cd /tmp/ltsmin17335046874819011732;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin17335046874819011732;'/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/stateBased12242121281495104830.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 15:44:32] [INFO ] Flatten gal took : 16 ms
[2022-05-17 15:44:32] [INFO ] Flatten gal took : 15 ms
[2022-05-17 15:44:32] [INFO ] Time to serialize gal into /tmp/LTL2561277245043882309.gal : 4 ms
[2022-05-17 15:44:32] [INFO ] Time to serialize properties into /tmp/LTL17028526059114410324.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2561277245043882309.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17028526059114410324.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL2561277...267
Read 1 LTL properties
Checking formula 0 : !(((((((((F(G("(((((((Eat_2>=1)||(Eat_0>=1))||((Eat_6>=1)||(Eat_4>=1)))||(((Eat_10>=1)||(Eat_8>=1))||((Eat_14>=1)||(Eat_12>=1))))||(((...5550
Formula 0 simplified : !(("(((((((Think_30>=1)&&(Fork_29>=1))||((Think_38>=1)&&(Fork_37>=1)))||(((Think_33>=1)&&(Fork_32>=1))||((Think_25>=1)&&(Fork_24>=1)...5523
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
235 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.40226,96700,1,0,254,479041,20,203,6102,444300,515
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-COL-000050-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Philosophers-COL-000050-LTLFireability-06 finished in 43187 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:35] [INFO ] Computed 100 place invariants in 0 ms
[2022-05-17 15:44:35] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:35] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:35] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2022-05-17 15:44:35] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:35] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:35] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (AND (GEQ s50 1) (GEQ s100 1)) (AND (GEQ s87 1) (GEQ s137 1)) (AND (GEQ s82 1) (GEQ s132 1)) (AND (GEQ s92 1) (GEQ s142 1)) (AND (GEQ s60 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 548 reset in 644 ms.
Stack based approach found an accepted trace after 6945 steps with 31 reset with depth 279 and stack size 278 in 45 ms.
FORMULA Philosophers-COL-000050-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-07 finished in 1118 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(G(p1))||p0))&&p2)))'
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:36] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 15:44:36] [INFO ] Implicit Places using invariants in 79 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:36] [INFO ] Computed 100 place invariants in 4 ms
[2022-05-17 15:44:36] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2022-05-17 15:44:36] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:36] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:36] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 605 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p2) p1) (AND (NOT p0) p1)), acceptance={1} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(OR (AND (GEQ s50 1) (GEQ s100 1)) (AND (GEQ s87 1) (GEQ s137 1)) (AND (GEQ s82 1) (GEQ s132 1)) (AND (GEQ s92 1) (GEQ s142 1)) (AND (GEQ s60 1) (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 25 reset in 643 ms.
Stack based approach found an accepted trace after 446 steps with 0 reset with depth 447 and stack size 440 in 7 ms.
FORMULA Philosophers-COL-000050-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-09 finished in 1619 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((X((X(p0)&&p0)) U !p0)&&X((p1 U p0))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:38] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 15:44:38] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:38] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 15:44:38] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:38] [INFO ] Computed 100 place invariants in 7 ms
[2022-05-17 15:44:38] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), true, true]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 1}], [{ 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=[p0:(OR (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 69 steps with 5 reset in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-11 finished in 482 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||G(p2)||p0)))'
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:38] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:38] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:38] [INFO ] Computed 100 place invariants in 4 ms
[2022-05-17 15:44:38] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:38] [INFO ] Computed 100 place invariants in 5 ms
[2022-05-17 15:44:38] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s50 1) (GEQ s100 1)) (AND (GEQ s87 1) (GEQ s137 1)) (AND (GEQ s82 1) (GEQ s132 1)) (AND (GEQ s92 1) (GEQ s142 1)) (AND (GEQ s60 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 576 ms.
Product exploration explored 100000 steps with 50000 reset in 600 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) (NOT p2) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1) p2)))
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-COL-000050-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000050-LTLFireability-12 finished in 1911 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(!(X(G(X((p0 U p1)))) U p1)))||X(p2))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:40] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:40] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:40] [INFO ] Computed 100 place invariants in 4 ms
[2022-05-17 15:44:40] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:40] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:40] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 114 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2)), p1]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(OR (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-13 finished in 457 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(!(p0 U p1))||F(G(X(G(p2))))||G(!p1)))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:41] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 15:44:41] [INFO ] Implicit Places using invariants in 86 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:41] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:41] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2022-05-17 15:44:41] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:41] [INFO ] Computed 100 place invariants in 0 ms
[2022-05-17 15:44:41] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 31 ms :[(AND p1 (NOT p2))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p2:(OR (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 598 reset in 789 ms.
Stack based approach found an accepted trace after 8127 steps with 49 reset with depth 165 and stack size 163 in 65 ms.
FORMULA Philosophers-COL-000050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-14 finished in 1279 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(X(p0)))||X(X(!(p1 U p2)))))'
Support contains 200 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:42] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 15:44:42] [INFO ] Implicit Places using invariants in 76 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:42] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:42] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 15:44:42] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 15:44:42] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (AND (NOT p0) p2), p2, (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Philosophers-COL-000050-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=(AND p2 (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p2 p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(AND (OR (LT s13 1) (LT s63 1)) (OR (LT s8 1) (LT s58 1)) (OR (LT s18 1) (LT s68 1)) (OR (LT s40 1) (LT s90 1)) (OR (LT s28 1) (LT s78 1)) (OR (LT s1 1...], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 8 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-15 finished in 538 ms.
All properties solved by simple procedures.
Total runtime 78080 ms.

BK_STOP 1652802282883

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-000050"
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-000050, 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-165277016400204"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000050.tgz
mv Philosophers-COL-000050 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 ;