Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625500398.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is GlobalResAllocation-COL-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625500398
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 8.6K Apr 12 14:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 12 14:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Apr 12 14:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Apr 12 14:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 22:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 22:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 12 21:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 12 21:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:42 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 5 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 28K May 18 16:42 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-05-LTLFireability-00
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-01
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-02
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-03
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-04
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-05
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-06
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-07
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-08
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-09
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-10
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-11
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-12
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-13
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-14
FORMULA_NAME GlobalResAllocation-COL-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716555484886

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GlobalResAllocation-COL-05
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202304061127
[2024-05-24 12:58:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-24 12:58:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 12:58:06] [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.
[2024-05-24 12:58:06] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-24 12:58:06] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 430 ms
[2024-05-24 12:58:07] [INFO ] Imported 5 HL places and 7 HL transitions for a total of 75 PT places and 56105.0 transition bindings in 127 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
[2024-05-24 12:58:07] [INFO ] Built PT skeleton of HLPN with 5 places and 7 transitions 29 arcs in 5 ms.
[2024-05-24 12:58:07] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 6 properties that can be checked using skeleton over-approximation.
FORMULA GlobalResAllocation-COL-05-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Finished random walk after 6 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
[2024-05-24 12:58:07] [INFO ] Flatten gal took : 13 ms
[2024-05-24 12:58:07] [INFO ] Flatten gal took : 2 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 10
Transition release1 forces synchronizations/join behavior on parameter p of sort Proc
[2024-05-24 12:58:07] [INFO ] Unfolded HLPN to a Petri net with 21 places and 35 transitions 145 arcs in 8 ms.
[2024-05-24 12:58:07] [INFO ] Unfolded 15 HLPN properties in 0 ms.
Initial state reduction rules removed 3 formulas.
FORMULA GlobalResAllocation-COL-05-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-05-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GlobalResAllocation-COL-05-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 35/35 transitions.
Reduce isomorphic (modulo) transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 30
Applied a total of 10 rules in 6 ms. Remains 21 /21 variables (removed 0) and now considering 30/35 (removed 5) transitions.
// Phase 1: matrix 30 rows 21 cols
[2024-05-24 12:58:07] [INFO ] Computed 11 invariants in 3 ms
[2024-05-24 12:58:07] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
[2024-05-24 12:58:07] [INFO ] Invariant cache hit.
[2024-05-24 12:58:07] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-24 12:58:07] [INFO ] Invariant cache hit.
[2024-05-24 12:58:07] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2024-05-24 12:58:07] [INFO ] Invariant cache hit.
[2024-05-24 12:58:07] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 21/21 places, 30/35 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 234 ms. Remains : 21/21 places, 30/35 transitions.
Support contains 21 out of 21 places after structural reductions.
[2024-05-24 12:58:07] [INFO ] Flatten gal took : 7 ms
[2024-05-24 12:58:07] [INFO ] Flatten gal took : 6 ms
[2024-05-24 12:58:07] [INFO ] Input system was already deterministic with 30 transitions.
Finished random walk after 6 steps, including 0 resets, run visited all 12 properties in 18 ms. (steps per millisecond=0 )
Parikh walk visited 0 properties in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-07 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G((X(p2)||p1))&&p0)))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 12:58:07] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [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.
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 21/21 places, 30/30 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 294 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 1}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=3, aps=[p0:(AND (OR (LT s8 1) (LT s13 1)) (OR (LT s9 1) (LT s14 1)) (OR (LT s6 1) (LT s11 1)) (OR (LT s7 1) (LT s12 1)) (OR (LT s10 1) (LT s15 1))), p1:(OR (AND (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-00 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 127 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=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 s9 2) (GEQ s14 2)) (AND (GEQ s6 2) (GEQ s11 2)) (AND (GEQ s8 2) (GEQ s13 2)) (AND (GEQ s10 2) (GEQ s15 2)) (AND (GEQ s7 2) (GEQ s12 2)))], 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 144 steps with 0 reset in 8 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-01 finished in 398 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 1 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2024-05-24 12:58:08] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 12:58:08] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-24 12:58:08] [INFO ] Invariant cache hit.
[2024-05-24 12:58:08] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 138 ms. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LT s14 4) (LT s15 4) (LT s11 4) (LT s12 4) (LT s13 4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-03 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 1 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
[2024-05-24 12:58:09] [INFO ] Invariant cache hit.
[2024-05-24 12:58:09] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 12:58:09] [INFO ] Invariant cache hit.
[2024-05-24 12:58:09] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 12:58:09] [INFO ] Invariant cache hit.
[2024-05-24 12:58:09] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-24 12:58:09] [INFO ] Invariant cache hit.
[2024-05-24 12:58:09] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (OR (AND (GEQ s0 1) (GEQ s5 2)) (AND (GEQ s4 1) (GEQ s5 2)) (AND (GEQ s1 1) (GEQ s5 2)) (AND (GEQ s2 1) (GEQ s5 2)) (AND (GEQ s3 1) (GEQ s5 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][false, false, false]]
Product exploration explored 100000 steps with 21115 reset in 281 ms.
Stack based approach found an accepted trace after 616 steps with 140 reset with depth 5 and stack size 5 in 2 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-05 finished in 505 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 5 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2024-05-24 12:58:09] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 12:58:09] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
[2024-05-24 12:58:09] [INFO ] Invariant cache hit.
[2024-05-24 12:58:09] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 12:58:09] [INFO ] Invariant cache hit.
[2024-05-24 12:58:09] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-24 12:58:09] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:58:09] [INFO ] Invariant cache hit.
[2024-05-24 12:58:09] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 159 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s9 2) (GEQ s14 2)) (AND (GEQ s6 2) (GEQ s11 2)) (AND (GEQ s8 2) (GEQ s13 2)) (AND (GEQ s10 2) (GEQ s15 2)) (AND (GEQ s7 2) (GEQ s12 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 42209 reset in 159 ms.
Stack based approach found an accepted trace after 1312 steps with 562 reset with depth 3 and stack size 3 in 3 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-06 finished in 378 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U G((!p1&&X((G(!p1)||X(X(X(F(!p0))))))))))'
Support contains 16 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 12:58:10] [INFO ] Invariant cache hit.
[2024-05-24 12:58:10] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
[2024-05-24 12:58:10] [INFO ] Invariant cache hit.
[2024-05-24 12:58:10] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-24 12:58:10] [INFO ] Invariant cache hit.
[2024-05-24 12:58:10] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 12:58:10] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:58:10] [INFO ] Invariant cache hit.
[2024-05-24 12:58:10] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 601 ms :[p1, true, (AND (NOT p1) (NOT p0)), p1, (AND p1 p0), p0, (AND p0 p1), p0, p0, (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={1} source=0 dest: 0}, { cond=(AND p1 p0), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND p1 p0), acceptance={} source=4 dest: 9}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 10}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=p1, acceptance={} source=6 dest: 7}, { cond=(NOT p1), acceptance={} source=6 dest: 11}], [{ cond=true, acceptance={} source=7 dest: 8}], [{ cond=p0, acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p0), acceptance={} source=9 dest: 7}, { cond=p0, acceptance={} source=9 dest: 12}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 11}, { cond=(AND p1 p0), acceptance={} source=10 dest: 12}, { cond=(AND (NOT p1) p0), acceptance={} source=10 dest: 13}], [{ cond=p1, acceptance={} source=11 dest: 8}, { cond=(NOT p1), acceptance={} source=11 dest: 14}], [{ cond=(NOT p0), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=12 dest: 15}, { cond=p0, acceptance={} source=12 dest: 16}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=13 dest: 8}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=13 dest: 14}, { cond=(AND (NOT p1) p0), acceptance={} source=13 dest: 15}, { cond=(AND p1 p0), acceptance={} source=13 dest: 16}], [{ cond=(AND p1 p0), acceptance={} source=14 dest: 8}, { cond=(AND (NOT p1) p0), acceptance={} source=14 dest: 14}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=15 dest: 15}, { cond=(AND p1 p0), acceptance={0, 1} source=15 dest: 16}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=16 dest: 15}, { cond=(AND (NOT p1) p0), acceptance={1} source=16 dest: 16}, { cond=(AND p1 p0), acceptance={0, 1} source=16 dest: 16}]], initial=0, aps=[p1:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s10 1) (GEQ s15 1))),...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 15 steps with 3 reset in 1 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-08 finished in 746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||((p1&&X(X(X(G(p2))))) U p2)))'
Support contains 16 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 12:58:10] [INFO ] Invariant cache hit.
[2024-05-24 12:58:10] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-24 12:58:10] [INFO ] Invariant cache hit.
[2024-05-24 12:58:10] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 12:58:10] [INFO ] Invariant cache hit.
[2024-05-24 12:58:10] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-24 12:58:10] [INFO ] Invariant cache hit.
[2024-05-24 12:58:10] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s10 1) (GEQ s15 1))),...], 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 42249 reset in 167 ms.
Product exploration explored 100000 steps with 42173 reset in 267 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 (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))))]
Knowledge based reduction with 4 factoid took 340 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 61 steps, including 0 resets, run visited all 3 properties in 5 ms. (steps per millisecond=12 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))), (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) p1 (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (OR (AND p2 (NOT p0)) (AND p1 (NOT p0))))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND p1 (NOT p0)))))), (F p0), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 4 factoid took 405 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-24 12:58:12] [INFO ] Invariant cache hit.
[2024-05-24 12:58:12] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 12:58:12] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 5 ms returned sat
[2024-05-24 12:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:58:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 12:58:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:58:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 12:58:12] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 12:58:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:58:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-24 12:58:12] [INFO ] Computed and/alt/rep : 10/60/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:58:12] [INFO ] Added : 0 causal constraints over 0 iterations in 14 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Support contains 10 out of 21 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 12:58:12] [INFO ] Invariant cache hit.
[2024-05-24 12:58:13] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-24 12:58:13] [INFO ] Invariant cache hit.
[2024-05-24 12:58:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-24 12:58:13] [INFO ] Invariant cache hit.
[2024-05-24 12:58:13] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2024-05-24 12:58:13] [INFO ] Invariant cache hit.
[2024-05-24 12:58:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112 ms. Remains : 21/21 places, 30/30 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))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 147 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 2 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=2 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p2))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F (AND (NOT p0) p2)), (F (NOT (AND (NOT p0) (NOT p2))))]
Knowledge based reduction with 1 factoid took 239 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
[2024-05-24 12:58:14] [INFO ] Invariant cache hit.
[2024-05-24 12:58:14] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 12:58:14] [INFO ] [Real]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 12:58:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 12:58:14] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 12:58:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 12:58:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 12:58:14] [INFO ] [Nat]Absence check using 6 positive and 5 generalized place invariants in 1 ms returned sat
[2024-05-24 12:58:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 12:58:14] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-24 12:58:14] [INFO ] Computed and/alt/rep : 10/60/10 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-24 12:58:14] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 42193 reset in 153 ms.
Product exploration explored 100000 steps with 42198 reset in 122 ms.
Applying partial POR strategy [true, false, true, false, false]
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 12:58:14] [INFO ] Invariant cache hit.
[2024-05-24 12:58:14] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-24 12:58:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:58:14] [INFO ] Invariant cache hit.
[2024-05-24 12:58:15] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 21/21 places, 30/30 transitions.
Built C files in :
/tmp/ltsmin112841336316874674
[2024-05-24 12:58:15] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin112841336316874674
Running compilation step : cd /tmp/ltsmin112841336316874674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 188 ms.
Running link step : cd /tmp/ltsmin112841336316874674;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin112841336316874674;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2293576374069630467.hoa' '--buchi-type=spotba'
LTSmin run took 118 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GlobalResAllocation-COL-05-LTLFireability-10 finished in 4634 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 16 transition count 30
Applied a total of 5 rules in 1 ms. Remains 16 /21 variables (removed 5) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 16 cols
[2024-05-24 12:58:15] [INFO ] Computed 6 invariants in 1 ms
[2024-05-24 12:58:15] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-24 12:58:15] [INFO ] Invariant cache hit.
[2024-05-24 12:58:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-24 12:58:15] [INFO ] Invariant cache hit.
[2024-05-24 12:58:15] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-05-24 12:58:15] [INFO ] Invariant cache hit.
[2024-05-24 12:58:15] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 16/21 places, 30/30 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 16/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s2 1) (GEQ s5 3)) (AND (GEQ s0 1) (GEQ s5 3)) (AND (GEQ s1 1) (GEQ s5 3)) (AND (GEQ s3 1) (GEQ s5 3)) (AND (GEQ s4 1) (GEQ s5 3))), p1:(O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-12 finished in 234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(!p1) U (F(p3)||p2))))'
Support contains 21 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
// Phase 1: matrix 30 rows 21 cols
[2024-05-24 12:58:15] [INFO ] Computed 11 invariants in 2 ms
[2024-05-24 12:58:15] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-24 12:58:15] [INFO ] Invariant cache hit.
[2024-05-24 12:58:15] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 12:58:15] [INFO ] Invariant cache hit.
[2024-05-24 12:58:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-24 12:58:15] [INFO ] Invariant cache hit.
[2024-05-24 12:58:15] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 117 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (NOT p0), (NOT p3), (AND (NOT p3) p1), (AND (NOT p2) (NOT p3)), true]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p3) p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p3) (NOT p1)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(OR (AND (GEQ s8 1) (GEQ s13 1)) (AND (GEQ s9 1) (GEQ s14 1)) (AND (GEQ s6 1) (GEQ s11 1)) (AND (GEQ s7 1) (GEQ s12 1)) (AND (GEQ s10 1) (GEQ s15 1))),...], 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][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Product exploration explored 100000 steps with 50000 reset in 141 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) p3 p1 (NOT p0)), (X p0), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1)))), (X p3), (X (NOT (AND (NOT p3) p1))), (X (NOT (AND (NOT p2) (NOT p3) p1))), true, (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p3) p1))))]
False Knowledge obtained : [(X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) p1))), (X (X (NOT (AND (NOT p3) p1))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 18 ms. Reduced automaton from 6 states, 12 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-05-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-05-LTLFireability-13 finished in 625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0 U (X(p1)||G(p2))))))'
Support contains 16 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 12:58:16] [INFO ] Invariant cache hit.
[2024-05-24 12:58:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
[2024-05-24 12:58:16] [INFO ] Invariant cache hit.
[2024-05-24 12:58:16] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-24 12:58:16] [INFO ] Invariant cache hit.
[2024-05-24 12:58:16] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-24 12:58:16] [INFO ] Invariant cache hit.
[2024-05-24 12:58:16] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=1 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (AND (GEQ s0 1) (GEQ s5 2)) (AND (GEQ s4 1) (GEQ s5 2)) (AND (GEQ s1 1) (GEQ s5 2)) (AND (GEQ s2 1) (GEQ s5 2)) (AND (GEQ s3 1) (GEQ s5 2))), p0:(O...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 28173 steps with 3162 reset in 63 ms.
FORMULA GlobalResAllocation-COL-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GlobalResAllocation-COL-05-LTLFireability-14 finished in 416 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(!p1))||p0)))'
Support contains 10 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 30/30 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 30/30 (removed 0) transitions.
[2024-05-24 12:58:16] [INFO ] Invariant cache hit.
[2024-05-24 12:58:16] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
[2024-05-24 12:58:16] [INFO ] Invariant cache hit.
[2024-05-24 12:58:16] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-24 12:58:16] [INFO ] Invariant cache hit.
[2024-05-24 12:58:16] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-24 12:58:16] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-24 12:58:16] [INFO ] Invariant cache hit.
[2024-05-24 12:58:16] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 116 ms. Remains : 21/21 places, 30/30 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : GlobalResAllocation-COL-05-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s9 2) (GEQ s14 2)) (AND (GEQ s6 2) (GEQ s11 2)) (AND (GEQ s8 2) (GEQ s13 2)) (AND (GEQ s10 2) (GEQ s15 2)) (AND (GEQ s7 2) (GEQ s12 2))),...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 41983 reset in 148 ms.
Product exploration explored 100000 steps with 42155 reset in 180 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 183 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-24 12:58:17] [INFO ] Invariant cache hit.
[2024-05-24 12:58:17] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 12 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA GlobalResAllocation-COL-05-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GlobalResAllocation-COL-05-LTLFireability-15 finished in 932 ms.
All properties solved by simple procedures.
Total runtime 11302 ms.

BK_STOP 1716555498553

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is GlobalResAllocation-COL-05, 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 r197-tall-171640625500398"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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