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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 13:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 13:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 13:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 13:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 25 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 18K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678783834027

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Philosophers-COL-000200
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:50:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 08:50:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:50:35] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-14 08:50:35] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 08:50:36] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 684 ms
[2023-03-14 08:50:36] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 1000 PT places and 1000.0 transition bindings in 14 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 08:50:36] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 3 ms.
[2023-03-14 08:50:36] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA Philosophers-COL-000200-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000200-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 13 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10099 steps, including 49 resets, run finished after 28 ms. (steps per millisecond=360 ) properties (out of 22) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 08:50:36] [INFO ] Computed 2 place invariants in 6 ms
[2023-03-14 08:50:36] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-14 08:50:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-14 08:50:36] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
FORMULA Philosophers-COL-000200-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-14 08:50:36] [INFO ] Flatten gal took : 12 ms
[2023-03-14 08:50:36] [INFO ] Flatten gal took : 2 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 200) 200) 200)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 08:50:36] [INFO ] Unfolded HLPN to a Petri net with 1000 places and 1000 transitions 3200 arcs in 25 ms.
[2023-03-14 08:50:36] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Support contains 1000 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 15 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
// Phase 1: matrix 1000 rows 1000 cols
[2023-03-14 08:50:36] [INFO ] Computed 400 place invariants in 24 ms
[2023-03-14 08:50:37] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-14 08:50:37] [INFO ] Invariant cache hit.
[2023-03-14 08:50:37] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 780 ms to find 0 implicit places.
[2023-03-14 08:50:37] [INFO ] Invariant cache hit.
[2023-03-14 08:50:38] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1415 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Support contains 1000 out of 1000 places after structural reductions.
[2023-03-14 08:50:38] [INFO ] Flatten gal took : 81 ms
[2023-03-14 08:50:38] [INFO ] Flatten gal took : 68 ms
[2023-03-14 08:50:38] [INFO ] Input system was already deterministic with 1000 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=14 ) properties (out of 21) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 168 ms. (steps per millisecond=59 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-14 08:50:40] [INFO ] Invariant cache hit.
[2023-03-14 08:50:41] [INFO ] [Real]Absence check using 400 positive place invariants in 68 ms returned sat
[2023-03-14 08:50:42] [INFO ] After 1283ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-14 08:50:42] [INFO ] [Nat]Absence check using 400 positive place invariants in 61 ms returned sat
[2023-03-14 08:50:45] [INFO ] After 2509ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-14 08:50:46] [INFO ] After 3719ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 1076 ms.
[2023-03-14 08:50:47] [INFO ] After 5398ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 200 steps, including 0 resets, run visited all 2 properties in 12 ms. (steps per millisecond=16 )
Parikh walk visited 2 properties in 42 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
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)))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 69 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:50:47] [INFO ] Invariant cache hit.
[2023-03-14 08:50:48] [INFO ] Implicit Places using invariants in 537 ms returned []
[2023-03-14 08:50:48] [INFO ] Invariant cache hit.
[2023-03-14 08:50:49] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1337 ms to find 0 implicit places.
[2023-03-14 08:50:49] [INFO ] Redundant transitions in 56 ms returned []
[2023-03-14 08:50:49] [INFO ] Invariant cache hit.
[2023-03-14 08:50:49] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2018 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 127 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-00 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 (LEQ 1 (ADD s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826...], 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 68654 steps with 0 reset in 1465 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-00 finished in 3679 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)||G(p1))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 38 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:50:51] [INFO ] Invariant cache hit.
[2023-03-14 08:50:51] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-14 08:50:51] [INFO ] Invariant cache hit.
[2023-03-14 08:50:52] [INFO ] Implicit Places using invariants and state equation in 690 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
[2023-03-14 08:50:52] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-14 08:50:52] [INFO ] Invariant cache hit.
[2023-03-14 08:50:53] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1682 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 3 (ADD s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827...], nbAcceptance=2, 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 87935 steps with 0 reset in 2723 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-01 finished in 4462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(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 34 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:50:55] [INFO ] Invariant cache hit.
[2023-03-14 08:50:56] [INFO ] Implicit Places using invariants in 214 ms returned []
[2023-03-14 08:50:56] [INFO ] Invariant cache hit.
[2023-03-14 08:50:56] [INFO ] Implicit Places using invariants and state equation in 546 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-03-14 08:50:56] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-14 08:50:56] [INFO ] Invariant cache hit.
[2023-03-14 08:50:57] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1375 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p1:(LEQ (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 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, null][true, true]]
Product exploration explored 100000 steps with 24 reset in 2565 ms.
Stack based approach found an accepted trace after 863 steps with 0 reset with depth 864 and stack size 864 in 50 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-02 finished in 4099 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||F(p1)||X(G(p2)))))'
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:50:59] [INFO ] Invariant cache hit.
[2023-03-14 08:51:00] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-14 08:51:00] [INFO ] Invariant cache hit.
[2023-03-14 08:51:00] [INFO ] Implicit Places using invariants and state equation in 648 ms returned []
Implicit Place search using SMT with State Equation took 944 ms to find 0 implicit places.
[2023-03-14 08:51:00] [INFO ] Invariant cache hit.
[2023-03-14 08:51:01] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1501 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ (ADD s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3283 ms.
Product exploration explored 100000 steps with 50000 reset in 3372 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 p1 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 67 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000200-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000200-LTLCardinality-05 finished in 12040 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(!p0)) U G(p1)))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 99 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:51:12] [INFO ] Invariant cache hit.
[2023-03-14 08:51:12] [INFO ] Implicit Places using invariants in 357 ms returned []
[2023-03-14 08:51:12] [INFO ] Invariant cache hit.
[2023-03-14 08:51:13] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1017 ms to find 0 implicit places.
[2023-03-14 08:51:13] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-14 08:51:13] [INFO ] Invariant cache hit.
[2023-03-14 08:51:13] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1664 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), p0, (AND p0 p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 (ADD s600 s601 s602 s603 s604 s605 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6 reset in 1814 ms.
Stack based approach found an accepted trace after 2808 steps with 1 reset with depth 2807 and stack size 2807 in 65 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-06 finished in 3675 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||X(G(p1)))))'
Support contains 200 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:51:15] [INFO ] Invariant cache hit.
[2023-03-14 08:51:16] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-14 08:51:16] [INFO ] Invariant cache hit.
[2023-03-14 08:51:16] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1143 ms to find 0 implicit places.
[2023-03-14 08:51:16] [INFO ] Invariant cache hit.
[2023-03-14 08:51:17] [INFO ] Dead Transitions using invariants and state equation in 561 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1727 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 103 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(LEQ 2 (ADD s600 s601 s602 s603 s604 s605 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, 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 2 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-07 finished in 1854 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(F(p1)))))'
Support contains 400 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 13 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:51:17] [INFO ] Invariant cache hit.
[2023-03-14 08:51:18] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-14 08:51:18] [INFO ] Invariant cache hit.
[2023-03-14 08:51:18] [INFO ] Implicit Places using invariants and state equation in 780 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
[2023-03-14 08:51:18] [INFO ] Invariant cache hit.
[2023-03-14 08:51:19] [INFO ] Dead Transitions using invariants and state equation in 558 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1807 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 (ADD s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 3522 ms.
Product exploration explored 100000 steps with 50000 reset in 3720 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 5 factoid took 90 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Philosophers-COL-000200-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Philosophers-COL-000200-LTLCardinality-08 finished in 10835 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 U p1)&&F(p2)))||G(p3))))'
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 23 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:51:28] [INFO ] Invariant cache hit.
[2023-03-14 08:51:28] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-14 08:51:28] [INFO ] Invariant cache hit.
[2023-03-14 08:51:29] [INFO ] Implicit Places using invariants and state equation in 532 ms returned []
Implicit Place search using SMT with State Equation took 756 ms to find 0 implicit places.
[2023-03-14 08:51:29] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-14 08:51:29] [INFO ] Invariant cache hit.
[2023-03-14 08:51:29] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1335 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=(OR (AND p3 p1) (AND p3 p0)), acceptance={} source=0 dest: 0}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p3) p1) (AND (NOT p3) p0)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 2}], [{ cond=(AND p3 (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p3 (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p3 (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p3:(GT 2 (ADD s200 s201 s202 s203 s204 s205 s206 s207 s208 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 545 reset in 9944 ms.
Stack based approach found an accepted trace after 9949 steps with 52 reset with depth 217 and stack size 217 in 1003 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-09 finished in 12430 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(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 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:51:40] [INFO ] Invariant cache hit.
[2023-03-14 08:51:41] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-14 08:51:41] [INFO ] Invariant cache hit.
[2023-03-14 08:51:41] [INFO ] Implicit Places using invariants and state equation in 687 ms returned []
Implicit Place search using SMT with State Equation took 979 ms to find 0 implicit places.
[2023-03-14 08:51:41] [INFO ] Invariant cache hit.
[2023-03-14 08:51:42] [INFO ] Dead Transitions using invariants and state equation in 559 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1551 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p1:(GT (ADD s800 s801 s802 s803 s804 s805 s806 s807 s808 s809 s810 s811 s812 s813 s814 s815 s816 s817 s818 s819 s820 s821 s822 s823 s824 s825 s826 s827 s8...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 2205 ms.
Product exploration explored 100000 steps with 1 reset in 2358 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 p1)), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 2) seen :1
Finished Best-First random walk after 800 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Support contains 600 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 1000/1000 transitions.
Applied a total of 0 rules in 14 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:51:50] [INFO ] Invariant cache hit.
[2023-03-14 08:51:50] [INFO ] Implicit Places using invariants in 313 ms returned []
[2023-03-14 08:51:50] [INFO ] Invariant cache hit.
[2023-03-14 08:51:51] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2023-03-14 08:51:51] [INFO ] Invariant cache hit.
[2023-03-14 08:51:51] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1513 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 (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 149 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 2) seen :1
Finished Best-First random walk after 800 steps, including 0 resets, run visited all 1 properties in 14 ms. (steps per millisecond=57 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 258 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 101 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 100 ms :[(AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 2 reset in 2230 ms.
Stack based approach found an accepted trace after 9287 steps with 0 reset with depth 9288 and stack size 9016 in 244 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-12 finished in 17000 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 200 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 10 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:51:57] [INFO ] Invariant cache hit.
[2023-03-14 08:51:58] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-14 08:51:58] [INFO ] Invariant cache hit.
[2023-03-14 08:51:59] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1239 ms to find 0 implicit places.
[2023-03-14 08:51:59] [INFO ] Invariant cache hit.
[2023-03-14 08:51:59] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1804 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ 2 (ADD s600 s601 s602 s603 s604 s605 s606 s607 s608 s609 s610 s611 s612 s613 s614 s615 s616 s617 s618 s619 s620 s621 s622 s623 s624 s625 s626 s627...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-13 finished in 1913 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)&&F(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 17 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:51:59] [INFO ] Invariant cache hit.
[2023-03-14 08:51:59] [INFO ] Implicit Places using invariants in 251 ms returned []
[2023-03-14 08:51:59] [INFO ] Invariant cache hit.
[2023-03-14 08:52:00] [INFO ] Implicit Places using invariants and state equation in 565 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
[2023-03-14 08:52:00] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-14 08:52:00] [INFO ] Invariant cache hit.
[2023-03-14 08:52:01] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1382 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LEQ (ADD s400 s401 s402 s403 s404 s405 s406 s407 s408 s409 s410 s411 s412 s413 s414 s415 s416 s417 s418 s419 s420 s421 s422 s423 s424 s425 s426 s427 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, null, null][true, true, true]]
Product exploration explored 100000 steps with 387 reset in 4153 ms.
Stack based approach found an accepted trace after 48465 steps with 190 reset with depth 87 and stack size 87 in 2104 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-14 finished in 7774 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)))'
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 19 ms. Remains 1000 /1000 variables (removed 0) and now considering 1000/1000 (removed 0) transitions.
[2023-03-14 08:52:07] [INFO ] Invariant cache hit.
[2023-03-14 08:52:07] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-14 08:52:07] [INFO ] Invariant cache hit.
[2023-03-14 08:52:08] [INFO ] Implicit Places using invariants and state equation in 601 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
[2023-03-14 08:52:08] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-14 08:52:08] [INFO ] Invariant cache hit.
[2023-03-14 08:52:08] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1452 ms. Remains : 1000/1000 places, 1000/1000 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000200-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GT 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 420 reset in 3047 ms.
Stack based approach found an accepted trace after 3214 steps with 19 reset with depth 2269 and stack size 2269 in 128 ms.
FORMULA Philosophers-COL-000200-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000200-LTLCardinality-15 finished in 4720 ms.
All properties solved by simple procedures.
Total runtime 96798 ms.
ITS solved all properties within timeout

BK_STOP 1678783933395

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Philosophers-COL-000200"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/Philosophers-COL-000200.tgz
mv Philosophers-COL-000200 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;