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-167873947600228.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-PT-000200, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873947600228
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.2M
-rw-r--r-- 1 mcc users 171K Feb 25 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 960K Feb 25 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 117K Feb 25 13:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 762K Feb 25 13:14 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 75K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 295K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 69K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 332K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 310K Feb 25 13:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 261K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.7M Feb 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 55K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 445K 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-PT-000200-LTLFireability-00
FORMULA_NAME Philosophers-PT-000200-LTLFireability-01
FORMULA_NAME Philosophers-PT-000200-LTLFireability-02
FORMULA_NAME Philosophers-PT-000200-LTLFireability-03
FORMULA_NAME Philosophers-PT-000200-LTLFireability-04
FORMULA_NAME Philosophers-PT-000200-LTLFireability-05
FORMULA_NAME Philosophers-PT-000200-LTLFireability-06
FORMULA_NAME Philosophers-PT-000200-LTLFireability-07
FORMULA_NAME Philosophers-PT-000200-LTLFireability-08
FORMULA_NAME Philosophers-PT-000200-LTLFireability-09
FORMULA_NAME Philosophers-PT-000200-LTLFireability-10
FORMULA_NAME Philosophers-PT-000200-LTLFireability-11
FORMULA_NAME Philosophers-PT-000200-LTLFireability-12
FORMULA_NAME Philosophers-PT-000200-LTLFireability-13
FORMULA_NAME Philosophers-PT-000200-LTLFireability-14
FORMULA_NAME Philosophers-PT-000200-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678805227924

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-PT-000200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 14:47:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 14:47:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 14:47:09] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-14 14:47:09] [INFO ] Transformed 1000 places.
[2023-03-14 14:47:09] [INFO ] Transformed 1000 transitions.
[2023-03-14 14:47:09] [INFO ] Parsed PT model containing 1000 places and 1000 transitions and 3200 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Philosophers-PT-000200-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-PT-000200-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 804 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 34 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 14:47:09] [INFO ] Computed 400 place invariants in 25 ms
[2023-03-14 14:47:10] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-14 14:47:10] [INFO ] Invariant cache hit.
[2023-03-14 14:47:10] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
[2023-03-14 14:47:10] [INFO ] Invariant cache hit.
[2023-03-14 14:47:11] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1614 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 804 out of 1000 places after structural reductions.
[2023-03-14 14:47:11] [INFO ] Flatten gal took : 115 ms
[2023-03-14 14:47:11] [INFO ] Flatten gal took : 79 ms
[2023-03-14 14:47:12] [INFO ] Input system was already deterministic with 1000 transitions.
Finished random walk after 6745 steps, including 2 resets, run visited all 21 properties in 308 ms. (steps per millisecond=21 )
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 36 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:47:12] [INFO ] Invariant cache hit.
[2023-03-14 14:47:13] [INFO ] Implicit Places using invariants in 256 ms returned []
[2023-03-14 14:47:13] [INFO ] Invariant cache hit.
[2023-03-14 14:47:13] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-14 14:47:13] [INFO ] Invariant cache hit.
[2023-03-14 14:47:14] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1348 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 300 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-PT-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 s282 1) (GEQ s454 1)) (AND (GEQ s333 1) (GEQ s551 1)) (AND (GEQ s277 1) (GEQ s457 1)) (AND (GEQ s338 1) (GEQ s556 1)) (AND (GEQ s406 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 33258 reset in 5897 ms.
Product exploration explored 100000 steps with 33089 reset in 5920 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 182 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 150 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Finished random walk after 4755 steps, including 1 resets, run visited all 3 properties in 76 ms. (steps per millisecond=62 )
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 229 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 145 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
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))]
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 14:47:29] [INFO ] Invariant cache hit.
[2023-03-14 14:47:30] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-14 14:47:30] [INFO ] Invariant cache hit.
[2023-03-14 14:47:30] [INFO ] Implicit Places using invariants and state equation in 626 ms returned []
Implicit Place search using SMT with State Equation took 873 ms to find 0 implicit places.
[2023-03-14 14:47:30] [INFO ] Invariant cache hit.
[2023-03-14 14:47:31] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1339 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 167 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 9698 steps, including 2 resets, run visited all 3 properties in 131 ms. (steps per millisecond=74 )
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 199 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 175 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 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))]
Product exploration explored 100000 steps with 33262 reset in 5300 ms.
Product exploration explored 100000 steps with 33181 reset in 5458 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 151 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 42 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:47:44] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-14 14:47:44] [INFO ] Invariant cache hit.
[2023-03-14 14:47:45] [INFO ] Dead Transitions using invariants and state equation in 509 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 625 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 7 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:47:45] [INFO ] Invariant cache hit.
[2023-03-14 14:47:45] [INFO ] Implicit Places using invariants in 230 ms returned []
[2023-03-14 14:47:45] [INFO ] Invariant cache hit.
[2023-03-14 14:47:46] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 823 ms to find 0 implicit places.
[2023-03-14 14:47:46] [INFO ] Invariant cache hit.
[2023-03-14 14:47:46] [INFO ] Dead Transitions using invariants and state equation in 442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1273 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-PT-000200-LTLFireability-00 finished in 33727 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 22 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:47:46] [INFO ] Invariant cache hit.
[2023-03-14 14:47:46] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-14 14:47:46] [INFO ] Invariant cache hit.
[2023-03-14 14:47:47] [INFO ] Implicit Places using invariants and state equation in 445 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-14 14:47:47] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-14 14:47:47] [INFO ] Invariant cache hit.
[2023-03-14 14:47:47] [INFO ] Dead Transitions using invariants and state equation in 450 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1118 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 181 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-PT-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 s366 1) (GEQ s729 1)) (AND (GEQ s271 1) (GEQ s698 1)) (AND (GEQ s371 1) (GEQ s726 1)) (AND (GEQ s321 1) (GEQ s716 1)) (AND (GEQ s218 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-PT-000200-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-03 finished in 1325 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 7 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:47:47] [INFO ] Invariant cache hit.
[2023-03-14 14:47:48] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-14 14:47:48] [INFO ] Invariant cache hit.
[2023-03-14 14:47:48] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-03-14 14:47:48] [INFO ] Invariant cache hit.
[2023-03-14 14:47:49] [INFO ] Dead Transitions using invariants and state equation in 449 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1222 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR p0 (AND (NOT p1) (NOT p2))), p0, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-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 s58 1) (GEQ s273 1)) (AND (GEQ s194 1) (GEQ s391 1)) (AND (GEQ s14 1) (GEQ s209 1)) (AND (GEQ s51 1) (GEQ s240 1)) (AND (GEQ s187 1) (GEQ...], 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 77 reset in 1423 ms.
Stack based approach found an accepted trace after 361 steps with 0 reset with depth 362 and stack size 362 in 11 ms.
FORMULA Philosophers-PT-000200-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-04 finished in 2800 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 7 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:47:50] [INFO ] Invariant cache hit.
[2023-03-14 14:47:50] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-03-14 14:47:50] [INFO ] Invariant cache hit.
[2023-03-14 14:47:51] [INFO ] Implicit Places using invariants and state equation in 538 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
[2023-03-14 14:47:51] [INFO ] Invariant cache hit.
[2023-03-14 14:47:51] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1207 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 140 ms :[true, (OR (NOT p0) p1), p1, (OR (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-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 s366 1) (GEQ s729 1)) (AND (GEQ s271 1) (GEQ s698 1)) (AND (GEQ s371 1) (GEQ s726 1)) (AND (GEQ s321 1) (GEQ s716 1)) (AND (GEQ s218 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 0 ms.
FORMULA Philosophers-PT-000200-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-05 finished in 1374 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((G(p0)||X(p1)))||((G(p0)||X(p1))&&G(F(!p2))))))'
Support contains 6 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 47 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:47:52] [INFO ] Invariant cache hit.
[2023-03-14 14:47:52] [INFO ] Implicit Places using invariants in 450 ms returned []
[2023-03-14 14:47:52] [INFO ] Invariant cache hit.
[2023-03-14 14:47:53] [INFO ] Implicit Places using invariants and state equation in 861 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
[2023-03-14 14:47:53] [INFO ] Invariant cache hit.
[2023-03-14 14:47:53] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1810 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 9}, { cond=(NOT p1), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=7 dest: 9}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 10}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 11}], [{ cond=(NOT p0), acceptance={} source=8 dest: 5}, { cond=p0, acceptance={} source=8 dest: 8}], [{ cond=p2, acceptance={0} source=9 dest: 9}], [{ cond=p2, acceptance={} source=10 dest: 9}, { cond=true, acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=11 dest: 9}, { cond=(AND (NOT p0) p1), acceptance={} source=11 dest: 10}, { cond=(AND p0 p1), acceptance={} source=11 dest: 11}]], initial=0, aps=[p0:(AND (GEQ s161 1) (GEQ s351 1)), p1:(LT s767 1), p2:(OR (GEQ s770 1) (AND (GEQ s241 1) (GEQ s474 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25050 reset in 4649 ms.
Product exploration explored 100000 steps with 25038 reset in 4728 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 351 ms. Reduced automaton from 12 states, 24 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 10) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-14 14:48:05] [INFO ] Invariant cache hit.
[2023-03-14 14:48:06] [INFO ] [Real]Absence check using 400 positive place invariants in 69 ms returned sat
[2023-03-14 14:48:06] [INFO ] After 280ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 14:48:06] [INFO ] [Nat]Absence check using 400 positive place invariants in 69 ms returned sat
[2023-03-14 14:48:06] [INFO ] After 401ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-14 14:48:07] [INFO ] After 595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-14 14:48:07] [INFO ] After 983ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 158 steps, including 0 resets, run visited all 3 properties in 11 ms. (steps per millisecond=14 )
Parikh walk visited 3 properties in 17 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND p2 (NOT p0) (NOT p1))), (F p2), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND p2 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND p2 (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 3 factoid took 615 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 671 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 612 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Support contains 6 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 25 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:48:09] [INFO ] Invariant cache hit.
[2023-03-14 14:48:10] [INFO ] Implicit Places using invariants in 858 ms returned []
[2023-03-14 14:48:10] [INFO ] Invariant cache hit.
[2023-03-14 14:48:10] [INFO ] Implicit Places using invariants and state equation in 805 ms returned []
Implicit Place search using SMT with State Equation took 1667 ms to find 0 implicit places.
[2023-03-14 14:48:10] [INFO ] Invariant cache hit.
[2023-03-14 14:48:11] [INFO ] Dead Transitions using invariants and state equation in 432 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2125 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 p0 p1 (NOT p2)), true]
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 283 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Finished random walk after 2533 steps, including 0 resets, run visited all 10 properties in 53 ms. (steps per millisecond=47 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), true]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p1))), (X (X p1)), (X (X (NOT p0))), (X (X p0)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F p2), (F (AND p0 (NOT p1))), (F (NOT p0)), (F (AND (NOT p1) p2)), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) p1 p2)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 2 factoid took 469 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Stuttering acceptance computed with spot in 417 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (NOT p0), p2, p2, (AND p2 (NOT p0) p1)]
Entered a terminal (fully accepting) state of product in 89774 steps with 22469 reset in 4124 ms.
FORMULA Philosophers-PT-000200-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-08 finished in 26695 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)&&X(X((p1||X(F(p2))))))))'
Support contains 7 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 31 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:48:18] [INFO ] Invariant cache hit.
[2023-03-14 14:48:19] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-14 14:48:19] [INFO ] Invariant cache hit.
[2023-03-14 14:48:20] [INFO ] Implicit Places using invariants and state equation in 840 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2023-03-14 14:48:20] [INFO ] Invariant cache hit.
[2023-03-14 14:48:20] [INFO ] Dead Transitions using invariants and state equation in 448 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1747 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 411 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p0 (NOT p2)), acceptance={0} source=5 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 9}, { cond=(AND p0 (NOT p2)), acceptance={0} source=7 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=8 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=9 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 8}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p0:(AND (GEQ s19 1) (GEQ s207 1) (GEQ s218 1) (GEQ s384 1)), p1:(LT s852 1), p2:(OR (LT s38 1) (LT s250 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 706 ms.
Stack based approach found an accepted trace after 724 steps with 0 reset with depth 725 and stack size 605 in 17 ms.
FORMULA Philosophers-PT-000200-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-09 finished in 2907 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 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 802 transition count 802
Applied a total of 396 rules in 184 ms. Remains 802 /1000 variables (removed 198) and now considering 802/1000 (removed 198) transitions.
// Phase 1: matrix 802 rows 802 cols
[2023-03-14 14:48:21] [INFO ] Computed 400 place invariants in 3 ms
[2023-03-14 14:48:22] [INFO ] Implicit Places using invariants in 390 ms returned []
[2023-03-14 14:48:22] [INFO ] Invariant cache hit.
[2023-03-14 14:48:23] [INFO ] Implicit Places using invariants and state equation in 820 ms returned []
Implicit Place search using SMT with State Equation took 1212 ms to find 0 implicit places.
[2023-03-14 14:48:23] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-14 14:48:23] [INFO ] Invariant cache hit.
[2023-03-14 14:48:23] [INFO ] Dead Transitions using invariants and state equation in 358 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/1000 places, 802/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1766 ms. Remains : 802/1000 places, 802/1000 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-11 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 (LT s363 1) (LT s794 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 819 ms.
Stack based approach found an accepted trace after 2632 steps with 0 reset with depth 2633 and stack size 2592 in 49 ms.
FORMULA Philosophers-PT-000200-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-11 finished in 2683 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(G(p1)))))'
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 196
Deduced a syphon composed of 196 places in 0 ms
Reduce places removed 196 places and 0 transitions.
Iterating global reduction 0 with 392 rules applied. Total rules applied 392 place count 804 transition count 804
Applied a total of 392 rules in 48 ms. Remains 804 /1000 variables (removed 196) and now considering 804/1000 (removed 196) transitions.
// Phase 1: matrix 804 rows 804 cols
[2023-03-14 14:48:24] [INFO ] Computed 400 place invariants in 9 ms
[2023-03-14 14:48:24] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-14 14:48:24] [INFO ] Invariant cache hit.
[2023-03-14 14:48:25] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
[2023-03-14 14:48:25] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 14:48:25] [INFO ] Invariant cache hit.
[2023-03-14 14:48:26] [INFO ] Dead Transitions using invariants and state equation in 364 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 804/1000 places, 804/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1692 ms. Remains : 804/1000 places, 804/1000 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s197 1) (GEQ s403 1)), p1:(AND (GEQ s249 1) (GEQ s415 1))], nbAcceptance=1, 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 44421 steps with 0 reset in 358 ms.
FORMULA Philosophers-PT-000200-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-12 finished in 2182 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 2 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 0 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 0 with 396 rules applied. Total rules applied 396 place count 802 transition count 802
Applied a total of 396 rules in 57 ms. Remains 802 /1000 variables (removed 198) and now considering 802/1000 (removed 198) transitions.
// Phase 1: matrix 802 rows 802 cols
[2023-03-14 14:48:26] [INFO ] Computed 400 place invariants in 6 ms
[2023-03-14 14:48:27] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-14 14:48:27] [INFO ] Invariant cache hit.
[2023-03-14 14:48:27] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 1287 ms to find 0 implicit places.
[2023-03-14 14:48:27] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-14 14:48:27] [INFO ] Invariant cache hit.
[2023-03-14 14:48:28] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 802/1000 places, 802/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1727 ms. Remains : 802/1000 places, 802/1000 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s192 1) (GEQ s393 1))], 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 45324 steps with 0 reset in 366 ms.
FORMULA Philosophers-PT-000200-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-13 finished in 2154 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((G(F((p0||G(F(p0)))))||(p1&&G(p2))))))'
Support contains 5 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 18 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 14:48:28] [INFO ] Computed 400 place invariants in 6 ms
[2023-03-14 14:48:29] [INFO ] Implicit Places using invariants in 456 ms returned []
[2023-03-14 14:48:29] [INFO ] Invariant cache hit.
[2023-03-14 14:48:30] [INFO ] Implicit Places using invariants and state equation in 895 ms returned []
Implicit Place search using SMT with State Equation took 1353 ms to find 0 implicit places.
[2023-03-14 14:48:30] [INFO ] Invariant cache hit.
[2023-03-14 14:48:30] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1813 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 183 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))), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND p1 p2), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s51 1) (LT s239 1)), p2:(LT s891 1), p0:(AND (GEQ s165 1) (GEQ s380 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 61 reset in 1262 ms.
Stack based approach found an accepted trace after 16226 steps with 0 reset with depth 16227 and stack size 2895 in 156 ms.
FORMULA Philosophers-PT-000200-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-PT-000200-LTLFireability-14 finished in 3445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||G(p1))))'
Support contains 4 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 14:48:32] [INFO ] Invariant cache hit.
[2023-03-14 14:48:32] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-14 14:48:32] [INFO ] Invariant cache hit.
[2023-03-14 14:48:33] [INFO ] Implicit Places using invariants and state equation in 858 ms returned []
Implicit Place search using SMT with State Equation took 1303 ms to find 0 implicit places.
[2023-03-14 14:48:33] [INFO ] Invariant cache hit.
[2023-03-14 14:48:33] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1755 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-PT-000200-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s130 1) (LT s321 1)), p1:(AND (GEQ s147 1) (GEQ s367 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 1092 reset in 4289 ms.
Product exploration explored 100000 steps with 1091 reset in 4463 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) p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 155 steps, including 0 resets, run visited all 4 properties in 12 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (NOT (AND (NOT p0) p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 237 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 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 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:48:44] [INFO ] Invariant cache hit.
[2023-03-14 14:48:45] [INFO ] Implicit Places using invariants in 434 ms returned []
[2023-03-14 14:48:45] [INFO ] Invariant cache hit.
[2023-03-14 14:48:45] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
[2023-03-14 14:48:45] [INFO ] Invariant cache hit.
[2023-03-14 14:48:46] [INFO ] Dead Transitions using invariants and state equation in 441 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1769 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) p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 188 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 266 steps, including 0 resets, run visited all 4 properties in 15 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (F (NOT (AND (NOT p0) p1))), (F p0), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 279 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1122 reset in 4371 ms.
Product exploration explored 100000 steps with 1119 reset in 4484 ms.
Applying partial POR strategy [true, false, false, true]
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Performed 196 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 196 places in 0 ms
Iterating global reduction 0 with 196 rules applied. Total rules applied 196 place count 1000 transition count 1000
Deduced a syphon composed of 196 places in 1 ms
Applied a total of 196 rules in 93 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 14:48:57] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 14:48:57] [INFO ] Computed 400 place invariants in 4 ms
[2023-03-14 14:48:58] [INFO ] Dead Transitions using invariants and state equation in 491 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1000/1000 places, 1000/1000 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 602 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 4 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.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 14:48:58] [INFO ] Computed 400 place invariants in 10 ms
[2023-03-14 14:48:58] [INFO ] Implicit Places using invariants in 453 ms returned []
[2023-03-14 14:48:58] [INFO ] Invariant cache hit.
[2023-03-14 14:48:59] [INFO ] Implicit Places using invariants and state equation in 876 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2023-03-14 14:48:59] [INFO ] Invariant cache hit.
[2023-03-14 14:48:59] [INFO ] Dead Transitions using invariants and state equation in 455 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1801 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Treatment of property Philosophers-PT-000200-LTLFireability-15 finished in 27767 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' '!(X((X(F(p0))||G(p1))))'
[2023-03-14 14:49:00] [INFO ] Flatten gal took : 50 ms
[2023-03-14 14:49:00] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 17 ms.
[2023-03-14 14:49:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1000 places, 1000 transitions and 3200 arcs took 8 ms.
Total runtime 110952 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Philosophers-PT-000200
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

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

FORMULA Philosophers-PT-000200-LTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678805347257

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Philosophers-PT-000200-LTLFireability-00
lola: time limit : 1797 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for Philosophers-PT-000200-LTLFireability-00
lola: result : false
lola: markings : 11520
lola: fired transitions : 23357
lola: time used : 1.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 Philosophers-PT-000200-LTLFireability-15
lola: time limit : 3594 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for Philosophers-PT-000200-LTLFireability-15
lola: result : false
lola: markings : 5497
lola: fired transitions : 11040
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-PT-000200-LTLFireability-00: LTL false LTL model checker
Philosophers-PT-000200-LTLFireability-15: LTL false LTL model checker


Time elapsed: 6 secs. Pages in use: 1

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-PT-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-PT-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-167873947600228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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