Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r295-tall-167873947500140.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 lolaxred
Input is Philosophers-COL-001000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947500140
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.7K Feb 25 14:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Feb 25 14:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 13:41 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:41 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 4.1K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 25 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 14:55 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 52K 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-COL-001000-LTLFireability-00
FORMULA_NAME Philosophers-COL-001000-LTLFireability-01
FORMULA_NAME Philosophers-COL-001000-LTLFireability-02
FORMULA_NAME Philosophers-COL-001000-LTLFireability-03
FORMULA_NAME Philosophers-COL-001000-LTLFireability-04
FORMULA_NAME Philosophers-COL-001000-LTLFireability-05
FORMULA_NAME Philosophers-COL-001000-LTLFireability-06
FORMULA_NAME Philosophers-COL-001000-LTLFireability-07
FORMULA_NAME Philosophers-COL-001000-LTLFireability-08
FORMULA_NAME Philosophers-COL-001000-LTLFireability-09
FORMULA_NAME Philosophers-COL-001000-LTLFireability-10
FORMULA_NAME Philosophers-COL-001000-LTLFireability-11
FORMULA_NAME Philosophers-COL-001000-LTLFireability-12
FORMULA_NAME Philosophers-COL-001000-LTLFireability-13
FORMULA_NAME Philosophers-COL-001000-LTLFireability-14
FORMULA_NAME Philosophers-COL-001000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678786598890

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=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-001000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 09:36:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 09:36:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 09:36:40] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 09:36:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 09:36:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 429 ms
[2023-03-14 09:36:40] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 09:36:41] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 09:36:41] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-001000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 4 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10019 steps, including 9 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 3) seen :1
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=7 )
[2023-03-14 09:36:41] [INFO ] Flatten gal took : 11 ms
[2023-03-14 09:36:41] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 1000) 1000) 1000)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 09:36:41] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions 16000 arcs in 68 ms.
[2023-03-14 09:36:41] [INFO ] Unfolded 15 HLPN properties in 9 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-001000-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 41 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-14 09:36:42] [INFO ] Computed 2000 place invariants in 53 ms
[2023-03-14 09:36:42] [INFO ] Implicit Places using invariants in 804 ms returned []
[2023-03-14 09:36:42] [INFO ] Invariant cache hit.
[2023-03-14 09:36:43] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
[2023-03-14 09:36:43] [INFO ] Invariant cache hit.
[2023-03-14 09:36:46] [INFO ] Dead Transitions using invariants and state equation in 3084 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4423 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-14 09:36:47] [INFO ] Flatten gal took : 434 ms
[2023-03-14 09:36:48] [INFO ] Flatten gal took : 386 ms
[2023-03-14 09:36:50] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1337 ms. (steps per millisecond=7 ) properties (out of 12) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2176 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3602 ms. (steps per millisecond=2 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2193 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2628 ms. (steps per millisecond=3 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2138 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1602 ms. (steps per millisecond=6 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-14 09:37:05] [INFO ] Invariant cache hit.
[2023-03-14 09:37:12] [INFO ] [Real]Absence check using 2000 positive place invariants in 457 ms returned sat
[2023-03-14 09:37:13] [INFO ] After 2154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-14 09:37:15] [INFO ] [Nat]Absence check using 2000 positive place invariants in 474 ms returned sat
[2023-03-14 09:37:27] [INFO ] After 9379ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-14 09:37:33] [INFO ] After 14999ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 4771 ms.
[2023-03-14 09:37:38] [INFO ] After 24575ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 5 properties in 213 ms. (steps per millisecond=4 )
Parikh walk visited 5 properties in 217 ms.
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((F(p1)&&X(G(!p2))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 109 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:37:39] [INFO ] Invariant cache hit.
[2023-03-14 09:37:40] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2023-03-14 09:37:40] [INFO ] Invariant cache hit.
[2023-03-14 09:37:41] [INFO ] Implicit Places using invariants and state equation in 993 ms returned []
Implicit Place search using SMT with State Equation took 2022 ms to find 0 implicit places.
[2023-03-14 09:37:41] [INFO ] Invariant cache hit.
[2023-03-14 09:37:44] [INFO ] Dead Transitions using invariants and state equation in 3135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5268 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p1) p2), (OR (NOT p1) p2), (OR (NOT p1) p2), (NOT p1), p2, true, p2, p2]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 4}, { cond=p2, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=6 dest: 3}, { cond=true, acceptance={} source=6 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 3}, { cond=(NOT p0), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4616 1) (GEQ s4746 1) (GEQ s4015 1) (GEQ s4437 1) (GEQ s4567 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 72 steps with 2 reset in 44 ms.
FORMULA Philosophers-COL-001000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-01 finished in 5805 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(((!p0&&G(F(p1))) U p2)))'
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 73 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:37:44] [INFO ] Invariant cache hit.
[2023-03-14 09:37:45] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-14 09:37:45] [INFO ] Invariant cache hit.
[2023-03-14 09:37:45] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2023-03-14 09:37:46] [INFO ] Redundant transitions in 370 ms returned []
[2023-03-14 09:37:46] [INFO ] Invariant cache hit.
[2023-03-14 09:37:49] [INFO ] Dead Transitions using invariants and state equation in 3088 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4449 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 223 ms :[(NOT p2), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s804 1) (GEQ s1804 1)) (AND (GEQ s212 1) (GEQ s1212 1)) (AND (GEQ s809 1) (GEQ s1809 1)) (AND (GEQ s217 1) (GEQ s1217 1)) (AND (GEQ s227 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 5524 ms.
Product exploration explored 100000 steps with 1 reset in 6016 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 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 225 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), true, (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1326 ms. (steps per millisecond=7 ) properties (out of 5) seen :1
Interrupted Best-First random walk after 9003 steps, including 2 resets, run timeout after 5256 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 9003 steps, including 2 resets, run timeout after 5201 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 7003 steps, including 1 resets, run timeout after 5473 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 9003 steps, including 2 resets, run timeout after 5243 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 4 properties.
[2023-03-14 09:38:24] [INFO ] Invariant cache hit.
[2023-03-14 09:38:37] [INFO ] [Real]Absence check using 2000 positive place invariants in 454 ms returned sat
[2023-03-14 09:38:38] [INFO ] After 6290ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-14 09:38:41] [INFO ] [Nat]Absence check using 2000 positive place invariants in 463 ms returned sat
[2023-03-14 09:38:59] [INFO ] After 15796ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-14 09:38:59] [INFO ] After 16292ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 319 ms.
[2023-03-14 09:39:00] [INFO ] After 21489ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :1
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 969 steps, including 0 resets, run visited all 2 properties in 329 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 330 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (G (OR (NOT p0) p2)), (G (NOT (AND p0 (NOT p2))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 8 factoid took 420 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 65 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:39:01] [INFO ] Invariant cache hit.
[2023-03-14 09:39:01] [INFO ] Implicit Places using invariants in 443 ms returned []
[2023-03-14 09:39:01] [INFO ] Invariant cache hit.
[2023-03-14 09:39:02] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 894 ms to find 0 implicit places.
[2023-03-14 09:39:02] [INFO ] Redundant transitions in 355 ms returned []
[2023-03-14 09:39:02] [INFO ] Invariant cache hit.
[2023-03-14 09:39:05] [INFO ] Dead Transitions using invariants and state equation in 3058 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4383 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 136 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1141 ms. (steps per millisecond=8 ) properties (out of 3) seen :1
Interrupted Best-First random walk after 9003 steps, including 2 resets, run timeout after 5530 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4203 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 09:39:17] [INFO ] Invariant cache hit.
[2023-03-14 09:39:24] [INFO ] [Real]Absence check using 2000 positive place invariants in 475 ms returned sat
[2023-03-14 09:39:25] [INFO ] After 3540ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:39:28] [INFO ] [Nat]Absence check using 2000 positive place invariants in 461 ms returned sat
[2023-03-14 09:39:34] [INFO ] After 5275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 09:39:36] [INFO ] After 6983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1254 ms.
[2023-03-14 09:39:37] [INFO ] After 11805ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 970 steps, including 0 resets, run visited all 2 properties in 176 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 177 ms.
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT p1)), (X (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2))), (F p1), (F (NOT p2))]
Knowledge based reduction with 4 factoid took 226 ms. Reduced automaton from 4 states, 10 edges and 2 AP (stutter insensitive) to 4 states, 10 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1 reset in 5031 ms.
Product exploration explored 100000 steps with 0 reset in 5292 ms.
Support contains 5000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 41 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:39:48] [INFO ] Invariant cache hit.
[2023-03-14 09:39:49] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-14 09:39:49] [INFO ] Invariant cache hit.
[2023-03-14 09:39:49] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 896 ms to find 0 implicit places.
[2023-03-14 09:39:49] [INFO ] Redundant transitions in 304 ms returned []
[2023-03-14 09:39:49] [INFO ] Invariant cache hit.
[2023-03-14 09:39:52] [INFO ] Dead Transitions using invariants and state equation in 3004 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4258 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-03 finished in 128717 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(X(X(G(((!p1 U (p2||G(!p1)))||p0)))))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 317 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:39:53] [INFO ] Invariant cache hit.
[2023-03-14 09:39:55] [INFO ] Implicit Places using invariants in 1555 ms returned []
[2023-03-14 09:39:55] [INFO ] Invariant cache hit.
[2023-03-14 09:39:56] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned []
Implicit Place search using SMT with State Equation took 3077 ms to find 0 implicit places.
[2023-03-14 09:39:56] [INFO ] Invariant cache hit.
[2023-03-14 09:40:00] [INFO ] Dead Transitions using invariants and state equation in 3053 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6448 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (AND p1 (NOT p2)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 p2), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p2:(AND (NOT (OR (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4616 1) (GEQ s4746 1) (GEQ s4015 1) (GEQ s4437 1) (GEQ s4567 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 35339 steps with 0 reset in 1711 ms.
FORMULA Philosophers-COL-001000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-05 finished in 8450 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 U (G(!p0)||(!p0&&G(!p1)))))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 245 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:40:02] [INFO ] Invariant cache hit.
[2023-03-14 09:40:03] [INFO ] Implicit Places using invariants in 1033 ms returned []
[2023-03-14 09:40:03] [INFO ] Invariant cache hit.
[2023-03-14 09:40:04] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2023-03-14 09:40:04] [INFO ] Redundant transitions in 295 ms returned []
[2023-03-14 09:40:04] [INFO ] Invariant cache hit.
[2023-03-14 09:40:07] [INFO ] Dead Transitions using invariants and state equation in 3044 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5623 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 101 ms :[p0, p0, (AND p1 p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s1684 1) (GEQ s3685 1)) (AND (GEQ s1107 1) (GEQ s3108 1)) (AND (GEQ s1097 1) (GEQ s3098 1)) (AND (GEQ s1102 1) (GEQ s3103 1)) (AND (GEQ s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 4848 ms.
Stack based approach found an accepted trace after 32870 steps with 0 reset with depth 32871 and stack size 22520 in 1878 ms.
FORMULA Philosophers-COL-001000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-08 finished in 12492 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((F(p1)&&p0))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 88 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:40:14] [INFO ] Invariant cache hit.
[2023-03-14 09:40:15] [INFO ] Implicit Places using invariants in 1003 ms returned []
[2023-03-14 09:40:15] [INFO ] Invariant cache hit.
[2023-03-14 09:40:16] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 2008 ms to find 0 implicit places.
[2023-03-14 09:40:16] [INFO ] Invariant cache hit.
[2023-03-14 09:40:19] [INFO ] Dead Transitions using invariants and state equation in 3075 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5172 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s1684 1) (GEQ s3685 1)) (AND (GEQ s1107 1) (GEQ s3108 1)) (AND (GEQ s1097 1) (GEQ s3098 1)) (AND (GEQ s1102 1) (GEQ s3103 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 27210 steps with 9018 reset in 10002 ms.
Product exploration timeout after 26870 steps with 8994 reset in 10005 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1068 ms. (steps per millisecond=9 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4761 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 09:40:46] [INFO ] Invariant cache hit.
[2023-03-14 09:40:50] [INFO ] After 2386ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 167 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
[2023-03-14 09:40:59] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 84 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:41:14] [INFO ] Invariant cache hit.
[2023-03-14 09:41:15] [INFO ] Implicit Places using invariants in 999 ms returned []
[2023-03-14 09:41:15] [INFO ] Invariant cache hit.
[2023-03-14 09:41:16] [INFO ] Implicit Places using invariants and state equation in 976 ms returned []
Implicit Place search using SMT with State Equation took 1977 ms to find 0 implicit places.
[2023-03-14 09:41:16] [INFO ] Invariant cache hit.
[2023-03-14 09:41:19] [INFO ] Dead Transitions using invariants and state equation in 2949 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5011 ms. Remains : 5000/5000 places, 5000/5000 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 p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 92 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-14 09:41:28] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration timeout after 30850 steps with 10275 reset in 10002 ms.
Product exploration timeout after 30460 steps with 10133 reset in 10004 ms.
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 97 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:42:03] [INFO ] Invariant cache hit.
[2023-03-14 09:42:04] [INFO ] Implicit Places using invariants in 974 ms returned []
[2023-03-14 09:42:04] [INFO ] Invariant cache hit.
[2023-03-14 09:42:05] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
[2023-03-14 09:42:05] [INFO ] Redundant transitions in 303 ms returned []
[2023-03-14 09:42:05] [INFO ] Invariant cache hit.
[2023-03-14 09:42:08] [INFO ] Dead Transitions using invariants and state equation in 3018 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5412 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-09 finished in 114740 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 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 141 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:42:09] [INFO ] Invariant cache hit.
[2023-03-14 09:42:11] [INFO ] Implicit Places using invariants in 2497 ms returned []
[2023-03-14 09:42:11] [INFO ] Invariant cache hit.
[2023-03-14 09:42:14] [INFO ] Implicit Places using invariants and state equation in 2706 ms returned []
Implicit Place search using SMT with State Equation took 5205 ms to find 0 implicit places.
[2023-03-14 09:42:14] [INFO ] Invariant cache hit.
[2023-03-14 09:42:17] [INFO ] Dead Transitions using invariants and state equation in 3059 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8406 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-10 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 (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4616 1) (GEQ s4746 1) (GEQ s4015 1) (GEQ s4437 1) (GEQ s4567 1) (GEQ s4...], 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 timeout after 33420 steps with 587 reset in 10001 ms.
Product exploration timeout after 32410 steps with 578 reset in 10006 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 44 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 209 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 20 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 58 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 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 09:42:39] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 132 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:42:54] [INFO ] Invariant cache hit.
[2023-03-14 09:42:57] [INFO ] Implicit Places using invariants in 2598 ms returned []
[2023-03-14 09:42:57] [INFO ] Invariant cache hit.
[2023-03-14 09:43:00] [INFO ] Implicit Places using invariants and state equation in 2701 ms returned []
Implicit Place search using SMT with State Equation took 5300 ms to find 0 implicit places.
[2023-03-14 09:43:00] [INFO ] Invariant cache hit.
[2023-03-14 09:43:03] [INFO ] Dead Transitions using invariants and state equation in 3056 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8491 ms. Remains : 5000/5000 places, 5000/5000 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 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 169 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 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 124 steps, including 0 resets, run visited all 1 properties in 40 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 76 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 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 09:43:04] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 33400 steps with 587 reset in 10003 ms.
Product exploration timeout after 32160 steps with 570 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 334 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:43:41] [INFO ] Redundant transitions in 326 ms returned []
[2023-03-14 09:43:41] [INFO ] Invariant cache hit.
[2023-03-14 09:43:44] [INFO ] Dead Transitions using invariants and state equation in 3095 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3760 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 159 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:43:44] [INFO ] Invariant cache hit.
[2023-03-14 09:43:47] [INFO ] Implicit Places using invariants in 2759 ms returned []
[2023-03-14 09:43:47] [INFO ] Invariant cache hit.
[2023-03-14 09:43:49] [INFO ] Implicit Places using invariants and state equation in 2733 ms returned []
Implicit Place search using SMT with State Equation took 5493 ms to find 0 implicit places.
[2023-03-14 09:43:49] [INFO ] Invariant cache hit.
[2023-03-14 09:43:52] [INFO ] Dead Transitions using invariants and state equation in 3048 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8703 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-10 finished in 104002 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(!p0)))))'
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 170 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:43:53] [INFO ] Invariant cache hit.
[2023-03-14 09:43:55] [INFO ] Implicit Places using invariants in 1587 ms returned []
[2023-03-14 09:43:55] [INFO ] Invariant cache hit.
[2023-03-14 09:43:56] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned []
Implicit Place search using SMT with State Equation took 3181 ms to find 0 implicit places.
[2023-03-14 09:43:56] [INFO ] Invariant cache hit.
[2023-03-14 09:43:59] [INFO ] Dead Transitions using invariants and state equation in 3100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6452 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 126 ms :[p0, p0, true, p0]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s1396 1) (GEQ s2396 1)) (AND (GEQ s1411 1) (GEQ s2411 1)) (AND (GEQ s1391 1) (GEQ s2391 1)) (AND (GEQ s1993 1) (GEQ s2993 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 3 ms.
FORMULA Philosophers-COL-001000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-11 finished in 6620 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(p1))))'
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 202 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:44:00] [INFO ] Invariant cache hit.
[2023-03-14 09:44:01] [INFO ] Implicit Places using invariants in 1539 ms returned []
[2023-03-14 09:44:01] [INFO ] Invariant cache hit.
[2023-03-14 09:44:03] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 3090 ms to find 0 implicit places.
[2023-03-14 09:44:03] [INFO ] Redundant transitions in 330 ms returned []
[2023-03-14 09:44:03] [INFO ] Invariant cache hit.
[2023-03-14 09:44:06] [INFO ] Dead Transitions using invariants and state equation in 3086 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6713 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-12 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s804 1) (GEQ s1804 1)) (AND (GEQ s212 1) (GEQ s1212 1)) (AND (GEQ s809 1) (GEQ s1809 1)) (AND (GEQ s217 1) (GEQ s1217 1)) (AND (GEQ s227 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2 reset in 4751 ms.
Product exploration explored 100000 steps with 2 reset in 5207 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 p0 p1), (X p1), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1113 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2044 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2009 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 330900 steps, run timeout after 15016 ms. (steps per millisecond=22 ) properties seen :{}
Probabilistic random walk after 330900 steps, saw 330397 distinct states, run finished after 15019 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 09:44:37] [INFO ] Invariant cache hit.
[2023-03-14 09:44:40] [INFO ] [Real]Absence check using 2000 positive place invariants in 470 ms returned sat
[2023-03-14 09:44:40] [INFO ] After 1304ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:44:41] [INFO ] [Nat]Absence check using 2000 positive place invariants in 477 ms returned sat
[2023-03-14 09:44:48] [INFO ] After 6131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 09:44:50] [INFO ] After 7992ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1564 ms.
[2023-03-14 09:44:51] [INFO ] After 11360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 2 properties in 127 ms. (steps per millisecond=7 )
Parikh walk visited 2 properties in 129 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 227 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 178 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:44:52] [INFO ] Invariant cache hit.
[2023-03-14 09:44:54] [INFO ] Implicit Places using invariants in 1563 ms returned []
[2023-03-14 09:44:54] [INFO ] Invariant cache hit.
[2023-03-14 09:44:55] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 3099 ms to find 0 implicit places.
[2023-03-14 09:44:55] [INFO ] Redundant transitions in 305 ms returned []
[2023-03-14 09:44:55] [INFO ] Invariant cache hit.
[2023-03-14 09:44:58] [INFO ] Dead Transitions using invariants and state equation in 3031 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6624 ms. Remains : 5000/5000 places, 5000/5000 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 p0 p1), (X p1), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 139 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1144 ms. (steps per millisecond=8 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2046 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1999 ms. (steps per millisecond=5 ) properties (out of 2) seen :0
Probabilistic random walk after 335882 steps, saw 335372 distinct states, run finished after 15022 ms. (steps per millisecond=22 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-14 09:45:19] [INFO ] Invariant cache hit.
[2023-03-14 09:45:22] [INFO ] [Real]Absence check using 2000 positive place invariants in 460 ms returned sat
[2023-03-14 09:45:22] [INFO ] After 1281ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-14 09:45:23] [INFO ] [Nat]Absence check using 2000 positive place invariants in 494 ms returned sat
[2023-03-14 09:45:30] [INFO ] After 6192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-14 09:45:32] [INFO ] After 8081ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1585 ms.
[2023-03-14 09:45:33] [INFO ] After 11534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 2 properties in 129 ms. (steps per millisecond=7 )
Parikh walk visited 2 properties in 129 ms.
Knowledge obtained : [(AND p0 p1), (X p1), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 1 reset in 4268 ms.
Product exploration explored 100000 steps with 2 reset in 5041 ms.
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 170 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:45:44] [INFO ] Invariant cache hit.
[2023-03-14 09:45:45] [INFO ] Implicit Places using invariants in 1545 ms returned []
[2023-03-14 09:45:45] [INFO ] Invariant cache hit.
[2023-03-14 09:45:47] [INFO ] Implicit Places using invariants and state equation in 1540 ms returned []
Implicit Place search using SMT with State Equation took 3086 ms to find 0 implicit places.
[2023-03-14 09:45:47] [INFO ] Redundant transitions in 326 ms returned []
[2023-03-14 09:45:47] [INFO ] Invariant cache hit.
[2023-03-14 09:45:50] [INFO ] Dead Transitions using invariants and state equation in 3018 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6606 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-12 finished in 111112 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' '!((p0 U X(!p0)))'
Support contains 2000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 156 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:45:51] [INFO ] Invariant cache hit.
[2023-03-14 09:45:52] [INFO ] Implicit Places using invariants in 1531 ms returned []
[2023-03-14 09:45:52] [INFO ] Invariant cache hit.
[2023-03-14 09:45:54] [INFO ] Implicit Places using invariants and state equation in 1529 ms returned []
Implicit Place search using SMT with State Equation took 3061 ms to find 0 implicit places.
[2023-03-14 09:45:54] [INFO ] Invariant cache hit.
[2023-03-14 09:45:57] [INFO ] Dead Transitions using invariants and state equation in 3055 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6274 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 116 ms :[p0, true, p0, p0]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s804 1) (GEQ s1804 1)) (AND (GEQ s212 1) (GEQ s1212 1)) (AND (GEQ s809 1) (GEQ s1809 1)) (AND (GEQ s217 1) (GEQ s1217 1)) (AND (GEQ s227 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 4028 ms.
Stack based approach found an accepted trace after 32311 steps with 0 reset with depth 32312 and stack size 32312 in 1423 ms.
FORMULA Philosophers-COL-001000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-13 finished in 11874 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 U (p1||G(p0))))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 68 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:46:02] [INFO ] Invariant cache hit.
[2023-03-14 09:46:04] [INFO ] Implicit Places using invariants in 1570 ms returned []
[2023-03-14 09:46:04] [INFO ] Invariant cache hit.
[2023-03-14 09:46:06] [INFO ] Implicit Places using invariants and state equation in 1579 ms returned []
Implicit Place search using SMT with State Equation took 3150 ms to find 0 implicit places.
[2023-03-14 09:46:06] [INFO ] Redundant transitions in 307 ms returned []
[2023-03-14 09:46:06] [INFO ] Invariant cache hit.
[2023-03-14 09:46:09] [INFO ] Dead Transitions using invariants and state equation in 3078 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6607 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (AND (GEQ s1396 1) (GEQ s2396 1)) (AND (GEQ s1411 1) (GEQ s2411 1)) (AND (GEQ s1391 1) (GEQ s2391 1)) (AND (GEQ s1993 1) (GEQ s2993 1)) (...], 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 1 reset in 4426 ms.
Product exploration explored 100000 steps with 1 reset in 5021 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 29 steps, including 0 resets, run visited all 2 properties in 17 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-14 09:46:28] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 67 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:46:43] [INFO ] Invariant cache hit.
[2023-03-14 09:46:44] [INFO ] Implicit Places using invariants in 1586 ms returned []
[2023-03-14 09:46:44] [INFO ] Invariant cache hit.
[2023-03-14 09:46:46] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 3172 ms to find 0 implicit places.
[2023-03-14 09:46:46] [INFO ] Redundant transitions in 317 ms returned []
[2023-03-14 09:46:46] [INFO ] Invariant cache hit.
[2023-03-14 09:46:49] [INFO ] Dead Transitions using invariants and state equation in 3035 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6597 ms. Remains : 5000/5000 places, 5000/5000 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) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 29 steps, including 0 resets, run visited all 2 properties in 13 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-14 09:46:58] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 4206 ms.
Product exploration explored 100000 steps with 1 reset in 4669 ms.
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 70 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:47:22] [INFO ] Invariant cache hit.
[2023-03-14 09:47:23] [INFO ] Implicit Places using invariants in 1505 ms returned []
[2023-03-14 09:47:23] [INFO ] Invariant cache hit.
[2023-03-14 09:47:25] [INFO ] Implicit Places using invariants and state equation in 1625 ms returned []
Implicit Place search using SMT with State Equation took 3132 ms to find 0 implicit places.
[2023-03-14 09:47:25] [INFO ] Redundant transitions in 308 ms returned []
[2023-03-14 09:47:25] [INFO ] Invariant cache hit.
[2023-03-14 09:47:28] [INFO ] Dead Transitions using invariants and state equation in 3050 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6570 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-14 finished in 86422 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(G((G(!p0)||X(p1))))))'
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 86 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:47:29] [INFO ] Invariant cache hit.
[2023-03-14 09:47:30] [INFO ] Implicit Places using invariants in 1530 ms returned []
[2023-03-14 09:47:30] [INFO ] Invariant cache hit.
[2023-03-14 09:47:32] [INFO ] Implicit Places using invariants and state equation in 1573 ms returned []
Implicit Place search using SMT with State Equation took 3104 ms to find 0 implicit places.
[2023-03-14 09:47:32] [INFO ] Invariant cache hit.
[2023-03-14 09:47:35] [INFO ] Dead Transitions using invariants and state equation in 3053 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6243 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 241 ms :[true, (NOT p1), (AND (NOT p1) p0), p0, (AND p0 (NOT p1)), (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4616 1) (GEQ s4746 1) (GEQ s4015 1) (GEQ s4437 1) (GEQ s4567 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 3 steps with 0 reset in 4 ms.
FORMULA Philosophers-COL-001000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-15 finished in 6531 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(((!p0&&G(F(p1))) U p2)))'
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((F(p1)&&p0))))'
Found a Shortening insensitive property : Philosophers-COL-001000-LTLFireability-09
Stuttering acceptance computed with spot in 92 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 94 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:47:36] [INFO ] Invariant cache hit.
[2023-03-14 09:47:37] [INFO ] Implicit Places using invariants in 1024 ms returned []
[2023-03-14 09:47:37] [INFO ] Invariant cache hit.
[2023-03-14 09:47:38] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 2015 ms to find 0 implicit places.
[2023-03-14 09:47:38] [INFO ] Invariant cache hit.
[2023-03-14 09:47:41] [INFO ] Dead Transitions using invariants and state equation in 3077 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5187 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s1684 1) (GEQ s3685 1)) (AND (GEQ s1107 1) (GEQ s3108 1)) (AND (GEQ s1097 1) (GEQ s3098 1)) (AND (GEQ s1102 1) (GEQ s3103 1)) (AND (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 27030 steps with 9020 reset in 10002 ms.
Product exploration timeout after 26380 steps with 8840 reset in 10015 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 2 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1054 ms. (steps per millisecond=9 ) properties (out of 3) seen :2
Interrupted Best-First random walk after 9003 steps, including 2 resets, run timeout after 5150 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-14 09:48:08] [INFO ] Invariant cache hit.
[2023-03-14 09:48:13] [INFO ] After 2398ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 188 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
[2023-03-14 09:48:21] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 76 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:48:36] [INFO ] Invariant cache hit.
[2023-03-14 09:48:37] [INFO ] Implicit Places using invariants in 1018 ms returned []
[2023-03-14 09:48:37] [INFO ] Invariant cache hit.
[2023-03-14 09:48:39] [INFO ] Implicit Places using invariants and state equation in 1025 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
[2023-03-14 09:48:39] [INFO ] Invariant cache hit.
[2023-03-14 09:48:42] [INFO ] Dead Transitions using invariants and state equation in 3054 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5177 ms. Remains : 5000/5000 places, 5000/5000 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 p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Knowledge based reduction with 1 factoid took 69 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (F p0)]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-14 09:48:50] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration timeout after 30260 steps with 10049 reset in 10004 ms.
Product exploration timeout after 29440 steps with 9773 reset in 10002 ms.
Support contains 3000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 108 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:49:25] [INFO ] Invariant cache hit.
[2023-03-14 09:49:26] [INFO ] Implicit Places using invariants in 1009 ms returned []
[2023-03-14 09:49:26] [INFO ] Invariant cache hit.
[2023-03-14 09:49:27] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 2019 ms to find 0 implicit places.
[2023-03-14 09:49:28] [INFO ] Redundant transitions in 305 ms returned []
[2023-03-14 09:49:28] [INFO ] Invariant cache hit.
[2023-03-14 09:49:31] [INFO ] Dead Transitions using invariants and state equation in 3021 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5458 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-09 finished in 115906 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))))'
Found a Shortening insensitive property : Philosophers-COL-001000-LTLFireability-10
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 158 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:49:32] [INFO ] Invariant cache hit.
[2023-03-14 09:49:35] [INFO ] Implicit Places using invariants in 2747 ms returned []
[2023-03-14 09:49:35] [INFO ] Invariant cache hit.
[2023-03-14 09:49:37] [INFO ] Implicit Places using invariants and state equation in 2735 ms returned []
Implicit Place search using SMT with State Equation took 5483 ms to find 0 implicit places.
[2023-03-14 09:49:37] [INFO ] Invariant cache hit.
[2023-03-14 09:49:40] [INFO ] Dead Transitions using invariants and state equation in 3007 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 8650 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Running random walk in product with property : Philosophers-COL-001000-LTLFireability-10 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 (GEQ s4356 1) (GEQ s4486 1) (GEQ s4876 1) (GEQ s4145 1) (GEQ s4275 1) (GEQ s4616 1) (GEQ s4746 1) (GEQ s4015 1) (GEQ s4437 1) (GEQ s4567 1) (GEQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 33300 steps with 573 reset in 10003 ms.
Product exploration timeout after 32320 steps with 562 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 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 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 80 steps, including 0 resets, run visited all 1 properties in 27 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 56 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 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 09:50:02] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 146 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:50:17] [INFO ] Invariant cache hit.
[2023-03-14 09:50:20] [INFO ] Implicit Places using invariants in 2789 ms returned []
[2023-03-14 09:50:20] [INFO ] Invariant cache hit.
[2023-03-14 09:50:23] [INFO ] Implicit Places using invariants and state equation in 2751 ms returned []
Implicit Place search using SMT with State Equation took 5543 ms to find 0 implicit places.
[2023-03-14 09:50:23] [INFO ] Invariant cache hit.
[2023-03-14 09:50:26] [INFO ] Dead Transitions using invariants and state equation in 3086 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8777 ms. Remains : 5000/5000 places, 5000/5000 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 p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 54 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 102 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 47 steps, including 0 resets, run visited all 1 properties in 16 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 61 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 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-14 09:50:27] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 33160 steps with 595 reset in 10003 ms.
Product exploration timeout after 32220 steps with 577 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 179 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:51:03] [INFO ] Redundant transitions in 322 ms returned []
[2023-03-14 09:51:03] [INFO ] Invariant cache hit.
[2023-03-14 09:51:06] [INFO ] Dead Transitions using invariants and state equation in 3065 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3571 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 1000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 145 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-14 09:51:06] [INFO ] Invariant cache hit.
[2023-03-14 09:51:09] [INFO ] Implicit Places using invariants in 2738 ms returned []
[2023-03-14 09:51:09] [INFO ] Invariant cache hit.
[2023-03-14 09:51:12] [INFO ] Implicit Places using invariants and state equation in 2807 ms returned []
Implicit Place search using SMT with State Equation took 5549 ms to find 0 implicit places.
[2023-03-14 09:51:12] [INFO ] Invariant cache hit.
[2023-03-14 09:51:15] [INFO ] Dead Transitions using invariants and state equation in 2871 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8568 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-10 finished in 103607 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(p1))))'
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 U (p1||G(p0))))))'
[2023-03-14 09:51:15] [INFO ] Flatten gal took : 221 ms
[2023-03-14 09:51:15] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 43 ms.
[2023-03-14 09:51:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 5000 transitions and 16000 arcs took 20 ms.
Total runtime 875751 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-COL-001000
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678788324789

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
/home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin//../BenchKit_head.sh: line 63: 2104 Killed lola --conf=$BIN_DIR/configfiles/ltlfireabilityconf --formula=$DIR/LTLFireability.xml --verdictfile=$DIR/GenericPropertiesVerdict.xml $DIR/model.pnml

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-001000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
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 lolaxred"
echo " Input is Philosophers-COL-001000, 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 r295-tall-167873947500140"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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