Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 25 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 13:07 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.6K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 13:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 13:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 120K Feb 25 13:15 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:32 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:32 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 12K 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-000050-LTLFireability-00
FORMULA_NAME Philosophers-COL-000050-LTLFireability-01
FORMULA_NAME Philosophers-COL-000050-LTLFireability-02
FORMULA_NAME Philosophers-COL-000050-LTLFireability-03
FORMULA_NAME Philosophers-COL-000050-LTLFireability-04
FORMULA_NAME Philosophers-COL-000050-LTLFireability-05
FORMULA_NAME Philosophers-COL-000050-LTLFireability-06
FORMULA_NAME Philosophers-COL-000050-LTLFireability-07
FORMULA_NAME Philosophers-COL-000050-LTLFireability-08
FORMULA_NAME Philosophers-COL-000050-LTLFireability-09
FORMULA_NAME Philosophers-COL-000050-LTLFireability-10
FORMULA_NAME Philosophers-COL-000050-LTLFireability-11
FORMULA_NAME Philosophers-COL-000050-LTLFireability-12
FORMULA_NAME Philosophers-COL-000050-LTLFireability-13
FORMULA_NAME Philosophers-COL-000050-LTLFireability-14
FORMULA_NAME Philosophers-COL-000050-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679450219098

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000050
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 01:57:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 01:57:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 01:57:01] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-22 01:57:01] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-22 01:57:01] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 482 ms
[2023-03-22 01:57:01] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 250 PT places and 250.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
[2023-03-22 01:57:01] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 5 ms.
[2023-03-22 01:57:01] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
FORMULA Philosophers-COL-000050-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000050-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 8 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 522 steps, including 10 resets, run visited all 7 properties in 9 ms. (steps per millisecond=58 )
[2023-03-22 01:57:01] [INFO ] Flatten gal took : 13 ms
[2023-03-22 01:57:01] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 50) 50) 50)]] contains successor/predecessor on variables of sort Philo
[2023-03-22 01:57:01] [INFO ] Unfolded HLPN to a Petri net with 250 places and 250 transitions 800 arcs in 17 ms.
[2023-03-22 01:57:01] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Support contains 250 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
// Phase 1: matrix 250 rows 250 cols
[2023-03-22 01:57:02] [INFO ] Computed 100 place invariants in 10 ms
[2023-03-22 01:57:02] [INFO ] Implicit Places using invariants in 206 ms returned []
[2023-03-22 01:57:02] [INFO ] Invariant cache hit.
[2023-03-22 01:57:02] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
[2023-03-22 01:57:02] [INFO ] Invariant cache hit.
[2023-03-22 01:57:02] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 626 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 250 out of 250 places after structural reductions.
[2023-03-22 01:57:02] [INFO ] Flatten gal took : 38 ms
[2023-03-22 01:57:02] [INFO ] Flatten gal took : 28 ms
[2023-03-22 01:57:03] [INFO ] Input system was already deterministic with 250 transitions.
Finished random walk after 152 steps, including 0 resets, run visited all 11 properties in 19 ms. (steps per millisecond=8 )
FORMULA Philosophers-COL-000050-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:03] [INFO ] Invariant cache hit.
[2023-03-22 01:57:03] [INFO ] Implicit Places using invariants in 96 ms returned []
[2023-03-22 01:57:03] [INFO ] Invariant cache hit.
[2023-03-22 01:57:03] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-22 01:57:03] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-22 01:57:03] [INFO ] Invariant cache hit.
[2023-03-22 01:57:03] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 453 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s34 1) (GEQ s83 1)) (AND (GEQ s39 1) (GEQ s88 1)) (AND (GEQ s29 1) (GEQ s78 1)) (AND (GEQ s2 1) (GEQ s51 1)) (AND (GEQ s7 1) (GEQ s56 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 77022 steps with 98 reset in 496 ms.
FORMULA Philosophers-COL-000050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-00 finished in 1243 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((X((F(!p1)||G(p2)))&&p0))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:04] [INFO ] Invariant cache hit.
[2023-03-22 01:57:04] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-22 01:57:04] [INFO ] Invariant cache hit.
[2023-03-22 01:57:04] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-22 01:57:04] [INFO ] Invariant cache hit.
[2023-03-22 01:57:05] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 409 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2)), (OR (AND (NOT p0) p1) (AND p1 (NOT p2)))]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s34 1) (LT s83 1)) (OR (LT s39 1) (LT s88 1)) (OR (LT s29 1) (LT s78 1)) (OR (LT s2 1) (LT s51 1)) (OR (LT s7 1) (LT s56 1)) (OR (LT s24 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 264 reset in 709 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 2 ms.
FORMULA Philosophers-COL-000050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-01 finished in 1365 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 50 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 20 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:05] [INFO ] Invariant cache hit.
[2023-03-22 01:57:06] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-22 01:57:06] [INFO ] Invariant cache hit.
[2023-03-22 01:57:06] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-22 01:57:06] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:57:06] [INFO ] Invariant cache hit.
[2023-03-22 01:57:06] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 548 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 37 ms :[p0]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-02 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 (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], 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 24 reset in 443 ms.
Stack based approach found an accepted trace after 364 steps with 0 reset with depth 365 and stack size 365 in 3 ms.
FORMULA Philosophers-COL-000050-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-02 finished in 1054 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 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 16 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:07] [INFO ] Invariant cache hit.
[2023-03-22 01:57:07] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-22 01:57:07] [INFO ] Invariant cache hit.
[2023-03-22 01:57:07] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-22 01:57:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-22 01:57:07] [INFO ] Invariant cache hit.
[2023-03-22 01:57:07] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 492 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s171 1)) (AND (GEQ s75 1) (GEQ s176 1)) (AND (GEQ s97 1) (GEQ s198 1)) (AND (GEQ s85 1) (GEQ s186 1)) (AND (GEQ s65 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6785 steps with 0 reset in 39 ms.
FORMULA Philosophers-COL-000050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-03 finished in 577 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(p1)))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:07] [INFO ] Invariant cache hit.
[2023-03-22 01:57:07] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-22 01:57:07] [INFO ] Invariant cache hit.
[2023-03-22 01:57:07] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-22 01:57:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:57:07] [INFO ] Invariant cache hit.
[2023-03-22 01:57:07] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 380 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (NOT p1), (AND (NOT p1) p0), p0]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (OR (LT s50 1) (LT s100 1)) (OR (LT s87 1) (LT s137 1)) (OR (LT s82 1) (LT s132 1)) (OR (LT s92 1) (LT s142 1)) (OR (LT s60 1) (LT s110 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 117 steps with 0 reset in 3 ms.
FORMULA Philosophers-COL-000050-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-04 finished in 580 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||X(F((G(F(!p1))||(X(F(!p1))&&p2))))))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:08] [INFO ] Invariant cache hit.
[2023-03-22 01:57:08] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-22 01:57:08] [INFO ] Invariant cache hit.
[2023-03-22 01:57:08] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-22 01:57:08] [INFO ] Invariant cache hit.
[2023-03-22 01:57:08] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 384 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s171 1)) (AND (GEQ s75 1) (GEQ s176 1)) (AND (GEQ s97 1) (GEQ s198 1)) (AND (GEQ s85 1) (GEQ s186 1)) (AND (GEQ s65 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 26174 reset in 967 ms.
Stack based approach found an accepted trace after 1529 steps with 381 reset with depth 145 and stack size 145 in 17 ms.
FORMULA Philosophers-COL-000050-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-05 finished in 1556 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:09] [INFO ] Invariant cache hit.
[2023-03-22 01:57:09] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-22 01:57:09] [INFO ] Invariant cache hit.
[2023-03-22 01:57:09] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-22 01:57:09] [INFO ] Invariant cache hit.
[2023-03-22 01:57:10] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 430 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (AND (GEQ s13 1) (GEQ s63 1)) (AND (GEQ s8 1) (GEQ s58 1)) (AND (GEQ s18 1) (GEQ s68 1)) (AND (GEQ s40 1) (GEQ s90 1)) (AND (GEQ s28 1) (GEQ s78 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 146 steps with 0 reset in 3 ms.
FORMULA Philosophers-COL-000050-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-08 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:10] [INFO ] Invariant cache hit.
[2023-03-22 01:57:10] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-22 01:57:10] [INFO ] Invariant cache hit.
[2023-03-22 01:57:10] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
[2023-03-22 01:57:10] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:57:10] [INFO ] Invariant cache hit.
[2023-03-22 01:57:10] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 427 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s70 1) (GEQ s171 1)) (AND (GEQ s75 1) (GEQ s176 1)) (AND (GEQ s97 1) (GEQ s198 1)) (AND (GEQ s85 1) (GEQ s186 1)) (AND (GEQ s65 1) (GEQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 32811 reset in 1082 ms.
Stack based approach found an accepted trace after 6608 steps with 2205 reset with depth 5 and stack size 5 in 86 ms.
FORMULA Philosophers-COL-000050-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-10 finished in 1639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 15 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:11] [INFO ] Invariant cache hit.
[2023-03-22 01:57:12] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-22 01:57:12] [INFO ] Invariant cache hit.
[2023-03-22 01:57:12] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-22 01:57:12] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 01:57:12] [INFO ] Invariant cache hit.
[2023-03-22 01:57:12] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 439 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s202 1) (GEQ s200 1) (GEQ s206 1) (GEQ s204 1) (GEQ s210 1) (GEQ s208 1) (GEQ s214 1) (GEQ s212 1) (GEQ s218 1) (GEQ s216 1) (GEQ s222 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33300 reset in 1190 ms.
Product exploration explored 100000 steps with 33323 reset in 1254 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 124 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 145 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
[2023-03-22 01:57:15] [INFO ] Invariant cache hit.
[2023-03-22 01:57:15] [INFO ] [Real]Absence check using 100 positive place invariants in 43 ms returned sat
[2023-03-22 01:57:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:57:16] [INFO ] [Real]Absence check using state equation in 395 ms returned sat
[2023-03-22 01:57:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:57:16] [INFO ] [Nat]Absence check using 100 positive place invariants in 68 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000050-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000050-LTLFireability-11 finished in 5215 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(F(!p0)))))'
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:17] [INFO ] Invariant cache hit.
[2023-03-22 01:57:17] [INFO ] Implicit Places using invariants in 132 ms returned []
[2023-03-22 01:57:17] [INFO ] Invariant cache hit.
[2023-03-22 01:57:17] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-22 01:57:17] [INFO ] Invariant cache hit.
[2023-03-22 01:57:17] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 458 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 164 ms :[p0, p0, p0, p0]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s50 1) (LT s100 1)) (OR (LT s87 1) (LT s137 1)) (OR (LT s82 1) (LT s132 1)) (OR (LT s92 1) (LT s142 1)) (OR (LT s60 1) (LT s110 1)) (OR (L...], 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 23180 reset in 967 ms.
Product exploration explored 100000 steps with 23207 reset in 943 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0, p0]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 137 ms :[p0, p0, p0, p0]
[2023-03-22 01:57:20] [INFO ] Invariant cache hit.
[2023-03-22 01:57:20] [INFO ] [Real]Absence check using 100 positive place invariants in 44 ms returned sat
[2023-03-22 01:57:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:57:21] [INFO ] [Real]Absence check using state equation in 281 ms returned sat
[2023-03-22 01:57:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:57:21] [INFO ] [Nat]Absence check using 100 positive place invariants in 37 ms returned sat
[2023-03-22 01:57:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:57:21] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-22 01:57:21] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 21 ms.
[2023-03-22 01:57:21] [INFO ] Added : 10 causal constraints over 2 iterations in 84 ms. Result :sat
Could not prove EG p0
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:21] [INFO ] Invariant cache hit.
[2023-03-22 01:57:21] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-22 01:57:21] [INFO ] Invariant cache hit.
[2023-03-22 01:57:22] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-22 01:57:22] [INFO ] Invariant cache hit.
[2023-03-22 01:57:22] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 250/250 places, 250/250 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[p0, p0, p0, p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 143 ms :[p0, p0, p0, p0]
[2023-03-22 01:57:22] [INFO ] Invariant cache hit.
[2023-03-22 01:57:23] [INFO ] [Real]Absence check using 100 positive place invariants in 44 ms returned sat
[2023-03-22 01:57:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:57:23] [INFO ] [Real]Absence check using state equation in 289 ms returned sat
[2023-03-22 01:57:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:57:24] [INFO ] [Nat]Absence check using 100 positive place invariants in 39 ms returned sat
[2023-03-22 01:57:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:57:24] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2023-03-22 01:57:24] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 16 ms.
[2023-03-22 01:57:24] [INFO ] Added : 10 causal constraints over 2 iterations in 67 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 231 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 23202 reset in 896 ms.
Product exploration explored 100000 steps with 23127 reset in 939 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 131 ms :[p0, p0, p0, p0]
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:57:26] [INFO ] Invariant cache hit.
[2023-03-22 01:57:26] [INFO ] Dead Transitions using invariants and state equation in 168 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 197 ms. Remains : 250/250 places, 250/250 transitions.
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:26] [INFO ] Invariant cache hit.
[2023-03-22 01:57:27] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-22 01:57:27] [INFO ] Invariant cache hit.
[2023-03-22 01:57:27] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-22 01:57:27] [INFO ] Invariant cache hit.
[2023-03-22 01:57:27] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 250/250 places, 250/250 transitions.
Treatment of property Philosophers-COL-000050-LTLFireability-12 finished in 10428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(F(!p1))||p0))))'
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:27] [INFO ] Invariant cache hit.
[2023-03-22 01:57:27] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-22 01:57:27] [INFO ] Invariant cache hit.
[2023-03-22 01:57:27] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-22 01:57:27] [INFO ] Invariant cache hit.
[2023-03-22 01:57:27] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 436 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s50 1) (GEQ s100 1)) (AND (GEQ s87 1) (GEQ s137 1)) (AND (GEQ s82 1) (GEQ s132 1)) (AND (GEQ s92 1) (GEQ s142 1)) (AND (GEQ s60 1) (GEQ s...], nbAcceptance=1, 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 943 reset in 649 ms.
Stack based approach found an accepted trace after 20969 steps with 199 reset with depth 184 and stack size 182 in 141 ms.
FORMULA Philosophers-COL-000050-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-13 finished in 1361 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)||X(F(!p1))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:28] [INFO ] Invariant cache hit.
[2023-03-22 01:57:28] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-22 01:57:28] [INFO ] Invariant cache hit.
[2023-03-22 01:57:29] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2023-03-22 01:57:29] [INFO ] Invariant cache hit.
[2023-03-22 01:57:29] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 412 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 97 ms :[p1, (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s13 1) (LT s63 1)) (OR (LT s8 1) (LT s58 1)) (OR (LT s18 1) (LT s68 1)) (OR (LT s40 1) (LT s90 1)) (OR (LT s28 1) (LT s78 1)) (OR (LT s1 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 893 ms.
Product exploration explored 100000 steps with 50000 reset in 940 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 (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p1))
Knowledge based reduction with 7 factoid took 135 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000050-LTLFireability-14 finished in 2562 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((G(!p0) U p1))))'
Support contains 150 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 11 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:31] [INFO ] Invariant cache hit.
[2023-03-22 01:57:31] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-22 01:57:31] [INFO ] Invariant cache hit.
[2023-03-22 01:57:31] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-22 01:57:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 01:57:31] [INFO ] Invariant cache hit.
[2023-03-22 01:57:31] [INFO ] Dead Transitions using invariants and state equation in 142 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 424 ms. Remains : 250/250 places, 250/250 transitions.
Stuttering acceptance computed with spot in 116 ms :[(NOT p1), (AND (NOT p1) p0), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(OR p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (GEQ s34 1) (GEQ s83 1)) (AND (GEQ s39 1) (GEQ s88 1)) (AND (GEQ s29 1) (GEQ s78 1)) (AND (GEQ s2 1) (GEQ s51 1)) (AND (GEQ s7 1) (GEQ s56 1))...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 37669 steps with 131 reset in 322 ms.
FORMULA Philosophers-COL-000050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000050-LTLFireability-15 finished in 884 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(F(!p0)))))'
Found a Shortening insensitive property : Philosophers-COL-000050-LTLFireability-12
Stuttering acceptance computed with spot in 151 ms :[p0, p0, p0, p0]
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 13 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:32] [INFO ] Invariant cache hit.
[2023-03-22 01:57:32] [INFO ] Implicit Places using invariants in 107 ms returned []
[2023-03-22 01:57:32] [INFO ] Invariant cache hit.
[2023-03-22 01:57:32] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 276 ms to find 0 implicit places.
[2023-03-22 01:57:32] [INFO ] Invariant cache hit.
[2023-03-22 01:57:33] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 431 ms. Remains : 250/250 places, 250/250 transitions.
Running random walk in product with property : Philosophers-COL-000050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (OR (LT s50 1) (LT s100 1)) (OR (LT s87 1) (LT s137 1)) (OR (LT s82 1) (LT s132 1)) (OR (LT s92 1) (LT s142 1)) (OR (LT s60 1) (LT s110 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 23176 reset in 903 ms.
Product exploration explored 100000 steps with 23189 reset in 957 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 132 ms :[p0, p0, p0, p0]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 103 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 140 ms :[p0, p0, p0, p0]
[2023-03-22 01:57:35] [INFO ] Invariant cache hit.
[2023-03-22 01:57:35] [INFO ] [Real]Absence check using 100 positive place invariants in 43 ms returned sat
[2023-03-22 01:57:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:57:36] [INFO ] [Real]Absence check using state equation in 291 ms returned sat
[2023-03-22 01:57:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:57:36] [INFO ] [Nat]Absence check using 100 positive place invariants in 39 ms returned sat
[2023-03-22 01:57:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:57:36] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2023-03-22 01:57:36] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 17 ms.
[2023-03-22 01:57:37] [INFO ] Added : 10 causal constraints over 2 iterations in 71 ms. Result :sat
Could not prove EG p0
Support contains 100 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-22 01:57:37] [INFO ] Invariant cache hit.
[2023-03-22 01:57:37] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-22 01:57:37] [INFO ] Invariant cache hit.
[2023-03-22 01:57:37] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-22 01:57:37] [INFO ] Invariant cache hit.
[2023-03-22 01:57:37] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 250/250 places, 250/250 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 : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[p0, p0, p0, p0]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 158 ms :[p0, p0, p0, p0]
[2023-03-22 01:57:38] [INFO ] Invariant cache hit.
[2023-03-22 01:57:38] [INFO ] [Real]Absence check using 100 positive place invariants in 43 ms returned sat
[2023-03-22 01:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 01:57:38] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-22 01:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 01:57:39] [INFO ] [Nat]Absence check using 100 positive place invariants in 37 ms returned sat
[2023-03-22 01:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 01:57:39] [INFO ] [Nat]Absence check using state equation in 174 ms returned sat
[2023-03-22 01:57:39] [INFO ] Computed and/alt/rep : 150/200/150 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-22 01:57:39] [INFO ] Added : 10 causal constraints over 2 iterations in 70 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 139 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 23215 reset in 895 ms.
Stack based approach found an accepted trace after 51814 steps with 12068 reset with depth 6 and stack size 6 in 494 ms.
Treatment of property Philosophers-COL-000050-LTLFireability-12 finished in 8723 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-22 01:57:41] [INFO ] Flatten gal took : 20 ms
[2023-03-22 01:57:41] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-22 01:57:41] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 250 transitions and 800 arcs took 2 ms.
Total runtime 39993 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1292/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : Philosophers-COL-000050-LTLFireability-12

BK_STOP 1679450913655

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name Philosophers-COL-000050-LTLFireability-12
ltl formula formula --ltl=/tmp/1292/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 250 places, 250 transitions and 800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.080 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1292/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1292/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1292/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1292/ltl_0_

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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