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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 25 13:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 25 13:10 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.8K Feb 25 16:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 13:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 13:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 129K Feb 25 13:24 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 14K 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-000100-LTLCardinality-00
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-01
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-02
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-03
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-04
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-05
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-06
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-07
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-08
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-09
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-10
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-11
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-12
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-13
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-14
FORMULA_NAME Philosophers-COL-000100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678783487005

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-000100
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 08:44:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 08:44:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 08:44:48] [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:44:48] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-14 08:44:49] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1407 ms
[2023-03-14 08:44:49] [INFO ] Imported 5 HL places and 5 HL transitions for a total of 500 PT places and 500.0 transition bindings in 15 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
[2023-03-14 08:44:50] [INFO ] Built PT skeleton of HLPN with 5 places and 5 transitions 15 arcs in 4 ms.
[2023-03-14 08:44:50] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Initial state reduction rules removed 4 formulas.
FORMULA Philosophers-COL-000100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Philosophers-COL-000100-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10097 steps, including 98 resets, run finished after 49 ms. (steps per millisecond=206 ) properties (out of 20) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 5 cols
[2023-03-14 08:44:50] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-14 08:44:50] [INFO ] After 100ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 08:44:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-14 08:44:50] [INFO ] After 40ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-14 08:44:50] [INFO ] Flatten gal took : 12 ms
[2023-03-14 08:44:50] [INFO ] Flatten gal took : 1 ms
Arc [1:1*[(MOD (ADD (MOD (MINUS $x 1) 100) 100) 100)]] contains successor/predecessor on variables of sort Philo
[2023-03-14 08:44:50] [INFO ] Unfolded HLPN to a Petri net with 500 places and 500 transitions 1600 arcs in 18 ms.
[2023-03-14 08:44:50] [INFO ] Unfolded 12 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA Philosophers-COL-000100-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2023-03-14 08:44:50] [INFO ] Computed 200 place invariants in 9 ms
[2023-03-14 08:44:50] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-14 08:44:50] [INFO ] Invariant cache hit.
[2023-03-14 08:44:50] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-14 08:44:50] [INFO ] Invariant cache hit.
[2023-03-14 08:44:51] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 727 ms. Remains : 500/500 places, 500/500 transitions.
Support contains 500 out of 500 places after structural reductions.
[2023-03-14 08:44:51] [INFO ] Flatten gal took : 43 ms
[2023-03-14 08:44:51] [INFO ] Flatten gal took : 38 ms
[2023-03-14 08:44:51] [INFO ] Input system was already deterministic with 500 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 18) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 08:44:52] [INFO ] Invariant cache hit.
[2023-03-14 08:44:52] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 08:44:52] [INFO ] [Nat]Absence check using 200 positive place invariants in 29 ms returned sat
[2023-03-14 08:44:52] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 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' '!(X(F(p0)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 26 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 08:44:52] [INFO ] Invariant cache hit.
[2023-03-14 08:44:52] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-14 08:44:52] [INFO ] Invariant cache hit.
[2023-03-14 08:44:53] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 544 ms to find 0 implicit places.
[2023-03-14 08:44:53] [INFO ] Invariant cache hit.
[2023-03-14 08:44:53] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 802 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ (ADD s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 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][false, false]]
Stuttering criterion allowed to conclude after 16971 steps with 5 reset in 179 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-00 finished in 1195 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 G(p1)))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 400 transition count 400
Applied a total of 200 rules in 45 ms. Remains 400 /500 variables (removed 100) and now considering 400/500 (removed 100) transitions.
// Phase 1: matrix 400 rows 400 cols
[2023-03-14 08:44:53] [INFO ] Computed 200 place invariants in 2 ms
[2023-03-14 08:44:54] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-14 08:44:54] [INFO ] Invariant cache hit.
[2023-03-14 08:44:54] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-14 08:44:54] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-14 08:44:54] [INFO ] Invariant cache hit.
[2023-03-14 08:44:54] [INFO ] Dead Transitions using invariants and state equation in 190 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/500 places, 400/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 705 ms. Remains : 400/500 places, 400/500 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 3 (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=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 3248 steps with 0 reset in 39 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-02 finished in 848 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||(p1&&(p2 U (p3||G(p2))))))))'
Support contains 400 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 22 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2023-03-14 08:44:54] [INFO ] Computed 200 place invariants in 10 ms
[2023-03-14 08:44:54] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-14 08:44:54] [INFO ] Invariant cache hit.
[2023-03-14 08:44:55] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 410 ms to find 0 implicit places.
[2023-03-14 08:44:55] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-14 08:44:55] [INFO ] Invariant cache hit.
[2023-03-14 08:44:55] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 691 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND (NOT p3) (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p0))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p3) (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p3:(AND (GT 3 (ADD s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 ...], 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 2113 reset in 3031 ms.
Stack based approach found an accepted trace after 43781 steps with 966 reset with depth 189 and stack size 189 in 1331 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-03 finished in 5229 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 400 transition count 400
Applied a total of 200 rules in 32 ms. Remains 400 /500 variables (removed 100) and now considering 400/500 (removed 100) transitions.
// Phase 1: matrix 400 rows 400 cols
[2023-03-14 08:45:00] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 08:45:00] [INFO ] Implicit Places using invariants in 196 ms returned []
[2023-03-14 08:45:00] [INFO ] Invariant cache hit.
[2023-03-14 08:45:00] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-14 08:45:00] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:45:00] [INFO ] Invariant cache hit.
[2023-03-14 08:45:00] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/500 places, 400/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 764 ms. Remains : 400/500 places, 400/500 transitions.
Stuttering acceptance computed with spot in 767 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 (ADD s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327...], 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 33715 steps with 3 reset in 301 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-04 finished in 1864 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 0 with 200 rules applied. Total rules applied 200 place count 400 transition count 400
Applied a total of 200 rules in 27 ms. Remains 400 /500 variables (removed 100) and now considering 400/500 (removed 100) transitions.
[2023-03-14 08:45:01] [INFO ] Invariant cache hit.
[2023-03-14 08:45:02] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-14 08:45:02] [INFO ] Invariant cache hit.
[2023-03-14 08:45:02] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-14 08:45:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 08:45:02] [INFO ] Invariant cache hit.
[2023-03-14 08:45:02] [INFO ] Dead Transitions using invariants and state equation in 186 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/500 places, 400/500 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 702 ms. Remains : 400/500 places, 400/500 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 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=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 2384 steps with 0 reset in 30 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-05 finished in 780 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(G(!p0))||G(p1)||G(!p2)||(!p2&&F(p3))))))'
Support contains 400 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 500 cols
[2023-03-14 08:45:02] [INFO ] Computed 200 place invariants in 3 ms
[2023-03-14 08:45:02] [INFO ] Implicit Places using invariants in 140 ms returned []
[2023-03-14 08:45:02] [INFO ] Invariant cache hit.
[2023-03-14 08:45:03] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 384 ms to find 0 implicit places.
[2023-03-14 08:45:03] [INFO ] Invariant cache hit.
[2023-03-14 08:45:03] [INFO ] Dead Transitions using invariants and state equation in 226 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 620 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 583 ms :[true, (NOT p3), (AND p0 (NOT p1) p2), p0, (AND (NOT p3) p0), (AND (NOT p3) p0 p2), (AND (NOT p3) p0 p2 (NOT p1)), (AND p0 (NOT p1)), (AND (NOT p3) p2), (AND (NOT p3) p2 (NOT p1)), (AND (NOT p3) p0 (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p1), (AND p0 (NOT p1) p2), (AND p0 (NOT p1) p2)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=2 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 6}, { cond=(AND p1 p2), acceptance={} source=2 dest: 7}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3) p0), acceptance={} source=5 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={} source=5 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p3) p0), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p2) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2) (NOT p3) p0), acceptance={} source=6 dest: 8}, { cond=(AND p1 (NOT p2) (NOT p3) p0), acceptance={} source=6 dest: 9}, { cond=(AND p1 p2 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 10}, { cond=(AND p1 p2 (NOT p3) p0), acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 7}, { cond=(AND p1 p0), acceptance={} source=7 dest: 12}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=9 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=9 dest: 8}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=9 dest: 9}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=9 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3) p0), acceptance={} source=10 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=10 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=10 dest: 10}, { cond=(AND p1 (NOT p3) p0), acceptance={} source=10 dest: 11}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=11 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=11 dest: 11}], [{ cond=(NOT p1), acceptance={} source=12 dest: 0}, { cond=p1, acceptance={} source=12 dest: 12}], [{ cond=true, acceptance={} source=13 dest: 14}], [{ cond=true, acceptance={} source=14 dest: 2}]], initial=13, aps=[p3:(GT (ADD s300 s301 s302 s303 s304 s305 s306 s307 s308 s309 s310 s311 s312 s313 s314 s315 s316 s317 s318 s319 s320 s321 s322 s323 s324 s325 s326 s327 s3...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 688 reset in 2830 ms.
Stack based approach found an accepted trace after 2022 steps with 11 reset with depth 111 and stack size 111 in 61 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-07 finished in 4133 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&&(p1||X((G(p2) U (p1&&G(p2))))))))'
Support contains 400 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 3 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 08:45:06] [INFO ] Invariant cache hit.
[2023-03-14 08:45:06] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-14 08:45:06] [INFO ] Invariant cache hit.
[2023-03-14 08:45:07] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-14 08:45:07] [INFO ] Invariant cache hit.
[2023-03-14 08:45:07] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 624 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p2), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(AND p1 p2), acceptance={0} source=4 dest: 0}, { cond=(NOT p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(LEQ (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 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, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-08 finished in 836 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 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 08:45:07] [INFO ] Invariant cache hit.
[2023-03-14 08:45:07] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-14 08:45:07] [INFO ] Invariant cache hit.
[2023-03-14 08:45:08] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2023-03-14 08:45:08] [INFO ] Invariant cache hit.
[2023-03-14 08:45:08] [INFO ] Dead Transitions using invariants and state equation in 237 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 782 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-10 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 (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, 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 6214 steps with 0 reset in 83 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-10 finished in 959 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||(p1&&F(p0))))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 08:45:08] [INFO ] Invariant cache hit.
[2023-03-14 08:45:08] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-14 08:45:08] [INFO ] Invariant cache hit.
[2023-03-14 08:45:08] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
[2023-03-14 08:45:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-14 08:45:08] [INFO ] Invariant cache hit.
[2023-03-14 08:45:09] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 649 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-11 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:(LEQ (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 s...], 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 816 reset in 1915 ms.
Stack based approach found an accepted trace after 26383 steps with 216 reset with depth 27 and stack size 27 in 514 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-11 finished in 3188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||F(p1))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 08:45:12] [INFO ] Invariant cache hit.
[2023-03-14 08:45:12] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-14 08:45:12] [INFO ] Invariant cache hit.
[2023-03-14 08:45:12] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
[2023-03-14 08:45:12] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-14 08:45:12] [INFO ] Invariant cache hit.
[2023-03-14 08:45:13] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 727 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 3 (ADD s100 s101 s102 s103 s104 s105 s106 s107 s108 s109 s110 s111 s112 s113 s114 s115 s116 s117 s118 s119 s120 s121 s122 s123 s124 s125 s126 s127 ...], 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 812 reset in 1869 ms.
Stack based approach found an accepted trace after 2290 steps with 18 reset with depth 116 and stack size 116 in 45 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-13 finished in 3460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p0))))'
Support contains 200 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 500/500 transitions.
Applied a total of 0 rules in 7 ms. Remains 500 /500 variables (removed 0) and now considering 500/500 (removed 0) transitions.
[2023-03-14 08:45:15] [INFO ] Invariant cache hit.
[2023-03-14 08:45:15] [INFO ] Implicit Places using invariants in 199 ms returned []
[2023-03-14 08:45:15] [INFO ] Invariant cache hit.
[2023-03-14 08:45:15] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2023-03-14 08:45:15] [INFO ] Invariant cache hit.
[2023-03-14 08:45:15] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 795 ms. Remains : 500/500 places, 500/500 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Philosophers-COL-000100-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 1}]], initial=1, aps=[p0:(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, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA Philosophers-COL-000100-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Philosophers-COL-000100-LTLCardinality-14 finished in 984 ms.
All properties solved by simple procedures.
Total runtime 27743 ms.
ITS solved all properties within timeout

BK_STOP 1678783518114

--------------------
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:
++ 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
++ sed s/.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-000100"
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-000100, 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-167873947400115"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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