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.r297-tall-167873950000140.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 ltsminxred
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 r297-tall-167873950000140
=====================================================================

--------------------
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 1679453834320

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-001000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 02:57:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:57:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:57:16] [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-22 02:57:16] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 02:57:16] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 553 ms
[2023-03-22 02:57:16] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 19 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 02:57:17] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 02:57:17] [INFO ] Skeletonized 16 HLPN properties in 1 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 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=3 )
[2023-03-22 02:57:17] [INFO ] Flatten gal took : 13 ms
[2023-03-22 02:57:17] [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-22 02:57:17] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions 16000 arcs in 74 ms.
[2023-03-22 02:57:17] [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 44 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
// Phase 1: matrix 5000 rows 5000 cols
[2023-03-22 02:57:18] [INFO ] Computed 2000 place invariants in 49 ms
[2023-03-22 02:57:18] [INFO ] Implicit Places using invariants in 739 ms returned []
[2023-03-22 02:57:18] [INFO ] Invariant cache hit.
[2023-03-22 02:57:19] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2023-03-22 02:57:19] [INFO ] Invariant cache hit.
[2023-03-22 02:57:22] [INFO ] Dead Transitions using invariants and state equation in 3379 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4737 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-22 02:57:23] [INFO ] Flatten gal took : 448 ms
[2023-03-22 02:57:25] [INFO ] Flatten gal took : 393 ms
[2023-03-22 02:57:26] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1418 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 2246 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 3645 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 2180 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 2666 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 2208 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 1738 ms. (steps per millisecond=5 ) properties (out of 6) seen :1
Running SMT prover for 5 properties.
[2023-03-22 02:57:42] [INFO ] Invariant cache hit.
[2023-03-22 02:57:50] [INFO ] [Real]Absence check using 2000 positive place invariants in 537 ms returned sat
[2023-03-22 02:57:51] [INFO ] After 2450ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-22 02:57:53] [INFO ] [Nat]Absence check using 2000 positive place invariants in 557 ms returned sat
[2023-03-22 02:58:07] [INFO ] After 10390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-22 02:58:13] [INFO ] After 16305ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 3499 ms.
[2023-03-22 02:58:16] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 5 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 5 properties in 189 ms. (steps per millisecond=5 )
Parikh walk visited 5 properties in 197 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 100 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 02:58:17] [INFO ] Invariant cache hit.
[2023-03-22 02:58:18] [INFO ] Implicit Places using invariants in 1279 ms returned []
[2023-03-22 02:58:18] [INFO ] Invariant cache hit.
[2023-03-22 02:58:20] [INFO ] Implicit Places using invariants and state equation in 1288 ms returned []
Implicit Place search using SMT with State Equation took 2569 ms to find 0 implicit places.
[2023-03-22 02:58:20] [INFO ] Invariant cache hit.
[2023-03-22 02:58:23] [INFO ] Dead Transitions using invariants and state equation in 3826 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6499 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 577 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 2 steps with 0 reset in 4 ms.
FORMULA Philosophers-COL-001000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-01 finished in 7195 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 87 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 02:58:24] [INFO ] Invariant cache hit.
[2023-03-22 02:58:25] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-22 02:58:25] [INFO ] Invariant cache hit.
[2023-03-22 02:58:25] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 1171 ms to find 0 implicit places.
[2023-03-22 02:58:26] [INFO ] Redundant transitions in 376 ms returned []
[2023-03-22 02:58:26] [INFO ] Invariant cache hit.
[2023-03-22 02:58:29] [INFO ] Dead Transitions using invariants and state equation in 3691 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5334 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 189 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 5780 ms.
Product exploration explored 100000 steps with 0 reset in 6439 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 272 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 176 ms :[(NOT p2), true, (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1260 ms. (steps per millisecond=7 ) properties (out of 5) seen :1
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5092 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5047 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 6002 steps, including 1 resets, run timeout after 5138 ms. (steps per millisecond=1 ) properties seen 0
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5106 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 4 properties.
[2023-03-22 02:59:05] [INFO ] Invariant cache hit.
[2023-03-22 02:59:22] [INFO ] [Real]Absence check using 2000 positive place invariants in 564 ms returned sat
[2023-03-22 02:59:23] [INFO ] After 6801ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-22 02:59:26] [INFO ] [Nat]Absence check using 2000 positive place invariants in 549 ms returned sat
[2023-03-22 02:59:45] [INFO ] After 16710ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :1
[2023-03-22 02:59:46] [INFO ] After 17268ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :1
Attempting to minimize the solution found.
Minimization took 369 ms.
[2023-03-22 02:59:46] [INFO ] After 23081ms 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 949 steps, including 0 resets, run visited all 2 properties in 330 ms. (steps per millisecond=2 )
Parikh walk visited 2 properties in 332 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 427 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 171 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 158 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 62 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 02:59:47] [INFO ] Invariant cache hit.
[2023-03-22 02:59:48] [INFO ] Implicit Places using invariants in 587 ms returned []
[2023-03-22 02:59:48] [INFO ] Invariant cache hit.
[2023-03-22 02:59:49] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 1177 ms to find 0 implicit places.
[2023-03-22 02:59:49] [INFO ] Redundant transitions in 351 ms returned []
[2023-03-22 02:59:49] [INFO ] Invariant cache hit.
[2023-03-22 02:59:53] [INFO ] Dead Transitions using invariants and state equation in 3863 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5463 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 161 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 171 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1136 ms. (steps per millisecond=8 ) properties (out of 3) seen :1
Interrupted Best-First random walk after 8001 steps, including 1 resets, run timeout after 5401 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4620 ms. (steps per millisecond=2 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:00:05] [INFO ] Invariant cache hit.
[2023-03-22 03:00:12] [INFO ] [Real]Absence check using 2000 positive place invariants in 528 ms returned sat
[2023-03-22 03:00:14] [INFO ] After 3915ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:00:16] [INFO ] [Nat]Absence check using 2000 positive place invariants in 534 ms returned sat
[2023-03-22 03:00:23] [INFO ] After 6026ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:00:25] [INFO ] After 7898ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1367 ms.
[2023-03-22 03:00:27] [INFO ] After 13078ms 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 972 steps, including 0 resets, run visited all 2 properties in 174 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 178 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 265 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 163 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 181 ms :[(NOT p2), (NOT p1), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1 reset in 4930 ms.
Product exploration explored 100000 steps with 1 reset in 5928 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 61 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:00:39] [INFO ] Invariant cache hit.
[2023-03-22 03:00:39] [INFO ] Implicit Places using invariants in 586 ms returned []
[2023-03-22 03:00:39] [INFO ] Invariant cache hit.
[2023-03-22 03:00:40] [INFO ] Implicit Places using invariants and state equation in 574 ms returned []
Implicit Place search using SMT with State Equation took 1164 ms to find 0 implicit places.
[2023-03-22 03:00:40] [INFO ] Redundant transitions in 317 ms returned []
[2023-03-22 03:00:40] [INFO ] Invariant cache hit.
[2023-03-22 03:00:44] [INFO ] Dead Transitions using invariants and state equation in 3550 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5107 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-03 finished in 140131 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 250 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:00:45] [INFO ] Invariant cache hit.
[2023-03-22 03:00:46] [INFO ] Implicit Places using invariants in 1928 ms returned []
[2023-03-22 03:00:46] [INFO ] Invariant cache hit.
[2023-03-22 03:00:48] [INFO ] Implicit Places using invariants and state equation in 1894 ms returned []
Implicit Place search using SMT with State Equation took 3824 ms to find 0 implicit places.
[2023-03-22 03:00:48] [INFO ] Invariant cache hit.
[2023-03-22 03:00:52] [INFO ] Dead Transitions using invariants and state equation in 3773 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7850 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 268 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 55214 steps with 0 reset in 2554 ms.
FORMULA Philosophers-COL-001000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-05 finished in 10711 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 422 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:00:55] [INFO ] Invariant cache hit.
[2023-03-22 03:00:57] [INFO ] Implicit Places using invariants in 1235 ms returned []
[2023-03-22 03:00:57] [INFO ] Invariant cache hit.
[2023-03-22 03:00:58] [INFO ] Implicit Places using invariants and state equation in 1201 ms returned []
Implicit Place search using SMT with State Equation took 2438 ms to find 0 implicit places.
[2023-03-22 03:00:58] [INFO ] Redundant transitions in 287 ms returned []
[2023-03-22 03:00:58] [INFO ] Invariant cache hit.
[2023-03-22 03:01:01] [INFO ] Dead Transitions using invariants and state equation in 3326 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6480 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 106 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 6358 ms.
Stack based approach found an accepted trace after 16230 steps with 0 reset with depth 16231 and stack size 6445 in 1070 ms.
FORMULA Philosophers-COL-001000-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-08 finished in 14056 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 77 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:01:09] [INFO ] Invariant cache hit.
[2023-03-22 03:01:10] [INFO ] Implicit Places using invariants in 1216 ms returned []
[2023-03-22 03:01:10] [INFO ] Invariant cache hit.
[2023-03-22 03:01:12] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 2416 ms to find 0 implicit places.
[2023-03-22 03:01:12] [INFO ] Invariant cache hit.
[2023-03-22 03:01:15] [INFO ] Dead Transitions using invariants and state equation in 3621 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6117 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 120 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 27500 steps with 9169 reset in 10006 ms.
Product exploration timeout after 26860 steps with 8945 reset in 10001 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 126 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 109 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 1084 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 4865 ms. (steps per millisecond=2 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 03:01:42] [INFO ] Invariant cache hit.
[2023-03-22 03:01:48] [INFO ] After 2565ms 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 221 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2023-03-22 03:01:57] [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 101 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:02:12] [INFO ] Invariant cache hit.
[2023-03-22 03:02:13] [INFO ] Implicit Places using invariants in 1260 ms returned []
[2023-03-22 03:02:13] [INFO ] Invariant cache hit.
[2023-03-22 03:02:15] [INFO ] Implicit Places using invariants and state equation in 1312 ms returned []
Implicit Place search using SMT with State Equation took 2577 ms to find 0 implicit places.
[2023-03-22 03:02:15] [INFO ] Invariant cache hit.
[2023-03-22 03:02:18] [INFO ] Dead Transitions using invariants and state equation in 3322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6003 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 85 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 39 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 3 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 99 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 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2023-03-22 03:02:27] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 134 ms :[(NOT p0)]
Product exploration timeout after 30950 steps with 10369 reset in 10001 ms.
Product exploration timeout after 29880 steps with 9900 reset in 10001 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 104 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:03:02] [INFO ] Invariant cache hit.
[2023-03-22 03:03:04] [INFO ] Implicit Places using invariants in 1259 ms returned []
[2023-03-22 03:03:04] [INFO ] Invariant cache hit.
[2023-03-22 03:03:05] [INFO ] Implicit Places using invariants and state equation in 1270 ms returned []
Implicit Place search using SMT with State Equation took 2531 ms to find 0 implicit places.
[2023-03-22 03:03:05] [INFO ] Redundant transitions in 290 ms returned []
[2023-03-22 03:03:05] [INFO ] Invariant cache hit.
[2023-03-22 03:03:09] [INFO ] Dead Transitions using invariants and state equation in 3848 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6780 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-09 finished in 120705 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 148 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:03:10] [INFO ] Invariant cache hit.
[2023-03-22 03:03:13] [INFO ] Implicit Places using invariants in 3223 ms returned []
[2023-03-22 03:03:13] [INFO ] Invariant cache hit.
[2023-03-22 03:03:16] [INFO ] Implicit Places using invariants and state equation in 3079 ms returned []
Implicit Place search using SMT with State Equation took 6304 ms to find 0 implicit places.
[2023-03-22 03:03:16] [INFO ] Invariant cache hit.
[2023-03-22 03:03:20] [INFO ] Dead Transitions using invariants and state equation in 3781 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10233 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 112 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 33570 steps with 586 reset in 10003 ms.
Product exploration timeout after 31790 steps with 543 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 : [(NOT p0)]
False Knowledge obtained : []
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 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 33 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 75 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 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 03:03:42] [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 158 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:03:57] [INFO ] Invariant cache hit.
[2023-03-22 03:04:00] [INFO ] Implicit Places using invariants in 3082 ms returned []
[2023-03-22 03:04:00] [INFO ] Invariant cache hit.
[2023-03-22 03:04:03] [INFO ] Implicit Places using invariants and state equation in 3015 ms returned []
Implicit Place search using SMT with State Equation took 6099 ms to find 0 implicit places.
[2023-03-22 03:04:03] [INFO ] Invariant cache hit.
[2023-03-22 03:04:07] [INFO ] Dead Transitions using invariants and state equation in 3730 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9988 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 57 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 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 66 steps, including 0 resets, run visited all 1 properties in 22 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 85 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 92 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 03:04:08] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 33000 steps with 567 reset in 10003 ms.
Product exploration timeout after 31500 steps with 537 reset in 10002 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 110 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 335 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:04:45] [INFO ] Redundant transitions in 315 ms returned []
[2023-03-22 03:04:45] [INFO ] Invariant cache hit.
[2023-03-22 03:04:48] [INFO ] Dead Transitions using invariants and state equation in 3727 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4389 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 188 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:04:48] [INFO ] Invariant cache hit.
[2023-03-22 03:04:52] [INFO ] Implicit Places using invariants in 3324 ms returned []
[2023-03-22 03:04:52] [INFO ] Invariant cache hit.
[2023-03-22 03:04:55] [INFO ] Implicit Places using invariants and state equation in 3260 ms returned []
Implicit Place search using SMT with State Equation took 6587 ms to find 0 implicit places.
[2023-03-22 03:04:55] [INFO ] Invariant cache hit.
[2023-03-22 03:04:59] [INFO ] Dead Transitions using invariants and state equation in 3535 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10317 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-10 finished in 109303 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 105 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:04:59] [INFO ] Invariant cache hit.
[2023-03-22 03:05:01] [INFO ] Implicit Places using invariants in 1947 ms returned []
[2023-03-22 03:05:01] [INFO ] Invariant cache hit.
[2023-03-22 03:05:03] [INFO ] Implicit Places using invariants and state equation in 1906 ms returned []
Implicit Place search using SMT with State Equation took 3855 ms to find 0 implicit places.
[2023-03-22 03:05:03] [INFO ] Invariant cache hit.
[2023-03-22 03:05:07] [INFO ] Dead Transitions using invariants and state equation in 3596 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7561 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 124 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 98563 steps with 0 reset in 3985 ms.
FORMULA Philosophers-COL-001000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-11 finished in 11712 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 197 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:05:11] [INFO ] Invariant cache hit.
[2023-03-22 03:05:13] [INFO ] Implicit Places using invariants in 1904 ms returned []
[2023-03-22 03:05:13] [INFO ] Invariant cache hit.
[2023-03-22 03:05:15] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 3639 ms to find 0 implicit places.
[2023-03-22 03:05:15] [INFO ] Redundant transitions in 313 ms returned []
[2023-03-22 03:05:15] [INFO ] Invariant cache hit.
[2023-03-22 03:05:19] [INFO ] Dead Transitions using invariants and state equation in 3853 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8009 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 153 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 1 reset in 4489 ms.
Product exploration explored 100000 steps with 2 reset in 5558 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 123 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 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1126 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 2143 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 2136 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 354735 steps, run timeout after 15053 ms. (steps per millisecond=23 ) properties seen :{}
Probabilistic random walk after 354735 steps, saw 354200 distinct states, run finished after 15055 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:05:50] [INFO ] Invariant cache hit.
[2023-03-22 03:05:53] [INFO ] [Real]Absence check using 2000 positive place invariants in 515 ms returned sat
[2023-03-22 03:05:53] [INFO ] After 1633ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:05:54] [INFO ] [Nat]Absence check using 2000 positive place invariants in 545 ms returned sat
[2023-03-22 03:06:02] [INFO ] After 6607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:06:03] [INFO ] After 8444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1599 ms.
[2023-03-22 03:06:05] [INFO ] After 12059ms 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 128 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 160 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 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 99 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 270 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:06:06] [INFO ] Invariant cache hit.
[2023-03-22 03:06:08] [INFO ] Implicit Places using invariants in 1946 ms returned []
[2023-03-22 03:06:08] [INFO ] Invariant cache hit.
[2023-03-22 03:06:10] [INFO ] Implicit Places using invariants and state equation in 1917 ms returned []
Implicit Place search using SMT with State Equation took 3865 ms to find 0 implicit places.
[2023-03-22 03:06:10] [INFO ] Redundant transitions in 292 ms returned []
[2023-03-22 03:06:10] [INFO ] Invariant cache hit.
[2023-03-22 03:06:14] [INFO ] Dead Transitions using invariants and state equation in 3788 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8220 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 133 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 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1165 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 2123 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 2171 ms. (steps per millisecond=4 ) properties (out of 2) seen :0
Probabilistic random walk after 357719 steps, saw 357183 distinct states, run finished after 15007 ms. (steps per millisecond=23 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:06:35] [INFO ] Invariant cache hit.
[2023-03-22 03:06:37] [INFO ] [Real]Absence check using 2000 positive place invariants in 526 ms returned sat
[2023-03-22 03:06:38] [INFO ] After 1439ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:06:39] [INFO ] [Nat]Absence check using 2000 positive place invariants in 534 ms returned sat
[2023-03-22 03:06:46] [INFO ] After 6527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:06:48] [INFO ] After 8322ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1604 ms.
[2023-03-22 03:06:49] [INFO ] After 11904ms 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 134 ms. (steps per millisecond=7 )
Parikh walk visited 2 properties in 135 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 178 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 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 2 reset in 4312 ms.
Product exploration explored 100000 steps with 1 reset in 4928 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 189 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:07:00] [INFO ] Invariant cache hit.
[2023-03-22 03:07:01] [INFO ] Implicit Places using invariants in 1891 ms returned []
[2023-03-22 03:07:01] [INFO ] Invariant cache hit.
[2023-03-22 03:07:03] [INFO ] Implicit Places using invariants and state equation in 1884 ms returned []
Implicit Place search using SMT with State Equation took 3777 ms to find 0 implicit places.
[2023-03-22 03:07:04] [INFO ] Redundant transitions in 295 ms returned []
[2023-03-22 03:07:04] [INFO ] Invariant cache hit.
[2023-03-22 03:07:07] [INFO ] Dead Transitions using invariants and state equation in 3800 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8070 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-12 finished in 117137 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 170 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:07:08] [INFO ] Invariant cache hit.
[2023-03-22 03:07:10] [INFO ] Implicit Places using invariants in 1801 ms returned []
[2023-03-22 03:07:10] [INFO ] Invariant cache hit.
[2023-03-22 03:07:12] [INFO ] Implicit Places using invariants and state equation in 1898 ms returned []
Implicit Place search using SMT with State Equation took 3701 ms to find 0 implicit places.
[2023-03-22 03:07:12] [INFO ] Invariant cache hit.
[2023-03-22 03:07:15] [INFO ] Dead Transitions using invariants and state equation in 3689 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7561 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 113 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 1 reset in 3663 ms.
Stack based approach found an accepted trace after 6201 steps with 0 reset with depth 6202 and stack size 6202 in 535 ms.
FORMULA Philosophers-COL-001000-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-13 finished in 11911 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 75 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:07:20] [INFO ] Invariant cache hit.
[2023-03-22 03:07:22] [INFO ] Implicit Places using invariants in 1989 ms returned []
[2023-03-22 03:07:22] [INFO ] Invariant cache hit.
[2023-03-22 03:07:24] [INFO ] Implicit Places using invariants and state equation in 1907 ms returned []
Implicit Place search using SMT with State Equation took 3897 ms to find 0 implicit places.
[2023-03-22 03:07:24] [INFO ] Redundant transitions in 309 ms returned []
[2023-03-22 03:07:24] [INFO ] Invariant cache hit.
[2023-03-22 03:07:28] [INFO ] Dead Transitions using invariants and state equation in 3750 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8036 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 113 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 4614 ms.
Product exploration explored 100000 steps with 0 reset in 5095 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 125 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 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 116 steps, including 0 resets, run visited all 2 properties in 54 ms. (steps per millisecond=2 )
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 161 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 03:07:48] [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 82 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:08:03] [INFO ] Invariant cache hit.
[2023-03-22 03:08:05] [INFO ] Implicit Places using invariants in 1969 ms returned []
[2023-03-22 03:08:05] [INFO ] Invariant cache hit.
[2023-03-22 03:08:07] [INFO ] Implicit Places using invariants and state equation in 1978 ms returned []
Implicit Place search using SMT with State Equation took 3949 ms to find 0 implicit places.
[2023-03-22 03:08:07] [INFO ] Redundant transitions in 300 ms returned []
[2023-03-22 03:08:07] [INFO ] Invariant cache hit.
[2023-03-22 03:08:11] [INFO ] Dead Transitions using invariants and state equation in 3867 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8209 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 104 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 72 steps, including 0 resets, run visited all 2 properties in 31 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 148 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 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2023-03-22 03:08:21] [INFO ] Invariant cache hit.
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1 reset in 3996 ms.
Product exploration explored 100000 steps with 1 reset in 4744 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 69 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:08:45] [INFO ] Invariant cache hit.
[2023-03-22 03:08:47] [INFO ] Implicit Places using invariants in 1999 ms returned []
[2023-03-22 03:08:47] [INFO ] Invariant cache hit.
[2023-03-22 03:08:49] [INFO ] Implicit Places using invariants and state equation in 1983 ms returned []
Implicit Place search using SMT with State Equation took 3983 ms to find 0 implicit places.
[2023-03-22 03:08:49] [INFO ] Redundant transitions in 286 ms returned []
[2023-03-22 03:08:49] [INFO ] Invariant cache hit.
[2023-03-22 03:08:52] [INFO ] Dead Transitions using invariants and state equation in 3547 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7891 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-14 finished in 93075 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 85 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:08:53] [INFO ] Invariant cache hit.
[2023-03-22 03:08:55] [INFO ] Implicit Places using invariants in 1969 ms returned []
[2023-03-22 03:08:55] [INFO ] Invariant cache hit.
[2023-03-22 03:08:57] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 3911 ms to find 0 implicit places.
[2023-03-22 03:08:57] [INFO ] Invariant cache hit.
[2023-03-22 03:09:01] [INFO ] Dead Transitions using invariants and state equation in 3811 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7808 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 220 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 2 ms.
FORMULA Philosophers-COL-001000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLFireability-15 finished in 8070 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 104 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 114 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:09:01] [INFO ] Invariant cache hit.
[2023-03-22 03:09:03] [INFO ] Implicit Places using invariants in 1269 ms returned []
[2023-03-22 03:09:03] [INFO ] Invariant cache hit.
[2023-03-22 03:09:04] [INFO ] Implicit Places using invariants and state equation in 1251 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2023-03-22 03:09:04] [INFO ] Invariant cache hit.
[2023-03-22 03:09:08] [INFO ] Dead Transitions using invariants and state equation in 3773 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6411 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 27440 steps with 9086 reset in 10001 ms.
Product exploration timeout after 26800 steps with 8908 reset in 10011 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 131 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 109 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 1072 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 5455 ms. (steps per millisecond=1 ) properties seen 0
Running SMT prover for 1 properties.
[2023-03-22 03:09:35] [INFO ] Invariant cache hit.
[2023-03-22 03:09:40] [INFO ] After 2694ms 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 181 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 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2023-03-22 03:09:49] [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 78 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:10:05] [INFO ] Invariant cache hit.
[2023-03-22 03:10:06] [INFO ] Implicit Places using invariants in 1277 ms returned []
[2023-03-22 03:10:06] [INFO ] Invariant cache hit.
[2023-03-22 03:10:07] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 2527 ms to find 0 implicit places.
[2023-03-22 03:10:07] [INFO ] Invariant cache hit.
[2023-03-22 03:10:11] [INFO ] Dead Transitions using invariants and state equation in 3783 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6389 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 86 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 34 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 84 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 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-22 03:10:20] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Product exploration timeout after 31070 steps with 10400 reset in 10001 ms.
Product exploration timeout after 29720 steps with 9894 reset in 10007 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 104 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:10:55] [INFO ] Invariant cache hit.
[2023-03-22 03:10:57] [INFO ] Implicit Places using invariants in 1301 ms returned []
[2023-03-22 03:10:57] [INFO ] Invariant cache hit.
[2023-03-22 03:10:58] [INFO ] Implicit Places using invariants and state equation in 1310 ms returned []
Implicit Place search using SMT with State Equation took 2613 ms to find 0 implicit places.
[2023-03-22 03:10:58] [INFO ] Redundant transitions in 326 ms returned []
[2023-03-22 03:10:58] [INFO ] Invariant cache hit.
[2023-03-22 03:11:02] [INFO ] Dead Transitions using invariants and state equation in 3776 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6825 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-09 finished in 121502 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 107 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 181 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:11:03] [INFO ] Invariant cache hit.
[2023-03-22 03:11:06] [INFO ] Implicit Places using invariants in 3449 ms returned []
[2023-03-22 03:11:06] [INFO ] Invariant cache hit.
[2023-03-22 03:11:09] [INFO ] Implicit Places using invariants and state equation in 3059 ms returned []
Implicit Place search using SMT with State Equation took 6510 ms to find 0 implicit places.
[2023-03-22 03:11:09] [INFO ] Invariant cache hit.
[2023-03-22 03:11:13] [INFO ] Dead Transitions using invariants and state equation in 3829 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10521 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 33330 steps with 585 reset in 10003 ms.
Product exploration timeout after 31700 steps with 544 reset in 10001 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 51 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 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 12 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 64 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 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 03:11:35] [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 142 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:11:50] [INFO ] Invariant cache hit.
[2023-03-22 03:11:53] [INFO ] Implicit Places using invariants in 3288 ms returned []
[2023-03-22 03:11:53] [INFO ] Invariant cache hit.
[2023-03-22 03:11:57] [INFO ] Implicit Places using invariants and state equation in 3334 ms returned []
Implicit Place search using SMT with State Equation took 6623 ms to find 0 implicit places.
[2023-03-22 03:11:57] [INFO ] Invariant cache hit.
[2023-03-22 03:12:00] [INFO ] Dead Transitions using invariants and state equation in 3726 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10492 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 57 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 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 143 steps, including 0 resets, run visited all 1 properties in 45 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 69 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 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2023-03-22 03:12:02] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration timeout after 33550 steps with 581 reset in 10002 ms.
Product exploration timeout after 32460 steps with 570 reset in 10001 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 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 188 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:12:38] [INFO ] Redundant transitions in 300 ms returned []
[2023-03-22 03:12:38] [INFO ] Invariant cache hit.
[2023-03-22 03:12:42] [INFO ] Dead Transitions using invariants and state equation in 3712 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4208 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 140 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:12:42] [INFO ] Invariant cache hit.
[2023-03-22 03:12:45] [INFO ] Implicit Places using invariants in 3366 ms returned []
[2023-03-22 03:12:45] [INFO ] Invariant cache hit.
[2023-03-22 03:12:49] [INFO ] Implicit Places using invariants and state equation in 3268 ms returned []
Implicit Place search using SMT with State Equation took 6635 ms to find 0 implicit places.
[2023-03-22 03:12:49] [INFO ] Invariant cache hit.
[2023-03-22 03:12:52] [INFO ] Dead Transitions using invariants and state equation in 3700 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10475 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLFireability-10 finished in 110069 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-22 03:12:53] [INFO ] Flatten gal took : 248 ms
[2023-03-22 03:12:53] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 45 ms.
[2023-03-22 03:12:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 5000 transitions and 16000 arcs took 22 ms.
Total runtime 937415 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2115/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 8335012 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16062644 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2115/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 7323600 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16056784 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2115/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2115/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393216 kB
MemFree: 7274340 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16049696 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2115/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Philosophers-COL-001000-LTLFireability-03
Could not compute solution for formula : Philosophers-COL-001000-LTLFireability-09
Could not compute solution for formula : Philosophers-COL-001000-LTLFireability-10
Could not compute solution for formula : Philosophers-COL-001000-LTLFireability-12
Could not compute solution for formula : Philosophers-COL-001000-LTLFireability-14

BK_STOP 1679456929303

--------------------
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
mcc2023
ltl formula name Philosophers-COL-001000-LTLFireability-03
ltl formula formula --ltl=/tmp/2115/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5000 places, 5000 transitions and 16000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.490 real 0.160 user 0.120 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2115/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2115/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2115/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2115/ltl_0_
Killing (15) : 2121 2122 2123 2124 2125
Killing (9) : 2121 2122 2123 2124 2125
ltl formula name Philosophers-COL-001000-LTLFireability-09
ltl formula formula --ltl=/tmp/2115/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5000 places, 5000 transitions and 16000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.490 real 0.140 user 0.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2115/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2115/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2115/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2115/ltl_1_
Killing (15) : 2136 2137 2138 2139 2140
Killing (9) : 2136 2137 2138 2139 2140
ltl formula name Philosophers-COL-001000-LTLFireability-10
ltl formula formula --ltl=/tmp/2115/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5000 places, 5000 transitions and 16000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.460 real 0.170 user 0.110 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2115/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2115/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2115/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2115/ltl_2_
pnml2lts-mc( 0/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 1/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
pnml2lts-mc( 3/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
pnml2lts-mc( 2/ 4), ** error **: more than 30 predicates in buchi automaton are currently not supported
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
malloc_consolidate(): invalid chunk size
ltl formula name Philosophers-COL-001000-LTLFireability-12
ltl formula formula --ltl=/tmp/2115/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5000 places, 5000 transitions and 16000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.470 real 0.110 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2115/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2115/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2115/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2115/ltl_3_
Killing (15) : 2159 2160 2161 2162 2163
Killing (9) : 2159 2160 2161 2162 2163
ltl formula name Philosophers-COL-001000-LTLFireability-14
ltl formula formula --ltl=/tmp/2115/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 5000 places, 5000 transitions and 16000 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.480 real 0.130 user 0.140 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2115/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2115/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2115/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2115/ltl_4_
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
terminate called after throwing an instance of 'std::runtime_error'
terminate called after throwing an instance of 'std::runtime_error'
terminate called after throwing an instance of ' what(): too many children for formulastd::runtime_error'

what(): what(): too many children for formulatoo many children for formula

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="ltsminxred"
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 ltsminxred"
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 r297-tall-167873950000140"
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 ;