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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 72K Apr 29 11:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 460K Apr 29 11:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 43K Apr 29 11:32 CTLFireability.txt
-rw-r--r-- 1 mcc users 297K 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 31K May 9 08:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 9 08:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 17K May 9 08:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 9 08:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K May 9 08:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 16K May 9 08:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 109K 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-PT-000050-LTLFireability-00
FORMULA_NAME Philosophers-PT-000050-LTLFireability-01
FORMULA_NAME Philosophers-PT-000050-LTLFireability-02
FORMULA_NAME Philosophers-PT-000050-LTLFireability-03
FORMULA_NAME Philosophers-PT-000050-LTLFireability-04
FORMULA_NAME Philosophers-PT-000050-LTLFireability-05
FORMULA_NAME Philosophers-PT-000050-LTLFireability-06
FORMULA_NAME Philosophers-PT-000050-LTLFireability-07
FORMULA_NAME Philosophers-PT-000050-LTLFireability-08
FORMULA_NAME Philosophers-PT-000050-LTLFireability-09
FORMULA_NAME Philosophers-PT-000050-LTLFireability-10
FORMULA_NAME Philosophers-PT-000050-LTLFireability-11
FORMULA_NAME Philosophers-PT-000050-LTLFireability-12
FORMULA_NAME Philosophers-PT-000050-LTLFireability-13
FORMULA_NAME Philosophers-PT-000050-LTLFireability-14
FORMULA_NAME Philosophers-PT-000050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652822746648

