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.r201-smll-167840347400180.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 ltsminxred
Input is GlobalResAllocation-COL-06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-167840347400180
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 9.3K Feb 25 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.2K Feb 25 16:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 17K Feb 25 16:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 16:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 25 16:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 16:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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-06-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678617029663

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-COL-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 10:30:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 10:30:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 10:30:32] [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-12 10:30:32] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-12 10:30:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1102 ms
[2023-03-12 10:30:33] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 102 PT places and 136662.0 transition bindings in 42 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2023-03-12 10:30:33] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 6 ms.
[2023-03-12 10:30:33] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GlobalResAllocation-COL-06-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
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 12
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2023-03-12 10:30:33] [INFO ] Unfolded HLPN to a Petri net with 25 places and 42 transitions 174 arcs in 17 ms.
[2023-03-12 10:30:33] [INFO ] Unfolded 15 HLPN properties in 1 ms.
Initial state reduction rules removed 3 formulas.
FORMULA GlobalResAllocation-COL-06-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-06-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 42/42 transitions.
Reduce isomorphic (modulo) transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 25 transition count 36
Applied a total of 12 rules in 11 ms. Remains 25 /25 variables (removed 0) and now considering 36/42 (removed 6) transitions.
// Phase 1: matrix 36 rows 25 cols
[2023-03-12 10:30:34] [INFO ] Computed 13 place invariants in 7 ms
[2023-03-12 10:30:34] [INFO ] Dead Transitions using invariants and state equation in 293 ms found 0 transitions.
[2023-03-12 10:30:34] [INFO ] Invariant cache hit.
[2023-03-12 10:30:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-12 10:30:34] [INFO ] Invariant cache hit.
[2023-03-12 10:30:34] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
[2023-03-12 10:30:34] [INFO ] Invariant cache hit.
[2023-03-12 10:30:34] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 25/25 places, 36/42 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 564 ms. Remains : 25/25 places, 36/42 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-12 10:30:34] [INFO ] Flatten gal took : 48 ms
[2023-03-12 10:30:34] [INFO ] Flatten gal took : 43 ms
[2023-03-12 10:30:35] [INFO ] Input system was already deterministic with 36 transitions.
Finished random walk after 1186 steps, including 0 resets, run visited all 14 properties in 123 ms. (steps per millisecond=9 )
FORMULA GlobalResAllocation-COL-06-LTLFireability-01 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' '!(((!p0&&G(!p1)) U G(!p2)))'
Support contains 13 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Applied a total of 0 rules in 7 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 19 cols
[2023-03-12 10:30:36] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 10:30:36] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
[2023-03-12 10:30:36] [INFO ] Invariant cache hit.
[2023-03-12 10:30:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-12 10:30:36] [INFO ] Invariant cache hit.
[2023-03-12 10:30:36] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 110 ms to find 0 implicit places.
[2023-03-12 10:30:36] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 10:30:36] [INFO ] Invariant cache hit.
[2023-03-12 10:30:36] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 392 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 383 ms :[p2, true, p1, p2]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p2 p0) (AND p2 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(OR (GEQ s13 4) (GEQ s14 4) (GEQ s15 4) (GEQ s16 4) (GEQ s17 4) (GEQ s18 4)), p0:(OR (AND (GEQ s0 1) (GEQ s6 2)) (AND (GEQ s5 1) (GEQ s6 2)) (AND (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 2 ms.
FORMULA GlobalResAllocation-COL-06-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-06-LTLFireability-00 finished in 881 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((X((F(p1)&&F(G(p2))))||p0)))'
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Applied a total of 0 rules in 4 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
[2023-03-12 10:30:37] [INFO ] Invariant cache hit.
[2023-03-12 10:30:37] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2023-03-12 10:30:37] [INFO ] Invariant cache hit.
[2023-03-12 10:30:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-12 10:30:37] [INFO ] Invariant cache hit.
[2023-03-12 10:30:37] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2023-03-12 10:30:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-12 10:30:37] [INFO ] Invariant cache hit.
[2023-03-12 10:30:37] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 188 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 186 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s6 4)) (AND (GEQ s2 1) (GEQ s6 4)) (AND (GEQ s0 1) (GEQ s6 4)) (AND (GEQ s1 1) (GEQ s6 4)) (AND (GEQ s3 1) (GEQ s6 4)) (AND (G...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 433 ms.
Stack based approach found an accepted trace after 62 steps with 2 reset with depth 43 and stack size 43 in 2 ms.
FORMULA GlobalResAllocation-COL-06-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLFireability-02 finished in 834 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(F(!p0)) U (G(!p1) U p2)))))'
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 25 cols
[2023-03-12 10:30:37] [INFO ] Computed 13 place invariants in 2 ms
[2023-03-12 10:30:37] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
[2023-03-12 10:30:37] [INFO ] Invariant cache hit.
[2023-03-12 10:30:38] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-12 10:30:38] [INFO ] Invariant cache hit.
[2023-03-12 10:30:38] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2023-03-12 10:30:38] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 10:30:38] [INFO ] Invariant cache hit.
[2023-03-12 10:30:38] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 25/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 385 ms :[(NOT p2), (AND (NOT p2) p1 p0), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 4}], [{ cond=(AND p2 (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=1 dest: 1}, { cond=(AND p2 p1 p0), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=1 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0, 1} source=4 dest: 2}, { cond=(OR (AND p2 p0) (AND (NOT p1) p0)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p2) p1 p0), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s8 2) (GEQ s14 2)) (AND (GEQ s9 2) (GEQ s15 2)) (AND (GEQ s12 2) (GEQ s18 2)) (AND (GEQ s7 2) (GEQ s13 2)) (AND (GEQ s10 2) (GEQ s16 2)) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 3920 reset in 332 ms.
Product exploration explored 100000 steps with 3802 reset in 339 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) p1 p0), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2))]
Knowledge based reduction with 12 factoid took 1276 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter insensitive) to 5 states, 18 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 356 ms :[(NOT p2), (AND p1 (NOT p2) p0), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 8) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 10:30:41] [INFO ] Invariant cache hit.
[2023-03-12 10:30:41] [INFO ] After 199ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (OR (AND p0 (NOT p1)) (AND p0 p2)))]
Knowledge based reduction with 14 factoid took 1543 ms. Reduced automaton from 5 states, 18 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 294 ms :[(NOT p2), (NOT p2)]
[2023-03-12 10:30:43] [INFO ] Invariant cache hit.
Proved EG (NOT p2)
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT (AND p2 (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT (AND p2 p1 p0))), (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p1) p0)))), (X (X (NOT (AND p2 p1 p0)))), (X (X (NOT (OR (AND p2 p0) (AND (NOT p1) p0))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (NOT (AND p0 (NOT p1) p2))), (G (NOT (AND p0 p1 p2)))]
False Knowledge obtained : [(X (AND (NOT p2) p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X p2), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p1 p0))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p2))), (X (X p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p1 (NOT p2)))), (F p2), (F (OR (AND p0 (NOT p1)) (AND p0 p2))), (G (NOT p2))]
Property proved to be false thanks to negative knowledge :(G (NOT p2))
Knowledge based reduction with 14 factoid took 992 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-06-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-06-LTLFireability-03 finished in 6684 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((G(p1)||p0)) U (X(p3)||p2))))'
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-12 10:30:44] [INFO ] Invariant cache hit.
[2023-03-12 10:30:44] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
[2023-03-12 10:30:44] [INFO ] Invariant cache hit.
[2023-03-12 10:30:44] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 10:30:44] [INFO ] Invariant cache hit.
[2023-03-12 10:30:44] [INFO ] Implicit Places using invariants and state equation in 77 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
[2023-03-12 10:30:44] [INFO ] Invariant cache hit.
[2023-03-12 10:30:44] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 25/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 438 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 6}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3))), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p0) p1 (NOT p3)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND p1 (NOT p3)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={} source=5 dest: 7}, { cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=p0, acceptance={} source=8 dest: 8}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s6 2)) (AND (GEQ s5 1) (GEQ s6 2)) (AND (GEQ s4 1) (GEQ s6 2)) (AND (GEQ s1 1) (GEQ s6 2)) (AND (GEQ s2 1) (GEQ s6 2)) (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, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 214 ms.
Product exploration explored 100000 steps with 50000 reset in 224 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 p0 p1 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1)))), (X (NOT (AND (NOT p2) (NOT p0) p1))), (X (NOT (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p2) p0 (NOT p3)) (AND (NOT p2) p1 (NOT p3)))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1 (NOT p3)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p3)))), (X (X (NOT (AND p1 (NOT p3))))), (X (X (NOT p3))), (X (X p3)), (X (X (AND p0 (NOT p3)))), (X (X (NOT (AND p0 (NOT p3)))))]
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p2) p0) (AND (NOT p2) p1))))
Knowledge based reduction with 12 factoid took 543 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-06-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-06-LTLFireability-04 finished in 1694 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 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 19 transition count 36
Applied a total of 6 rules in 1 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 19 cols
[2023-03-12 10:30:46] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-12 10:30:46] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
[2023-03-12 10:30:46] [INFO ] Invariant cache hit.
[2023-03-12 10:30:46] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-12 10:30:46] [INFO ] Invariant cache hit.
[2023-03-12 10:30:46] [INFO ] Implicit Places using invariants and state equation in 67 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2023-03-12 10:30:46] [INFO ] Invariant cache hit.
[2023-03-12 10:30:46] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 19/25 places, 36/36 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 167 ms :[true, p0, p0, p0]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-05 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:(OR (AND (GEQ s0 1) (GEQ s6 2)) (AND (GEQ s5 1) (GEQ s6 2)) (AND (GEQ s4 1) (GEQ s6 2)) (AND (GEQ s1 1) (GEQ s6 2)) (AND (GEQ s2 1) (GEQ s6 2)) (AND (G...], 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 2 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-06-LTLFireability-05 finished in 533 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)&&X(F(p1))))'
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 25 cols
[2023-03-12 10:30:46] [INFO ] Computed 13 place invariants in 3 ms
[2023-03-12 10:30:46] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
[2023-03-12 10:30:46] [INFO ] Invariant cache hit.
[2023-03-12 10:30:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2023-03-12 10:30:46] [INFO ] Invariant cache hit.
[2023-03-12 10:30:47] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 131 ms to find 0 implicit places.
[2023-03-12 10:30:47] [INFO ] Invariant cache hit.
[2023-03-12 10:30:47] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 25/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s0 1) (GEQ s6 3)) (AND (GEQ s5 1) (GEQ s6 3)) (AND (GEQ s4 1) (GEQ s6 3)) (AND (GEQ s1 1) (GEQ s6 3)) (AND (GEQ s2 1) (GEQ s6 3)) (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][false, false, false]]
Product exploration explored 100000 steps with 42224 reset in 212 ms.
Stack based approach found an accepted trace after 1035 steps with 423 reset with depth 4 and stack size 4 in 4 ms.
FORMULA GlobalResAllocation-COL-06-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLFireability-08 finished in 658 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)||X((G(p2)||(X(p0)&&p3)))))'
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 36/36 (removed 0) transitions.
[2023-03-12 10:30:47] [INFO ] Invariant cache hit.
[2023-03-12 10:30:47] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2023-03-12 10:30:47] [INFO ] Invariant cache hit.
[2023-03-12 10:30:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-12 10:30:47] [INFO ] Invariant cache hit.
[2023-03-12 10:30:47] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2023-03-12 10:30:47] [INFO ] Invariant cache hit.
[2023-03-12 10:30:47] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 174 ms. Remains : 25/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 426 ms :[true, (OR (NOT p0) p1), (OR (AND (NOT p0) p1 (NOT p2)) (AND p1 (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (OR (AND p1 (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p0), (AND (NOT p2) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 6}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=3 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p2) p3), acceptance={} source=3 dest: 9}, { cond=(AND p2 p3), acceptance={} source=3 dest: 10}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 0}, { cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2) (NOT p3)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) p0 p2 (NOT p3)), acceptance={} source=4 dest: 7}, { cond=(AND p1 p0 p2 (NOT p3)), acceptance={} source=4 dest: 8}, { cond=(AND (NOT p2) p3), acceptance={} source=4 dest: 9}, { cond=(AND p2 p3), acceptance={} source=4 dest: 10}], [{ cond=(NOT p2), acceptance={} source=5 dest: 0}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 0}, { cond=p0, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 6}, { cond=(AND p0 p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=8 dest: 7}, { cond=(AND p1 p0 p2), acceptance={} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 0}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=10 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=10 dest: 5}]], initial=2, aps=[p0:(OR (AND (GEQ s8 2) (GEQ s14 2)) (AND (GEQ s9 2) (GEQ s15 2)) (AND (GEQ s12 2) (GEQ s18 2)) (AND (GEQ s7 2) (GEQ s13 2)) (AND (GEQ s10 2) (GEQ s16 2)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-06-LTLFireability-09 finished in 627 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 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Applied a total of 0 rules in 2 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 19 cols
[2023-03-12 10:30:48] [INFO ] Computed 7 place invariants in 3 ms
[2023-03-12 10:30:48] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2023-03-12 10:30:48] [INFO ] Invariant cache hit.
[2023-03-12 10:30:48] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-03-12 10:30:48] [INFO ] Invariant cache hit.
[2023-03-12 10:30:48] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-03-12 10:30:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 10:30:48] [INFO ] Invariant cache hit.
[2023-03-12 10:30:48] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 108 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-10 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 s0 1) (GEQ s6 2)) (AND (GEQ s5 1) (GEQ s6 2)) (AND (GEQ s4 1) (GEQ s6 2)) (AND (GEQ s1 1) (GEQ s6 2)) (AND (GEQ s2 1) (GEQ s6 2)) (AND (G...], 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 206 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 80 in 1 ms.
FORMULA GlobalResAllocation-COL-06-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLFireability-10 finished in 488 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 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Applied a total of 0 rules in 5 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
[2023-03-12 10:30:48] [INFO ] Invariant cache hit.
[2023-03-12 10:30:48] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
[2023-03-12 10:30:48] [INFO ] Invariant cache hit.
[2023-03-12 10:30:48] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-12 10:30:48] [INFO ] Invariant cache hit.
[2023-03-12 10:30:48] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
[2023-03-12 10:30:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 10:30:48] [INFO ] Invariant cache hit.
[2023-03-12 10:30:48] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s5 1) (GEQ s6 4)) (AND (GEQ s2 1) (GEQ s6 4)) (AND (GEQ s0 1) (GEQ s6 4)) (AND (GEQ s1 1) (GEQ s6 4)) (AND (GEQ s3 1) (GEQ s6 4)) (AND (G...], 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 7094 reset in 300 ms.
Stack based approach found an accepted trace after 83 steps with 5 reset with depth 12 and stack size 12 in 0 ms.
FORMULA GlobalResAllocation-COL-06-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLFireability-13 finished in 692 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 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Ensure Unique test removed 6 places
Applied a total of 0 rules in 2 ms. Remains 19 /25 variables (removed 6) and now considering 36/36 (removed 0) transitions.
[2023-03-12 10:30:49] [INFO ] Invariant cache hit.
[2023-03-12 10:30:49] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
[2023-03-12 10:30:49] [INFO ] Invariant cache hit.
[2023-03-12 10:30:49] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-12 10:30:49] [INFO ] Invariant cache hit.
[2023-03-12 10:30:49] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2023-03-12 10:30:49] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-12 10:30:49] [INFO ] Invariant cache hit.
[2023-03-12 10:30:49] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 19/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 64 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-14 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 s0 1) (GEQ s6 2)) (AND (GEQ s5 1) (GEQ s6 2)) (AND (GEQ s4 1) (GEQ s6 2)) (AND (GEQ s1 1) (GEQ s6 2)) (AND (GEQ s2 1) (GEQ s6 2)) (AND (G...], 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 255 ms.
Stack based approach found an accepted trace after 15 steps with 0 reset with depth 16 and stack size 16 in 1 ms.
FORMULA GlobalResAllocation-COL-06-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLFireability-14 finished in 609 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(p2)||p1))))'
Support contains 19 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 36/36 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 36/36 (removed 0) transitions.
// Phase 1: matrix 36 rows 25 cols
[2023-03-12 10:30:49] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 10:30:50] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
[2023-03-12 10:30:50] [INFO ] Invariant cache hit.
[2023-03-12 10:30:50] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-12 10:30:50] [INFO ] Invariant cache hit.
[2023-03-12 10:30:50] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 99 ms to find 0 implicit places.
[2023-03-12 10:30:50] [INFO ] Invariant cache hit.
[2023-03-12 10:30:50] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 25/25 places, 36/36 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : GlobalResAllocation-COL-06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (LT s5 1) (LT s6 1)) (OR (LT s0 1) (LT s6 1)) (OR (LT s1 1) (LT s6 1)) (OR (LT s3 1) (LT s6 1)) (OR (LT s4 1) (LT s6 1)) (OR (LT s2 1) (LT s6 ...], 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 11363 reset in 359 ms.
Stack based approach found an accepted trace after 46 steps with 6 reset with depth 7 and stack size 7 in 1 ms.
FORMULA GlobalResAllocation-COL-06-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-06-LTLFireability-15 finished in 876 ms.
All properties solved by simple procedures.
Total runtime 18372 ms.
ITS solved all properties within timeout

BK_STOP 1678617051944

--------------------
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

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-06"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is GlobalResAllocation-COL-06, 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 r201-smll-167840347400180"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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