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.r295-tall-167873947400124.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Philosophers-COL-000200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947400124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:13 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 3.7K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:30 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 18K 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-000200-LTLFireability-00
FORMULA_NAME Philosophers-COL-000200-LTLFireability-01
FORMULA_NAME Philosophers-COL-000200-LTLFireability-02
FORMULA_NAME Philosophers-COL-000200-LTLFireability-03
FORMULA_NAME Philosophers-COL-000200-LTLFireability-04
FORMULA_NAME Philosophers-COL-000200-LTLFireability-05
FORMULA_NAME Philosophers-COL-000200-LTLFireability-06
FORMULA_NAME Philosophers-COL-000200-LTLFireability-07
FORMULA_NAME Philosophers-COL-000200-LTLFireability-08
FORMULA_NAME Philosophers-COL-000200-LTLFireability-09
FORMULA_NAME Philosophers-COL-000200-LTLFireability-10
FORMULA_NAME Philosophers-COL-000200-LTLFireability-11
FORMULA_NAME Philosophers-COL-000200-LTLFireability-12
FORMULA_NAME Philosophers-COL-000200-LTLFireability-13
FORMULA_NAME Philosophers-COL-000200-LTLFireability-14
FORMULA_NAME Philosophers-COL-000200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678783942002

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:52:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 08:52:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:52:23] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 08:52:23] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 08:52:24] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 623 ms
[2023-03-14 08:52:24] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 1000 PT places and 1000.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 08:52:24] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 08:52:24] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000200-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10099 steps, including 49 resets, run finished after 23 ms. (steps per millisecond=439 ) properties (out of 4) seen :3
Finished Best-First random walk after 7 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
[2023-03-14 08:52:24] [INFO ] Flatten gal took : 12 ms
[2023-03-14 08:52:24] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 200) 200) 200)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 08:52:24] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions 3200 arcs in 27 ms.
[2023-03-14 08:52:24] [INFO ] Unfolded 13 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000200-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 08:52:24] [INFO ] Computed 400 place invariants in 19 ms
[2023-03-14 08:52:24] [INFO ] Implicit Places using invariants in 312 ms returned []
[2023-03-14 08:52:24] [INFO ] Invariant cache hit.
[2023-03-14 08:52:25] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 782 ms to find 0 implicit places.
[2023-03-14 08:52:25] [INFO ] Invariant cache hit.
[2023-03-14 08:52:25] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1368 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 1000 out of 1000 places after structural reductions.
[2023-03-14 08:52:26] [INFO ] Flatten gal took : 129 ms
[2023-03-14 08:52:26] [INFO ] Flatten gal took : 105 ms
[2023-03-14 08:52:27] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 6650 steps, including 1 resets, run visited all 13 properties in 261 ms. (steps per millisecond=25 )
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(G(p0))||F(p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 40 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:52:27] [INFO ] Invariant cache hit.
[2023-03-14 08:52:28] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-14 08:52:28] [INFO ] Invariant cache hit.
[2023-03-14 08:52:28] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2023-03-14 08:52:28] [INFO ] Invariant cache hit.
[2023-03-14 08:52:29] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1342 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s316 1) (GEQ s516 1)) (AND (GEQ s321 1) (GEQ s521 1)) (AND (GEQ s331 1) (GEQ s531 1)) (AND (GEQ s301 1) (GEQ s501 1)) (AND (GEQ s311 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33279 reset in 5588 ms.
Product exploration explored 100000 steps with 33335 reset in 5618 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), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 2529 steps, including 0 resets, run visited all 3 properties in 35 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 222 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 149 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:52:44] [INFO ] Invariant cache hit.
[2023-03-14 08:52:44] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-14 08:52:44] [INFO ] Invariant cache hit.
[2023-03-14 08:52:45] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 767 ms to find 0 implicit places.
[2023-03-14 08:52:45] [INFO ] Invariant cache hit.
[2023-03-14 08:52:45] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1326 ms. Remains : 1000/1000 places, 1000/1000 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) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 3094 steps, including 0 resets, run visited all 3 properties in 41 ms. (steps per millisecond=75 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 212 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 141 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 33144 reset in 4846 ms.
Product exploration explored 100000 steps with 33202 reset in 5026 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 48 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:52:57] [INFO ] Redundant transitions in 53 ms returned []
[2023-03-14 08:52:57] [INFO ] Invariant cache hit.
[2023-03-14 08:52:58] [INFO ] Dead Transitions using invariants and state equation in 536 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 649 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 11 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:52:58] [INFO ] Invariant cache hit.
[2023-03-14 08:52:58] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-14 08:52:58] [INFO ] Invariant cache hit.
[2023-03-14 08:52:59] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 748 ms to find 0 implicit places.
[2023-03-14 08:52:59] [INFO ] Invariant cache hit.
[2023-03-14 08:52:59] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1294 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-COL-000200-LTLFireability-00 finished in 31960 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(!p2)&&p1))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:52:59] [INFO ] Invariant cache hit.
[2023-03-14 08:52:59] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-14 08:52:59] [INFO ] Invariant cache hit.
[2023-03-14 08:53:00] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2023-03-14 08:53:00] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-14 08:53:00] [INFO ] Invariant cache hit.
[2023-03-14 08:53:00] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1149 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 348 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), true, (NOT p0), p2, (OR (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=(AND p1 p2), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-03 finished in 1534 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(!p0))&&F(((p2 U X(p2))||p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:53:01] [INFO ] Invariant cache hit.
[2023-03-14 08:53:01] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-14 08:53:01] [INFO ] Invariant cache hit.
[2023-03-14 08:53:02] [INFO ] Implicit Places using invariants and state equation in 545 ms returned []
Implicit Place search using SMT with State Equation took 761 ms to find 0 implicit places.
[2023-03-14 08:53:02] [INFO ] Invariant cache hit.
[2023-03-14 08:53:02] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1306 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s173 1) (GEQ s373 1)) (AND (GEQ s158 1) (GE...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 84 reset in 1229 ms.
Stack based approach found an accepted trace after 3369 steps with 1 reset with depth 2317 and stack size 2317 in 54 ms.
FORMULA Philosophers-COL-000200-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-04 finished in 2742 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&&G(!p1))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:53:04] [INFO ] Invariant cache hit.
[2023-03-14 08:53:04] [INFO ] Implicit Places using invariants in 219 ms returned []
[2023-03-14 08:53:04] [INFO ] Invariant cache hit.
[2023-03-14 08:53:04] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-03-14 08:53:04] [INFO ] Invariant cache hit.
[2023-03-14 08:53:05] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1292 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-05 finished in 1449 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 U (p1||G(p0)))||F((G(p2)||(X(p2)&&p3))))))'
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:53:05] [INFO ] Invariant cache hit.
[2023-03-14 08:53:05] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-14 08:53:05] [INFO ] Invariant cache hit.
[2023-03-14 08:53:06] [INFO ] Implicit Places using invariants and state equation in 549 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2023-03-14 08:53:06] [INFO ] Invariant cache hit.
[2023-03-14 08:53:06] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1301 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (LT s846 1) (LT s911 1) (LT s968 1) (LT s838 1) (LT s903 1) (LT s960 1) (LT s927 1) (LT s862 1) (LT s984 1) (LT s854 1) (LT s919 1) (LT s976 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 48 reset in 1515 ms.
Product exploration explored 100000 steps with 52 reset in 1644 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 p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 7 factoid took 455 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 08:53:15] [INFO ] Invariant cache hit.
[2023-03-14 08:53:16] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 4 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (G (NOT (AND p2 p3))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 9 factoid took 622 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-14 08:53:17] [INFO ] Invariant cache hit.
[2023-03-14 08:53:30] [INFO ] [Real]Absence check using 400 positive place invariants in 606 ms returned sat
[2023-03-14 08:53:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:53:32] [INFO ] [Real]Absence check using state equation in 2112 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:53:32] [INFO ] Invariant cache hit.
[2023-03-14 08:53:32] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-14 08:53:32] [INFO ] Invariant cache hit.
[2023-03-14 08:53:33] [INFO ] Implicit Places using invariants and state equation in 523 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-14 08:53:33] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-14 08:53:33] [INFO ] Invariant cache hit.
[2023-03-14 08:53:33] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1327 ms. Remains : 1000/1000 places, 1000/1000 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 p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1)))))]
Knowledge based reduction with 4 factoid took 293 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Finished random walk after 1955 steps, including 0 resets, run visited all 5 properties in 30 ms. (steps per millisecond=65 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1))))), (F (NOT p3)), (F (OR (AND p0 p3) (AND p1 p3))), (F (AND (NOT p0) p2 (NOT p1))), (F (OR (AND p0 p2) (AND p2 p1))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 4 factoid took 430 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-14 08:53:40] [INFO ] Invariant cache hit.
[2023-03-14 08:53:53] [INFO ] [Real]Absence check using 400 positive place invariants in 594 ms returned sat
[2023-03-14 08:53:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:53:55] [INFO ] [Real]Absence check using state equation in 2137 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Product exploration explored 100000 steps with 100 reset in 1524 ms.
Product exploration explored 100000 steps with 132 reset in 1668 ms.
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:53:58] [INFO ] Invariant cache hit.
[2023-03-14 08:53:58] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-03-14 08:53:58] [INFO ] Invariant cache hit.
[2023-03-14 08:53:59] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-14 08:53:59] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-14 08:53:59] [INFO ] Invariant cache hit.
[2023-03-14 08:54:00] [INFO ] Dead Transitions using invariants and state equation in 533 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1325 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-COL-000200-LTLFireability-08 finished in 54685 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&&X(X(X(G(!p1)))))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 45 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:54:00] [INFO ] Invariant cache hit.
[2023-03-14 08:54:00] [INFO ] Implicit Places using invariants in 267 ms returned []
[2023-03-14 08:54:00] [INFO ] Invariant cache hit.
[2023-03-14 08:54:01] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 881 ms to find 0 implicit places.
[2023-03-14 08:54:01] [INFO ] Invariant cache hit.
[2023-03-14 08:54:01] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1450 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p0) p1), p1, p1, p1, p1, p1, p1, p1]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 4}, { cond=p0, acceptance={0} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 6}, { cond=p0, acceptance={0} source=3 dest: 7}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 0}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={0} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p0:(OR (AND (OR (LT s83 1) (LT s282 1)) (OR (LT s88 1) (LT s287 1)) (OR (LT s73 1) (LT s272 1)) (OR (LT s78 1) (LT s277 1)) (OR (LT s103 1) (LT s302 1)) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 2652 ms.
Stack based approach found an accepted trace after 628 steps with 0 reset with depth 629 and stack size 629 in 15 ms.
FORMULA Philosophers-COL-000200-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-09 finished in 4462 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 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:54:04] [INFO ] Invariant cache hit.
[2023-03-14 08:54:04] [INFO ] Implicit Places using invariants in 287 ms returned []
[2023-03-14 08:54:04] [INFO ] Invariant cache hit.
[2023-03-14 08:54:05] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2023-03-14 08:54:05] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-14 08:54:05] [INFO ] Invariant cache hit.
[2023-03-14 08:54:06] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1469 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-10 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 s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], 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 5335 reset in 5006 ms.
Product exploration explored 100000 steps with 5694 reset in 5464 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 241 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)]
Finished random walk after 33 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 229 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 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 08:54:18] [INFO ] Invariant cache hit.
[2023-03-14 08:54:24] [INFO ] [Real]Absence check using 400 positive place invariants in 469 ms returned sat
[2023-03-14 08:54:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:54:30] [INFO ] [Real]Absence check using state equation in 6103 ms returned sat
[2023-03-14 08:54:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:54:35] [INFO ] [Nat]Absence check using 400 positive place invariants in 350 ms returned sat
[2023-03-14 08:54:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:54:37] [INFO ] [Nat]Absence check using state equation in 1752 ms returned sat
[2023-03-14 08:54:37] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 39 ms.
[2023-03-14 08:54:37] [INFO ] Added : 40 causal constraints over 8 iterations in 561 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-14 08:54:37] [INFO ] Invariant cache hit.
[2023-03-14 08:54:39] [INFO ] [Real]Absence check using 400 positive place invariants in 505 ms returned sat
[2023-03-14 08:54:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:54:48] [INFO ] [Real]Absence check using state equation in 8790 ms returned sat
[2023-03-14 08:54:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:54:49] [INFO ] [Nat]Absence check using 400 positive place invariants in 295 ms returned sat
[2023-03-14 08:54:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:54:50] [INFO ] [Nat]Absence check using state equation in 1480 ms returned sat
[2023-03-14 08:54:51] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 41 ms.
[2023-03-14 08:54:51] [INFO ] Added : 0 causal constraints over 0 iterations in 135 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 18 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:54:51] [INFO ] Invariant cache hit.
[2023-03-14 08:54:51] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-14 08:54:51] [INFO ] Invariant cache hit.
[2023-03-14 08:54:52] [INFO ] Implicit Places using invariants and state equation in 617 ms returned []
Implicit Place search using SMT with State Equation took 900 ms to find 0 implicit places.
[2023-03-14 08:54:52] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-14 08:54:52] [INFO ] Invariant cache hit.
[2023-03-14 08:54:52] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1464 ms. Remains : 1000/1000 places, 1000/1000 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 p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 167 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 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 21 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1)]
Knowledge based reduction with 2 factoid took 226 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 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-14 08:54:54] [INFO ] Invariant cache hit.
[2023-03-14 08:54:59] [INFO ] [Real]Absence check using 400 positive place invariants in 468 ms returned sat
[2023-03-14 08:54:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:55:05] [INFO ] [Real]Absence check using state equation in 6044 ms returned sat
[2023-03-14 08:55:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:55:11] [INFO ] [Nat]Absence check using 400 positive place invariants in 368 ms returned sat
[2023-03-14 08:55:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:55:12] [INFO ] [Nat]Absence check using state equation in 1784 ms returned sat
[2023-03-14 08:55:13] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 44 ms.
[2023-03-14 08:55:13] [INFO ] Added : 40 causal constraints over 8 iterations in 548 ms. Result :sat
Could not prove EG (NOT p0)
[2023-03-14 08:55:13] [INFO ] Invariant cache hit.
[2023-03-14 08:55:15] [INFO ] [Real]Absence check using 400 positive place invariants in 508 ms returned sat
[2023-03-14 08:55:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:55:24] [INFO ] [Real]Absence check using state equation in 8909 ms returned sat
[2023-03-14 08:55:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 08:55:25] [INFO ] [Nat]Absence check using 400 positive place invariants in 303 ms returned sat
[2023-03-14 08:55:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 08:55:26] [INFO ] [Nat]Absence check using state equation in 1516 ms returned sat
[2023-03-14 08:55:26] [INFO ] Computed and/alt/rep : 600/800/600 causal constraints (skipped 0 transitions) in 42 ms.
[2023-03-14 08:55:27] [INFO ] Added : 0 causal constraints over 0 iterations in 130 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 5095 reset in 4938 ms.
Product exploration explored 100000 steps with 5638 reset in 5439 ms.
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 29 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:55:37] [INFO ] Invariant cache hit.
[2023-03-14 08:55:37] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-14 08:55:37] [INFO ] Invariant cache hit.
[2023-03-14 08:55:38] [INFO ] Implicit Places using invariants and state equation in 621 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2023-03-14 08:55:38] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-14 08:55:38] [INFO ] Invariant cache hit.
[2023-03-14 08:55:39] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1484 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-COL-000200-LTLFireability-10 finished in 94471 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((F(G(p1))&&p0)))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 8 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:55:39] [INFO ] Invariant cache hit.
[2023-03-14 08:55:39] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-03-14 08:55:39] [INFO ] Invariant cache hit.
[2023-03-14 08:55:39] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-14 08:55:39] [INFO ] Invariant cache hit.
[2023-03-14 08:55:40] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1281 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s83 1) (LT s282 1)) (OR (LT s88 1) (LT s287 1)) (OR (LT s73 1) (LT s272 1)) (OR (LT s78 1) (LT s277 1)) (OR (LT s103 1) (LT s302 1)) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000200-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-11 finished in 1464 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(G((F((p1&&G(p2)))||p0))))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 12 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:55:40] [INFO ] Invariant cache hit.
[2023-03-14 08:55:40] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-14 08:55:40] [INFO ] Invariant cache hit.
[2023-03-14 08:55:41] [INFO ] Implicit Places using invariants and state equation in 630 ms returned []
Implicit Place search using SMT with State Equation took 895 ms to find 0 implicit places.
[2023-03-14 08:55:41] [INFO ] Invariant cache hit.
[2023-03-14 08:55:42] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1429 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 247 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=3 dest: 5}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s173 1) (GEQ s373 1)) (AND (GEQ s158 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 39191 steps with 0 reset in 598 ms.
FORMULA Philosophers-COL-000200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-12 finished in 2307 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 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 20 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:55:42] [INFO ] Invariant cache hit.
[2023-03-14 08:55:43] [INFO ] Implicit Places using invariants in 277 ms returned []
[2023-03-14 08:55:43] [INFO ] Invariant cache hit.
[2023-03-14 08:55:43] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
[2023-03-14 08:55:43] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-14 08:55:43] [INFO ] Invariant cache hit.
[2023-03-14 08:55:44] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1487 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 36 ms :[p0]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3 reset in 1316 ms.
Stack based approach found an accepted trace after 1083 steps with 0 reset with depth 1084 and stack size 1084 in 20 ms.
FORMULA Philosophers-COL-000200-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-13 finished in 2885 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(!p0))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:55:45] [INFO ] Invariant cache hit.
[2023-03-14 08:55:46] [INFO ] Implicit Places using invariants in 275 ms returned []
[2023-03-14 08:55:46] [INFO ] Invariant cache hit.
[2023-03-14 08:55:46] [INFO ] Implicit Places using invariants and state equation in 606 ms returned []
Implicit Place search using SMT with State Equation took 882 ms to find 0 implicit places.
[2023-03-14 08:55:46] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-14 08:55:46] [INFO ] Invariant cache hit.
[2023-03-14 08:55:47] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1452 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 195 ms :[false, p0, p0]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s20 1) (GEQ s220 1)) (AND (GEQ s25 1) (GEQ s225 1)) (AND (GEQ s168 1) (GEQ s368 1)) (AND (GEQ s173 1) (GEQ s373 1)) (AND (GEQ s158 1) (GE...], 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 53 reset in 1388 ms.
Stack based approach found an accepted trace after 33754 steps with 18 reset with depth 1441 and stack size 1441 in 513 ms.
FORMULA Philosophers-COL-000200-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-14 finished in 3573 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 (F(!p1)&&G(p2))) U (p1&&(p0 U (F(!p1)&&G(p2)))))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 9 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:55:49] [INFO ] Invariant cache hit.
[2023-03-14 08:55:49] [INFO ] Implicit Places using invariants in 211 ms returned []
[2023-03-14 08:55:49] [INFO ] Invariant cache hit.
[2023-03-14 08:55:50] [INFO ] Implicit Places using invariants and state equation in 522 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
[2023-03-14 08:55:50] [INFO ] Invariant cache hit.
[2023-03-14 08:55:50] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1277 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, true, true, p1, (NOT p2), (OR (NOT p2) p1), (NOT p2)]
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p1) p2) (AND (NOT p1) p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=1 dest: 5}, { cond=(AND p1 p2 p0), acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND p1 p2), acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p2 p0), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=6 dest: 2}, { cond=(AND p2 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={0} source=6 dest: 5}, { cond=(AND p2 p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(OR (AND (GEQ s274 1) (GEQ s675 1)) (AND (GEQ s279 1) (GEQ s680 1)) (AND (GEQ s264 1) (GEQ s665 1)) (AND (GEQ s269 1) (GEQ s670 1)) (AND (GEQ s284 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2972 steps with 0 reset in 58 ms.
FORMULA Philosophers-COL-000200-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLFireability-15 finished in 1633 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(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(((p0 U (p1||G(p0)))||F((G(p2)||(X(p2)&&p3))))))'
Found a Shortening insensitive property : Philosophers-COL-000200-LTLFireability-08
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:55:51] [INFO ] Invariant cache hit.
[2023-03-14 08:55:51] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-14 08:55:51] [INFO ] Invariant cache hit.
[2023-03-14 08:55:52] [INFO ] Implicit Places using invariants and state equation in 520 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2023-03-14 08:55:52] [INFO ] Invariant cache hit.
[2023-03-14 08:55:52] [INFO ] Dead Transitions using invariants and state equation in 529 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1289 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Running random walk in product with property : Philosophers-COL-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p3), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p3), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p3:(AND (LT s846 1) (LT s911 1) (LT s968 1) (LT s838 1) (LT s903 1) (LT s960 1) (LT s927 1) (LT s862 1) (LT s984 1) (LT s854 1) (LT s919 1) (LT s976 1) (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 69 reset in 1484 ms.
Product exploration explored 100000 steps with 63 reset in 1612 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 p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3))))]
Knowledge based reduction with 7 factoid took 347 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 9 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 140 ms. (steps per millisecond=71 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-14 08:56:01] [INFO ] Invariant cache hit.
[2023-03-14 08:56:01] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p3 (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p2 p3))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p2) p3)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (G (NOT (AND p2 p3))), (G (NOT (AND (NOT p2) (NOT p3))))]
False Knowledge obtained : [(X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p2 (NOT p3))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 9 factoid took 557 ms. Reduced automaton from 3 states, 9 edges and 4 AP (stutter sensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-14 08:56:02] [INFO ] Invariant cache hit.
[2023-03-14 08:56:15] [INFO ] [Real]Absence check using 400 positive place invariants in 582 ms returned sat
[2023-03-14 08:56:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:56:17] [INFO ] [Real]Absence check using state equation in 1964 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:56:17] [INFO ] Invariant cache hit.
[2023-03-14 08:56:17] [INFO ] Implicit Places using invariants in 212 ms returned []
[2023-03-14 08:56:17] [INFO ] Invariant cache hit.
[2023-03-14 08:56:18] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 742 ms to find 0 implicit places.
[2023-03-14 08:56:18] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-14 08:56:18] [INFO ] Invariant cache hit.
[2023-03-14 08:56:18] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1301 ms. Remains : 1000/1000 places, 1000/1000 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 p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1)))))]
Knowledge based reduction with 4 factoid took 350 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 287 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Finished random walk after 2920 steps, including 0 resets, run visited all 5 properties in 42 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) p3), (X p3), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1)))))]
False Knowledge obtained : [(X (OR (AND p0 p3) (AND p3 p1))), (X (NOT (OR (AND p0 p3) (AND p3 p1)))), (X (X p3)), (X (X (NOT p3))), (X (X (OR (AND p0 p3) (AND p3 p1)))), (X (X (NOT (OR (AND p0 p3) (AND p3 p1))))), (F (NOT p3)), (F (OR (AND p0 p3) (AND p1 p3))), (F (AND (NOT p0) p2 (NOT p1))), (F (OR (AND p0 p2) (AND p2 p1))), (F (NOT (AND (NOT p0) (NOT p1) p3)))]
Knowledge based reduction with 4 factoid took 373 ms. Reduced automaton from 3 states, 6 edges and 4 AP (stutter insensitive) to 3 states, 6 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
[2023-03-14 08:56:25] [INFO ] Invariant cache hit.
[2023-03-14 08:56:38] [INFO ] [Real]Absence check using 400 positive place invariants in 600 ms returned sat
[2023-03-14 08:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 08:56:40] [INFO ] [Real]Absence check using state equation in 2258 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1) p3)
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p1) p3), (OR (AND p0 p3) (AND p1 p3)), p3]
Product exploration explored 100000 steps with 109 reset in 1538 ms.
Product exploration explored 100000 steps with 98 reset in 1605 ms.
Support contains 800 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:56:43] [INFO ] Invariant cache hit.
[2023-03-14 08:56:43] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-03-14 08:56:43] [INFO ] Invariant cache hit.
[2023-03-14 08:56:44] [INFO ] Implicit Places using invariants and state equation in 534 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-14 08:56:44] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-14 08:56:44] [INFO ] Invariant cache hit.
[2023-03-14 08:56:45] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1327 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-COL-000200-LTLFireability-08 finished in 54036 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))))'
[2023-03-14 08:56:45] [INFO ] Flatten gal took : 52 ms
[2023-03-14 08:56:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 10 ms.
[2023-03-14 08:56:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1000 transitions and 3200 arcs took 4 ms.
Total runtime 261942 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-COL-000200
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA Philosophers-COL-000200-LTLFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000200-LTLFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA Philosophers-COL-000200-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678784263526

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 11 (type EXCL) for 6 Philosophers-COL-000200-LTLFireability-10
lola: time limit : 894 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-000200-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 5/894 6/32 Philosophers-COL-000200-LTLFireability-10 373884 m, 74776 m/sec, 843549 t fired, .

Time elapsed: 27 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-000200-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 10/894 11/32 Philosophers-COL-000200-LTLFireability-10 758558 m, 76934 m/sec, 1739404 t fired, .

Time elapsed: 32 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-000200-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 15/894 15/32 Philosophers-COL-000200-LTLFireability-10 1108083 m, 69905 m/sec, 2664194 t fired, .

Time elapsed: 37 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-000200-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 20/894 20/32 Philosophers-COL-000200-LTLFireability-10 1495418 m, 77467 m/sec, 3539446 t fired, .

Time elapsed: 42 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-000200-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 25/894 25/32 Philosophers-COL-000200-LTLFireability-10 1869681 m, 74852 m/sec, 4424422 t fired, .

Time elapsed: 47 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-000200-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-10: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 30/894 30/32 Philosophers-COL-000200-LTLFireability-10 2232873 m, 72638 m/sec, 5320275 t fired, .

Time elapsed: 52 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 11 (type EXCL) for Philosophers-COL-000200-LTLFireability-10 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Philosophers-COL-000200-LTLFireability-00: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-08: LTL 0 1 0 0 1 0 0 0
Philosophers-COL-000200-LTLFireability-10: CONJ 0 1 0 0 2 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 57 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 Philosophers-COL-000200-LTLFireability-08
lola: time limit : 1181 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Philosophers-COL-000200-LTLFireability-08
lola: result : false
lola: markings : 599
lola: fired transitions : 599
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-COL-000200-LTLFireability-00
lola: time limit : 1771 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Philosophers-COL-000200-LTLFireability-00
lola: result : false
lola: markings : 203
lola: fired transitions : 203
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 9 (type EXCL) for 6 Philosophers-COL-000200-LTLFireability-10
lola: time limit : 3543 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for Philosophers-COL-000200-LTLFireability-10
lola: result : false
lola: markings : 2181
lola: fired transitions : 2183
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Philosophers-COL-000200-LTLFireability-00: LTL false LTL model checker
Philosophers-COL-000200-LTLFireability-08: LTL false LTL model checker
Philosophers-COL-000200-LTLFireability-10: CONJ false LTL model checker


Time elapsed: 57 secs. Pages in use: 32

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-000200"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Philosophers-COL-000200, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r295-tall-167873947400124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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