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

About the Execution of LTSMin+red for DNAwalker-PT-12ringLLLarge

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
473.636 36585.00 48058.00 632.60 TFFFTFFTF?FFTFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r105-tall-167814481900963.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is DNAwalker-PT-12ringLLLarge, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481900963
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 624K
-rw-r--r-- 1 mcc users 6.0K Feb 25 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 25 12:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Feb 25 13:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 13:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:55 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 14 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 135K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-00
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-01
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-02
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-03
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-04
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-05
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-06
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-07
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-08
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-09
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-12ringLLLarge-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678404948652

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-12ringLLLarge
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 23:35:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 23:35:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:35:50] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-09 23:35:50] [INFO ] Transformed 33 places.
[2023-03-09 23:35:50] [INFO ] Transformed 312 transitions.
[2023-03-09 23:35:50] [INFO ] Parsed PT model containing 33 places and 312 transitions and 916 arcs in 126 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 14 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:35:50] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
// Phase 1: matrix 311 rows 33 cols
[2023-03-09 23:35:50] [INFO ] Computed 0 place invariants in 16 ms
[2023-03-09 23:35:51] [INFO ] Dead Transitions using invariants and state equation in 440 ms found 0 transitions.
[2023-03-09 23:35:51] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:51] [INFO ] Invariant cache hit.
[2023-03-09 23:35:51] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 23:35:51] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:51] [INFO ] Invariant cache hit.
[2023-03-09 23:35:51] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:35:51] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
[2023-03-09 23:35:51] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:51] [INFO ] Invariant cache hit.
[2023-03-09 23:35:51] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 837 ms. Remains : 33/33 places, 312/312 transitions.
Support contains 27 out of 33 places after structural reductions.
[2023-03-09 23:35:51] [INFO ] Flatten gal took : 39 ms
[2023-03-09 23:35:51] [INFO ] Flatten gal took : 18 ms
[2023-03-09 23:35:51] [INFO ] Input system was already deterministic with 312 transitions.
Support contains 25 out of 33 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 767 resets, run finished after 353 ms. (steps per millisecond=28 ) properties (out of 30) seen :26
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-09 23:35:52] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:52] [INFO ] Invariant cache hit.
[2023-03-09 23:35:52] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-09 23:35:55] [INFO ] After 3540ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 33 stabilizing places and 310 stable transitions
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(X(G(p2))))))'
Support contains 6 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:35:56] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:56] [INFO ] Invariant cache hit.
[2023-03-09 23:35:56] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
[2023-03-09 23:35:56] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:56] [INFO ] Invariant cache hit.
[2023-03-09 23:35:56] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 23:35:56] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:56] [INFO ] Invariant cache hit.
[2023-03-09 23:35:56] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:35:56] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-09 23:35:56] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:56] [INFO ] Invariant cache hit.
[2023-03-09 23:35:56] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 531 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 563 ms :[true, (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p1) p0), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=7 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=7 dest: 3}]], initial=4, aps=[p1:(LEQ s1 s32), p0:(LEQ s12 s11), p2:(OR (AND (GT s12 s11) (GT 1 s16)) (LEQ 1 s15))], 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][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 357 ms.
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0))))]
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 8 factoid took 184 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-00 finished in 1980 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F((p1||X((p2||F(p3))))))))'
Support contains 7 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:35:58] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:58] [INFO ] Invariant cache hit.
[2023-03-09 23:35:58] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
[2023-03-09 23:35:58] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:58] [INFO ] Invariant cache hit.
[2023-03-09 23:35:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 23:35:58] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:58] [INFO ] Invariant cache hit.
[2023-03-09 23:35:58] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:35:58] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-09 23:35:58] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:58] [INFO ] Invariant cache hit.
[2023-03-09 23:35:58] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 534 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3))]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s7 s12), p1:(LEQ 2 s25), p2:(LEQ s9 s2), p3:(GT s24 s10)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 9 steps with 1 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-01 finished in 736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:35:58] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:58] [INFO ] Invariant cache hit.
[2023-03-09 23:35:58] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
[2023-03-09 23:35:58] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:58] [INFO ] Invariant cache hit.
[2023-03-09 23:35:59] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 23:35:59] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:59] [INFO ] Invariant cache hit.
[2023-03-09 23:35:59] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:35:59] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 356 ms to find 0 implicit places.
[2023-03-09 23:35:59] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:59] [INFO ] Invariant cache hit.
[2023-03-09 23:35:59] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GT s21 s6)], 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-03 finished in 693 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 21 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:35:59] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:59] [INFO ] Invariant cache hit.
[2023-03-09 23:35:59] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
[2023-03-09 23:35:59] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:59] [INFO ] Invariant cache hit.
[2023-03-09 23:35:59] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 23:35:59] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:35:59] [INFO ] Invariant cache hit.
[2023-03-09 23:35:59] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:35:59] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2023-03-09 23:36:00] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-09 23:36:00] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:00] [INFO ] Invariant cache hit.
[2023-03-09 23:36:00] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 549 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ s12 s10), p0:(OR (LEQ s8 s14) (GT 2 s10))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 186 ms.
Product exploration explored 100000 steps with 0 reset in 109 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 297 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 779 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 125 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:36:01] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:01] [INFO ] Invariant cache hit.
[2023-03-09 23:36:01] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 23:36:03] [INFO ] After 2046ms SMT Verify possible using all constraints in natural 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 p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND p1 (NOT p0)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 8 factoid took 206 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-04 finished in 3733 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 12 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:03] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:03] [INFO ] Invariant cache hit.
[2023-03-09 23:36:03] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
[2023-03-09 23:36:03] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:03] [INFO ] Invariant cache hit.
[2023-03-09 23:36:03] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 23:36:03] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:03] [INFO ] Invariant cache hit.
[2023-03-09 23:36:03] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:03] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-09 23:36:03] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-09 23:36:03] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:03] [INFO ] Invariant cache hit.
[2023-03-09 23:36:03] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 528 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s15)], 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 12 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-05 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:03] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:03] [INFO ] Invariant cache hit.
[2023-03-09 23:36:03] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
[2023-03-09 23:36:03] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:03] [INFO ] Invariant cache hit.
[2023-03-09 23:36:04] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 23:36:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:04] [INFO ] Invariant cache hit.
[2023-03-09 23:36:04] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:04] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2023-03-09 23:36:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:04] [INFO ] Invariant cache hit.
[2023-03-09 23:36:04] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 540 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s30)], 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]]
Stuttering criterion allowed to conclude after 15 steps with 3 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-06 finished in 637 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)||G(F(p2))))))'
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 3 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:04] [INFO ] Invariant cache hit.
[2023-03-09 23:36:04] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
[2023-03-09 23:36:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:04] [INFO ] Invariant cache hit.
[2023-03-09 23:36:04] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 23:36:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:04] [INFO ] Invariant cache hit.
[2023-03-09 23:36:04] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:04] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
[2023-03-09 23:36:04] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:04] [INFO ] Invariant cache hit.
[2023-03-09 23:36:05] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 512 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ s31 s27), p0:(LEQ s30 s9), p2:(AND (GT s30 s9) (GT s31 s27))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 32253 reset in 305 ms.
Product exploration explored 100000 steps with 32259 reset in 347 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 384 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 779 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 23:36:06] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:06] [INFO ] Invariant cache hit.
[2023-03-09 23:36:06] [INFO ] After 21ms 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 p1 p0 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p2) (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F p2), (F (AND (NOT p1) (NOT p2) p0)), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0)))]
Knowledge based reduction with 7 factoid took 560 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 331 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:07] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:07] [INFO ] Invariant cache hit.
[2023-03-09 23:36:07] [INFO ] Dead Transitions using invariants and state equation in 100 ms found 0 transitions.
[2023-03-09 23:36:07] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:07] [INFO ] Invariant cache hit.
[2023-03-09 23:36:07] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 23:36:07] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:07] [INFO ] Invariant cache hit.
[2023-03-09 23:36:08] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:08] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-09 23:36:08] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:08] [INFO ] Invariant cache hit.
[2023-03-09 23:36:08] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 486 ms. Remains : 33/33 places, 312/312 transitions.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 365 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Finished random walk after 614 steps, including 47 resets, run visited all 4 properties in 14 ms. (steps per millisecond=43 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F p2), (F (AND p0 (NOT p1))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 476 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 265 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 32245 reset in 279 ms.
Product exploration explored 100000 steps with 32206 reset in 287 ms.
Applying partial POR strategy [false, false, true, true, true, true]
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 15 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:11] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:11] [INFO ] Invariant cache hit.
[2023-03-09 23:36:11] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
[2023-03-09 23:36:11] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 23:36:11] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:11] [INFO ] Invariant cache hit.
[2023-03-09 23:36:11] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 203 ms. Remains : 33/33 places, 312/312 transitions.
Support contains 4 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:11] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:11] [INFO ] Invariant cache hit.
[2023-03-09 23:36:11] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
[2023-03-09 23:36:11] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:11] [INFO ] Invariant cache hit.
[2023-03-09 23:36:11] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 23:36:11] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:11] [INFO ] Invariant cache hit.
[2023-03-09 23:36:11] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:11] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-09 23:36:11] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:11] [INFO ] Invariant cache hit.
[2023-03-09 23:36:11] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 476 ms. Remains : 33/33 places, 312/312 transitions.
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-09 finished in 7355 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:11] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:11] [INFO ] Invariant cache hit.
[2023-03-09 23:36:11] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
[2023-03-09 23:36:11] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:11] [INFO ] Invariant cache hit.
[2023-03-09 23:36:12] [INFO ] Implicit Places using invariants in 39 ms returned []
[2023-03-09 23:36:12] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:12] [INFO ] Invariant cache hit.
[2023-03-09 23:36:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:12] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-09 23:36:12] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:12] [INFO ] Invariant cache hit.
[2023-03-09 23:36:12] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 505 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s19 s6)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-10 finished in 603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(G(p0))&&F(p1))))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 14 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:12] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:12] [INFO ] Invariant cache hit.
[2023-03-09 23:36:12] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
[2023-03-09 23:36:12] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:12] [INFO ] Invariant cache hit.
[2023-03-09 23:36:12] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 23:36:12] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:12] [INFO ] Invariant cache hit.
[2023-03-09 23:36:12] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:12] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-09 23:36:12] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 23:36:12] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:12] [INFO ] Invariant cache hit.
[2023-03-09 23:36:13] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 536 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-11 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=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT s12 s24), p1:(LEQ 1 s24)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 76 ms.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 289 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 79 steps, including 6 resets, run visited all 2 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 345 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-09 23:36:14] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:14] [INFO ] Invariant cache hit.
[2023-03-09 23:36:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:14] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2023-03-09 23:36:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:17] [INFO ] [Nat]Absence check using state equation in 3041 ms returned unknown
Could not prove EG (NOT p0)
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 13 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:17] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:17] [INFO ] Invariant cache hit.
[2023-03-09 23:36:17] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
[2023-03-09 23:36:17] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:17] [INFO ] Invariant cache hit.
[2023-03-09 23:36:17] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 23:36:17] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:17] [INFO ] Invariant cache hit.
[2023-03-09 23:36:17] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:17] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-09 23:36:17] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 23:36:17] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:17] [INFO ] Invariant cache hit.
[2023-03-09 23:36:18] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 532 ms. Remains : 33/33 places, 312/312 transitions.
Computed a total of 33 stabilizing places and 310 stable transitions
Computed a total of 33 stabilizing places and 310 stable transitions
Detected a total of 33/33 stabilizing places and 310/312 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 405 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Finished random walk after 17 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 364 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2023-03-09 23:36:19] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:19] [INFO ] Invariant cache hit.
[2023-03-09 23:36:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:19] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2023-03-09 23:36:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:36:22] [INFO ] [Nat]Absence check using state equation in 3040 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-11 finished in 10070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:22] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:22] [INFO ] Invariant cache hit.
[2023-03-09 23:36:22] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
[2023-03-09 23:36:22] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:22] [INFO ] Invariant cache hit.
[2023-03-09 23:36:22] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 23:36:22] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:22] [INFO ] Invariant cache hit.
[2023-03-09 23:36:22] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:22] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-09 23:36:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:36:22] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:22] [INFO ] Invariant cache hit.
[2023-03-09 23:36:23] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 581 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 100 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-13 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 s17 s8)], 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 7 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-13 finished in 703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 312/312 transitions.
Applied a total of 0 rules in 4 ms. Remains 33 /33 variables (removed 0) and now considering 312/312 (removed 0) transitions.
[2023-03-09 23:36:23] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:23] [INFO ] Invariant cache hit.
[2023-03-09 23:36:23] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
[2023-03-09 23:36:23] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:23] [INFO ] Invariant cache hit.
[2023-03-09 23:36:23] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-09 23:36:23] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:23] [INFO ] Invariant cache hit.
[2023-03-09 23:36:23] [INFO ] State equation strengthened by 71 read => feed constraints.
[2023-03-09 23:36:23] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-09 23:36:23] [INFO ] Flow matrix only has 311 transitions (discarded 1 similar events)
[2023-03-09 23:36:23] [INFO ] Invariant cache hit.
[2023-03-09 23:36:23] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 33/33 places, 312/312 transitions.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DNAwalker-PT-12ringLLLarge-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 2 s7), p1:(AND (GT s10 s30) (GT 2 s30))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-12ringLLLarge-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-12ringLLLarge-LTLCardinality-15 finished in 737 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)||G(F(p2))))))'
[2023-03-09 23:36:24] [INFO ] Flatten gal took : 13 ms
[2023-03-09 23:36:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-09 23:36:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 312 transitions and 916 arcs took 3 ms.
Total runtime 33829 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1498/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DNAwalker-PT-12ringLLLarge-LTLCardinality-09

BK_STOP 1678404985237

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name DNAwalker-PT-12ringLLLarge-LTLCardinality-09
ltl formula formula --ltl=/tmp/1498/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 33 places, 312 transitions and 916 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1498/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1498/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1498/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1498/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55880f1083f4]
1: pnml2lts-mc(+0xa2496) [0x55880f108496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7fe8b37c9140]
3: pnml2lts-mc(+0x405be5) [0x55880f46bbe5]
4: pnml2lts-mc(+0x16b3f9) [0x55880f1d13f9]
5: pnml2lts-mc(+0x164ac4) [0x55880f1caac4]
6: pnml2lts-mc(+0x272e0a) [0x55880f2d8e0a]
7: pnml2lts-mc(+0xb61f0) [0x55880f11c1f0]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7fe8b361c4d7]
9: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7fe8b361c67a]
10: pnml2lts-mc(+0xa1581) [0x55880f107581]
11: pnml2lts-mc(+0xa1910) [0x55880f107910]
12: pnml2lts-mc(+0xa32a2) [0x55880f1092a2]
13: pnml2lts-mc(+0xa50f4) [0x55880f10b0f4]
14: pnml2lts-mc(+0x3f34b3) [0x55880f4594b3]
15: pnml2lts-mc(+0x7c63d) [0x55880f0e263d]
16: pnml2lts-mc(+0x67d86) [0x55880f0cdd86]
17: pnml2lts-mc(+0x60a8a) [0x55880f0c6a8a]
18: pnml2lts-mc(+0x5eb15) [0x55880f0c4b15]
19: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7fe8b3604d0a]
20: pnml2lts-mc(+0x6075e) [0x55880f0c675e]

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="DNAwalker-PT-12ringLLLarge"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is DNAwalker-PT-12ringLLLarge, 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 r105-tall-167814481900963"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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