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

About the Execution of LoLa+red for GlobalResAllocation-COL-07

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
384.336 39800.00 56796.00 1702.50 FFFFFFFFTTFFFFTF 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.r199-smll-167840345600188.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 GlobalResAllocation-COL-07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840345600188
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 8.2K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 25 16:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 28K Mar 5 18:22 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 GlobalResAllocation-COL-07-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678488801152

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=GlobalResAllocation-COL-07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-10 22:53:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-10 22:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 22:53:24] [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-10 22:53:25] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-10 22:53:25] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 901 ms
[2023-03-10 22:53:25] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 133 PT places and 291067.0 transition bindings in 21 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
[2023-03-10 22:53:26] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 6 ms.
[2023-03-10 22:53:26] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 9 ms. (steps per millisecond=0 )
[2023-03-10 22:53:26] [INFO ] Flatten gal took : 22 ms
[2023-03-10 22:53:26] [INFO ] Flatten gal took : 3 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :Res
Symmetric sort wr.t. initial detected :Res
Symmetric sort wr.t. initial and guards detected :Res
Applying symmetric unfolding of full symmetric sort :Res domain size was 14
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2023-03-10 22:53:26] [INFO ] Unfolded HLPN to a Petri net with 29 places and 49 transitions 203 arcs in 15 ms.
[2023-03-10 22:53:26] [INFO ] Unfolded 16 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GlobalResAllocation-COL-07-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 49/49 transitions.
Reduce isomorphic (modulo) transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 29 transition count 42
Applied a total of 14 rules in 9 ms. Remains 29 /29 variables (removed 0) and now considering 42/49 (removed 7) transitions.
// Phase 1: matrix 42 rows 29 cols
[2023-03-10 22:53:26] [INFO ] Computed 15 place invariants in 13 ms
[2023-03-10 22:53:26] [INFO ] Dead Transitions using invariants and state equation in 354 ms found 0 transitions.
[2023-03-10 22:53:26] [INFO ] Invariant cache hit.
[2023-03-10 22:53:26] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-10 22:53:26] [INFO ] Invariant cache hit.
[2023-03-10 22:53:26] [INFO ] Implicit Places using invariants and state equation in 87 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2023-03-10 22:53:26] [INFO ] Invariant cache hit.
[2023-03-10 22:53:26] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/29 places, 42/49 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 654 ms. Remains : 29/29 places, 42/49 transitions.
Support contains 29 out of 29 places after structural reductions.
[2023-03-10 22:53:26] [INFO ] Flatten gal took : 27 ms
[2023-03-10 22:53:27] [INFO ] Flatten gal took : 23 ms
[2023-03-10 22:53:27] [INFO ] Input system was already deterministic with 42 transitions.
Finished random walk after 273 steps, including 0 resets, run visited all 15 properties in 49 ms. (steps per millisecond=5 )
FORMULA GlobalResAllocation-COL-07-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(F(p0)))))&&F(p1)))'
Support contains 22 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:27] [INFO ] Invariant cache hit.
[2023-03-10 22:53:27] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
[2023-03-10 22:53:27] [INFO ] Invariant cache hit.
[2023-03-10 22:53:27] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 22:53:27] [INFO ] Invariant cache hit.
[2023-03-10 22:53:28] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
[2023-03-10 22:53:28] [INFO ] Invariant cache hit.
[2023-03-10 22:53:28] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 474 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (AND (GEQ s5 1) (GEQ s7 2)) (AND (GEQ s0 1) (GEQ s7 2)) (AND (GEQ s1 1) (GEQ s7 2)) (AND (GEQ s6 1) (GEQ s7 2)) (AND (GEQ s3 1) (GEQ s7 2)) (AND (G...], 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, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23 reset in 495 ms.
Stack based approach found an accepted trace after 383 steps with 0 reset with depth 384 and stack size 384 in 2 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-00 finished in 1298 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 14 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 7 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:29] [INFO ] Invariant cache hit.
[2023-03-10 22:53:29] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
[2023-03-10 22:53:29] [INFO ] Invariant cache hit.
[2023-03-10 22:53:29] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-10 22:53:29] [INFO ] Invariant cache hit.
[2023-03-10 22:53:29] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-10 22:53:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:53:29] [INFO ] Invariant cache hit.
[2023-03-10 22:53:29] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 312 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (OR (LT s8 1) (LT s15 1)) (OR (LT s12 1) (LT s19 1)) (OR (LT s10 1) (LT s17 1)) (OR (LT s14 1) (LT s21 1)) (OR (LT s9 1) (LT s16 1)) (OR (LT s11 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 48 reset in 401 ms.
Stack based approach found an accepted trace after 42 steps with 4 reset with depth 33 and stack size 33 in 1 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-01 finished in 899 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 22 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 5 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:30] [INFO ] Invariant cache hit.
[2023-03-10 22:53:30] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
[2023-03-10 22:53:30] [INFO ] Invariant cache hit.
[2023-03-10 22:53:30] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-10 22:53:30] [INFO ] Invariant cache hit.
[2023-03-10 22:53:30] [INFO ] Implicit Places using invariants and state equation in 72 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-10 22:53:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:53:30] [INFO ] Invariant cache hit.
[2023-03-10 22:53:30] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 336 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s12 2) (LT s19 2)) (OR (LT s13 2) (LT s20 2)) (OR (LT s8 2) (LT s15 2)) (OR (LT s9 2) (LT s16 2)) (OR (LT s11 2) (LT s18 2)) (OR (LT s14 2...], 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 394 ms.
Stack based approach found an accepted trace after 79 steps with 0 reset with depth 80 and stack size 80 in 1 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-02 finished in 820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(G((p1 U p2)))))'
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:30] [INFO ] Invariant cache hit.
[2023-03-10 22:53:30] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
[2023-03-10 22:53:30] [INFO ] Invariant cache hit.
[2023-03-10 22:53:30] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-10 22:53:30] [INFO ] Invariant cache hit.
[2023-03-10 22:53:31] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-10 22:53:31] [INFO ] Invariant cache hit.
[2023-03-10 22:53:31] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 233 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p2), (NOT p0), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(OR (NOT (AND (OR (AND (GEQ s8 1) (GEQ s15 1)) (AND (GEQ s12 1) (GEQ s19 1)) (AND (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s14 1) (GEQ s21 1)) (AND (GEQ s9 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 7460 reset in 546 ms.
Stack based approach found an accepted trace after 2678 steps with 199 reset with depth 14 and stack size 14 in 21 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-03 finished in 1005 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)) U G(p1)))'
Support contains 15 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 3 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 22 cols
[2023-03-10 22:53:31] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-10 22:53:31] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
[2023-03-10 22:53:31] [INFO ] Invariant cache hit.
[2023-03-10 22:53:31] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-10 22:53:31] [INFO ] Invariant cache hit.
[2023-03-10 22:53:32] [INFO ] Implicit Places using invariants and state equation in 63 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2023-03-10 22:53:32] [INFO ] Invariant cache hit.
[2023-03-10 22:53:32] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 262 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), true, (AND (NOT p1) p0)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-04 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=p1, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (GEQ s15 4) (GEQ s16 4) (GEQ s17 4) (GEQ s18 4) (GEQ s19 4) (GEQ s20 4) (GEQ s21 4)), p0:(OR (AND (GEQ s5 1) (GEQ s7 2)) (AND (GEQ s0 1) (GEQ s7 2)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 168 steps with 58 reset in 1 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-04 finished in 542 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)&&G(p1))))'
Support contains 22 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 29 cols
[2023-03-10 22:53:32] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 22:53:32] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2023-03-10 22:53:32] [INFO ] Invariant cache hit.
[2023-03-10 22:53:32] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-10 22:53:32] [INFO ] Invariant cache hit.
[2023-03-10 22:53:32] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2023-03-10 22:53:32] [INFO ] Invariant cache hit.
[2023-03-10 22:53:32] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 175 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (AND (GEQ s5 1) (GEQ s7 2)) (AND (GEQ s0 1) (GEQ s7 2)) (AND (GEQ s1 1) (GEQ s7 2)) (AND (GEQ s6 1) (GEQ s7 2)) (AND (GEQ s3 1) (GEQ s7 2)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 5 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-05 finished in 442 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 22 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:32] [INFO ] Invariant cache hit.
[2023-03-10 22:53:32] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
[2023-03-10 22:53:32] [INFO ] Invariant cache hit.
[2023-03-10 22:53:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-10 22:53:32] [INFO ] Invariant cache hit.
[2023-03-10 22:53:32] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-10 22:53:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 22:53:33] [INFO ] Invariant cache hit.
[2023-03-10 22:53:33] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s12 2) (GEQ s19 2)) (AND (GEQ s13 2) (GEQ s20 2)) (AND (GEQ s8 2) (GEQ s15 2)) (AND (GEQ s9 2) (GEQ s16 2)) (AND (GEQ s11 2) (GEQ s18 2))...], nbAcceptance=3, 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 931 ms.
Stack based approach found an accepted trace after 389 steps with 0 reset with depth 390 and stack size 387 in 3 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-06 finished in 1284 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) U (p1 U p2))))'
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 0 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:34] [INFO ] Invariant cache hit.
[2023-03-10 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-10 22:53:34] [INFO ] Invariant cache hit.
[2023-03-10 22:53:34] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-10 22:53:34] [INFO ] Invariant cache hit.
[2023-03-10 22:53:34] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
[2023-03-10 22:53:34] [INFO ] Invariant cache hit.
[2023-03-10 22:53:34] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 175 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p2), (NOT p2), true, (NOT p0), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s7 3)) (AND (GEQ s5 1) (GEQ s7 3)) (AND (GEQ s6 1) (GEQ s7 3)) (AND (GEQ s4 1) (GEQ s7 3)) (AND (GEQ s1 1) (GEQ s7 3)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 363 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 p2 (NOT p0) (NOT p1)), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p0)))), true, (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) p1 (NOT p0))))
Knowledge based reduction with 12 factoid took 269 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-07-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-07-LTLFireability-08 finished in 1278 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' '!(((!p0||(!p1 U (G(!p1)||(!p1&&(!p2||F(!p0)))))) U (p0 U p2)))'
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:35] [INFO ] Invariant cache hit.
[2023-03-10 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-03-10 22:53:35] [INFO ] Invariant cache hit.
[2023-03-10 22:53:35] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-10 22:53:35] [INFO ] Invariant cache hit.
[2023-03-10 22:53:35] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-10 22:53:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 22:53:35] [INFO ] Invariant cache hit.
[2023-03-10 22:53:35] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p2), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(OR (GEQ s22 4) (GEQ s23 4) (GEQ s24 4) (GEQ s25 4) (GEQ s26 4) (GEQ s27 4) (GEQ s28 4)), p0:(OR (AND (GEQ s8 1) (GEQ s15 1)) (AND (GEQ s12 1) (GEQ s19...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 10361 reset in 418 ms.
Product exploration explored 100000 steps with 10286 reset in 1035 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) p0)), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1))))]
Knowledge based reduction with 8 factoid took 427 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[true, (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=0 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (AND (NOT p2) p0)), (X (AND (NOT p2) p0 p1)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND (NOT p2) p0 p1))), (X (X (NOT (AND (NOT p2) p0 p1)))), (F (AND p0 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 687 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p2), (NOT p2)]
[2023-03-10 22:53:38] [INFO ] Invariant cache hit.
[2023-03-10 22:53:38] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-10 22:53:38] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 9 ms returned sat
[2023-03-10 22:53:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:53:38] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-10 22:53:38] [INFO ] Computed and/alt/rep : 14/84/14 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 22:53:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:53:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-10 22:53:39] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 12 ms returned sat
[2023-03-10 22:53:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:53:39] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-10 22:53:39] [INFO ] Computed and/alt/rep : 14/84/14 causal constraints (skipped 0 transitions) in 27 ms.
[2023-03-10 22:53:39] [INFO ] Added : 8 causal constraints over 2 iterations in 65 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:39] [INFO ] Invariant cache hit.
[2023-03-10 22:53:39] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
[2023-03-10 22:53:39] [INFO ] Invariant cache hit.
[2023-03-10 22:53:39] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-10 22:53:39] [INFO ] Invariant cache hit.
[2023-03-10 22:53:39] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
[2023-03-10 22:53:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:53:39] [INFO ] Invariant cache hit.
[2023-03-10 22:53:39] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 265 ms. Remains : 29/29 places, 42/42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1))))]
Knowledge based reduction with 8 factoid took 578 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p2), (NOT p2)]
Finished random walk after 1 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (X (AND p0 (NOT p2) p1)), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (AND p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2) p1)))), (F (AND p0 (NOT p2))), (F (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p0 (NOT p2) p1))]
Knowledge based reduction with 8 factoid took 697 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 157 ms :[true, (NOT p2), (NOT p2)]
[2023-03-10 22:53:41] [INFO ] Invariant cache hit.
[2023-03-10 22:53:41] [INFO ] [Real]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-10 22:53:41] [INFO ] [Real]Absence check using 8 positive and 7 generalized place invariants in 11 ms returned sat
[2023-03-10 22:53:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 22:53:41] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-10 22:53:41] [INFO ] Computed and/alt/rep : 14/84/14 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-10 22:53:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 22:53:41] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-10 22:53:41] [INFO ] [Nat]Absence check using 8 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-10 22:53:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 22:53:41] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-10 22:53:41] [INFO ] Computed and/alt/rep : 14/84/14 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-10 22:53:41] [INFO ] Added : 8 causal constraints over 2 iterations in 38 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10287 reset in 566 ms.
Product exploration explored 100000 steps with 10307 reset in 426 ms.
Support contains 29 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:42] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2023-03-10 22:53:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 207 ms. Remains : 29/29 places, 42/42 transitions.
Treatment of property GlobalResAllocation-COL-07-LTLFireability-09 finished in 7868 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((X(p0) U (G(p2)||p1))))))'
Support contains 15 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 22 cols
[2023-03-10 22:53:43] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-10 22:53:43] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 202 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 311 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p0)), true, (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 6}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(OR (GEQ s15 4) (GEQ s16 4) (GEQ s17 4) (GEQ s18 4) (GEQ s19 4) (GEQ s20 4) (GEQ s21 4)), p2:(OR (AND (GEQ s5 1) (GEQ s7 2)) (AND (GEQ s0 1) (GEQ s7 2)...], nbAcceptance=1, 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 7 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-10 finished in 544 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((X(p1)&&p0))||(G(!p2)&&X(p1)&&(p3||G(p4))))))'
Support contains 15 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
[2023-03-10 22:53:43] [INFO ] Invariant cache hit.
[2023-03-10 22:53:43] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 149 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 530 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) p2)), (NOT p1), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (OR (AND (NOT p0) (NOT p3) (NOT p4)) (AND (NOT p0) p2 (NOT p4)) (AND (NOT p1) (NOT p4))), (AND (NOT p1) (NOT p4)), (OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p1) p2 (NOT p4)))]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND p0 p2 p1) (AND p0 (NOT p3) (NOT p4) p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p3) (NOT p4)) (AND p2 (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2) p3 p1) (AND p0 (NOT p2) p4 p1)), acceptance={0, 1} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))), acceptance={0, 1, 2} source=0 dest: 1}, { cond=(OR (AND p0 (NOT p2) p3 p1) (AND p0 (NOT p2) p4 p1)), acceptance={1} source=0 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p2) p4) (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))), acceptance={1, 2} source=0 dest: 2}, { cond=(AND p0 (NOT p2) (NOT p3) p4 p1), acceptance={0} source=0 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p3) p4) (AND (NOT p2) (NOT p3) p4 (NOT p1))), acceptance={0, 2} source=0 dest: 3}], [{ cond=(OR (AND p2 (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=1 dest: 0}, { cond=(OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p3 (NOT p1)) (AND (NOT p2) p4 (NOT p1))), acceptance={1, 2} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p3) p4 (NOT p1)), acceptance={0, 2} source=1 dest: 3}], [{ cond=(AND p0 p2 p1), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={1} source=2 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={1, 2} source=2 dest: 2}], [{ cond=(OR (AND p0 p2 (NOT p4) p1) (AND p0 (NOT p3) (NOT p4) p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p4)) (AND (NOT p0) (NOT p3) (NOT p4)) (AND p2 (NOT p4) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=3 dest: 0}, { cond=(AND p0 (NOT p2) p3 (NOT p4) p1), acceptance={0, 1} source=3 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p3 (NOT p4) p1), acceptance={1} source=3 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2) p3 (NOT p4)) (AND (NOT p2) p3 (NOT p4) (NOT p1))), acceptance={1, 2} source=3 dest: 2}, { cond=(OR (AND p0 p2 p4 p1) (AND p0 (NOT p3) p4 p1)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) p2 p4) (AND (NOT p0) (NOT p3) p4) (AND p2 p4 (NOT p1)) (AND (NOT p3) p4 (NOT p1))), acceptance={0, 2} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p3 p4 p1), acceptance={0} source=3 dest: 4}, { cond=(OR (AND (NOT p0) (NOT p2) p3 p4) (AND (NOT p2) p3 p4 (NOT p1))), acceptance={0, 2} source=3 dest: 4}, { cond=(AND p0 (NOT p2) p3 p4 p1), acceptance={} source=3 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) p3 p4) (AND (NOT p2) p3 p4 (NOT p1))), acceptance={2} source=3 dest: 5}], [{ cond=(OR (AND p2 (NOT p4) (NOT p1)) (AND (NOT p3) (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=4 dest: 0}, { cond=(AND (NOT p2) p3 (NOT p4) (NOT p1)), acceptance={0, 1, 2} source=4 dest: 1}, { cond=(AND (NOT p2) p3 (NOT p4) (NOT p1)), acceptance={1, 2} source=4 dest: 2}, { cond=(OR (AND p2 p4 (NOT p1)) (AND (NOT p3) p4 (NOT p1))), acceptance={0, 2} source=4 dest: 3}, { cond=(AND (NOT p2) p3 p4 (NOT p1)), acceptance={0, 2} source=4 dest: 4}, { cond=(AND (NOT p2) p3 p4 (NOT p1)), acceptance={2} source=4 dest: 5}], [{ cond=(AND p0 p2 (NOT p4) p1), acceptance={0, 1} source=5 dest: 0}, { cond=(OR (AND (NOT p0) p2 (NOT p4)) (AND p2 (NOT p4) (NOT p1))), acceptance={0, 1, 2} source=5 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p4) p1), acceptance={1} source=5 dest: 2}, { cond=(OR (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p2) (NOT p4) (NOT p1))), acceptance={1, 2} source=5 dest: 2}, { cond=(AND p0 p2 p4 p1), acceptance={0} source=5 dest: 3}, { cond=(OR (AND (NOT p0) p2 p4) (AND p2 p4 (NOT p1))), acceptance={0, 2} source=5 dest: 3}, { cond=(AND p0 (NOT p2) p4 p1), acceptance={} source=5 dest: 5}, { cond=(OR (AND (NOT p0) (NOT p2) p4) (AND (NOT p2) p4 (NOT p1))), acceptance={2} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (LT s5 1) (LT s7 2)) (OR (LT s0 1) (LT s7 2)) (OR (LT s1 1) (LT s7 2)) (OR (LT s6 1) (LT s7 2)) (OR (LT s3 1) (LT s7 2)) (OR (LT s4 1) (LT s7 ...], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5107 reset in 1168 ms.
Stack based approach found an accepted trace after 644 steps with 32 reset with depth 13 and stack size 13 in 6 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-11 finished in 1887 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(G(p0)))))'
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 2 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:45] [INFO ] Invariant cache hit.
[2023-03-10 22:53:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-10 22:53:45] [INFO ] Invariant cache hit.
[2023-03-10 22:53:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 22:53:45] [INFO ] Invariant cache hit.
[2023-03-10 22:53:45] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2023-03-10 22:53:45] [INFO ] Invariant cache hit.
[2023-03-10 22:53:45] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 154 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, true, (NOT p0), true]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (LT s0 1) (LT s7 4)) (OR (LT s5 1) (LT s7 4)) (OR (LT s6 1) (LT s7 4)) (OR (LT s4 1) (LT s7 4)) (OR (LT s1 1) (LT s7 4)) (OR (LT s2 1) (LT s7 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 2 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-13 finished in 292 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(p1)||p0)))'
Support contains 8 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Ensure Unique test removed 7 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 42
Applied a total of 7 rules in 1 ms. Remains 22 /29 variables (removed 7) and now considering 42/42 (removed 0) transitions.
[2023-03-10 22:53:45] [INFO ] Invariant cache hit.
[2023-03-10 22:53:46] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
[2023-03-10 22:53:46] [INFO ] Invariant cache hit.
[2023-03-10 22:53:46] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-10 22:53:46] [INFO ] Invariant cache hit.
[2023-03-10 22:53:46] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2023-03-10 22:53:46] [INFO ] Invariant cache hit.
[2023-03-10 22:53:46] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 22/29 places, 42/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 188 ms. Remains : 22/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-14 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 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (OR (LT s0 1) (LT s7 1)) (OR (LT s6 1) (LT s7 1)) (OR (LT s3 1) (LT s7 1)) (OR (LT s4 1) (LT s7 1)) (OR (LT s5 1) (LT s7 1)) (OR (LT s2 1) (LT s7 ...], 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]]
Product exploration explored 100000 steps with 50000 reset in 273 ms.
Product exploration explored 100000 steps with 50000 reset in 292 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 157 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-07-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-07-LTLFireability-14 finished in 1106 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 14 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 42/42 transitions.
Applied a total of 0 rules in 3 ms. Remains 29 /29 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 29 cols
[2023-03-10 22:53:47] [INFO ] Computed 15 place invariants in 2 ms
[2023-03-10 22:53:47] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
[2023-03-10 22:53:47] [INFO ] Invariant cache hit.
[2023-03-10 22:53:47] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-10 22:53:47] [INFO ] Invariant cache hit.
[2023-03-10 22:53:47] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2023-03-10 22:53:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 22:53:47] [INFO ] Invariant cache hit.
[2023-03-10 22:53:47] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 284 ms. Remains : 29/29 places, 42/42 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s12 2) (GEQ s19 2)) (AND (GEQ s13 2) (GEQ s20 2)) (AND (GEQ s8 2) (GEQ s15 2)) (AND (GEQ s9 2) (GEQ s16 2)) (AND (GEQ s11 2) (GEQ s18 2))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 42514 reset in 351 ms.
Stack based approach found an accepted trace after 4999 steps with 2080 reset with depth 5 and stack size 5 in 19 ms.
FORMULA GlobalResAllocation-COL-07-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-07-LTLFireability-15 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' '!(((!p0||(!p1 U (G(!p1)||(!p1&&(!p2||F(!p0)))))) U (p0 U p2)))'
[2023-03-10 22:53:48] [INFO ] Flatten gal took : 12 ms
[2023-03-10 22:53:48] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 4 ms.
[2023-03-10 22:53:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 29 places, 42 transitions and 175 arcs took 2 ms.
Total runtime 23413 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT GlobalResAllocation-COL-07
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA GlobalResAllocation-COL-07-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678488840952

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 GlobalResAllocation-COL-07-LTLFireability-09
lola: time limit : 3600 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
GlobalResAllocation-COL-07-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3600 2/32 GlobalResAllocation-COL-07-LTLFireability-09 275224 m, 55044 m/sec, 1817646 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
lola: FINISHED task # 1 (type EXCL) for GlobalResAllocation-COL-07-LTLFireability-09
lola: result : true
lola: markings : 482428
lola: fired transitions : 3790507
lola: time used : 9.000000
lola: memory pages used : 4
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
GlobalResAllocation-COL-07-LTLFireability-09: LTL true LTL model checker


Time elapsed: 9 secs. Pages in use: 4

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="GlobalResAllocation-COL-07"
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 GlobalResAllocation-COL-07, 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 r199-smll-167840345600188"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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