Running Version 202205111006
[2022-05-17 21:25:47] [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 21:25:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 21:25:48] [INFO ] Load time of PNML (sax parser for PT used): 95 ms
[2022-05-17 21:25:48] [INFO ] Transformed 250 places.
[2022-05-17 21:25:48] [INFO ] Transformed 250 transitions.
[2022-05-17 21:25:48] [INFO ] Found NUPN structural information;
[2022-05-17 21:25:48] [INFO ] Parsed PT model containing 250 places and 250 transitions in 201 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-PT-000050-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000050-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 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 21:25:48] [INFO ] Computed 100 place invariants in 20 ms
[2022-05-17 21:25:48] [INFO ] Implicit Places using invariants in 219 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:48] [INFO ] Computed 100 place invariants in 8 ms
[2022-05-17 21:25:48] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 436 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:48] [INFO ] Computed 100 place invariants in 4 ms
[2022-05-17 21:25:48] [INFO ] Dead Transitions using invariants and state equation in 171 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 21:25:49] [INFO ] Flatten gal took : 50 ms
[2022-05-17 21:25:49] [INFO ] Flatten gal took : 30 ms
[2022-05-17 21:25:49] [INFO ] Input system was already deterministic with 250 transitions.
Finished random walk after 3603 steps, including 1 resets, run visited all 21 properties in 83 ms. (steps per millisecond=43 )
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 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 21:25:49] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:25:49] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:49] [INFO ] Computed 100 place invariants in 10 ms
[2022-05-17 21:25:50] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2022-05-17 21:25:50] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:50] [INFO ] Computed 100 place invariants in 5 ms
[2022-05-17 21:25:50] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : Philosophers-PT-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 (EQ s1 1) (EQ s3 1) (EQ s5 1) (EQ s7 1) (EQ s9 1) (EQ s11 1) (EQ s13 1) (EQ s15 1) (EQ s17 1) (EQ s19 1) (EQ s21 1) (EQ s23 1) (EQ s25 1) (EQ s27 1...], 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 990 reset in 627 ms.
Stack based approach found an accepted trace after 308 steps with 1 reset with depth 307 and stack size 307 in 2 ms.
FORMULA Philosophers-PT-000050-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-00 finished in 1640 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 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 21:25:51] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:25:51] [INFO ] Implicit Places using invariants in 89 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:51] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:25:51] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:51] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:25:51] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 136 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-PT-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 (EQ s98 1) (EQ s155 1)) (AND (EQ s55 1) (EQ s103 1)) (AND (EQ s60 1) (EQ s102 1)) (AND (EQ s91 1) (EQ s132 1)) (AND (EQ s50 1) (EQ s108 1)) (A...], 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 863 ms.
Product exploration explored 100000 steps with 33333 reset in 896 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 p1)), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Philosophers-PT-000050-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000050-LTLFireability-01 finished in 2401 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(!(p0 U X(p1)))&&(G(p3)||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 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 21:25:53] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:25:53] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:53] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 21:25:54] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:54] [INFO ] Computed 100 place invariants in 5 ms
[2022-05-17 21:25:54] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), true, p1, (NOT p3), p1]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(OR p2 p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) p3), 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=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 2}]], initial=0, aps=[p2:(OR (AND (EQ s98 1) (EQ s155 1)) (AND (EQ s55 1) (EQ s103 1)) (AND (EQ s60 1) (EQ s102 1)) (AND (EQ s91 1) (EQ s132 1)) (AND (EQ s50 1) (EQ s108 1)) (A...], 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 3 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-03 finished in 717 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 21:25:54] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:25:54] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:54] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:25:54] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
[2022-05-17 21:25:54] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:25:54] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:25:54] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 446 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-PT-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 (EQ s1 1) (EQ s3 1) (EQ s5 1) (EQ s7 1) (EQ s9 1) (EQ s11 1) (EQ s13 1) (EQ s15 1) (EQ s17 1) (EQ s19 1) (EQ s21 1) (EQ s23 1) (EQ s25 1) (EQ s27 1...], 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 33269 reset in 1147 ms.
Product exploration explored 100000 steps with 33216 reset in 1210 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 (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 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) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (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 (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 12 factoid took 1317 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 371 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 1991 steps, including 0 resets, run visited all 21 properties in 30 ms. (steps per millisecond=66 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p0 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) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (AND p2 p1))), (X (X (NOT (AND p2 p1)))), (X (X (AND p0 p2 (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (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 (NOT p0) p2 p1))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT p1))), (X (X 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 2070 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 381 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 373 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 10 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 21:26:02] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 21:26:02] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:02] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:26:02] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2022-05-17 21:26:02] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:02] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:26:02] [INFO ] Dead Transitions using invariants and state equation in 146 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 p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 12 factoid took 1349 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 336 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 1439 steps, including 0 resets, run visited all 21 properties in 34 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (X (X (AND p0 (NOT p1) p2))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X 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 2008 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 338 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 336 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 359 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 33359 reset in 1129 ms.
Product exploration explored 100000 steps with 33422 reset in 1160 ms.
Built C files in :
/tmp/ltsmin16232062880191036018
[2022-05-17 21:26:10] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-05-17 21:26:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:26:10] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-05-17 21:26:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:26:10] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-05-17 21:26:10] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:26:10] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16232062880191036018
Running compilation step : cd /tmp/ltsmin16232062880191036018;'/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 636 ms.
Running link step : cd /tmp/ltsmin16232062880191036018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16232062880191036018;'/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/stateBased9927545361901783312.hoa' '--buchi-type=spotba'
LTSmin run took 1452 ms.
FORMULA Philosophers-PT-000050-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Philosophers-PT-000050-LTLFireability-05 finished in 18004 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 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 21:26:12] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:26:12] [INFO ] Implicit Places using invariants in 87 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:12] [INFO ] Computed 100 place invariants in 4 ms
[2022-05-17 21:26:12] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2022-05-17 21:26:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:12] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:26:12] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s1 1) (EQ s3 1) (EQ s5 1) (EQ s7 1) (EQ s9 1) (EQ s11 1) (EQ s13 1) (EQ s15 1) (EQ s17 1) (EQ s19 1) (EQ s21 1) (EQ s23 1) (EQ s25 1) (EQ s27 1...], 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 7325 reset in 1142 ms.
Product exploration explored 100000 steps with 7408 reset in 1200 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 386 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 30 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 124 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 43 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p1)]
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:15] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:26:16] [INFO ] [Real]Absence check using 100 positive place invariants in 64 ms returned sat
[2022-05-17 21:26:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:26:23] [INFO ] [Real]Absence check using state equation in 7486 ms returned sat
[2022-05-17 21:26:23] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:26:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 29 ms returned sat
[2022-05-17 21:26:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:26:24] [INFO ] [Nat]Absence check using state equation in 191 ms returned sat
[2022-05-17 21:26:24] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-17 21:26:24] [INFO ] Added : 0 causal constraints over 0 iterations in 58 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 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 21:26:24] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:26:24] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:24] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:26:24] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2022-05-17 21:26:24] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:24] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:26:24] [INFO ] Dead Transitions using invariants and state equation in 142 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 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 26 ms :[(NOT p1)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=12 )
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 132 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 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p1)]
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:25] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:26:25] [INFO ] [Real]Absence check using 100 positive place invariants in 63 ms returned sat
[2022-05-17 21:26:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 21:26:32] [INFO ] [Real]Absence check using state equation in 7452 ms returned sat
[2022-05-17 21:26:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 21:26:33] [INFO ] [Nat]Absence check using 100 positive place invariants in 25 ms returned sat
[2022-05-17 21:26:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 21:26:33] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2022-05-17 21:26:33] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-17 21:26:33] [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 45 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7396 reset in 1149 ms.
Product exploration explored 100000 steps with 7319 reset in 1205 ms.
Built C files in :
/tmp/ltsmin719854729957799106
[2022-05-17 21:26:35] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-05-17 21:26:35] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:26:35] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-05-17 21:26:35] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:26:35] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-05-17 21:26:35] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:26:35] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin719854729957799106
Running compilation step : cd /tmp/ltsmin719854729957799106;'/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 467 ms.
Running link step : cd /tmp/ltsmin719854729957799106;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin719854729957799106;'/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/stateBased7581077160639371223.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 25 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 21:26:50] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:26:51] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:51] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:26:51] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
[2022-05-17 21:26:51] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:26:51] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:26:51] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Built C files in :
/tmp/ltsmin1155845240652038330
[2022-05-17 21:26:51] [INFO ] Computing symmetric may disable matrix : 250 transitions.
[2022-05-17 21:26:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:26:51] [INFO ] Computing symmetric may enable matrix : 250 transitions.
[2022-05-17 21:26:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:26:51] [INFO ] Computing Do-Not-Accords matrix : 250 transitions.
[2022-05-17 21:26:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-17 21:26:51] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1155845240652038330
Running compilation step : cd /tmp/ltsmin1155845240652038330;'/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 504 ms.
Running link step : cd /tmp/ltsmin1155845240652038330;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1155845240652038330;'/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/stateBased13837469139815352572.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-17 21:27:06] [INFO ] Flatten gal took : 16 ms
[2022-05-17 21:27:06] [INFO ] Flatten gal took : 16 ms
[2022-05-17 21:27:06] [INFO ] Time to serialize gal into /tmp/LTL13333656189115793340.gal : 4 ms
[2022-05-17 21:27:06] [INFO ] Time to serialize properties into /tmp/LTL11192617214439207993.ltl : 1 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/LTL13333656189115793340.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11192617214439207993.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/LTL1333365...268
Read 1 LTL properties
Checking formula 0 : !(((((((((F(G("(((((((Eat_2==1)||(Eat_4==1))||((Eat_6==1)||(Eat_8==1)))||(((Eat_10==1)||(Eat_12==1))||((Eat_15==1)||(Eat_17==1))))||((...5557
Formula 0 simplified : !(("(((((((Fork_11==1)&&(Think_12==1))||((Fork_6==1)&&(Think_7==1)))||(((Fork_36==1)&&(Think_37==1))||((Fork_3==1)&&(Think_4==1))))|...5530
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
270 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.74593,96728,1,0,254,479041,20,203,6152,443856,515
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Philosophers-PT-000050-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property Philosophers-PT-000050-LTLFireability-06 finished in 57563 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 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 21:27:10] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:27:10] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:10] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:10] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2022-05-17 21:27:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:10] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:10] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-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 (EQ s68 1) (EQ s210 1)) (AND (EQ s59 1) (EQ s220 1)) (AND (EQ s73 1) (EQ s207 1)) (AND (EQ s69 1) (EQ s234 1)) (AND (EQ s85 1) (EQ s247 1)) (A...], 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 541 reset in 644 ms.
Stack based approach found an accepted trace after 1636 steps with 8 reset with depth 113 and stack size 113 in 13 ms.
FORMULA Philosophers-PT-000050-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-07 finished in 1169 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((!(F(p0) U X(p1))&&F(p2)))))'
Support contains 6 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 21:27:11] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:11] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:11] [INFO ] Computed 100 place invariants in 5 ms
[2022-05-17 21:27:11] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:11] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:27:11] [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 408 ms :[(OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1), p1, p1, (NOT p2), (AND p0 p1), true, (AND p0 p1), (AND p0 (NOT p1))]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}, { cond=(NOT p2), acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}], [{ cond=p1, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 3}, { cond=p0, acceptance={} source=6 dest: 4}, { cond=(NOT p0), acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(AND p0 p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 9}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p0:(AND (EQ s55 1) (EQ s191 1)), p2:(OR (AND (EQ s86 1) (EQ s132 1)) (AND (EQ s55 1) (EQ s191 1))), p1:(AND (EQ s57 1) (EQ s172 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1648 steps with 119 reset in 14 ms.
FORMULA Philosophers-PT-000050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-08 finished in 959 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 202 transition count 202
Applied a total of 96 rules in 26 ms. Remains 202 /250 variables (removed 48) and now considering 202/250 (removed 48) transitions.
// Phase 1: matrix 202 rows 202 cols
[2022-05-17 21:27:12] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:12] [INFO ] Implicit Places using invariants in 119 ms returned []
// Phase 1: matrix 202 rows 202 cols
[2022-05-17 21:27:12] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 21:27:12] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2022-05-17 21:27:12] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 202 rows 202 cols
[2022-05-17 21:27:12] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:12] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 202/250 places, 202/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/250 places, 202/250 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s57 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2107 steps with 0 reset in 15 ms.
FORMULA Philosophers-PT-000050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-09 finished in 559 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F(X(F(X(p1))))))'
Support contains 4 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 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 21:27:12] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:27:12] [INFO ] Implicit Places using invariants in 132 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:12] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:27:13] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:13] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:13] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s56 1) (EQ s105 1)), p1:(AND (EQ s61 1) (EQ s159 1))], nbAcceptance=0, 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 7144 steps with 22 reset in 38 ms.
FORMULA Philosophers-PT-000050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-10 finished in 747 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 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 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 21:27:13] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:27:13] [INFO ] Implicit Places using invariants in 138 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:13] [INFO ] Computed 100 place invariants in 8 ms
[2022-05-17 21:27:13] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:13] [INFO ] Computed 100 place invariants in 3 ms
[2022-05-17 21:27:13] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s69 1) (NEQ s118 1) (AND (EQ s61 1) (EQ s211 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4720 reset in 927 ms.
Stack based approach found an accepted trace after 1036 steps with 47 reset with depth 58 and stack size 58 in 10 ms.
FORMULA Philosophers-PT-000050-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-11 finished in 1578 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G((F(!F(G(p0))) U !F(p1)))&&p0))))'
Support contains 3 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 21:27:15] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:27:15] [INFO ] Implicit Places using invariants in 139 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:15] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:15] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:15] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:15] [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 88 ms :[(OR (NOT p0) p1), true, (OR (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s2 1), p1:(AND (EQ s57 1) (EQ s214 1))], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-PT-000050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-13 finished in 624 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 0 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 0 with 96 rules applied. Total rules applied 96 place count 202 transition count 202
Applied a total of 96 rules in 15 ms. Remains 202 /250 variables (removed 48) and now considering 202/250 (removed 48) transitions.
// Phase 1: matrix 202 rows 202 cols
[2022-05-17 21:27:15] [INFO ] Computed 100 place invariants in 2 ms
[2022-05-17 21:27:15] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 202 rows 202 cols
[2022-05-17 21:27:15] [INFO ] Computed 100 place invariants in 0 ms
[2022-05-17 21:27:15] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2022-05-17 21:27:15] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 202 rows 202 cols
[2022-05-17 21:27:15] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:16] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 202/250 places, 202/250 transitions.
Finished structural reductions, in 1 iterations. Remains : 202/250 places, 202/250 transitions.
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-14 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 (NEQ s36 1) (NEQ s90 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 41 reset in 328 ms.
Stack based approach found an accepted trace after 2691 steps with 1 reset with depth 529 and stack size 510 in 11 ms.
FORMULA Philosophers-PT-000050-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-14 finished in 840 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(G((G(X(X(p0)))&&F(p0)&&p1)))))'
Support contains 4 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 21:27:16] [INFO ] Computed 100 place invariants in 0 ms
[2022-05-17 21:27:16] [INFO ] Implicit Places using invariants in 123 ms returned []
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:16] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:16] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
// Phase 1: matrix 250 rows 250 cols
[2022-05-17 21:27:16] [INFO ] Computed 100 place invariants in 1 ms
[2022-05-17 21:27:16] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-PT-000050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 2}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 3}]], initial=1, aps=[p1:(OR (EQ s78 0) (EQ s176 0)), p0:(OR (EQ s100 0) (EQ s153 0))], 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Philosophers-PT-000050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000050-LTLFireability-15 finished in 751 ms.
All properties solved by simple procedures.
Total runtime 89405 ms.

BK_STOP 1652822837316

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

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

Sequence of Actions to be Executed by the VM

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

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

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