fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r359-smll-167891809200556
Last Updated
May 14, 2023

About the Execution of LoLa+red for SharedMemory-COL-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
354.044 32835.00 52706.00 767.50 TFFFFTFFFFTFFFFT normal

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.r359-smll-167891809200556.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 SharedMemory-COL-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r359-smll-167891809200556
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.9K Feb 25 14:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 25 14:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 114K Feb 25 14:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Feb 25 14:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 14:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 12K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679166699812

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000010
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-18 19:11:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-18 19:11:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 19:11:43] [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-18 19:11:44] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-18 19:11:44] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 974 ms
[2023-03-18 19:11:44] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 141 PT places and 320.0 transition bindings in 32 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
[2023-03-18 19:11:44] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 8 ms.
[2023-03-18 19:11:44] [INFO ] Skeletonized 15 HLPN properties in 2 ms. Removed 1 properties that had guard overlaps.
Initial state reduction rules removed 1 formulas.
FORMULA SharedMemory-COL-000010-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 5 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Incomplete random walk after 10000 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 5 rows 6 cols
[2023-03-18 19:11:45] [INFO ] Computed 3 place invariants in 5 ms
[2023-03-18 19:11:45] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-18 19:11:45] [INFO ] After 189ms SMT Verify possible using all constraints in real 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 5 simplifications.
[2023-03-18 19:11:45] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2023-03-18 19:11:45] [INFO ] Flatten gal took : 18 ms
FORMULA SharedMemory-COL-000010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-18 19:11:45] [INFO ] Flatten gal took : 2 ms
Domain [P(10), P(10)] of place Ext_Mem_Acc breaks symmetries in sort P
[2023-03-18 19:11:45] [INFO ] Unfolded HLPN to a Petri net with 141 places and 220 transitions 840 arcs in 30 ms.
[2023-03-18 19:11:45] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 10 transitions.
FORMULA SharedMemory-COL-000010-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 11 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2023-03-18 19:11:45] [INFO ] Computed 21 place invariants in 19 ms
[2023-03-18 19:11:45] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-18 19:11:45] [INFO ] Invariant cache hit.
[2023-03-18 19:11:46] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-18 19:11:46] [INFO ] Invariant cache hit.
[2023-03-18 19:11:46] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 538 ms. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2023-03-18 19:11:46] [INFO ] Flatten gal took : 79 ms
[2023-03-18 19:11:46] [INFO ] Flatten gal took : 91 ms
[2023-03-18 19:11:46] [INFO ] Input system was already deterministic with 210 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 8) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-18 19:11:47] [INFO ] Invariant cache hit.
[2023-03-18 19:11:47] [INFO ] After 47ms SMT Verify possible using all constraints in real 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 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' '!(X(X((X(p0)||F(p1)))))'
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:11:47] [INFO ] Invariant cache hit.
[2023-03-18 19:11:47] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-18 19:11:47] [INFO ] Invariant cache hit.
[2023-03-18 19:11:47] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-18 19:11:47] [INFO ] Invariant cache hit.
[2023-03-18 19:11:48] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 479 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(AND (LT s122 1) (LT s63 1) (LT s126 1) (LT s67 1) (LT s70 1) (LT s74 1) (LT s78 1) (LT s81 1) (LT s85 1) (LT s89 1) (LT s92 1) (LT s96 1) (LT s40 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 31578 reset in 835 ms.
Product exploration explored 100000 steps with 31580 reset in 481 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)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 144 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 241 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 34 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:11:51] [INFO ] Invariant cache hit.
[2023-03-18 19:11:51] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-18 19:11:51] [INFO ] Invariant cache hit.
[2023-03-18 19:11:51] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 432 ms to find 0 implicit places.
[2023-03-18 19:11:51] [INFO ] Invariant cache hit.
[2023-03-18 19:11:51] [INFO ] Dead Transitions using invariants and state equation in 251 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 691 ms. Remains : 131/131 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 146 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 208 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 272 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 425 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 31573 reset in 661 ms.
Product exploration explored 100000 steps with 31566 reset in 516 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 253 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 24 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:11:55] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-18 19:11:55] [INFO ] Invariant cache hit.
[2023-03-18 19:11:55] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 351 ms. Remains : 131/131 places, 210/210 transitions.
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:11:55] [INFO ] Invariant cache hit.
[2023-03-18 19:11:55] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-18 19:11:55] [INFO ] Invariant cache hit.
[2023-03-18 19:11:55] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2023-03-18 19:11:55] [INFO ] Invariant cache hit.
[2023-03-18 19:11:55] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 613 ms. Remains : 131/131 places, 210/210 transitions.
Treatment of property SharedMemory-COL-000010-LTLFireability-00 finished in 8617 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(p1)))&&F(p2)))'
Support contains 31 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 11 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:11:56] [INFO ] Invariant cache hit.
[2023-03-18 19:11:56] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-18 19:11:56] [INFO ] Invariant cache hit.
[2023-03-18 19:11:56] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2023-03-18 19:11:56] [INFO ] Invariant cache hit.
[2023-03-18 19:11:56] [INFO ] Dead Transitions using invariants and state equation in 204 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 308 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(OR (AND (GEQ s15 1) (GEQ s20 1) (GEQ s130 1)) (AND (GEQ s17 1) (GEQ s24 1) (GEQ s130 1)) (AND (GEQ s14 1) (GEQ s23 1) (GEQ s130 1)) (AND (GEQ s19 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, 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 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-01 finished in 825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&F((G(p1)||(X(p1)&&(p2||G(!p0)))))))'
Support contains 121 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:11:57] [INFO ] Invariant cache hit.
[2023-03-18 19:11:57] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-18 19:11:57] [INFO ] Invariant cache hit.
[2023-03-18 19:11:57] [INFO ] Implicit Places using invariants and state equation in 186 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-18 19:11:57] [INFO ] Invariant cache hit.
[2023-03-18 19:11:57] [INFO ] Dead Transitions using invariants and state equation in 208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 473 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 384 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p0 p2)), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p1 p2)), acceptance={1} source=4 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2)), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) p2)), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 6}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p1 p0 p2), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (AND (GEQ s15 1) (GEQ s20 1) (GEQ s130 1)) (AND (GEQ s17 1) (GEQ s24 1) (GEQ s130 1)) (AND (GEQ s14 1) (GEQ s23 1) (GEQ s130 1)) (AND (GEQ s19 1) (...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 235 steps with 38 reset in 14 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-02 finished in 947 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0||G(p1))))'
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:11:57] [INFO ] Invariant cache hit.
[2023-03-18 19:11:58] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-18 19:11:58] [INFO ] Invariant cache hit.
[2023-03-18 19:11:58] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-18 19:11:58] [INFO ] Invariant cache hit.
[2023-03-18 19:11:58] [INFO ] Dead Transitions using invariants and state equation in 244 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 548 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) p0), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (LT s122 1) (LT s63 1) (LT s126 1) (LT s67 1) (LT s70 1) (LT s74 1) (LT s78 1) (LT s81 1) (LT s85 1) (LT s89 1) (LT s92 1) (LT s96 1) (LT s40 1) (...], 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 3 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-04 finished in 732 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((F(p1)&&p0))))'
Support contains 30 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 11 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:11:58] [INFO ] Invariant cache hit.
[2023-03-18 19:11:58] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-18 19:11:58] [INFO ] Invariant cache hit.
[2023-03-18 19:11:58] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
[2023-03-18 19:11:58] [INFO ] Invariant cache hit.
[2023-03-18 19:11:59] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s20 1)) (OR (LT s4 1) (LT s24 1)) (OR (LT s5 1) (LT s25 1)) (OR (LT s8 1) (LT s28 1)) (OR (LT s9 1) (LT s29 1)) (OR (LT s1 1) (L...], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-06 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((F(!p0)&&X(!p1))))))'
Support contains 110 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:11:59] [INFO ] Invariant cache hit.
[2023-03-18 19:11:59] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-18 19:11:59] [INFO ] Invariant cache hit.
[2023-03-18 19:11:59] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2023-03-18 19:11:59] [INFO ] Invariant cache hit.
[2023-03-18 19:11:59] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 518 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 286 ms :[(OR p0 p1), (OR p0 p1), (OR p0 p1), p1, p0]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (LT s122 1) (LT s63 1) (LT s126 1) (LT s67 1) (LT s70 1) (LT s74 1) (LT s78 1) (LT s81 1) (LT s85 1) (LT s89 1) (LT s92 1) (LT s96 1) (LT s40 1) (...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19105 reset in 836 ms.
Stack based approach found an accepted trace after 1279 steps with 249 reset with depth 8 and stack size 8 in 14 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-07 finished in 1681 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 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 39 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:12:01] [INFO ] Invariant cache hit.
[2023-03-18 19:12:01] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-18 19:12:01] [INFO ] Invariant cache hit.
[2023-03-18 19:12:01] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2023-03-18 19:12:01] [INFO ] Redundant transitions in 16 ms returned []
[2023-03-18 19:12:01] [INFO ] Invariant cache hit.
[2023-03-18 19:12:01] [INFO ] Dead Transitions using invariants and state equation in 291 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 731 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s30 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 833 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-08 finished in 1634 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 21 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 18 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:12:02] [INFO ] Invariant cache hit.
[2023-03-18 19:12:02] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-18 19:12:02] [INFO ] Invariant cache hit.
[2023-03-18 19:12:02] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2023-03-18 19:12:02] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 19:12:02] [INFO ] Invariant cache hit.
[2023-03-18 19:12:03] [INFO ] Dead Transitions using invariants and state equation in 160 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 399 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s20 1) (GEQ s130 1)) (AND (GEQ s17 1) (GEQ s24 1) (GEQ s130 1)) (AND (GEQ s14 1) (GEQ s23 1) (GEQ s130 1)) (AND (GEQ s19 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 2426 ms.
Stack based approach found an accepted trace after 11 steps with 0 reset with depth 12 and stack size 12 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-09 finished in 2897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 10 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:12:05] [INFO ] Invariant cache hit.
[2023-03-18 19:12:05] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-18 19:12:05] [INFO ] Invariant cache hit.
[2023-03-18 19:12:05] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-18 19:12:05] [INFO ] Invariant cache hit.
[2023-03-18 19:12:06] [INFO ] Dead Transitions using invariants and state equation in 261 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 597 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s32 1) (GEQ s33 1) (GEQ s34 1) (GEQ s35 1) (GEQ s36 1) (GEQ s37 1) (GEQ s39 1) (GEQ s38 1) (GEQ s30 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 443 ms.
Product exploration explored 100000 steps with 50000 reset in 443 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-COL-000010-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000010-LTLFireability-10 finished in 1724 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 90 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 10 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:12:07] [INFO ] Invariant cache hit.
[2023-03-18 19:12:07] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-18 19:12:07] [INFO ] Invariant cache hit.
[2023-03-18 19:12:07] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 341 ms to find 0 implicit places.
[2023-03-18 19:12:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 19:12:07] [INFO ] Invariant cache hit.
[2023-03-18 19:12:07] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 526 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 103 ms :[p0, p0]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s122 1) (LT s63 1) (LT s126 1) (LT s67 1) (LT s70 1) (LT s74 1) (LT s78 1) (LT s81 1) (LT s85 1) (LT s89 1) (LT s92 1) (LT s96 1) (LT s40 1) (...], 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 14316 reset in 922 ms.
Stack based approach found an accepted trace after 14 steps with 2 reset with depth 5 and stack size 5 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-11 finished in 1565 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(!p0)||X(X(G(!p1))))))'
Support contains 31 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 9 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:12:08] [INFO ] Invariant cache hit.
[2023-03-18 19:12:08] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-18 19:12:08] [INFO ] Invariant cache hit.
[2023-03-18 19:12:09] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 162 ms to find 0 implicit places.
[2023-03-18 19:12:09] [INFO ] Invariant cache hit.
[2023-03-18 19:12:09] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 298 ms :[p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(OR (AND (GEQ s15 1) (GEQ s20 1) (GEQ s130 1)) (AND (GEQ s17 1) (GEQ s24 1) (GEQ s130 1)) (AND (GEQ s14 1) (GEQ s23 1) (GEQ s130 1)) (AND (GEQ s19 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 31415 reset in 902 ms.
Stack based approach found an accepted trace after 2321 steps with 711 reset with depth 6 and stack size 6 in 23 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-13 finished in 1581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(!p0))))'
Support contains 90 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-18 19:12:10] [INFO ] Invariant cache hit.
[2023-03-18 19:12:10] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-18 19:12:10] [INFO ] Invariant cache hit.
[2023-03-18 19:12:10] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
[2023-03-18 19:12:10] [INFO ] Invariant cache hit.
[2023-03-18 19:12:11] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 544 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, p0, p0, p0]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (LT s122 1) (LT s63 1) (LT s126 1) (LT s67 1) (LT s70 1) (LT s74 1) (LT s78 1) (LT s81 1) (LT s85 1) (LT s89 1) (LT s92 1) (LT s96 1) (LT s40 1) (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-14 finished in 731 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(p0)||F(p1)))))'
[2023-03-18 19:12:11] [INFO ] Flatten gal took : 31 ms
[2023-03-18 19:12:11] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 5 ms.
[2023-03-18 19:12:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 210 transitions and 800 arcs took 3 ms.
Total runtime 27978 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT SharedMemory-COL-000010
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/370
LTLFireability

FORMULA SharedMemory-COL-000010-LTLFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679166732647

--------------------
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'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/370/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/370/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/370/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 SharedMemory-COL-000010-LTLFireability-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for SharedMemory-COL-000010-LTLFireability-00
lola: result : true
lola: markings : 1913
lola: fired transitions : 2190
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
SharedMemory-COL-000010-LTLFireability-00: LTL true LTL model checker


Time elapsed: 0 secs. Pages in use: 1

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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