Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 716K Feb 25 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.9M Feb 25 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 379K Feb 25 13:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 2.4M Feb 25 13:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 214K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 840K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 184K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 850K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.2M Feb 25 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.5M Feb 25 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 234K Feb 25 14:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 14:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 46K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 130K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.1M Mar 5 18:23 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-000500-LTLFireability-00
FORMULA_NAME Philosophers-PT-000500-LTLFireability-01
FORMULA_NAME Philosophers-PT-000500-LTLFireability-02
FORMULA_NAME Philosophers-PT-000500-LTLFireability-03
FORMULA_NAME Philosophers-PT-000500-LTLFireability-04
FORMULA_NAME Philosophers-PT-000500-LTLFireability-05
FORMULA_NAME Philosophers-PT-000500-LTLFireability-06
FORMULA_NAME Philosophers-PT-000500-LTLFireability-07
FORMULA_NAME Philosophers-PT-000500-LTLFireability-08
FORMULA_NAME Philosophers-PT-000500-LTLFireability-09
FORMULA_NAME Philosophers-PT-000500-LTLFireability-10
FORMULA_NAME Philosophers-PT-000500-LTLFireability-11
FORMULA_NAME Philosophers-PT-000500-LTLFireability-12
FORMULA_NAME Philosophers-PT-000500-LTLFireability-13
FORMULA_NAME Philosophers-PT-000500-LTLFireability-14
FORMULA_NAME Philosophers-PT-000500-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678809517027

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-PT-000500
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-14 15:58:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-14 15:58:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 15:58:38] [INFO ] Load time of PNML (sax parser for PT used): 140 ms
[2023-03-14 15:58:38] [INFO ] Transformed 2500 places.
[2023-03-14 15:58:38] [INFO ] Transformed 2500 transitions.
[2023-03-14 15:58:38] [INFO ] Parsed PT model containing 2500 places and 2500 transitions and 8000 arcs in 218 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 38 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-000500-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000500-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 2500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 30 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-14 15:58:39] [INFO ] Computed 1000 place invariants in 34 ms
[2023-03-14 15:58:39] [INFO ] Implicit Places using invariants in 578 ms returned []
[2023-03-14 15:58:39] [INFO ] Invariant cache hit.
[2023-03-14 15:58:41] [INFO ] Implicit Places using invariants and state equation in 1366 ms returned []
Implicit Place search using SMT with State Equation took 1969 ms to find 0 implicit places.
[2023-03-14 15:58:41] [INFO ] Invariant cache hit.
[2023-03-14 15:58:42] [INFO ] Dead Transitions using invariants and state equation in 1498 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3502 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Support contains 2500 out of 2500 places after structural reductions.
[2023-03-14 15:58:43] [INFO ] Flatten gal took : 235 ms
[2023-03-14 15:58:43] [INFO ] Flatten gal took : 185 ms
[2023-03-14 15:58:44] [INFO ] Input system was already deterministic with 2500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 749 ms. (steps per millisecond=13 ) properties (out of 25) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 931 ms. (steps per millisecond=10 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 921 ms. (steps per millisecond=10 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 910 ms. (steps per millisecond=10 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :1
Running SMT prover for 3 properties.
[2023-03-14 15:58:48] [INFO ] Invariant cache hit.
[2023-03-14 15:58:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 170 ms returned sat
[2023-03-14 15:58:50] [INFO ] After 804ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 15:58:50] [INFO ] [Nat]Absence check using 1000 positive place invariants in 182 ms returned sat
[2023-03-14 15:58:54] [INFO ] After 2772ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 15:58:55] [INFO ] After 3940ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 912 ms.
[2023-03-14 15:58:56] [INFO ] After 6020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 500 steps, including 0 resets, run visited all 3 properties in 43 ms. (steps per millisecond=11 )
Parikh walk visited 3 properties in 46 ms.
FORMULA Philosophers-PT-000500-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (X(p1) U (p1&&G(F(p2))))))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 49 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:58:56] [INFO ] Invariant cache hit.
[2023-03-14 15:58:57] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-14 15:58:57] [INFO ] Invariant cache hit.
[2023-03-14 15:58:59] [INFO ] Implicit Places using invariants and state equation in 1743 ms returned []
Implicit Place search using SMT with State Equation took 2389 ms to find 0 implicit places.
[2023-03-14 15:58:59] [INFO ] Invariant cache hit.
[2023-03-14 15:59:00] [INFO ] Dead Transitions using invariants and state equation in 1497 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3937 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 380 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p2), true]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (GEQ s712 1) (GEQ s1165 1)) (AND (GEQ s832 1) (GEQ s1335 1)) (AND (GEQ s937 1) (GEQ s1490 1)) (AND (GEQ s680 1) (GEQ s1074 1)) (AND (GEQ s639 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA Philosophers-PT-000500-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-00 finished in 4399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 104 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:59:01] [INFO ] Invariant cache hit.
[2023-03-14 15:59:02] [INFO ] Implicit Places using invariants in 906 ms returned []
[2023-03-14 15:59:02] [INFO ] Invariant cache hit.
[2023-03-14 15:59:04] [INFO ] Implicit Places using invariants and state equation in 2184 ms returned []
Implicit Place search using SMT with State Equation took 3093 ms to find 0 implicit places.
[2023-03-14 15:59:04] [INFO ] Invariant cache hit.
[2023-03-14 15:59:05] [INFO ] Dead Transitions using invariants and state equation in 1519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4718 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-01 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:(AND (OR (LT s988 1) (LT s1977 1)) (OR (LT s940 1) (LT s1792 1)) (OR (LT s662 1) (LT s1732 1)) (OR (LT s928 1) (LT s2030 1)) (OR (LT s557 1) (LT s1447 ...], 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 5 reset in 2419 ms.
Stack based approach found an accepted trace after 10277 steps with 1 reset with depth 10275 and stack size 10275 in 308 ms.
FORMULA Philosophers-PT-000500-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-01 finished in 7869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(!p0))||(F(!p0)&&X(p0))))))'
Support contains 1000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 166 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:59:09] [INFO ] Invariant cache hit.
[2023-03-14 15:59:10] [INFO ] Implicit Places using invariants in 864 ms returned []
[2023-03-14 15:59:10] [INFO ] Invariant cache hit.
[2023-03-14 15:59:12] [INFO ] Implicit Places using invariants and state equation in 2099 ms returned []
Implicit Place search using SMT with State Equation took 2967 ms to find 0 implicit places.
[2023-03-14 15:59:12] [INFO ] Invariant cache hit.
[2023-03-14 15:59:13] [INFO ] Dead Transitions using invariants and state equation in 1477 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4611 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 64 ms :[p0, p0]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s79 1) (GEQ s616 1)) (AND (GEQ s375 1) (GEQ s847 1)) (AND (GEQ s287 1) (GEQ s784 1)) (AND (GEQ s168 1) (GEQ s693 1)) (AND (GEQ s456 1) (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 10 reset in 2631 ms.
Stack based approach found an accepted trace after 9033 steps with 0 reset with depth 9034 and stack size 9034 in 277 ms.
FORMULA Philosophers-PT-000500-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-02 finished in 7627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p2)||p1))||p0)))'
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 15 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:59:16] [INFO ] Invariant cache hit.
[2023-03-14 15:59:17] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-14 15:59:17] [INFO ] Invariant cache hit.
[2023-03-14 15:59:18] [INFO ] Implicit Places using invariants and state equation in 1331 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
[2023-03-14 15:59:18] [INFO ] Invariant cache hit.
[2023-03-14 15:59:19] [INFO ] Dead Transitions using invariants and state equation in 1488 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3240 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s712 1) (GEQ s1165 1)) (AND (GEQ s832 1) (GEQ s1335 1)) (AND (GEQ s937 1) (GEQ s1490 1)) (AND (GEQ s680 1) (GEQ s1074 1)) (AND (GEQ s639 ...], 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 timeout after 79640 steps with 31834 reset in 10002 ms.
Product exploration timeout after 77570 steps with 30977 reset in 10003 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))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 125 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 3) seen :2
Finished Best-First random walk after 1001 steps, including 0 resets, run visited all 1 properties in 338 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p0), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 15 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 15:59:55] [INFO ] Invariant cache hit.
[2023-03-14 15:59:55] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-14 15:59:55] [INFO ] Invariant cache hit.
[2023-03-14 15:59:56] [INFO ] Implicit Places using invariants and state equation in 1336 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
[2023-03-14 15:59:56] [INFO ] Invariant cache hit.
[2023-03-14 15:59:58] [INFO ] Dead Transitions using invariants and state equation in 1481 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3236 ms. Remains : 2500/2500 places, 2500/2500 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))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Finished random walk after 1 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F p0), (F (AND (NOT p1) (NOT p2))), (F (NOT p2))]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 4 states, 4 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Product exploration timeout after 79680 steps with 31899 reset in 10002 ms.
Product exploration timeout after 76740 steps with 30652 reset in 10001 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1))]
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 58 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 16:00:33] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-14 16:00:33] [INFO ] Invariant cache hit.
[2023-03-14 16:00:34] [INFO ] Dead Transitions using invariants and state equation in 1428 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1650 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin9249893257953739727
[2023-03-14 16:00:35] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9249893257953739727
Running compilation step : cd /tmp/ltsmin9249893257953739727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9249893257953739727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9249893257953739727;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2000 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 18 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 16:00:38] [INFO ] Invariant cache hit.
[2023-03-14 16:00:38] [INFO ] Implicit Places using invariants in 395 ms returned []
[2023-03-14 16:00:38] [INFO ] Invariant cache hit.
[2023-03-14 16:00:39] [INFO ] Implicit Places using invariants and state equation in 1327 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
[2023-03-14 16:00:39] [INFO ] Invariant cache hit.
[2023-03-14 16:00:41] [INFO ] Dead Transitions using invariants and state equation in 1517 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3259 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Built C files in :
/tmp/ltsmin3389099374801619626
[2023-03-14 16:00:41] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3389099374801619626
Running compilation step : cd /tmp/ltsmin3389099374801619626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3389099374801619626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3389099374801619626;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-14 16:00:44] [INFO ] Flatten gal took : 86 ms
[2023-03-14 16:00:44] [INFO ] Flatten gal took : 82 ms
[2023-03-14 16:00:44] [INFO ] Time to serialize gal into /tmp/LTL14233428846486132198.gal : 22 ms
[2023-03-14 16:00:44] [INFO ] Time to serialize properties into /tmp/LTL11936438603798858288.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14233428846486132198.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7496599252539463954.hoa' '-atoms' '/tmp/LTL11936438603798858288.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11936438603798858288.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7496599252539463954.hoa
Detected timeout of ITS tools.
[2023-03-14 16:01:00] [INFO ] Flatten gal took : 83 ms
[2023-03-14 16:01:00] [INFO ] Flatten gal took : 84 ms
[2023-03-14 16:01:00] [INFO ] Time to serialize gal into /tmp/LTL1630314675341153553.gal : 15 ms
[2023-03-14 16:01:00] [INFO ] Time to serialize properties into /tmp/LTL11773312863570548519.ltl : 17 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1630314675341153553.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11773312863570548519.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((((((((((X(("((((((((((Fork_496>=1)&&(Catch2_497>=1))||((Fork_411>=1)&&(Catch2_412>=1)))||(((Fork_193>=1)&&(Catch2_194>=1))||((Fo...69729
Formula 0 simplified : X(!"((((((((((Fork_59>=1)&&(Catch1_59>=1))||((Fork_254>=1)&&(Catch1_254>=1)))||(((Fork_166>=1)&&(Catch1_166>=1))||((Fork_333>=1)&&(C...69695
Detected timeout of ITS tools.
[2023-03-14 16:01:15] [INFO ] Flatten gal took : 79 ms
[2023-03-14 16:01:15] [INFO ] Applying decomposition
[2023-03-14 16:01:15] [INFO ] Flatten gal took : 79 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9476924610116236944.txt' '-o' '/tmp/graph9476924610116236944.bin' '-w' '/tmp/graph9476924610116236944.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9476924610116236944.bin' '-l' '-1' '-v' '-w' '/tmp/graph9476924610116236944.weights' '-q' '0' '-e' '0.001'
[2023-03-14 16:01:15] [INFO ] Decomposing Gal with order
[2023-03-14 16:01:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-14 16:01:16] [INFO ] Removed a total of 496 redundant transitions.
[2023-03-14 16:01:16] [INFO ] Flatten gal took : 197 ms
[2023-03-14 16:01:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 1694 labels/synchronizations in 48 ms.
[2023-03-14 16:01:18] [INFO ] Time to serialize gal into /tmp/LTL13003658662689641105.gal : 24 ms
[2023-03-14 16:01:18] [INFO ] Time to serialize properties into /tmp/LTL3603543734106544596.ltl : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13003658662689641105.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3603543734106544596.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((((((((((X(("((((((((((i31.i1.i1.u438.Fork_496>=1)&&(i31.i1.i1.u438.Catch2_497>=1))||((i9.i1.i0.u237.Fork_411>=1)&&(i9.i1.i1.u486...127485
Formula 0 simplified : X(!"((((((((((i37.i1.i0.u78.Fork_59>=1)&&(i37.i1.i0.u79.Catch1_59>=1))||((i8.i0.i1.u159.Fork_254>=1)&&(i8.i0.i1.u159.Catch1_254>=1))...127451
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2 deadlock states
3 unique states visited
0 strongly connected components in search stack
2 transitions explored
3 items max in DFS search stack
161 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,1.9133,58780,1,0,84354,632,22704,111879,381,1687,164721
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA Philosophers-PT-000500-LTLFireability-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property Philosophers-PT-000500-LTLFireability-04 finished in 123518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(G(p0))&&(G(p2)||p1))))'
Support contains 1500 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 60 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 16:01:20] [INFO ] Invariant cache hit.
[2023-03-14 16:01:21] [INFO ] Implicit Places using invariants in 812 ms returned []
[2023-03-14 16:01:21] [INFO ] Invariant cache hit.
[2023-03-14 16:01:23] [INFO ] Implicit Places using invariants and state equation in 2109 ms returned []
Implicit Place search using SMT with State Equation took 2925 ms to find 0 implicit places.
[2023-03-14 16:01:23] [INFO ] Redundant transitions in 52 ms returned []
[2023-03-14 16:01:23] [INFO ] Invariant cache hit.
[2023-03-14 16:01:24] [INFO ] Dead Transitions using invariants and state equation in 1510 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4554 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s399 1) (GEQ s842 1)) (AND (GEQ s242 1) (GEQ s706 1)) (AND (GEQ s137 1) (GEQ s600 1)) (AND (GEQ s298 1) (GEQ s792 1)) (AND (GEQ s421 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 2576 ms.
Stack based approach found an accepted trace after 3732 steps with 0 reset with depth 3733 and stack size 3733 in 155 ms.
FORMULA Philosophers-PT-000500-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-05 finished in 7439 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Performed 496 Post agglomeration using F-continuation condition.Transition count delta: 496
Deduced a syphon composed of 496 places in 0 ms
Reduce places removed 496 places and 0 transitions.
Iterating global reduction 0 with 992 rules applied. Total rules applied 992 place count 2004 transition count 2004
Applied a total of 992 rules in 324 ms. Remains 2004 /2500 variables (removed 496) and now considering 2004/2500 (removed 496) transitions.
// Phase 1: matrix 2004 rows 2004 cols
[2023-03-14 16:01:28] [INFO ] Computed 1000 place invariants in 6 ms
[2023-03-14 16:01:29] [INFO ] Implicit Places using invariants in 1245 ms returned []
[2023-03-14 16:01:29] [INFO ] Invariant cache hit.
[2023-03-14 16:01:32] [INFO ] Implicit Places using invariants and state equation in 2839 ms returned []
Implicit Place search using SMT with State Equation took 4087 ms to find 0 implicit places.
[2023-03-14 16:01:32] [INFO ] Redundant transitions in 101 ms returned []
[2023-03-14 16:01:32] [INFO ] Invariant cache hit.
[2023-03-14 16:01:33] [INFO ] Dead Transitions using invariants and state equation in 1059 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2004/2500 places, 2004/2500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5579 ms. Remains : 2004/2500 places, 2004/2500 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s849 1) (GEQ s1284 1)), p1:(AND (GEQ s981 1) (GEQ s1929 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 1 reset in 1697 ms.
Stack based approach found an accepted trace after 1719 steps with 0 reset with depth 1720 and stack size 1720 in 123 ms.
FORMULA Philosophers-PT-000500-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-09 finished in 7563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U ((X(G(p2))&&p1) U X(p3))))'
Support contains 8 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 70 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
// Phase 1: matrix 2500 rows 2500 cols
[2023-03-14 16:01:35] [INFO ] Computed 1000 place invariants in 19 ms
[2023-03-14 16:01:36] [INFO ] Implicit Places using invariants in 1388 ms returned []
[2023-03-14 16:01:36] [INFO ] Invariant cache hit.
[2023-03-14 16:01:39] [INFO ] Implicit Places using invariants and state equation in 2854 ms returned []
Implicit Place search using SMT with State Equation took 4243 ms to find 0 implicit places.
[2023-03-14 16:01:39] [INFO ] Invariant cache hit.
[2023-03-14 16:01:41] [INFO ] Dead Transitions using invariants and state equation in 1462 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5776 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 234 ms :[(NOT p3), (OR (NOT p2) (NOT p3)), (NOT p2), (OR (NOT p3) (NOT p2)), true, (NOT p3), (NOT p3)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0 (NOT p3)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=0 dest: 6}], [{ cond=(AND p1 (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p3 p2), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=1 dest: 3}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND p3 p2), acceptance={} source=3 dest: 2}, { cond=(OR (NOT p3) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 0}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(AND p1 p0 (NOT p3)), acceptance={0} source=6 dest: 0}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(AND (GEQ s279 1) (GEQ s718 1)), p0:(AND (GEQ s279 1) (GEQ s718 1)), p3:(OR (AND (GEQ s610 1) (GEQ s1597 1)) (AND (GEQ s81 1) (GEQ s609 1))), p2:(AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 570 steps with 63 reset in 61 ms.
FORMULA Philosophers-PT-000500-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-10 finished in 6111 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&(F((p2||G(p3)))||G(!p1)))))'
Support contains 8 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 72 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 16:01:41] [INFO ] Invariant cache hit.
[2023-03-14 16:01:42] [INFO ] Implicit Places using invariants in 1416 ms returned []
[2023-03-14 16:01:42] [INFO ] Invariant cache hit.
[2023-03-14 16:01:45] [INFO ] Implicit Places using invariants and state equation in 2878 ms returned []
Implicit Place search using SMT with State Equation took 4296 ms to find 0 implicit places.
[2023-03-14 16:01:45] [INFO ] Invariant cache hit.
[2023-03-14 16:01:47] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5892 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 228 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3) p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s47 1) (GEQ s512 1)), p0:(AND (GEQ s389 1) (GEQ s951 1)), p2:(AND (GEQ s87 1) (GEQ s624 1)), p3:(AND (GEQ s373 1) (GEQ s873 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 175 steps with 79 reset in 23 ms.
FORMULA Philosophers-PT-000500-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-13 finished in 6179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(!p0) U p1) U X((F(G(p2))&&G(p1)))))'
Support contains 5 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 66 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 16:01:47] [INFO ] Invariant cache hit.
[2023-03-14 16:01:49] [INFO ] Implicit Places using invariants in 1417 ms returned []
[2023-03-14 16:01:49] [INFO ] Invariant cache hit.
[2023-03-14 16:01:51] [INFO ] Implicit Places using invariants and state equation in 2834 ms returned []
Implicit Place search using SMT with State Equation took 4254 ms to find 0 implicit places.
[2023-03-14 16:01:51] [INFO ] Invariant cache hit.
[2023-03-14 16:01:53] [INFO ] Dead Transitions using invariants and state equation in 1455 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5777 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 275 ms :[(AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={0} source=3 dest: 3}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=1, aps=[p1:(GEQ s2485 1), p0:(AND (GEQ s219 1) (GEQ s748 1)), p2:(AND (GEQ s580 1) (GEQ s1041 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 91610 steps with 381 reset in 10001 ms.
Product exploration timeout after 86350 steps with 395 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 761 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 215 ms :[(AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (NOT p2), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 16:02:29] [INFO ] Invariant cache hit.
[2023-03-14 16:02:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 181 ms returned sat
[2023-03-14 16:02:30] [INFO ] After 1577ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 16:02:31] [INFO ] [Nat]Absence check using 1000 positive place invariants in 180 ms returned sat
[2023-03-14 16:02:32] [INFO ] After 1111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 16:02:32] [INFO ] After 1379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 150 ms.
[2023-03-14 16:02:32] [INFO ] After 2047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 327 steps, including 0 resets, run visited all 2 properties in 31 ms. (steps per millisecond=10 )
Parikh walk visited 2 properties in 32 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p2)), (F p2), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 5 factoid took 945 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 6 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (NOT p2), (AND p0 (NOT p2))]
Stuttering acceptance computed with spot in 235 ms :[(AND p0 (NOT p1)), (OR (NOT p1) (NOT p2)), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))), p0, (NOT p2), (AND p0 (NOT p2))]
[2023-03-14 16:02:34] [INFO ] Invariant cache hit.
[2023-03-14 16:02:37] [INFO ] [Real]Absence check using 1000 positive place invariants in 211 ms returned unsat
Proved EG (NOT p1)
[2023-03-14 16:02:37] [INFO ] Invariant cache hit.
[2023-03-14 16:02:43] [INFO ] [Real]Absence check using 1000 positive place invariants in 3011 ms returned sat
[2023-03-14 16:02:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:02:52] [INFO ] [Real]Absence check using state equation in 8951 ms returned unknown
Could not prove EG (NOT p2)
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p0))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p2))), (X (X (NOT (AND p0 p2)))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND p1 p0 (NOT p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (AND p0 p1)), (F (AND p1 (NOT p2))), (F (NOT p0)), (F (AND p0 p1 (NOT p2))), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p2)), (F p2), (F (NOT (AND p0 (NOT p2)))), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 5 factoid took 992 ms. Reduced automaton from 6 states, 14 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-PT-000500-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-PT-000500-LTLFireability-14 finished in 65995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0&&X(F(p1))))&&F(p2)))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 65 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 16:02:53] [INFO ] Invariant cache hit.
[2023-03-14 16:02:55] [INFO ] Implicit Places using invariants in 1472 ms returned []
[2023-03-14 16:02:55] [INFO ] Invariant cache hit.
[2023-03-14 16:02:58] [INFO ] Implicit Places using invariants and state equation in 2989 ms returned []
Implicit Place search using SMT with State Equation took 4463 ms to find 0 implicit places.
[2023-03-14 16:02:58] [INFO ] Invariant cache hit.
[2023-03-14 16:02:59] [INFO ] Dead Transitions using invariants and state equation in 1498 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6026 ms. Remains : 2500/2500 places, 2500/2500 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : Philosophers-PT-000500-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s109 1) (GEQ s581 1)) (GEQ s2296 1)), p0:(LT s2316 1), p1:(OR (LT s109 1) (LT s581 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, null][false, false, false, false, false]]
Product exploration timeout after 87770 steps with 375 reset in 10002 ms.
Product exploration timeout after 85750 steps with 386 reset in 10002 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 p2 p0 (NOT p1)), (X p0), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 15 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p0), true]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 3 factoid took 414 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-14 16:03:34] [INFO ] Invariant cache hit.
[2023-03-14 16:03:41] [INFO ] [Real]Absence check using 1000 positive place invariants in 3279 ms returned sat
[2023-03-14 16:03:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:03:49] [INFO ] [Real]Absence check using state equation in 8880 ms returned unknown
Could not prove EG (NOT p1)
Support contains 2 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 2500/2500 transitions.
Applied a total of 0 rules in 60 ms. Remains 2500 /2500 variables (removed 0) and now considering 2500/2500 (removed 0) transitions.
[2023-03-14 16:03:49] [INFO ] Invariant cache hit.
[2023-03-14 16:03:51] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2023-03-14 16:03:51] [INFO ] Invariant cache hit.
[2023-03-14 16:03:54] [INFO ] Implicit Places using invariants and state equation in 3021 ms returned []
Implicit Place search using SMT with State Equation took 4429 ms to find 0 implicit places.
[2023-03-14 16:03:54] [INFO ] Invariant cache hit.
[2023-03-14 16:03:55] [INFO ] Dead Transitions using invariants and state equation in 1472 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5962 ms. Remains : 2500/2500 places, 2500/2500 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)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 69 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2023-03-14 16:04:10] [INFO ] Invariant cache hit.
[2023-03-14 16:04:16] [INFO ] [Real]Absence check using 1000 positive place invariants in 3140 ms returned sat
[2023-03-14 16:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 16:04:25] [INFO ] [Real]Absence check using state equation in 9118 ms returned unknown
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration timeout after 89240 steps with 414 reset in 10002 ms.
Stack based approach found an accepted trace after 16604 steps with 78 reset with depth 28 and stack size 28 in 1954 ms.
FORMULA Philosophers-PT-000500-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000500-LTLFireability-15 finished in 104019 ms.
All properties solved by simple procedures.
Total runtime 359124 ms.

BK_STOP 1678809878488

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-000500"
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-5348"
echo " Executing tool itstools"
echo " Input is Philosophers-PT-000500, 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 r293-tall-167873945100236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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