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.r329-tall-171662362300443.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 RefineWMG-PT-015015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362300443
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 18:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 13 04:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 13 04:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 13 04:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 13 04:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 35K May 18 16:43 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 RefineWMG-PT-015015-LTLFireability-00
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-01
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-02
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-03
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-04
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-05
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-06
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-07
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-08
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-09
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-10
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-11
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-12
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-13
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-14
FORMULA_NAME RefineWMG-PT-015015-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716863253911

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=RefineWMG-PT-015015
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 02:27:35] [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-28 02:27:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:27:35] [INFO ] Load time of PNML (sax parser for PT used): 33 ms
[2024-05-28 02:27:35] [INFO ] Transformed 79 places.
[2024-05-28 02:27:35] [INFO ] Transformed 63 transitions.
[2024-05-28 02:27:35] [INFO ] Parsed PT model containing 79 places and 63 transitions and 188 arcs in 99 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA RefineWMG-PT-015015-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-015015-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 11 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:27:35] [INFO ] Computed 32 invariants in 9 ms
[2024-05-28 02:27:36] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
[2024-05-28 02:27:36] [INFO ] Invariant cache hit.
[2024-05-28 02:27:36] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-28 02:27:36] [INFO ] Invariant cache hit.
[2024-05-28 02:27:36] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-28 02:27:36] [INFO ] Invariant cache hit.
[2024-05-28 02:27:36] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 559 ms. Remains : 79/79 places, 63/63 transitions.
Support contains 34 out of 79 places after structural reductions.
[2024-05-28 02:27:36] [INFO ] Flatten gal took : 24 ms
[2024-05-28 02:27:36] [INFO ] Flatten gal took : 9 ms
[2024-05-28 02:27:36] [INFO ] Input system was already deterministic with 63 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 22) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :2
Running SMT prover for 6 properties.
[2024-05-28 02:27:36] [INFO ] Invariant cache hit.
[2024-05-28 02:27:36] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-28 02:27:36] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-28 02:27:36] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-28 02:27:37] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-28 02:27:37] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 54 ms.
[2024-05-28 02:27:37] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Finished Parikh walk after 233 steps, including 0 resets, run visited all 6 properties in 6 ms. (steps per millisecond=38 )
Parikh walk visited 6 properties in 7 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-14 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' '!((F(p0) U G(p1)))'
Support contains 6 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 2 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 52 place count 27 transition count 25
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 8 rules applied. Total rules applied 60 place count 27 transition count 17
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 68 place count 19 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 68 place count 19 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 72 place count 17 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 16 transition count 14
Applied a total of 74 rules in 12 ms. Remains 16 /79 variables (removed 63) and now considering 14/63 (removed 49) transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-05-28 02:27:37] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:27:37] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-28 02:27:37] [INFO ] Invariant cache hit.
[2024-05-28 02:27:37] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 02:27:37] [INFO ] Invariant cache hit.
[2024-05-28 02:27:37] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-28 02:27:37] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:27:37] [INFO ] Invariant cache hit.
[2024-05-28 02:27:37] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/79 places, 14/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 16/79 places, 14/63 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 171 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s13 1), p0:(OR (AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1)) (AND (GEQ s12 1) (GEQ s13 1) (GEQ s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 498 steps with 0 reset in 9 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-00 finished in 377 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(p0))||(!p1&&X((!p1 U (!p2||G(!p1))))))))'
Support contains 8 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:27:38] [INFO ] Computed 32 invariants in 1 ms
[2024-05-28 02:27:38] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:38] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:38] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 101 ms to find 0 implicit places.
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:38] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 195 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0) p2), (AND p1 (NOT p0) p2), (AND (NOT p0) p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s21 1) (GEQ s22 1) (GEQ s24 1)), p0:(GEQ s27 1), p2:(OR (AND (GEQ s36 1) (GEQ s37 1) (GEQ s39 1)) (GEQ s28 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 5143 reset in 369 ms.
Stack based approach found an accepted trace after 13967 steps with 516 reset with depth 2403 and stack size 2340 in 71 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-02 finished in 823 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((p0||X((p1||X(p2)))))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 6 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:38] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:38] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 02:27:38] [INFO ] Invariant cache hit.
[2024-05-28 02:27:39] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-28 02:27:39] [INFO ] Invariant cache hit.
[2024-05-28 02:27:39] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 196 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s22 1) (GEQ s38 1)), p1:(GEQ s22 1), p2:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4833 reset in 273 ms.
Stack based approach found an accepted trace after 84660 steps with 3195 reset with depth 2623 and stack size 2562 in 262 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-04 finished in 900 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 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 41 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 53 place count 25 transition count 23
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 62 place count 25 transition count 14
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 71 place count 16 transition count 14
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 16 transition count 12
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 14 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 77 place count 13 transition count 11
Applied a total of 77 rules in 7 ms. Remains 13 /79 variables (removed 66) and now considering 11/63 (removed 52) transitions.
// Phase 1: matrix 11 rows 13 cols
[2024-05-28 02:27:39] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 02:27:39] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:27:39] [INFO ] Invariant cache hit.
[2024-05-28 02:27:39] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:27:39] [INFO ] Invariant cache hit.
[2024-05-28 02:27:39] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-05-28 02:27:39] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:27:39] [INFO ] Invariant cache hit.
[2024-05-28 02:27:39] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 13/79 places, 11/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 13/79 places, 11/63 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s11 1) (OR (LT s6 1) (LT s7 1) (LT s9 1)))], 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-06 finished in 191 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(X((p0||F(p1))))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 4 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:27:39] [INFO ] Computed 32 invariants in 4 ms
[2024-05-28 02:27:40] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
[2024-05-28 02:27:40] [INFO ] Invariant cache hit.
[2024-05-28 02:27:40] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-28 02:27:40] [INFO ] Invariant cache hit.
[2024-05-28 02:27:40] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-28 02:27:40] [INFO ] Invariant cache hit.
[2024-05-28 02:27:40] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 187 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (GEQ s21 1) (GEQ s22 1) (GEQ s24 1)), p0:(GEQ s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 284 reset in 263 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 3 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-07 finished in 667 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' '!(((p0||F(p1)) U X(G((p2||G((p0 U p3)))))))'
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:40] [INFO ] Invariant cache hit.
[2024-05-28 02:27:40] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
[2024-05-28 02:27:40] [INFO ] Invariant cache hit.
[2024-05-28 02:27:40] [INFO ] Implicit Places using invariants in 39 ms returned []
[2024-05-28 02:27:40] [INFO ] Invariant cache hit.
[2024-05-28 02:27:40] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-28 02:27:40] [INFO ] Invariant cache hit.
[2024-05-28 02:27:40] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 201 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 334 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p2) p3)), acceptance={} source=0 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(OR p0 p2 p3), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p3)), acceptance={1} source=1 dest: 5}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p1)) (AND (NOT p1) p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3)), acceptance={0, 1} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 1}, { cond=(OR (AND p0 p2) (AND p2 p3)), acceptance={} source=5 dest: 5}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) p3)), acceptance={1} source=5 dest: 5}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=5 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p3)), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 1}, { cond=(AND p0 p2 (NOT p3)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p2) (NOT p3)), acceptance={0, 1} source=6 dest: 6}]], initial=1, aps=[p1:(AND (GEQ s1 2) (GEQ s2 2)), p2:(LT s4 5), p0:(AND (GEQ s41 1) (GEQ s42 1) (GEQ s44 1)), p3:(LT s67 1)], nbAcceptance=2, 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]]
Product exploration explored 100000 steps with 847 reset in 322 ms.
Stack based approach found an accepted trace after 2735 steps with 21 reset with depth 1089 and stack size 1058 in 10 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-08 finished in 895 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(F(!p0))||(F(!p0)&&X(F(!p1))))))'
Support contains 4 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:41] [INFO ] Invariant cache hit.
[2024-05-28 02:27:41] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-28 02:27:41] [INFO ] Invariant cache hit.
[2024-05-28 02:27:41] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 02:27:41] [INFO ] Invariant cache hit.
[2024-05-28 02:27:41] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-05-28 02:27:41] [INFO ] Invariant cache hit.
[2024-05-28 02:27:41] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 191 ms :[p0, p0, p0, (AND p1 p0), (AND p0 p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s16 1) (GEQ s17 1) (GEQ s19 1)), p1:(GEQ s22 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 214 reset in 266 ms.
Stack based approach found an accepted trace after 466 steps with 0 reset with depth 467 and stack size 458 in 1 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-09 finished in 663 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) U X(G(p1)))))'
Support contains 7 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:42] [INFO ] Invariant cache hit.
[2024-05-28 02:27:42] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
[2024-05-28 02:27:42] [INFO ] Invariant cache hit.
[2024-05-28 02:27:42] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-28 02:27:42] [INFO ] Invariant cache hit.
[2024-05-28 02:27:42] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-05-28 02:27:42] [INFO ] Invariant cache hit.
[2024-05-28 02:27:42] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 183 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 244 ms :[(NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s25 1) (AND (GEQ s71 1) (GEQ s72 1) (GEQ s74 1))), p0:(AND (GEQ s6 1) (GEQ s7 1) (GEQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 205 reset in 267 ms.
Stack based approach found an accepted trace after 4 steps with 0 reset with depth 5 and stack size 5 in 0 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-10 finished in 721 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)))'
Support contains 1 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-05-28 02:27:42] [INFO ] Invariant cache hit.
[2024-05-28 02:27:42] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
[2024-05-28 02:27:42] [INFO ] Invariant cache hit.
[2024-05-28 02:27:42] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 02:27:42] [INFO ] Invariant cache hit.
[2024-05-28 02:27:43] [INFO ] Implicit Places using invariants and state equation in 59 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-28 02:27:43] [INFO ] Invariant cache hit.
[2024-05-28 02:27:43] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 190 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s53 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1383 reset in 256 ms.
Stack based approach found an accepted trace after 146 steps with 49 reset with depth 11 and stack size 11 in 0 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-11 finished in 537 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)||F(p1)))'
Support contains 2 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 43 edges and 79 vertex of which 28 / 79 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Reduce places removed 14 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 51 transition count 36
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 1 with 45 rules applied. Total rules applied 59 place count 21 transition count 21
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 11 rules applied. Total rules applied 70 place count 21 transition count 10
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 81 place count 10 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 81 place count 10 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 85 place count 8 transition count 8
Applied a total of 85 rules in 7 ms. Remains 8 /79 variables (removed 71) and now considering 8/63 (removed 55) transitions.
// Phase 1: matrix 8 rows 8 cols
[2024-05-28 02:27:43] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 02:27:43] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
[2024-05-28 02:27:43] [INFO ] Invariant cache hit.
[2024-05-28 02:27:43] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 02:27:43] [INFO ] Invariant cache hit.
[2024-05-28 02:27:43] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-28 02:27:43] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-28 02:27:43] [INFO ] Invariant cache hit.
[2024-05-28 02:27:43] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/79 places, 8/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 8/79 places, 8/63 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(GEQ s7 1), p0:(LT s4 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-015015-LTLFireability-12 finished in 210 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 X(p1)))||X(X(G(p2)))))'
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 7 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:27:43] [INFO ] Computed 32 invariants in 1 ms
[2024-05-28 02:27:43] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
[2024-05-28 02:27:43] [INFO ] Invariant cache hit.
[2024-05-28 02:27:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-05-28 02:27:43] [INFO ] Invariant cache hit.
[2024-05-28 02:27:43] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-05-28 02:27:43] [INFO ] Invariant cache hit.
[2024-05-28 02:27:43] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 181 ms. Remains : 79/79 places, 63/63 transitions.
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=true, acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(NOT p2), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s71 1) (GEQ s72 1) (GEQ s74 1)), p1:(GEQ s7 1), p2:(OR (LT s7 1) (LT s20 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, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 31020 reset in 176 ms.
Product exploration explored 100000 steps with 31337 reset in 196 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) p1 p2), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 8 factoid took 213 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-28 02:27:45] [INFO ] Invariant cache hit.
[2024-05-28 02:27:45] [INFO ] [Real]Absence check using 32 positive place invariants in 3 ms returned sat
[2024-05-28 02:27:45] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-28 02:27:45] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-28 02:27:45] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-28 02:27:45] [INFO ] After 67ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-28 02:27:45] [INFO ] After 162ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 361 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=180 )
Parikh walk visited 2 properties in 5 ms.
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 53 transition count 37
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 53 place count 27 transition count 24
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 62 place count 27 transition count 15
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 71 place count 18 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 18 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 16 transition count 13
Applied a total of 75 rules in 6 ms. Remains 16 /79 variables (removed 63) and now considering 13/63 (removed 50) transitions.
// Phase 1: matrix 13 rows 16 cols
[2024-05-28 02:27:45] [INFO ] Computed 6 invariants in 1 ms
[2024-05-28 02:27:45] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 16/79 places, 13/63 transitions.
Finished random walk after 3267 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1089 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT p1)), (F (AND p0 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) (NOT p2))), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p0))), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 8 factoid took 434 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 335 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 5 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:27:46] [INFO ] Computed 32 invariants in 1 ms
[2024-05-28 02:27:46] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
[2024-05-28 02:27:46] [INFO ] Invariant cache hit.
[2024-05-28 02:27:46] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 02:27:46] [INFO ] Invariant cache hit.
[2024-05-28 02:27:46] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-28 02:27:46] [INFO ] Invariant cache hit.
[2024-05-28 02:27:46] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 193 ms. Remains : 79/79 places, 63/63 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 p2 p1 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 173 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 361 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-28 02:27:47] [INFO ] Invariant cache hit.
[2024-05-28 02:27:47] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-28 02:27:47] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-28 02:27:47] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2024-05-28 02:27:47] [INFO ] After 53ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-28 02:27:47] [INFO ] After 72ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 63 ms.
[2024-05-28 02:27:47] [INFO ] After 171ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 362 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=120 )
Parikh walk visited 2 properties in 6 ms.
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Drop transitions removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 53 transition count 37
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 53 place count 27 transition count 24
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 62 place count 27 transition count 15
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 71 place count 18 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 71 place count 18 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 75 place count 16 transition count 13
Applied a total of 75 rules in 3 ms. Remains 16 /79 variables (removed 63) and now considering 13/63 (removed 50) transitions.
// Phase 1: matrix 13 rows 16 cols
[2024-05-28 02:27:47] [INFO ] Computed 6 invariants in 1 ms
[2024-05-28 02:27:47] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 16/79 places, 13/63 transitions.
Finished random walk after 1549 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=387 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT p1)), (F (AND p0 (NOT p2))), (F (NOT p2)), (F (AND (NOT p2) (NOT p1))), (F (AND p2 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 385 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 346 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 370 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 444 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 17031 reset in 234 ms.
Product exploration explored 100000 steps with 17622 reset in 250 ms.
Applying partial POR strategy [false, false, true, true, true, false, true, false, false]
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 3 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 1 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 26 place count 53 transition count 38
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 26 rules in 24 ms. Remains 53 /79 variables (removed 26) and now considering 38/63 (removed 25) transitions.
// Phase 1: matrix 38 rows 53 cols
[2024-05-28 02:27:50] [INFO ] Computed 19 invariants in 1 ms
[2024-05-28 02:27:50] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-28 02:27:50] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-28 02:27:50] [INFO ] Invariant cache hit.
[2024-05-28 02:27:50] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/79 places, 38/63 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 53/79 places, 38/63 transitions.
Built C files in :
/tmp/ltsmin2230832125310500468
[2024-05-28 02:27:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2230832125310500468
Running compilation step : cd /tmp/ltsmin2230832125310500468;'/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 251 ms.
Running link step : cd /tmp/ltsmin2230832125310500468;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2230832125310500468;'/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/stateBased6111673549604796751.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Applied a total of 0 rules in 1 ms. Remains 79 /79 variables (removed 0) and now considering 63/63 (removed 0) transitions.
// Phase 1: matrix 63 rows 79 cols
[2024-05-28 02:28:05] [INFO ] Computed 32 invariants in 2 ms
[2024-05-28 02:28:05] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
[2024-05-28 02:28:05] [INFO ] Invariant cache hit.
[2024-05-28 02:28:05] [INFO ] Implicit Places using invariants in 40 ms returned []
[2024-05-28 02:28:05] [INFO ] Invariant cache hit.
[2024-05-28 02:28:05] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
[2024-05-28 02:28:05] [INFO ] Invariant cache hit.
[2024-05-28 02:28:05] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 199 ms. Remains : 79/79 places, 63/63 transitions.
Built C files in :
/tmp/ltsmin13074194811443458084
[2024-05-28 02:28:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13074194811443458084
Running compilation step : cd /tmp/ltsmin13074194811443458084;'/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 131 ms.
Running link step : cd /tmp/ltsmin13074194811443458084;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin13074194811443458084;'/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/stateBased9185116621712213770.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:28:21] [INFO ] Flatten gal took : 6 ms
[2024-05-28 02:28:21] [INFO ] Flatten gal took : 5 ms
[2024-05-28 02:28:21] [INFO ] Time to serialize gal into /tmp/LTL13346907148697502417.gal : 1 ms
[2024-05-28 02:28:21] [INFO ] Time to serialize properties into /tmp/LTL3178973748339559199.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13346907148697502417.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10578790319900334198.hoa' '-atoms' '/tmp/LTL3178973748339559199.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3178973748339559199.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10578790319900334198.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 02:28:36] [INFO ] Flatten gal took : 6 ms
[2024-05-28 02:28:36] [INFO ] Flatten gal took : 4 ms
[2024-05-28 02:28:36] [INFO ] Time to serialize gal into /tmp/LTL2272024646615249404.gal : 1 ms
[2024-05-28 02:28:36] [INFO ] Time to serialize properties into /tmp/LTL14066027523991542504.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2272024646615249404.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14066027523991542504.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(("(((p68>=1)&&(p69>=1))&&(p71>=1))")U(X("(p4>=1)"))))||(X(X(G("((p4<1)||(p17<1))"))))))
Formula 0 simplified : F(!"(((p68>=1)&&(p69>=1))&&(p71>=1))" R X!"(p4>=1)") & XXF!"((p4<1)||(p17<1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 02:28:51] [INFO ] Flatten gal took : 4 ms
[2024-05-28 02:28:51] [INFO ] Applying decomposition
[2024-05-28 02:28:51] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10801796683559162310.txt' '-o' '/tmp/graph10801796683559162310.bin' '-w' '/tmp/graph10801796683559162310.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10801796683559162310.bin' '-l' '-1' '-v' '-w' '/tmp/graph10801796683559162310.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:28:51] [INFO ] Decomposing Gal with order
[2024-05-28 02:28:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:28:51] [INFO ] Flatten gal took : 24 ms
[2024-05-28 02:28:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 02:28:51] [INFO ] Time to serialize gal into /tmp/LTL3675468233221513809.gal : 2 ms
[2024-05-28 02:28:51] [INFO ] Time to serialize properties into /tmp/LTL17456606405480304780.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3675468233221513809.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17456606405480304780.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !(((G(("(((i14.u34.p68>=1)&&(i14.u35.p69>=1))&&(i14.u33.p71>=1))")U(X("(i1.u3.p4>=1)"))))||(X(X(G("((i1.u3.p4<1)||(i4.u9.p17<1))")))))...156
Formula 0 simplified : F(!"(((i14.u34.p68>=1)&&(i14.u35.p69>=1))&&(i14.u33.p71>=1))" R X!"(i1.u3.p4>=1)") & XXF!"((i1.u3.p4<1)||(i4.u9.p17<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2486781271103747649
[2024-05-28 02:29:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2486781271103747649
Running compilation step : cd /tmp/ltsmin2486781271103747649;'/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 128 ms.
Running link step : cd /tmp/ltsmin2486781271103747649;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin2486781271103747649;'/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' '--ltl' '([](((LTLAPp0==true) U X((LTLAPp1==true))))||X(X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-015015-LTLFireability-13 finished in 97864 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 X(p1)))||X(X(G(p2)))))'
Found a Lengthening insensitive property : RefineWMG-PT-015015-LTLFireability-13
Stuttering acceptance computed with spot in 390 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 79 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 79/79 places, 63/63 transitions.
Graph (trivial) has 39 edges and 79 vertex of which 26 / 79 are part of one of the 13 SCC in 1 ms
Free SCC test removed 13 places
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 53 transition count 38
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 1 with 39 rules applied. Total rules applied 52 place count 27 transition count 25
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 9 rules applied. Total rules applied 61 place count 27 transition count 16
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 70 place count 18 transition count 16
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 70 place count 18 transition count 14
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 74 place count 16 transition count 14
Applied a total of 74 rules in 6 ms. Remains 16 /79 variables (removed 63) and now considering 14/63 (removed 49) transitions.
// Phase 1: matrix 14 rows 16 cols
[2024-05-28 02:29:22] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 02:29:22] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-28 02:29:22] [INFO ] Invariant cache hit.
[2024-05-28 02:29:22] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 02:29:22] [INFO ] Invariant cache hit.
[2024-05-28 02:29:22] [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-28 02:29:22] [INFO ] Invariant cache hit.
[2024-05-28 02:29:22] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/79 places, 14/63 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 113 ms. Remains : 16/79 places, 14/63 transitions.
Running random walk in product with property : RefineWMG-PT-015015-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=true, acceptance={} source=2 dest: 6}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(NOT p2), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 9}], [{ cond=(NOT p1), acceptance={} source=7 dest: 4}], [{ cond=(NOT p0), acceptance={} source=8 dest: 7}, { cond=true, acceptance={} source=8 dest: 8}, { cond=p0, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 7}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 9}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s13 1) (GEQ s15 1)), p1:(GEQ s5 1), p2:(OR (LT s5 1) (LT s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 30329 reset in 80 ms.
Product exploration explored 100000 steps with 30005 reset in 93 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 8 factoid took 182 ms. Reduced automaton from 10 states, 21 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:29:22] [INFO ] Invariant cache hit.
[2024-05-28 02:29:22] [INFO ] After 14ms 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) p1 p2), (X p1), (X (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p0) p2))), (F (NOT p1)), (F (AND p0 (NOT p2))), (F (NOT p2)), (F (AND (NOT p1) p2)), (F (AND (NOT p1) (NOT p0))), (F p0), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 451 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 300 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16/16 places, 14/14 transitions.
Applied a total of 0 rules in 0 ms. Remains 16 /16 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-28 02:29:23] [INFO ] Invariant cache hit.
[2024-05-28 02:29:23] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
[2024-05-28 02:29:23] [INFO ] Invariant cache hit.
[2024-05-28 02:29:23] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-28 02:29:23] [INFO ] Invariant cache hit.
[2024-05-28 02:29:24] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-28 02:29:24] [INFO ] Invariant cache hit.
[2024-05-28 02:29:24] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 113 ms. Remains : 16/16 places, 14/14 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2))))]
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 234 steps, including 0 resets, run visited all 8 properties in 4 ms. (steps per millisecond=58 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2)))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2)))), (F (AND p0 (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) (NOT p1))), (F p0), (F (NOT p2)), (F (NOT (AND (NOT p0) p2))), (F (NOT p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 4 factoid took 339 ms. Reduced automaton from 9 states, 17 edges and 3 AP (stutter sensitive) to 9 states, 17 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 384 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 16052 reset in 105 ms.
Product exploration explored 100000 steps with 16172 reset in 104 ms.
Applying partial POR strategy [false, false, true, true, false, false, true, false, false]
Stuttering acceptance computed with spot in 319 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (NOT p1)]
Support contains 5 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 14/14 transitions.
Applied a total of 0 rules in 2 ms. Remains 16 /16 variables (removed 0) and now considering 14/14 (removed 0) transitions.
[2024-05-28 02:29:26] [INFO ] Invariant cache hit.
[2024-05-28 02:29:26] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
[2024-05-28 02:29:26] [INFO ] Redundant transitions in 15 ms returned []
[2024-05-28 02:29:26] [INFO ] Invariant cache hit.
[2024-05-28 02:29:26] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 75 ms. Remains : 16/16 places, 14/14 transitions.
Built C files in :
/tmp/ltsmin10381809451870805404
[2024-05-28 02:29:26] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10381809451870805404
Running compilation step : cd /tmp/ltsmin10381809451870805404;'/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 87 ms.
Running link step : cd /tmp/ltsmin10381809451870805404;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10381809451870805404;'/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/stateBased9709544765350358247.hoa' '--buchi-type=spotba'
LTSmin run took 76 ms.
Treatment of property RefineWMG-PT-015015-LTLFireability-13 finished in 5235 ms.
FORMULA RefineWMG-PT-015015-LTLFireability-13 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-05-28 02:29:26] [INFO ] Flatten gal took : 6 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 111223 ms.

BK_STOP 1716863367970

--------------------
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="RefineWMG-PT-015015"
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 RefineWMG-PT-015015, 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 r329-tall-171662362300443"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-015015.tgz
mv RefineWMG-PT-015015 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 ;