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-171662362200422.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-007007, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662362200422
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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.7K Apr 23 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 13 04:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 13 04:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 13 04:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Apr 13 04:35 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 18K 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-007007-LTLCardinality-00
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-01
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-02
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-03
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-04
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-05
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-06
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-07
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-08
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-09
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-10
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-11
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-12
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-13
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-14
FORMULA_NAME RefineWMG-PT-007007-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716863080919

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=RefineWMG-PT-007007
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-28 02:24:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 02:24:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 02:24:42] [INFO ] Load time of PNML (sax parser for PT used): 28 ms
[2024-05-28 02:24:42] [INFO ] Transformed 39 places.
[2024-05-28 02:24:42] [INFO ] Transformed 31 transitions.
[2024-05-28 02:24:42] [INFO ] Parsed PT model containing 39 places and 31 transitions and 92 arcs in 105 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA RefineWMG-PT-007007-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RefineWMG-PT-007007-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 9 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2024-05-28 02:24:42] [INFO ] Computed 16 invariants in 9 ms
[2024-05-28 02:24:43] [INFO ] Dead Transitions using invariants and state equation in 486 ms found 0 transitions.
[2024-05-28 02:24:43] [INFO ] Invariant cache hit.
[2024-05-28 02:24:43] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 02:24:43] [INFO ] Invariant cache hit.
[2024-05-28 02:24: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:24:43] [INFO ] Invariant cache hit.
[2024-05-28 02:24:43] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 642 ms. Remains : 39/39 places, 31/31 transitions.
Support contains 27 out of 39 places after structural reductions.
[2024-05-28 02:24:43] [INFO ] Flatten gal took : 20 ms
[2024-05-28 02:24:43] [INFO ] Flatten gal took : 6 ms
[2024-05-28 02:24:43] [INFO ] Input system was already deterministic with 31 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 33) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 02:24:43] [INFO ] Invariant cache hit.
[2024-05-28 02:24:43] [INFO ] [Real]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-28 02:24:43] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 02:24:43] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2024-05-28 02:24:43] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 02:24:43] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-05-28 02:24:43] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 107 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=53 )
Parikh walk visited 3 properties in 13 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA RefineWMG-PT-007007-LTLCardinality-08 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((p0||G(p1))))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 7 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-28 02:24:44] [INFO ] Invariant cache hit.
[2024-05-28 02:24:44] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
[2024-05-28 02:24:44] [INFO ] Invariant cache hit.
[2024-05-28 02:24:44] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-05-28 02:24:44] [INFO ] Invariant cache hit.
[2024-05-28 02:24:44] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-28 02:24:44] [INFO ] Invariant cache hit.
[2024-05-28 02:24:44] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 164 ms. Remains : 39/39 places, 31/31 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 352 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(GT 1 s34), p0:(LEQ s5 s35)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 219 ms.
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 17 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA RefineWMG-PT-007007-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property RefineWMG-PT-007007-LTLCardinality-00 finished in 960 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)))'
Support contains 1 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 20 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 3 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 25 place count 13 transition count 12
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 4 rules applied. Total rules applied 29 place count 13 transition count 8
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 33 place count 9 transition count 8
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 33 place count 9 transition count 7
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 35 place count 8 transition count 7
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 37 place count 7 transition count 6
Applied a total of 37 rules in 12 ms. Remains 7 /39 variables (removed 32) and now considering 6/31 (removed 25) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-28 02:24:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 02:24:45] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-28 02:24:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/39 places, 6/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 95 ms. Remains : 7/39 places, 6/31 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 75 steps with 0 reset in 2 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-01 finished in 140 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 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 19 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 15 rules applied. Total rules applied 22 place count 15 transition count 13
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 3 rules applied. Total rules applied 25 place count 15 transition count 10
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 12 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 28 place count 12 transition count 9
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 30 place count 11 transition count 9
Applied a total of 30 rules in 4 ms. Remains 11 /39 variables (removed 28) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 11 cols
[2024-05-28 02:24:45] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 02:24:45] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-28 02:24:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/39 places, 9/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 109 ms. Remains : 11/39 places, 9/31 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-02 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=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(OR (LEQ 1 s10) (LEQ s9 s0)), p0:(LEQ 1 s5)], 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-007007-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-02 finished in 208 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((F(p0)&&F(G(p1)))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 20 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 25 place count 13 transition count 12
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 2 rules applied. Total rules applied 27 place count 13 transition count 10
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 11 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 10 transition count 9
Applied a total of 31 rules in 12 ms. Remains 10 /39 variables (removed 29) and now considering 9/31 (removed 22) transitions.
// Phase 1: matrix 9 rows 10 cols
[2024-05-28 02:24:45] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 02:24:45] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-28 02:24:45] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/39 places, 9/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 10/39 places, 9/31 transitions.
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 2 s9), p1:(AND (LEQ 2 s2) (LEQ s7 s5))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-03 finished in 254 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(X(((X(p0)&&F(p1))||X(G(p0))))))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2024-05-28 02:24:45] [INFO ] Computed 16 invariants in 2 ms
[2024-05-28 02:24:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:45] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-05-28 02:24:45] [INFO ] Invariant cache hit.
[2024-05-28 02:24:46] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
[2024-05-28 02:24:46] [INFO ] Invariant cache hit.
[2024-05-28 02:24:46] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 163 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(NOT p1), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 7}], [{ cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 8}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=(NOT p1), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(GT s0 s12), p0:(LEQ s36 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1309 steps with 6 reset in 8 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-04 finished in 503 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 U (p1 U G(p2))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 16 edges and 39 vertex of which 10 / 39 are part of one of the 5 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 29 transition count 22
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 23 place count 17 transition count 16
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 17 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 16 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 25 place count 16 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 29 place count 14 transition count 13
Applied a total of 29 rules in 4 ms. Remains 14 /39 variables (removed 25) and now considering 13/31 (removed 18) transitions.
// Phase 1: matrix 13 rows 14 cols
[2024-05-28 02:24:46] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 02:24:46] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
[2024-05-28 02:24:46] [INFO ] Invariant cache hit.
[2024-05-28 02:24:46] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-28 02:24:46] [INFO ] Invariant cache hit.
[2024-05-28 02:24:46] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-28 02:24:46] [INFO ] Redundant transitions in 10 ms returned []
[2024-05-28 02:24:46] [INFO ] Invariant cache hit.
[2024-05-28 02:24:46] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/39 places, 13/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 136 ms. Remains : 14/39 places, 13/31 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), true, (NOT p2), (NOT p2)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 1}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(LEQ s10 s5), p0:(LEQ 1 s12), p1:(LEQ 1 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 0 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-07 finished in 278 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) U p1))||G((G(p2) U p3)))))'
Support contains 6 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2024-05-28 02:24:46] [INFO ] Computed 16 invariants in 1 ms
[2024-05-28 02:24:46] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
[2024-05-28 02:24:46] [INFO ] Invariant cache hit.
[2024-05-28 02:24:46] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-28 02:24:46] [INFO ] Invariant cache hit.
[2024-05-28 02:24:46] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2024-05-28 02:24:46] [INFO ] Invariant cache hit.
[2024-05-28 02:24:46] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 136 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2) p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p3 p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0) p3) (AND (NOT p1) (NOT p0) p2)), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={} source=1 dest: 8}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 10}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p3 (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p3 p2), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p3 p2), acceptance={} source=5 dest: 7}], [{ cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(OR (AND p1 (NOT p0) p3) (AND p1 (NOT p0) p2)), acceptance={} source=6 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=8 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=9 dest: 7}, { cond=(AND (NOT p1) p2), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 2}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=10 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=10 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=10 dest: 8}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=10 dest: 9}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p3:(LEQ 2 s32), p2:(GT s7 s0), p1:(LEQ s6 s31), p0:(LEQ 1 s24)], 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, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2177 reset in 229 ms.
Stack based approach found an accepted trace after 8418 steps with 201 reset with depth 50 and stack size 46 in 25 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-09 finished in 898 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&&X((!p0 U (X(p1)||G(!p0))))))))'
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-28 02:24:47] [INFO ] Invariant cache hit.
[2024-05-28 02:24:47] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
[2024-05-28 02:24:47] [INFO ] Invariant cache hit.
[2024-05-28 02:24:47] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-28 02:24:47] [INFO ] Invariant cache hit.
[2024-05-28 02:24:47] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
[2024-05-28 02:24:47] [INFO ] Invariant cache hit.
[2024-05-28 02:24:47] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 179 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 182 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 2}]], initial=0, aps=[p0:(AND (LEQ s9 s20) (LEQ 3 s38)), p1:(GT s12 s15)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Product exploration explored 100000 steps with 25000 reset in 174 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), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 179 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 99 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=99 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 5 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-28 02:24:49] [INFO ] Invariant cache hit.
[2024-05-28 02:24:49] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
[2024-05-28 02:24:49] [INFO ] Invariant cache hit.
[2024-05-28 02:24:49] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-28 02:24:49] [INFO ] Invariant cache hit.
[2024-05-28 02:24:49] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-28 02:24:49] [INFO ] Invariant cache hit.
[2024-05-28 02:24:49] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 126 ms. Remains : 39/39 places, 31/31 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) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Finished random walk after 16 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=16 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 216 ms. Reduced automaton from 5 states, 9 edges and 2 AP (stutter sensitive) to 5 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 168 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 177 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 173 ms :[p0, p0, (AND p0 (NOT p1)), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 117 ms.
Product exploration explored 100000 steps with 25000 reset in 125 ms.
Built C files in :
/tmp/ltsmin7767399314034931677
[2024-05-28 02:24:50] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7767399314034931677
Running compilation step : cd /tmp/ltsmin7767399314034931677;'/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 170 ms.
Running link step : cd /tmp/ltsmin7767399314034931677;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7767399314034931677;'/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/stateBased15164241621629005776.hoa' '--buchi-type=spotba'
LTSmin run took 98 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property RefineWMG-PT-007007-LTLCardinality-10 finished in 3341 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||G(p1)))))'
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-28 02:24:50] [INFO ] Invariant cache hit.
[2024-05-28 02:24:50] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
[2024-05-28 02:24:50] [INFO ] Invariant cache hit.
[2024-05-28 02:24:50] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-28 02:24:50] [INFO ] Invariant cache hit.
[2024-05-28 02:24:50] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-28 02:24:50] [INFO ] Invariant cache hit.
[2024-05-28 02:24:51] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(LEQ 1 s1), p0:(LEQ 3 s37)], 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 505 steps with 0 reset in 1 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-11 finished in 262 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||X(X(X(p1))))))))'
Support contains 3 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-28 02:24:51] [INFO ] Invariant cache hit.
[2024-05-28 02:24:51] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
[2024-05-28 02:24:51] [INFO ] Invariant cache hit.
[2024-05-28 02:24:51] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 02:24:51] [INFO ] Invariant cache hit.
[2024-05-28 02:24:51] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-28 02:24:51] [INFO ] Invariant cache hit.
[2024-05-28 02:24:51] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}]], initial=1, aps=[p0:(LEQ 2 s14), p1:(GT s4 s19)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 734 reset in 168 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 0 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-13 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-13 finished in 548 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||(X((G(p1)||(p1&&F(p2)))) U (X(G((G(p1)||(p1&&F(p2)))))||(p0&&X((G(p1)||(p1&&F(p2))))))))))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-28 02:24:51] [INFO ] Invariant cache hit.
[2024-05-28 02:24:51] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
[2024-05-28 02:24:51] [INFO ] Invariant cache hit.
[2024-05-28 02:24:51] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:24:51] [INFO ] Invariant cache hit.
[2024-05-28 02:24:51] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-05-28 02:24:51] [INFO ] Invariant cache hit.
[2024-05-28 02:24:51] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 301 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}], [{ cond=(NOT p1), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 7}, { cond=(AND p0 p1), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=8 dest: 3}]], initial=6, aps=[p2:(GT s19 s11), p0:(GT s0 s16), p1:(LEQ 2 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 178 ms.
Product exploration explored 100000 steps with 0 reset in 210 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) 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 3) 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 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 02:24:53] [INFO ] Invariant cache hit.
[2024-05-28 02:24:53] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-28 02:24:53] [INFO ] [Nat]Absence check using 16 positive place invariants in 2 ms returned sat
[2024-05-28 02:24:53] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-28 02:24:53] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-28 02:24:53] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 97 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=97 )
Parikh walk visited 3 properties in 9 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F p2), (F (AND (NOT p1) (NOT p2))), (F p0)]
Knowledge based reduction with 2 factoid took 236 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 310 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-28 02:24:54] [INFO ] Invariant cache hit.
[2024-05-28 02:24:54] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
[2024-05-28 02:24:54] [INFO ] Invariant cache hit.
[2024-05-28 02:24:54] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 02:24:54] [INFO ] Invariant cache hit.
[2024-05-28 02:24:54] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-28 02:24:54] [INFO ] Invariant cache hit.
[2024-05-28 02:24:54] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 139 ms. Remains : 39/39 places, 31/31 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 p2) (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 68 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 429 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 02:24:54] [INFO ] Invariant cache hit.
[2024-05-28 02:24:54] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 02:24:54] [INFO ] [Nat]Absence check using 16 positive place invariants in 1 ms returned sat
[2024-05-28 02:24:54] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-28 02:24:54] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-28 02:24:55] [INFO ] After 65ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 105 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=52 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), true]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (AND p1 (NOT p2)))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1))), (F p2), (F (AND (NOT p1) (NOT p2))), (F p0)]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 9 states, 13 edges and 3 AP (stutter sensitive) to 9 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 274 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 288 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 195 ms.
Product exploration explored 100000 steps with 0 reset in 291 ms.
Applying partial POR strategy [true, true, false, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 306 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Graph (trivial) has 19 edges and 39 vertex of which 14 / 39 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 25 transition count 18
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 25 transition count 18
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 12 rules in 9 ms. Remains 25 /39 variables (removed 14) and now considering 18/31 (removed 13) transitions.
// Phase 1: matrix 18 rows 25 cols
[2024-05-28 02:24:56] [INFO ] Computed 9 invariants in 1 ms
[2024-05-28 02:24:56] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
[2024-05-28 02:24:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 02:24:56] [INFO ] Invariant cache hit.
[2024-05-28 02:24:57] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/39 places, 18/31 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 64 ms. Remains : 25/39 places, 18/31 transitions.
Built C files in :
/tmp/ltsmin12050354635430563301
[2024-05-28 02:24:57] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12050354635430563301
Running compilation step : cd /tmp/ltsmin12050354635430563301;'/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 96 ms.
Running link step : cd /tmp/ltsmin12050354635430563301;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12050354635430563301;'/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/stateBased1311148317410373887.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
// Phase 1: matrix 31 rows 39 cols
[2024-05-28 02:25:12] [INFO ] Computed 16 invariants in 7 ms
[2024-05-28 02:25:12] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
[2024-05-28 02:25:12] [INFO ] Invariant cache hit.
[2024-05-28 02:25:12] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 02:25:12] [INFO ] Invariant cache hit.
[2024-05-28 02:25:12] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-28 02:25:12] [INFO ] Invariant cache hit.
[2024-05-28 02:25:12] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 39/39 places, 31/31 transitions.
Built C files in :
/tmp/ltsmin925165283533028248
[2024-05-28 02:25:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin925165283533028248
Running compilation step : cd /tmp/ltsmin925165283533028248;'/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 102 ms.
Running link step : cd /tmp/ltsmin925165283533028248;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin925165283533028248;'/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/stateBased12473057358986123391.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 02:25:27] [INFO ] Flatten gal took : 4 ms
[2024-05-28 02:25:27] [INFO ] Flatten gal took : 4 ms
[2024-05-28 02:25:27] [INFO ] Time to serialize gal into /tmp/LTL3367484805108057904.gal : 2 ms
[2024-05-28 02:25:27] [INFO ] Time to serialize properties into /tmp/LTL233659195519399174.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/LTL3367484805108057904.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15066096125898517152.hoa' '-atoms' '/tmp/LTL233659195519399174.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...317
Loading property file /tmp/LTL233659195519399174.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15066096125898517152.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 02:25:42] [INFO ] Flatten gal took : 3 ms
[2024-05-28 02:25:42] [INFO ] Flatten gal took : 2 ms
[2024-05-28 02:25:42] [INFO ] Time to serialize gal into /tmp/LTL6959981902485535319.gal : 1 ms
[2024-05-28 02:25:42] [INFO ] Time to serialize properties into /tmp/LTL8258543261518425226.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/LTL6959981902485535319.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8258543261518425226.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...275
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(p>p13)")||((X((G("(p13>=2)"))||(("(p13>=2)")&&(F("(p16>p8)")))))U((X(G((G("(p13>=2)"))||(("(p13>=2)")&&(F("(p16>p8)"))))))...232
Formula 0 simplified : XXX(!"(p>p13)" & (X(F!"(p13>=2)" & (!"(p13>=2)" | G!"(p16>p8)")) R (XF(F!"(p13>=2)" & (!"(p13>=2)" | G!"(p16>p8)")) & (!"(p>p13)" | ...205
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2024-05-28 02:25:57] [INFO ] Flatten gal took : 5 ms
[2024-05-28 02:25:57] [INFO ] Applying decomposition
[2024-05-28 02:25:57] [INFO ] Flatten gal took : 3 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/graph7302256386267013728.txt' '-o' '/tmp/graph7302256386267013728.bin' '-w' '/tmp/graph7302256386267013728.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7302256386267013728.bin' '-l' '-1' '-v' '-w' '/tmp/graph7302256386267013728.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:25:57] [INFO ] Decomposing Gal with order
[2024-05-28 02:25:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:25:57] [INFO ] Flatten gal took : 22 ms
[2024-05-28 02:25:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2024-05-28 02:25:57] [INFO ] Time to serialize gal into /tmp/LTL15275298312276611465.gal : 1 ms
[2024-05-28 02:25:57] [INFO ] Time to serialize properties into /tmp/LTL2891512879042111370.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/LTL15275298312276611465.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2891512879042111370.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 : !((X(X(X(("(gu6.p>gu6.p13)")||((X((G("(gu6.p13>=2)"))||(("(gu6.p13>=2)")&&(F("(gu8.p16>gu8.p8)")))))U((X(G((G("(gu6.p13>=2)"))||(("(gu...296
Formula 0 simplified : XXX(!"(gu6.p>gu6.p13)" & (X(F!"(gu6.p13>=2)" & (!"(gu6.p13>=2)" | G!"(gu8.p16>gu8.p8)")) R (XF(F!"(gu6.p13>=2)" & (!"(gu6.p13>=2)" |...269
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin141811185955695367
[2024-05-28 02:26:12] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin141811185955695367
Running compilation step : cd /tmp/ltsmin141811185955695367;'/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 94 ms.
Running link step : cd /tmp/ltsmin141811185955695367;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin141811185955695367;'/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' 'X(X(X(((LTLAPp0==true)||(X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))) U (X([](([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))||((LTLAPp0==true)&&X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property RefineWMG-PT-007007-LTLCardinality-14 finished in 96106 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 U X((F(p1)&&G((p2||F(!p1)))))))'
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 39/39 places, 31/31 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 31/31 (removed 0) transitions.
[2024-05-28 02:26:27] [INFO ] Invariant cache hit.
[2024-05-28 02:26:27] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
[2024-05-28 02:26:27] [INFO ] Invariant cache hit.
[2024-05-28 02:26:27] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-28 02:26:27] [INFO ] Invariant cache hit.
[2024-05-28 02:26:27] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-28 02:26:27] [INFO ] Invariant cache hit.
[2024-05-28 02:26:27] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 137 ms. Remains : 39/39 places, 31/31 transitions.
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p1), p1, (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : RefineWMG-PT-007007-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=true, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 5}, { cond=p0, acceptance={} source=2 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p1 p2), acceptance={} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND p0 p1 p2), acceptance={} source=8 dest: 8}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(LEQ 2 s0), p1:(GT 3 s11), p2:(LEQ s15 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 164 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA RefineWMG-PT-007007-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property RefineWMG-PT-007007-LTLCardinality-15 finished in 661 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||(X((G(p1)||(p1&&F(p2)))) U (X(G((G(p1)||(p1&&F(p2)))))||(p0&&X((G(p1)||(p1&&F(p2))))))))))))'
[2024-05-28 02:26:28] [INFO ] Flatten gal took : 6 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2638651149691633109
[2024-05-28 02:26:28] [INFO ] Computing symmetric may disable matrix : 31 transitions.
[2024-05-28 02:26:28] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:26:28] [INFO ] Computing symmetric may enable matrix : 31 transitions.
[2024-05-28 02:26:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:26:28] [INFO ] Computing Do-Not-Accords matrix : 31 transitions.
[2024-05-28 02:26:28] [INFO ] Applying decomposition
[2024-05-28 02:26:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 02:26:28] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2638651149691633109
Running compilation step : cd /tmp/ltsmin2638651149691633109;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' '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'
[2024-05-28 02:26:28] [INFO ] Flatten gal took : 2 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/graph10035766231119815500.txt' '-o' '/tmp/graph10035766231119815500.bin' '-w' '/tmp/graph10035766231119815500.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10035766231119815500.bin' '-l' '-1' '-v' '-w' '/tmp/graph10035766231119815500.weights' '-q' '0' '-e' '0.001'
[2024-05-28 02:26:28] [INFO ] Decomposing Gal with order
[2024-05-28 02:26:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 02:26:28] [INFO ] Flatten gal took : 4 ms
[2024-05-28 02:26:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-28 02:26:28] [INFO ] Time to serialize gal into /tmp/LTLCardinality12257510875270542181.gal : 1 ms
[2024-05-28 02:26:28] [INFO ] Time to serialize properties into /tmp/LTLCardinality15795505501583505793.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/LTLCardinality12257510875270542181.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15795505501583505793.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...299
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(gu0.p>gu0.p13)")||((X((G("(gu0.p13>=2)"))||(("(gu0.p13>=2)")&&(F("(gu5.p16>gu5.p8)")))))U((X(G((G("(gu0.p13>=2)"))||(("(gu...296
Formula 0 simplified : XXX(!"(gu0.p>gu0.p13)" & (X(F!"(gu0.p13>=2)" & (!"(gu0.p13>=2)" | G!"(gu5.p16>gu5.p8)")) R (XF(F!"(gu0.p13>=2)" & (!"(gu0.p13>=2)" |...269
Compilation finished in 114 ms.
Running link step : cd /tmp/ltsmin2638651149691633109;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 22 ms.
Running LTSmin : cd /tmp/ltsmin2638651149691633109;'/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' 'X(X(X(((LTLAPp0==true)||(X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))) U (X([](([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))||((LTLAPp0==true)&&X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: LTL layer: formula: X(X(X(((LTLAPp0==true)||(X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))) U (X([](([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))||((LTLAPp0==true)&&X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))))))))
pins2lts-mc-linux64( 1/ 8), 0.001: "X(X(X(((LTLAPp0==true)||(X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))) U (X([](([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))||((LTLAPp0==true)&&X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 1/ 8), 0.001: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.014: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.033: DFS-FIFO for weak LTL, using special progress label 35
pins2lts-mc-linux64( 0/ 8), 0.033: There are 36 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.033: State length is 40, there are 44 groups
pins2lts-mc-linux64( 0/ 8), 0.033: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.033: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.033: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.033: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.042: ~1 levels ~960 states ~9632 transitions
pins2lts-mc-linux64( 0/ 8), 0.061: ~1 levels ~1920 states ~20104 transitions
pins2lts-mc-linux64( 0/ 8), 0.101: ~1 levels ~3840 states ~41952 transitions
pins2lts-mc-linux64( 0/ 8), 0.156: ~1 levels ~7680 states ~84824 transitions
pins2lts-mc-linux64( 4/ 8), 0.307: ~1 levels ~15360 states ~185584 transitions
pins2lts-mc-linux64( 4/ 8), 0.498: ~1 levels ~30720 states ~375368 transitions
pins2lts-mc-linux64( 4/ 8), 0.909: ~1 levels ~61440 states ~776072 transitions
pins2lts-mc-linux64( 4/ 8), 1.453: ~1 levels ~122880 states ~1579168 transitions
pins2lts-mc-linux64( 4/ 8), 2.427: ~1 levels ~245760 states ~3355664 transitions
pins2lts-mc-linux64( 4/ 8), 3.552: ~1 levels ~491520 states ~6897104 transitions
pins2lts-mc-linux64( 4/ 8), 5.289: ~1 levels ~983040 states ~14197168 transitions
pins2lts-mc-linux64( 4/ 8), 8.903: ~1 levels ~1966080 states ~29530584 transitions
pins2lts-mc-linux64( 4/ 8), 15.648: ~1 levels ~3932160 states ~60649528 transitions
pins2lts-mc-linux64( 4/ 8), 31.568: ~1 levels ~7864320 states ~126220480 transitions
pins2lts-mc-linux64( 4/ 8), 61.659: ~1 levels ~15728640 states ~257556800 transitions
pins2lts-mc-linux64( 4/ 8), 125.321: ~1 levels ~31457280 states ~532032168 transitions
pins2lts-mc-linux64( 4/ 8), 263.680: ~1 levels ~62914560 states ~1084474072 transitions
pins2lts-mc-linux64( 2/ 8), 299.438: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 299.516:
pins2lts-mc-linux64( 0/ 8), 299.516: mean standard work distribution: 3.0% (states) 1.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 299.516:
pins2lts-mc-linux64( 0/ 8), 299.516: Explored 64228675 states 1182805215 transitions, fanout: 18.416
pins2lts-mc-linux64( 0/ 8), 299.516: Total exploration time 299.460 sec (299.380 sec minimum, 299.417 sec on average)
pins2lts-mc-linux64( 0/ 8), 299.516: States per second: 214482, Transitions per second: 3949794
pins2lts-mc-linux64( 0/ 8), 299.516:
pins2lts-mc-linux64( 0/ 8), 299.516: Progress states detected: 134217350
pins2lts-mc-linux64( 0/ 8), 299.516: Redundant explorations: -52.1458
pins2lts-mc-linux64( 0/ 8), 299.516:
pins2lts-mc-linux64( 0/ 8), 299.516: Queue width: 8B, total height: 113045691, memory: 862.47MB
pins2lts-mc-linux64( 0/ 8), 299.516: Tree memory: 1056.4MB, 8.3 B/state, compr.: 5.1%
pins2lts-mc-linux64( 0/ 8), 299.516: Tree fill ratio (roots/leafs): 99.0%/12.0%
pins2lts-mc-linux64( 0/ 8), 299.516: Stored 31 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 299.516: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 299.516: Est. total memory use: 1918.9MB (~1886.5MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2638651149691633109;'/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' 'X(X(X(((LTLAPp0==true)||(X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))) U (X([](([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))||((LTLAPp0==true)&&X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2638651149691633109;'/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' 'X(X(X(((LTLAPp0==true)||(X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))) U (X([](([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))||((LTLAPp0==true)&&X(([]((LTLAPp1==true))||((LTLAPp1==true)&&<>((LTLAPp2==true))))))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
19160 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,191.625,2213032,1,0,1068,9.43492e+06,21,527,849,1.89596e+07,2657
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA RefineWMG-PT-007007-LTLCardinality-14 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 478014 ms.

BK_STOP 1716863561445

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-007007"
export BK_EXAMINATION="LTLCardinality"
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-007007, examination is LTLCardinality"
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-171662362200422"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/RefineWMG-PT-007007.tgz
mv RefineWMG-PT-007007 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;