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-167873950000139.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950000139
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-01
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-02
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-03
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-04
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-05
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-06
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-07
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-08
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-09
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-10
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-11
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-12
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-13
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-14
FORMULA_NAME Philosophers-COL-001000-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679453822289

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=LTLCardinality
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:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-22 02:57:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:57:04] [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:04] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 02:57:05] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 708 ms
[2023-03-22 02:57:05] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 5000 PT places and 5000.0 transition bindings in 22 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 02:57:05] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 02:57:05] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-COL-001000-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-001000-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 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 23 ms. (steps per millisecond=435 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-22 02:57:05] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-22 02:57:05] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 02:57:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-22 02:57:05] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA Philosophers-COL-001000-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:57:05] [INFO ] Flatten gal took : 15 ms
[2023-03-22 02:57:05] [INFO ] Flatten gal took : 2 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:05] [INFO ] Unfolded HLPN to a Petri net with 5000 places and 5000 transitions 16000 arcs in 70 ms.
[2023-03-22 02:57:05] [INFO ] Unfolded 11 HLPN properties in 8 ms.
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 43 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:06] [INFO ] Computed 2000 place invariants in 54 ms
[2023-03-22 02:57:06] [INFO ] Implicit Places using invariants in 842 ms returned []
[2023-03-22 02:57:06] [INFO ] Invariant cache hit.
[2023-03-22 02:57:07] [INFO ] Implicit Places using invariants and state equation in 689 ms returned []
Implicit Place search using SMT with State Equation took 1535 ms to find 0 implicit places.
[2023-03-22 02:57:07] [INFO ] Invariant cache hit.
[2023-03-22 02:57:11] [INFO ] Dead Transitions using invariants and state equation in 3847 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5428 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Support contains 5000 out of 5000 places after structural reductions.
[2023-03-22 02:57:12] [INFO ] Flatten gal took : 380 ms
[2023-03-22 02:57:12] [INFO ] Flatten gal took : 236 ms
[2023-03-22 02:57:13] [INFO ] Input system was already deterministic with 5000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3524 ms. (steps per millisecond=2 ) properties (out of 17) seen :13
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 844 ms. (steps per millisecond=11 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1023 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 690 ms. (steps per millisecond=14 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 02:57:19] [INFO ] Invariant cache hit.
[2023-03-22 02:57:21] [INFO ] [Real]Absence check using 2000 positive place invariants in 532 ms returned sat
[2023-03-22 02:57:29] [INFO ] After 9176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 02:57:30] [INFO ] [Nat]Absence check using 2000 positive place invariants in 530 ms returned sat
[2023-03-22 02:57:35] [INFO ] After 3962ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 02:57:36] [INFO ] After 4681ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 353 ms.
[2023-03-22 02:57:36] [INFO ] After 7345ms 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 258 ms. (steps per millisecond=3 )
Parikh walk visited 2 properties in 264 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&X((F(p1)||G(p2)))))))'
Support contains 4000 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 5000/5000 transitions.
Applied a total of 0 rules in 109 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 02:57:37] [INFO ] Invariant cache hit.
[2023-03-22 02:57:38] [INFO ] Implicit Places using invariants in 1312 ms returned []
[2023-03-22 02:57:38] [INFO ] Invariant cache hit.
[2023-03-22 02:57:40] [INFO ] Implicit Places using invariants and state equation in 1321 ms returned []
Implicit Place search using SMT with State Equation took 2635 ms to find 0 implicit places.
[2023-03-22 02:57:40] [INFO ] Invariant cache hit.
[2023-03-22 02:57:43] [INFO ] Dead Transitions using invariants and state equation in 3668 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6415 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 378 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(LEQ (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s40...], 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, null, null][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-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-01 finished in 6909 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&&F(p1)))||(F(p1)&&F((G(p2)||G(!p1))))))'
Support contains 4000 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 210 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 02:57:44] [INFO ] Invariant cache hit.
[2023-03-22 02:57:45] [INFO ] Implicit Places using invariants in 1446 ms returned []
[2023-03-22 02:57:45] [INFO ] Invariant cache hit.
[2023-03-22 02:57:47] [INFO ] Implicit Places using invariants and state equation in 1411 ms returned []
Implicit Place search using SMT with State Equation took 2863 ms to find 0 implicit places.
[2023-03-22 02:57:47] [INFO ] Redundant transitions in 368 ms returned []
[2023-03-22 02:57:47] [INFO ] Invariant cache hit.
[2023-03-22 02:57:51] [INFO ] Dead Transitions using invariants and state equation in 3952 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7406 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ 2 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 77090 steps with 0 reset in 10001 ms.
Product exploration timeout after 73200 steps with 0 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2)))]
Knowledge based reduction with 5 factoid took 327 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2324 ms. (steps per millisecond=4 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1052 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:58:16] [INFO ] Invariant cache hit.
[2023-03-22 02:58:17] [INFO ] [Real]Absence check using 2000 positive place invariants in 547 ms returned sat
[2023-03-22 02:58:21] [INFO ] After 3266ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 02:58:22] [INFO ] After 3642ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 187 ms.
[2023-03-22 02:58:22] [INFO ] After 5842ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 224 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 227 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X p0)]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F p1), (F (AND p1 p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 5 factoid took 432 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-22 02:58:23] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
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 57 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 02:58:38] [INFO ] Invariant cache hit.
[2023-03-22 02:58:40] [INFO ] Implicit Places using invariants in 1405 ms returned []
[2023-03-22 02:58:40] [INFO ] Invariant cache hit.
[2023-03-22 02:58:41] [INFO ] Implicit Places using invariants and state equation in 1385 ms returned []
Implicit Place search using SMT with State Equation took 2792 ms to find 0 implicit places.
[2023-03-22 02:58:41] [INFO ] Invariant cache hit.
[2023-03-22 02:58:45] [INFO ] Dead Transitions using invariants and state equation in 3732 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6587 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) (NOT p2) p0), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 2697 ms. (steps per millisecond=3 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 988 ms. (steps per millisecond=10 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1038 ms. (steps per millisecond=9 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:58:50] [INFO ] Invariant cache hit.
[2023-03-22 02:58:52] [INFO ] [Real]Absence check using 2000 positive place invariants in 585 ms returned sat
[2023-03-22 02:58:56] [INFO ] After 3180ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 02:58:56] [INFO ] After 3553ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-22 02:58:56] [INFO ] After 5687ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 208 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 209 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT p0)), (F p1), (F (AND p1 p2)), (F (AND (NOT p1) p2))]
Knowledge based reduction with 3 factoid took 295 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
[2023-03-22 02:58:57] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Product exploration timeout after 67540 steps with 1 reset in 10001 ms.
Product exploration timeout after 69480 steps with 1 reset in 10001 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p1), (AND p1 (NOT p2)), (AND p1 (NOT p2) (NOT p0))]
Support contains 4000 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 199 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 02:59:33] [INFO ] Redundant transitions in 287 ms returned []
[2023-03-22 02:59:33] [INFO ] Invariant cache hit.
[2023-03-22 02:59:37] [INFO ] Dead Transitions using invariants and state equation in 3645 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4155 ms. Remains : 5000/5000 places, 5000/5000 transitions.
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 38 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 02:59:37] [INFO ] Invariant cache hit.
[2023-03-22 02:59:38] [INFO ] Implicit Places using invariants in 1325 ms returned []
[2023-03-22 02:59:38] [INFO ] Invariant cache hit.
[2023-03-22 02:59:40] [INFO ] Implicit Places using invariants and state equation in 1341 ms returned []
Implicit Place search using SMT with State Equation took 2668 ms to find 0 implicit places.
[2023-03-22 02:59:40] [INFO ] Invariant cache hit.
[2023-03-22 02:59:43] [INFO ] Dead Transitions using invariants and state equation in 3607 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6315 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLCardinality-03 finished in 120222 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
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 400 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 02:59:44] [INFO ] Invariant cache hit.
[2023-03-22 02:59:47] [INFO ] Implicit Places using invariants in 2666 ms returned []
[2023-03-22 02:59:47] [INFO ] Invariant cache hit.
[2023-03-22 02:59:50] [INFO ] Implicit Places using invariants and state equation in 2515 ms returned []
Implicit Place search using SMT with State Equation took 5186 ms to find 0 implicit places.
[2023-03-22 02:59:50] [INFO ] Redundant transitions in 235 ms returned []
[2023-03-22 02:59:50] [INFO ] Invariant cache hit.
[2023-03-22 02:59:53] [INFO ] Dead Transitions using invariants and state equation in 3683 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9518 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 5313 ms.
Stack based approach found an accepted trace after 11868 steps with 0 reset with depth 11869 and stack size 9529 in 1209 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-05 finished in 16119 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)&&F(G(!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 43 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:00:00] [INFO ] Invariant cache hit.
[2023-03-22 03:00:01] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-22 03:00:01] [INFO ] Invariant cache hit.
[2023-03-22 03:00:01] [INFO ] Implicit Places using invariants and state equation in 586 ms returned []
Implicit Place search using SMT with State Equation took 1019 ms to find 0 implicit places.
[2023-03-22 03:00:01] [INFO ] Redundant transitions in 289 ms returned []
[2023-03-22 03:00:01] [INFO ] Invariant cache hit.
[2023-03-22 03:00:05] [INFO ] Dead Transitions using invariants and state equation in 3753 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5117 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LEQ (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration timeout after 31730 steps with 0 reset in 10001 ms.
Product exploration timeout after 30690 steps with 0 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 5 factoid took 232 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3189 ms. (steps per millisecond=3 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1869 ms. (steps per millisecond=5 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2411 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 731 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:00:35] [INFO ] Invariant cache hit.
[2023-03-22 03:00:36] [INFO ] After 784ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:00:37] [INFO ] [Nat]Absence check using 2000 positive place invariants in 570 ms returned sat
[2023-03-22 03:00:43] [INFO ] After 4835ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:00:44] [INFO ] After 5639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 441 ms.
[2023-03-22 03:00:44] [INFO ] After 8077ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 170 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 575 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p2))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F p1), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 371 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 152 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) 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 35 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:00:46] [INFO ] Invariant cache hit.
[2023-03-22 03:00:46] [INFO ] Implicit Places using invariants in 513 ms returned []
[2023-03-22 03:00:46] [INFO ] Invariant cache hit.
[2023-03-22 03:00:47] [INFO ] Implicit Places using invariants and state equation in 608 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
[2023-03-22 03:00:47] [INFO ] Redundant transitions in 302 ms returned []
[2023-03-22 03:00:47] [INFO ] Invariant cache hit.
[2023-03-22 03:00:51] [INFO ] Dead Transitions using invariants and state equation in 3714 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5186 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 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2)]
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3171 ms. (steps per millisecond=3 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1929 ms. (steps per millisecond=5 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 2489 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 748 ms. (steps per millisecond=13 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 03:01:00] [INFO ] Invariant cache hit.
[2023-03-22 03:01:02] [INFO ] After 689ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 03:01:03] [INFO ] [Nat]Absence check using 2000 positive place invariants in 531 ms returned sat
[2023-03-22 03:01:08] [INFO ] After 4710ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 03:01:09] [INFO ] After 5491ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 419 ms.
[2023-03-22 03:01:10] [INFO ] After 7927ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 1000 steps, including 0 resets, run visited all 1 properties in 178 ms. (steps per millisecond=5 )
Parikh walk visited 2 properties in 602 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (NOT p2)), (X p2), (F p2), (F p1), (F (NOT p0)), (F (AND (NOT p0) p2)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 5 factoid took 336 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 149 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (NOT p1), p2, (OR (NOT p1) p2)]
Product exploration timeout after 26260 steps with 0 reset in 10003 ms.
Product exploration timeout after 26210 steps with 0 reset in 10003 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 32 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:01:31] [INFO ] Invariant cache hit.
[2023-03-22 03:01:32] [INFO ] Implicit Places using invariants in 592 ms returned []
[2023-03-22 03:01:32] [INFO ] Invariant cache hit.
[2023-03-22 03:01:32] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 1139 ms to find 0 implicit places.
[2023-03-22 03:01:32] [INFO ] Redundant transitions in 301 ms returned []
[2023-03-22 03:01:32] [INFO ] Invariant cache hit.
[2023-03-22 03:01:36] [INFO ] Dead Transitions using invariants and state equation in 3693 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5171 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLCardinality-06 finished in 96402 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(G(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 162 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:01:37] [INFO ] Invariant cache hit.
[2023-03-22 03:01:40] [INFO ] Implicit Places using invariants in 3382 ms returned []
[2023-03-22 03:01:40] [INFO ] Invariant cache hit.
[2023-03-22 03:01:43] [INFO ] Implicit Places using invariants and state equation in 3322 ms returned []
Implicit Place search using SMT with State Equation took 6705 ms to find 0 implicit places.
[2023-03-22 03:01:43] [INFO ] Invariant cache hit.
[2023-03-22 03:01:47] [INFO ] Dead Transitions using invariants and state equation in 3743 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10611 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 1 (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-07 finished in 10729 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 p1)||G(!p2)))'
Support contains 4000 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 56 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:01:47] [INFO ] Invariant cache hit.
[2023-03-22 03:01:48] [INFO ] Implicit Places using invariants in 1101 ms returned []
[2023-03-22 03:01:48] [INFO ] Invariant cache hit.
[2023-03-22 03:01:50] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 2385 ms to find 0 implicit places.
[2023-03-22 03:01:50] [INFO ] Redundant transitions in 301 ms returned []
[2023-03-22 03:01:50] [INFO ] Invariant cache hit.
[2023-03-22 03:01:53] [INFO ] Dead Transitions using invariants and state equation in 3403 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6153 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p1), p2, (AND (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(LEQ (ADD s1000 s1001 s1002 s1003 s1004 s1005 s1006 s1007 s1008 s1009 s1010 s1011 s1012 s1013 s1014 s1015 s1016 s1017 s1018 s1019 s1020 s1021 s1022 s10...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 88 steps with 0 reset in 49 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-08 finished in 6351 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 4000 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 76 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:01:54] [INFO ] Invariant cache hit.
[2023-03-22 03:01:55] [INFO ] Implicit Places using invariants in 1397 ms returned []
[2023-03-22 03:01:55] [INFO ] Invariant cache hit.
[2023-03-22 03:01:56] [INFO ] Implicit Places using invariants and state equation in 1400 ms returned []
Implicit Place search using SMT with State Equation took 2800 ms to find 0 implicit places.
[2023-03-22 03:01:57] [INFO ] Redundant transitions in 312 ms returned []
[2023-03-22 03:01:57] [INFO ] Invariant cache hit.
[2023-03-22 03:02:01] [INFO ] Dead Transitions using invariants and state equation in 3833 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7027 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-11 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:(LEQ (ADD s4000 s4001 s4002 s4003 s4004 s4005 s4006 s4007 s4008 s4009 s4010 s4011 s4012 s4013 s4014 s4015 s4016 s4017 s4018 s4019 s4020 s4021 s4022 s40...], 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 timeout after 37950 steps with 27 reset in 10001 ms.
Product exploration timeout after 37530 steps with 27 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 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 129 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1980 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Finished Best-First random walk after 4000 steps, including 0 resets, run visited all 1 properties in 302 ms. (steps per millisecond=13 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 175 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 127 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-22 03:02:25] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Support contains 4000 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 79 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:02:40] [INFO ] Invariant cache hit.
[2023-03-22 03:02:42] [INFO ] Implicit Places using invariants in 1393 ms returned []
[2023-03-22 03:02:42] [INFO ] Invariant cache hit.
[2023-03-22 03:02:43] [INFO ] Implicit Places using invariants and state equation in 1378 ms returned []
Implicit Place search using SMT with State Equation took 2777 ms to find 0 implicit places.
[2023-03-22 03:02:43] [INFO ] Redundant transitions in 309 ms returned []
[2023-03-22 03:02:43] [INFO ] Invariant cache hit.
[2023-03-22 03:02:47] [INFO ] Dead Transitions using invariants and state equation in 3614 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6789 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 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1946 ms. (steps per millisecond=5 ) properties (out of 2) seen :1
Finished Best-First random walk after 4000 steps, including 0 resets, run visited all 1 properties in 317 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0)]
False Knowledge obtained : [(F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 170 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 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-22 03:02:51] [INFO ] Invariant cache hit.
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration timeout after 39860 steps with 27 reset in 10003 ms.
Product exploration timeout after 38880 steps with 27 reset in 10004 ms.
Support contains 4000 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 60 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:03:27] [INFO ] Invariant cache hit.
[2023-03-22 03:03:28] [INFO ] Implicit Places using invariants in 1342 ms returned []
[2023-03-22 03:03:28] [INFO ] Invariant cache hit.
[2023-03-22 03:03:29] [INFO ] Implicit Places using invariants and state equation in 1309 ms returned []
Implicit Place search using SMT with State Equation took 2653 ms to find 0 implicit places.
[2023-03-22 03:03:29] [INFO ] Redundant transitions in 209 ms returned []
[2023-03-22 03:03:29] [INFO ] Invariant cache hit.
[2023-03-22 03:03:33] [INFO ] Dead Transitions using invariants and state equation in 3483 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6414 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLCardinality-11 finished in 99676 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(G((p0&&F(p1))))||F((!p1&&X(p2)))))'
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 63 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:03:33] [INFO ] Invariant cache hit.
[2023-03-22 03:03:35] [INFO ] Implicit Places using invariants in 1816 ms returned []
[2023-03-22 03:03:35] [INFO ] Invariant cache hit.
[2023-03-22 03:03:37] [INFO ] Implicit Places using invariants and state equation in 1923 ms returned []
Implicit Place search using SMT with State Equation took 3741 ms to find 0 implicit places.
[2023-03-22 03:03:37] [INFO ] Invariant cache hit.
[2023-03-22 03:03:41] [INFO ] Dead Transitions using invariants and state equation in 3694 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7499 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) p1), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(GT 3 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration timeout after 35220 steps with 24 reset in 10002 ms.
Stack based approach found an accepted trace after 21739 steps with 14 reset with depth 1216 and stack size 1216 in 6163 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-12 finished in 24034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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 173 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 2658 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 2592 ms returned []
Implicit Place search using SMT with State Equation took 5251 ms to find 0 implicit places.
[2023-03-22 03:04:03] [INFO ] Redundant transitions in 218 ms returned []
[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 3696 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9343 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GT (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 49260 steps with 0 reset in 10002 ms.
Product exploration timeout after 47950 steps with 0 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Finished random walk after 76 steps, including 0 resets, run visited all 1 properties in 30 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 102 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-22 03:04:30] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
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 135 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:04:45] [INFO ] Invariant cache hit.
[2023-03-22 03:04:47] [INFO ] Implicit Places using invariants in 2624 ms returned []
[2023-03-22 03:04:47] [INFO ] Invariant cache hit.
[2023-03-22 03:04:50] [INFO ] Implicit Places using invariants and state equation in 2506 ms returned []
Implicit Place search using SMT with State Equation took 5132 ms to find 0 implicit places.
[2023-03-22 03:04:50] [INFO ] Redundant transitions in 213 ms returned []
[2023-03-22 03:04:50] [INFO ] Invariant cache hit.
[2023-03-22 03:04:54] [INFO ] Dead Transitions using invariants and state equation in 3805 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9293 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), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 115 steps, including 0 resets, run visited all 1 properties in 46 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2023-03-22 03:04:56] [INFO ] Invariant cache hit.
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Product exploration timeout after 48900 steps with 0 reset in 10002 ms.
Product exploration timeout after 46640 steps with 0 reset in 10005 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 149 ms. Remains 5000 /5000 variables (removed 0) and now considering 5000/5000 (removed 0) transitions.
[2023-03-22 03:05:31] [INFO ] Invariant cache hit.
[2023-03-22 03:05:34] [INFO ] Implicit Places using invariants in 2700 ms returned []
[2023-03-22 03:05:34] [INFO ] Invariant cache hit.
[2023-03-22 03:05:37] [INFO ] Implicit Places using invariants and state equation in 2677 ms returned []
Implicit Place search using SMT with State Equation took 5379 ms to find 0 implicit places.
[2023-03-22 03:05:37] [INFO ] Redundant transitions in 224 ms returned []
[2023-03-22 03:05:37] [INFO ] Invariant cache hit.
[2023-03-22 03:05:41] [INFO ] Dead Transitions using invariants and state equation in 3866 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9623 ms. Remains : 5000/5000 places, 5000/5000 transitions.
Treatment of property Philosophers-COL-001000-LTLCardinality-13 finished in 103997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
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.
Performed 1000 Post agglomeration using F-continuation condition.Transition count delta: 1000
Deduced a syphon composed of 1000 places in 1 ms
Reduce places removed 1000 places and 0 transitions.
Iterating global reduction 0 with 2000 rules applied. Total rules applied 2000 place count 4000 transition count 4000
Applied a total of 2000 rules in 573 ms. Remains 4000 /5000 variables (removed 1000) and now considering 4000/5000 (removed 1000) transitions.
// Phase 1: matrix 4000 rows 4000 cols
[2023-03-22 03:05:42] [INFO ] Computed 2000 place invariants in 33 ms
[2023-03-22 03:05:44] [INFO ] Implicit Places using invariants in 2449 ms returned []
[2023-03-22 03:05:44] [INFO ] Invariant cache hit.
[2023-03-22 03:05:48] [INFO ] Implicit Places using invariants and state equation in 3470 ms returned []
Implicit Place search using SMT with State Equation took 5922 ms to find 0 implicit places.
[2023-03-22 03:05:48] [INFO ] Redundant transitions in 149 ms returned []
[2023-03-22 03:05:48] [INFO ] Invariant cache hit.
[2023-03-22 03:05:51] [INFO ] Dead Transitions using invariants and state equation in 2605 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4000/5000 places, 4000/5000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9257 ms. Remains : 4000/5000 places, 4000/5000 transitions.
Stuttering acceptance computed with spot in 32 ms :[p0]
Running random walk in product with property : Philosophers-COL-001000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 3 (ADD s2000 s2001 s2002 s2003 s2004 s2005 s2006 s2007 s2008 s2009 s2010 s2011 s2012 s2013 s2014 s2015 s2016 s2017 s2018 s2019 s2020 s2021 s2022 s2...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration timeout after 35160 steps with 5006 reset in 10001 ms.
Stack based approach found an accepted trace after 5139 steps with 736 reset with depth 3 and stack size 3 in 1525 ms.
FORMULA Philosophers-COL-001000-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-001000-LTLCardinality-15 finished in 20842 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&&F(p1)))||(F(p1)&&F((G(p2)||G(!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(p0)||G((F(p1)&&F(G(!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' '!(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' '!(F(G(p0)))'
[2023-03-22 03:06:03] [INFO ] Flatten gal took : 191 ms
[2023-03-22 03:06:03] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 10 ms.
[2023-03-22 03:06:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 5000 transitions and 16000 arcs took 33 ms.
Total runtime 538923 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1600/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 15924316 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16117532 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1600/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 15877496 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16072192 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1600/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 892 seconds
MemTotal: 16393216 kB
MemFree: 15869604 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16064592 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1600/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15865648 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16063764 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2023

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="LTLCardinality"
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 LTLCardinality"
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-167873950000139"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;