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

About the Execution of LTSMin+red for DNAwalker-PT-05track28LR

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
412.067 95063.00 112999.00 930.70 FTFT?FFF?FTFFTTF 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-167814481800907.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-05track28LR, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481800907
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Feb 25 13:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 13:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 12:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K 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.6K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 15:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Feb 25 13:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 13:00 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 12 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 108K 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-05track28LR-LTLCardinality-00
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-01
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-02
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-03
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-04
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-05
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-06
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-07
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-08
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-09
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-10
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-11
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-12
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-13
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-14
FORMULA_NAME DNAwalker-PT-05track28LR-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678403362970

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-05track28LR
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-09 23:09:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-09 23:09:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 23:09:24] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-09 23:09:24] [INFO ] Transformed 34 places.
[2023-03-09 23:09:24] [INFO ] Transformed 250 transitions.
[2023-03-09 23:09:24] [INFO ] Parsed PT model containing 34 places and 250 transitions and 728 arcs in 104 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 3 formulas.
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 16 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:09:24] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2023-03-09 23:09:24] [INFO ] Computed 0 place invariants in 15 ms
[2023-03-09 23:09:25] [INFO ] Dead Transitions using invariants and state equation in 454 ms found 0 transitions.
[2023-03-09 23:09:25] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:25] [INFO ] Invariant cache hit.
[2023-03-09 23:09:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-09 23:09:25] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:25] [INFO ] Invariant cache hit.
[2023-03-09 23:09:25] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:25] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-09 23:09:25] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:25] [INFO ] Invariant cache hit.
[2023-03-09 23:09:25] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 874 ms. Remains : 34/34 places, 250/250 transitions.
Support contains 27 out of 34 places after structural reductions.
[2023-03-09 23:09:25] [INFO ] Flatten gal took : 34 ms
[2023-03-09 23:09:25] [INFO ] Flatten gal took : 15 ms
[2023-03-09 23:09:25] [INFO ] Input system was already deterministic with 250 transitions.
Incomplete random walk after 10000 steps, including 640 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 26) seen :21
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-09 23:09:26] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:26] [INFO ] Invariant cache hit.
[2023-03-09 23:09:26] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-09 23:09:27] [INFO ] After 896ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 2 ms.
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 34 stabilizing places and 246 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((F(G(p0))||G(p1)) U X(p0)))))'
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:09:27] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:27] [INFO ] Invariant cache hit.
[2023-03-09 23:09:27] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
[2023-03-09 23:09:27] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:27] [INFO ] Invariant cache hit.
[2023-03-09 23:09:27] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 23:09:27] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:27] [INFO ] Invariant cache hit.
[2023-03-09 23:09:27] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:27] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
[2023-03-09 23:09:27] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:27] [INFO ] Invariant cache hit.
[2023-03-09 23:09:27] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 425 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 7}], [{ cond=p0, acceptance={} source=6 dest: 6}, { cond=(NOT p0), acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(LEQ s14 s0), p0:(GT 1 s10)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 26 steps with 2 reset in 3 ms.
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-00 finished in 947 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(X(G(p0)))))'
Support contains 3 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 4 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:09:28] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:28] [INFO ] Invariant cache hit.
[2023-03-09 23:09:28] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
[2023-03-09 23:09:28] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:28] [INFO ] Invariant cache hit.
[2023-03-09 23:09:28] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 23:09:28] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:28] [INFO ] Invariant cache hit.
[2023-03-09 23:09:28] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:28] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
[2023-03-09 23:09:28] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:28] [INFO ] Invariant cache hit.
[2023-03-09 23:09:28] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (LEQ s30 s2) (OR (LEQ s13 s30) (LEQ 1 s30)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-02 finished in 655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 18 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:09:29] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:29] [INFO ] Invariant cache hit.
[2023-03-09 23:09:29] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
[2023-03-09 23:09:29] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:29] [INFO ] Invariant cache hit.
[2023-03-09 23:09:29] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 23:09:29] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:29] [INFO ] Invariant cache hit.
[2023-03-09 23:09:29] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:29] [INFO ] Implicit Places using invariants and state equation in 266 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
[2023-03-09 23:09:29] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-09 23:09:29] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:29] [INFO ] Invariant cache hit.
[2023-03-09 23:09:29] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 499 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s30 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 174 ms.
Product exploration explored 100000 steps with 0 reset in 103 ms.
Computed a total of 34 stabilizing places and 246 stable transitions
Computed a total of 34 stabilizing places and 246 stable transitions
Detected a total of 34/34 stabilizing places and 246/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 29 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=29 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 159 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 14 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:09:30] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:30] [INFO ] Invariant cache hit.
[2023-03-09 23:09:30] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
[2023-03-09 23:09:30] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:30] [INFO ] Invariant cache hit.
[2023-03-09 23:09:30] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 23:09:30] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:30] [INFO ] Invariant cache hit.
[2023-03-09 23:09:30] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:30] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
[2023-03-09 23:09:30] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-09 23:09:30] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:30] [INFO ] Invariant cache hit.
[2023-03-09 23:09:31] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 519 ms. Remains : 34/34 places, 250/250 transitions.
Computed a total of 34 stabilizing places and 246 stable transitions
Computed a total of 34 stabilizing places and 246 stable transitions
Detected a total of 34/34 stabilizing places and 246/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Finished random walk after 42 steps, including 2 resets, run visited all 1 properties in 6 ms. (steps per millisecond=7 )
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 100 ms.
Product exploration explored 100000 steps with 0 reset in 104 ms.
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:09:31] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:31] [INFO ] Invariant cache hit.
[2023-03-09 23:09:32] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
[2023-03-09 23:09:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:32] [INFO ] Invariant cache hit.
[2023-03-09 23:09:32] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 23:09:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:32] [INFO ] Invariant cache hit.
[2023-03-09 23:09:32] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:32] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
[2023-03-09 23:09:32] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 23:09:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:32] [INFO ] Invariant cache hit.
[2023-03-09 23:09:32] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 484 ms. Remains : 34/34 places, 250/250 transitions.
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-04 finished in 3449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:09:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:32] [INFO ] Invariant cache hit.
[2023-03-09 23:09:32] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
[2023-03-09 23:09:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:32] [INFO ] Invariant cache hit.
[2023-03-09 23:09:32] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 23:09:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:32] [INFO ] Invariant cache hit.
[2023-03-09 23:09:32] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:32] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-09 23:09:32] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 23:09:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:32] [INFO ] Invariant cache hit.
[2023-03-09 23:09:32] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 455 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s7 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 25 steps with 1 reset in 0 ms.
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-05 finished in 536 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 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 1 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:09:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:33] [INFO ] Invariant cache hit.
[2023-03-09 23:09:33] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-09 23:09:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:33] [INFO ] Invariant cache hit.
[2023-03-09 23:09:33] [INFO ] Implicit Places using invariants in 32 ms returned []
[2023-03-09 23:09:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:33] [INFO ] Invariant cache hit.
[2023-03-09 23:09:33] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:33] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-09 23:09:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:33] [INFO ] Invariant cache hit.
[2023-03-09 23:09:33] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 464 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-06 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 s21 s14)], 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-05track28LR-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-06 finished in 567 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(X(p0)&&p1) U G((X((G(p2)&&p3)) U p4)))))'
Support contains 7 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:09:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:33] [INFO ] Invariant cache hit.
[2023-03-09 23:09:33] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
[2023-03-09 23:09:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:33] [INFO ] Invariant cache hit.
[2023-03-09 23:09:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 23:09:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:33] [INFO ] Invariant cache hit.
[2023-03-09 23:09:33] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:33] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 248 ms to find 0 implicit places.
[2023-03-09 23:09:33] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:33] [INFO ] Invariant cache hit.
[2023-03-09 23:09:34] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 582 ms :[(NOT p4), (NOT p4), (OR (AND p0 (NOT p2)) (AND p0 (NOT p4)) (AND p0 (NOT p3))), (AND p0 (NOT p4)), (AND (NOT p2) (NOT p4)), (AND p0 (NOT p2) (NOT p4)), true, (NOT p2), (OR (NOT p2) (NOT p4) (NOT p3)), (NOT p4), (AND (NOT p2) p0), (AND (NOT p2) (NOT p4))]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p4), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p4) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(NOT p4), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p4) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p4 p3 p2), acceptance={} source=1 dest: 4}, { cond=(AND p4 p1 p3 p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p2) p0)), acceptance={} source=2 dest: 6}, { cond=(AND p4 p3 p2 p0), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p4) p3 p2 p0), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p4) p0), acceptance={} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=(NOT p2), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p4) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p4) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p4 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p4) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p4 p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p4) p1 p2), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p4) p2 p0), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p4) (NOT p2) p0), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 9}, { cond=(AND p4 p2 p0), acceptance={} source=5 dest: 11}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p4 p3 p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p4) p3 p2), acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p4), acceptance={} source=9 dest: 8}, { cond=true, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 6}, { cond=(AND p2 p0), acceptance={} source=10 dest: 7}], [{ cond=(AND (NOT p4) p2), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p4) (NOT p2)), acceptance={} source=11 dest: 8}, { cond=(NOT p2), acceptance={} source=11 dest: 9}, { cond=(AND p4 p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p4:(LEQ s19 s31), p1:(LEQ s19 s27), p3:(LEQ s8 s0), p2:(LEQ 2 s8), p0:(LEQ s3 s25)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 65 ms.
Product exploration explored 100000 steps with 1 reset in 102 ms.
Computed a total of 34 stabilizing places and 246 stable transitions
Computed a total of 34 stabilizing places and 246 stable transitions
Detected a total of 34/34 stabilizing places and 246/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 5/5 atomic propositions.
Knowledge obtained : [(AND p4 p1 p3 (NOT p2) p0), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND p4 p1 p3 p2))), (X (NOT (AND (NOT p4) p1))), (X (NOT (AND p4 p3 p2))), (X p4), (X (NOT (AND (NOT p4) p3 p2 p0))), (X (OR (NOT p3) (NOT p2))), (X (NOT (AND p4 p3 p2 p0))), (X (X (NOT (AND p4 p1 p3 p2)))), (X (X (NOT (AND p4 p3 p2)))), (X (X (OR (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p4) (NOT p2))))), true, (X (X (NOT (AND (NOT p4) p2)))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND (NOT p4) p2 p0)))), (X (X p4)), (X (X (NOT (AND (NOT p4) p1 p2)))), (X (X (NOT (AND (NOT p4) (NOT p2) p0)))), (X (X (NOT (AND (NOT p4) p1 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p2 p0)))), (X (X (NOT (AND p4 p3 p2 p0)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p3) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) p0)))), (X p0), (X (NOT p0)), (X (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p4 p2 p0))), (X (X (NOT (AND p4 p2 p0)))), (X (X (AND p4 p2))), (X (X (NOT (AND p4 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (AND p4 p1 p2))), (X (X (NOT (AND p4 p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 30 factoid took 12486 ms. Reduced automaton from 12 states, 41 edges and 5 AP (stutter sensitive) to 12 states, 41 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 555 ms :[(NOT p4), (NOT p4), (OR (AND p0 (NOT p2)) (AND p0 (NOT p4)) (AND p0 (NOT p3))), (AND p0 (NOT p4)), (AND (NOT p2) (NOT p4)), (AND p0 (NOT p2) (NOT p4)), true, (NOT p2), (OR (NOT p2) (NOT p4) (NOT p3)), (NOT p4), (AND (NOT p2) p0), (AND (NOT p2) (NOT p4))]
Incomplete random walk after 10000 steps, including 644 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 26) seen :17
Incomplete Best-First random walk after 10000 steps, including 69 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 58 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 68 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-09 23:09:48] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:09:48] [INFO ] Invariant cache hit.
[2023-03-09 23:09:48] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-09 23:09:49] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :3
[2023-03-09 23:09:49] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:09:49] [INFO ] After 62ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :6 sat :3
[2023-03-09 23:09:49] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :3
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-09 23:09:49] [INFO ] After 1021ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :3
Fused 9 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 250/250 transitions.
Graph (complete) has 240 edges and 34 vertex of which 32 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 32 transition count 230
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 22 place count 29 transition count 227
Applied a total of 22 rules in 11 ms. Remains 29 /34 variables (removed 5) and now considering 227/250 (removed 23) transitions.
// Phase 1: matrix 227 rows 29 cols
[2023-03-09 23:09:49] [INFO ] Computed 0 place invariants in 2 ms
[2023-03-09 23:09:49] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 29/34 places, 227/250 transitions.
Incomplete random walk after 10000 steps, including 627 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Finished probabilistic random walk after 743 steps, run visited all 3 properties in 25 ms. (steps per millisecond=29 )
Probabilistic random walk after 743 steps, saw 370 distinct states, run finished after 25 ms. (steps per millisecond=29 ) properties seen :3
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p4 p1 p3 (NOT p2) p0), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND p4 p1 p3 p2))), (X (NOT (AND (NOT p4) p1))), (X (NOT (AND p4 p3 p2))), (X p4), (X (NOT (AND (NOT p4) p3 p2 p0))), (X (OR (NOT p3) (NOT p2))), (X (NOT (AND p4 p3 p2 p0))), (X (X (NOT (AND p4 p1 p3 p2)))), (X (X (NOT (AND p4 p3 p2)))), (X (X (OR (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p4) (NOT p2))))), true, (X (X (NOT (AND (NOT p4) p2)))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND (NOT p4) p2 p0)))), (X (X p4)), (X (X (NOT (AND (NOT p4) p1 p2)))), (X (X (NOT (AND (NOT p4) (NOT p2) p0)))), (X (X (NOT (AND (NOT p4) p1 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p2 p0)))), (X (X (NOT (AND p4 p3 p2 p0)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p2) (NOT p3))), (G (NOT (AND (NOT p4) p2 p3))), (G (NOT (AND p4 p1 p2 p3))), (G (NOT (AND p4 p2 p3))), (G (NOT (AND p4 p0 p2 p3))), (G (NOT (AND (NOT p4) p0 p2 p3)))]
False Knowledge obtained : [(X (OR (AND (NOT p3) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) p0)))), (X p0), (X (NOT p0)), (X (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p4 p2 p0))), (X (X (NOT (AND p4 p2 p0)))), (X (X (AND p4 p2))), (X (X (NOT (AND p4 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (AND p4 p1 p2))), (X (X (NOT (AND p4 p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (F (AND p0 p2)), (F (AND p4 p0 p2)), (F (NOT p4)), (F (NOT p1)), (F (AND (NOT p4) p1)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p4) p0 (NOT p2))), (F (AND (NOT p4) p0 p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p4) p1 (NOT p2))), (F (AND (NOT p4) (NOT p2))), (F p2), (F (AND (NOT p4) p1 p2)), (F (AND p4 p1 p2)), (F (AND (NOT p4) p2)), (F (AND p4 p2)), (F (NOT p0)), (F (AND (NOT p4) p0))]
Knowledge based reduction with 36 factoid took 13215 ms. Reduced automaton from 12 states, 41 edges and 5 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Stuttering acceptance computed with spot in 171 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Support contains 5 out of 34 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:03] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
// Phase 1: matrix 247 rows 34 cols
[2023-03-09 23:10:03] [INFO ] Computed 0 place invariants in 3 ms
[2023-03-09 23:10:03] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-09 23:10:03] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:03] [INFO ] Invariant cache hit.
[2023-03-09 23:10:03] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 23:10:03] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:03] [INFO ] Invariant cache hit.
[2023-03-09 23:10:03] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:03] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-09 23:10:03] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:03] [INFO ] Invariant cache hit.
[2023-03-09 23:10:03] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 34/34 places, 250/250 transitions.
Computed a total of 34 stabilizing places and 246 stable transitions
Computed a total of 34 stabilizing places and 246 stable transitions
Detected a total of 34/34 stabilizing places and 246/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p4 p1 p0), (X p4), (X (NOT (AND (NOT p4) p1))), (X (NOT (AND p0 (NOT p4)))), true, (X (X p4)), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND p0 (NOT p4))))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p4 p1)), (X (NOT (AND p4 p1))), (X (AND p0 p4)), (X (NOT (AND p0 p4))), (X p0), (X (NOT p0)), (X (X (AND p4 p1))), (X (X (NOT (AND p4 p1)))), (X (X (AND p0 p4))), (X (X (NOT (AND p0 p4)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 882 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Finished random walk after 392 steps, including 26 resets, run visited all 6 properties in 2 ms. (steps per millisecond=196 )
Knowledge obtained : [(AND p4 p1 p0), (X p4), (X (NOT (AND (NOT p4) p1))), (X (NOT (AND p0 (NOT p4)))), true, (X (X p4)), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND p0 (NOT p4))))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p4 p1)), (X (NOT (AND p4 p1))), (X (AND p0 p4)), (X (NOT (AND p0 p4))), (X p0), (X (NOT p0)), (X (X (AND p4 p1))), (X (X (NOT (AND p4 p1)))), (X (X (AND p0 p4))), (X (X (NOT (AND p0 p4)))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p4) p0)), (F (NOT p0)), (F (NOT (AND p4 p0))), (F (NOT p4)), (F (NOT (AND p4 p1))), (F (AND (NOT p4) p1))]
Knowledge based reduction with 11 factoid took 1069 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Stuttering acceptance computed with spot in 147 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Stuttering acceptance computed with spot in 177 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Product exploration explored 100000 steps with 0 reset in 50 ms.
Product exploration explored 100000 steps with 0 reset in 58 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 13 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:06] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:06] [INFO ] Invariant cache hit.
[2023-03-09 23:10:07] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
[2023-03-09 23:10:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:10:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:07] [INFO ] Invariant cache hit.
[2023-03-09 23:10:07] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 183 ms. Remains : 34/34 places, 250/250 transitions.
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:07] [INFO ] Invariant cache hit.
[2023-03-09 23:10:07] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
[2023-03-09 23:10:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:07] [INFO ] Invariant cache hit.
[2023-03-09 23:10:07] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 23:10:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:07] [INFO ] Invariant cache hit.
[2023-03-09 23:10:07] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:07] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2023-03-09 23:10:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:07] [INFO ] Invariant cache hit.
[2023-03-09 23:10:07] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 34/34 places, 250/250 transitions.
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-08 finished in 34009 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) U (X(G(p0))||(X(p0)&&(!p1||X((p2||F(p3))))))))'
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:07] [INFO ] Invariant cache hit.
[2023-03-09 23:10:07] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
[2023-03-09 23:10:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:07] [INFO ] Invariant cache hit.
[2023-03-09 23:10:07] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 23:10:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:07] [INFO ] Invariant cache hit.
[2023-03-09 23:10:07] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:07] [INFO ] Implicit Places using invariants and state equation in 247 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
[2023-03-09 23:10:07] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:07] [INFO ] Invariant cache hit.
[2023-03-09 23:10:08] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 443 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p2) (NOT p3)), true, (AND (NOT p3) (NOT p0)), (NOT p3)]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p3), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (LEQ s4 s18) (LEQ 1 s16)), p0:(GT s4 s18), p2:(GT 1 s16), p3:(GT s9 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 2 reset in 1 ms.
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-09 finished in 677 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(F(p0))))'
Support contains 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:08] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:08] [INFO ] Invariant cache hit.
[2023-03-09 23:10:08] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
[2023-03-09 23:10:08] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:08] [INFO ] Invariant cache hit.
[2023-03-09 23:10:08] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-09 23:10:08] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:08] [INFO ] Invariant cache hit.
[2023-03-09 23:10:08] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:08] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-09 23:10:08] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:08] [INFO ] Invariant cache hit.
[2023-03-09 23:10:08] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 477 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s31 s9)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 24 steps with 5 reset in 1 ms.
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-11 finished in 606 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||X((p1||X(G(p1))))))))'
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:08] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:08] [INFO ] Invariant cache hit.
[2023-03-09 23:10:08] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
[2023-03-09 23:10:08] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:08] [INFO ] Invariant cache hit.
[2023-03-09 23:10:09] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-09 23:10:09] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:09] [INFO ] Invariant cache hit.
[2023-03-09 23:10:09] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:09] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2023-03-09 23:10:09] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:09] [INFO ] Invariant cache hit.
[2023-03-09 23:10:09] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(LEQ s5 s8), p1:(GT s11 s25)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Product exploration explored 100000 steps with 0 reset in 76 ms.
Computed a total of 34 stabilizing places and 246 stable transitions
Computed a total of 34 stabilizing places and 246 stable transitions
Detected a total of 34/34 stabilizing places and 246/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 638 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Finished random walk after 2082 steps, including 134 resets, run visited all 6 properties in 12 ms. (steps per millisecond=173 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 725 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter insensitive) to 4 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
[2023-03-09 23:10:11] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:11] [INFO ] Invariant cache hit.
[2023-03-09 23:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:10:11] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2023-03-09 23:10:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:10:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:10:12] [INFO ] [Nat]Absence check using state equation in 760 ms returned sat
[2023-03-09 23:10:12] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:12] [INFO ] [Nat]Added 54 Read/Feed constraints in 31 ms returned sat
[2023-03-09 23:10:12] [INFO ] Computed and/alt/rep : 114/943/114 causal constraints (skipped 117 transitions) in 21 ms.
[2023-03-09 23:10:12] [INFO ] Added : 1 causal constraints over 1 iterations in 106 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:12] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:12] [INFO ] Invariant cache hit.
[2023-03-09 23:10:12] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-09 23:10:12] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:12] [INFO ] Invariant cache hit.
[2023-03-09 23:10:12] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 23:10:12] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:12] [INFO ] Invariant cache hit.
[2023-03-09 23:10:12] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:13] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-09 23:10:13] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:10:13] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:13] [INFO ] Invariant cache hit.
[2023-03-09 23:10:13] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 472 ms. Remains : 34/34 places, 250/250 transitions.
Computed a total of 34 stabilizing places and 246 stable transitions
Computed a total of 34 stabilizing places and 246 stable transitions
Detected a total of 34/34 stabilizing places and 246/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 9 factoid took 672 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter insensitive) to 4 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Finished random walk after 1326 steps, including 86 resets, run visited all 6 properties in 25 ms. (steps per millisecond=53 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (AND p0 (NOT p1))), (F (AND p0 p1)), (F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 9 factoid took 728 ms. Reduced automaton from 4 states, 17 edges and 2 AP (stutter insensitive) to 4 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
[2023-03-09 23:10:15] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:15] [INFO ] Invariant cache hit.
[2023-03-09 23:10:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 23:10:15] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-09 23:10:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 23:10:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 23:10:16] [INFO ] [Nat]Absence check using state equation in 753 ms returned sat
[2023-03-09 23:10:16] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:16] [INFO ] [Nat]Added 54 Read/Feed constraints in 23 ms returned sat
[2023-03-09 23:10:16] [INFO ] Computed and/alt/rep : 114/943/114 causal constraints (skipped 117 transitions) in 17 ms.
[2023-03-09 23:10:16] [INFO ] Added : 1 causal constraints over 1 iterations in 98 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-12 finished in 7407 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 2 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 2 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:16] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:16] [INFO ] Invariant cache hit.
[2023-03-09 23:10:16] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-09 23:10:16] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:16] [INFO ] Invariant cache hit.
[2023-03-09 23:10:16] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-09 23:10:16] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:16] [INFO ] Invariant cache hit.
[2023-03-09 23:10:16] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:16] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2023-03-09 23:10:16] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:16] [INFO ] Invariant cache hit.
[2023-03-09 23:10:16] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 488 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-14 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 s10 s20)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Product exploration explored 100000 steps with 50000 reset in 183 ms.
Computed a total of 34 stabilizing places and 246 stable transitions
Computed a total of 34 stabilizing places and 246 stable transitions
Detected a total of 34/34 stabilizing places and 246/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 70 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-14 finished in 1014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 10 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:17] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:17] [INFO ] Invariant cache hit.
[2023-03-09 23:10:17] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-09 23:10:17] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:17] [INFO ] Invariant cache hit.
[2023-03-09 23:10:17] [INFO ] Implicit Places using invariants in 36 ms returned []
[2023-03-09 23:10:17] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:17] [INFO ] Invariant cache hit.
[2023-03-09 23:10:17] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:17] [INFO ] Implicit Places using invariants and state equation in 272 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2023-03-09 23:10:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 23:10:17] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:17] [INFO ] Invariant cache hit.
[2023-03-09 23:10:17] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 498 ms. Remains : 34/34 places, 250/250 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s32)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-05track28LR-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-15 finished in 581 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((!(X(p0)&&p1) U G((X((G(p2)&&p3)) U p4)))))'
Found a Lengthening insensitive property : DNAwalker-PT-05track28LR-LTLCardinality-08
Stuttering acceptance computed with spot in 631 ms :[(NOT p4), (NOT p4), (OR (AND p0 (NOT p2)) (AND p0 (NOT p4)) (AND p0 (NOT p3))), (AND p0 (NOT p4)), (AND (NOT p2) (NOT p4)), (AND p0 (NOT p2) (NOT p4)), true, (NOT p2), (OR (NOT p2) (NOT p4) (NOT p3)), (NOT p4), (AND (NOT p2) p0), (AND (NOT p2) (NOT p4))]
Support contains 7 out of 34 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 6 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:18] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:18] [INFO ] Invariant cache hit.
[2023-03-09 23:10:18] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-09 23:10:18] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:18] [INFO ] Invariant cache hit.
[2023-03-09 23:10:18] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-09 23:10:18] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:18] [INFO ] Invariant cache hit.
[2023-03-09 23:10:18] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:19] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-09 23:10:19] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:19] [INFO ] Invariant cache hit.
[2023-03-09 23:10:19] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 412 ms. Remains : 34/34 places, 250/250 transitions.
Running random walk in product with property : DNAwalker-PT-05track28LR-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p4), acceptance={0, 1} source=0 dest: 1}, { cond=(AND (NOT p4) p1), acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 0}, { cond=(NOT p4), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p4) p1), acceptance={} source=1 dest: 2}, { cond=(OR (AND p1 (NOT p3)) (AND p1 (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p4 p3 p2), acceptance={} source=1 dest: 4}, { cond=(AND p4 p1 p3 p2), acceptance={} source=1 dest: 5}], [{ cond=(OR (AND (NOT p3) p0) (AND (NOT p2) p0)), acceptance={} source=2 dest: 6}, { cond=(AND p4 p3 p2 p0), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p4) p3 p2 p0), acceptance={} source=2 dest: 8}], [{ cond=(AND (NOT p4) p0), acceptance={} source=3 dest: 8}, { cond=p0, acceptance={} source=3 dest: 9}], [{ cond=(NOT p2), acceptance={1} source=4 dest: 0}, { cond=(AND (NOT p4) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p4) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p4 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p4) p2), acceptance={0} source=4 dest: 4}, { cond=(AND p4 p1 p2), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p4) p1 p2), acceptance={} source=4 dest: 10}], [{ cond=(AND (NOT p4) p2 p0), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p4) (NOT p2) p0), acceptance={} source=5 dest: 8}, { cond=(AND (NOT p2) p0), acceptance={} source=5 dest: 9}, { cond=(AND p4 p2 p0), acceptance={} source=5 dest: 11}], [{ cond=true, acceptance={0, 1} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(OR (NOT p3) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p4 p3 p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p4) p3 p2), acceptance={0, 1} source=8 dest: 8}], [{ cond=(NOT p4), acceptance={} source=9 dest: 8}, { cond=true, acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p2) p0), acceptance={} source=10 dest: 6}, { cond=(AND p2 p0), acceptance={} source=10 dest: 7}], [{ cond=(AND (NOT p4) p2), acceptance={} source=11 dest: 7}, { cond=(AND (NOT p4) (NOT p2)), acceptance={} source=11 dest: 8}, { cond=(NOT p2), acceptance={} source=11 dest: 9}, { cond=(AND p4 p2), acceptance={} source=11 dest: 11}]], initial=0, aps=[p4:(LEQ s19 s31), p1:(LEQ s19 s27), p3:(LEQ s8 s0), p2:(LEQ 2 s8), p0:(LEQ s3 s25)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 63 ms.
Computed a total of 34 stabilizing places and 246 stable transitions
Computed a total of 34 stabilizing places and 246 stable transitions
Detected a total of 34/34 stabilizing places and 246/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 5/5 atomic propositions.
Knowledge obtained : [(AND p4 p1 p3 (NOT p2) p0), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND p4 p1 p3 p2))), (X (NOT (AND (NOT p4) p1))), (X (NOT (AND p4 p3 p2))), (X p4), (X (NOT (AND (NOT p4) p3 p2 p0))), (X (OR (NOT p3) (NOT p2))), (X (NOT (AND p4 p3 p2 p0))), (X (X (NOT (AND p4 p1 p3 p2)))), (X (X (NOT (AND p4 p3 p2)))), (X (X (OR (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p4) (NOT p2))))), true, (X (X (NOT (AND (NOT p4) p2)))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND (NOT p4) p2 p0)))), (X (X p4)), (X (X (NOT (AND (NOT p4) p1 p2)))), (X (X (NOT (AND (NOT p4) (NOT p2) p0)))), (X (X (NOT (AND (NOT p4) p1 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p2 p0)))), (X (X (NOT (AND p4 p3 p2 p0)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (OR (AND (NOT p3) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) p0)))), (X p0), (X (NOT p0)), (X (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p4 p2 p0))), (X (X (NOT (AND p4 p2 p0)))), (X (X (AND p4 p2))), (X (X (NOT (AND p4 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (AND p4 p1 p2))), (X (X (NOT (AND p4 p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 30 factoid took 12284 ms. Reduced automaton from 12 states, 41 edges and 5 AP (stutter sensitive) to 12 states, 41 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 516 ms :[(NOT p4), (NOT p4), (OR (AND p0 (NOT p2)) (AND p0 (NOT p4)) (AND p0 (NOT p3))), (AND p0 (NOT p4)), (AND (NOT p2) (NOT p4)), (AND p0 (NOT p2) (NOT p4)), true, (NOT p2), (OR (NOT p2) (NOT p4) (NOT p3)), (NOT p4), (AND (NOT p2) p0), (AND (NOT p2) (NOT p4))]
Incomplete random walk after 10000 steps, including 639 resets, run finished after 195 ms. (steps per millisecond=51 ) properties (out of 26) seen :15
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-09 23:10:32] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:32] [INFO ] Invariant cache hit.
[2023-03-09 23:10:32] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-09 23:10:37] [INFO ] After 4825ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :5
[2023-03-09 23:10:37] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:38] [INFO ] After 1038ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :6 sat :5
[2023-03-09 23:10:38] [INFO ] After 1462ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :5
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-09 23:10:39] [INFO ] After 6530ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :5
Fused 11 Parikh solutions to 5 different solutions.
Finished Parikh walk after 12 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=12 )
Parikh walk visited 5 properties in 3 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND p4 p1 p3 (NOT p2) p0), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND p4 p1 p3 p2))), (X (NOT (AND (NOT p4) p1))), (X (NOT (AND p4 p3 p2))), (X p4), (X (NOT (AND (NOT p4) p3 p2 p0))), (X (OR (NOT p3) (NOT p2))), (X (NOT (AND p4 p3 p2 p0))), (X (X (NOT (AND p4 p1 p3 p2)))), (X (X (NOT (AND p4 p3 p2)))), (X (X (OR (NOT p3) (NOT p2)))), (X (X (NOT (AND (NOT p4) p3 p2)))), (X (X (NOT (AND (NOT p4) (NOT p2))))), true, (X (X (NOT (AND (NOT p4) p2)))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND (NOT p4) p2 p0)))), (X (X p4)), (X (X (NOT (AND (NOT p4) p1 p2)))), (X (X (NOT (AND (NOT p4) (NOT p2) p0)))), (X (X (NOT (AND (NOT p4) p1 (NOT p2))))), (X (X (NOT (AND (NOT p4) p3 p2 p0)))), (X (X (NOT (AND p4 p3 p2 p0)))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p2) (NOT p3))), (G (NOT (AND (NOT p4) p2 p3))), (G (NOT (AND p4 p1 p2 p3))), (G (NOT (AND p4 p2 p3))), (G (NOT (AND p4 p0 p2 p3))), (G (NOT (AND (NOT p4) p0 p2 p3)))]
False Knowledge obtained : [(X (OR (AND (NOT p3) p0) (AND (NOT p2) p0))), (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) p0)))), (X p0), (X (NOT p0)), (X (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))), (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X (OR (AND (NOT p3) p0) (AND (NOT p2) p0)))), (X (X (NOT (OR (AND (NOT p3) p0) (AND (NOT p2) p0))))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p4 p2 p0))), (X (X (NOT (AND p4 p2 p0)))), (X (X (AND p4 p2))), (X (X (NOT (AND p4 p2)))), (X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p1 (NOT p3)) (AND p1 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p3)) (AND p1 (NOT p2)))))), (X (X (AND p4 p1 p2))), (X (X (NOT (AND p4 p1 p2)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (AND p1 (NOT p2)) (AND p1 (NOT p3))))), (F (AND p0 p2)), (F (AND p4 p0 p2)), (F (NOT p4)), (F (NOT p1)), (F (AND (NOT p4) p1)), (F (NOT (AND p0 (NOT p2)))), (F (AND (NOT p4) p0 (NOT p2))), (F (AND (NOT p4) p0 p2)), (F (NOT (OR (AND p0 (NOT p2)) (AND p0 (NOT p3))))), (F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p4) p1 (NOT p2))), (F (AND (NOT p4) (NOT p2))), (F p2), (F (AND (NOT p4) p1 p2)), (F (AND p4 p1 p2)), (F (AND (NOT p4) p2)), (F (AND p4 p2)), (F (NOT p0)), (F (AND (NOT p4) p0))]
Knowledge based reduction with 36 factoid took 13243 ms. Reduced automaton from 12 states, 41 edges and 5 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Stuttering acceptance computed with spot in 157 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Support contains 5 out of 34 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 3 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:52] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:52] [INFO ] Invariant cache hit.
[2023-03-09 23:10:52] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
[2023-03-09 23:10:52] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:52] [INFO ] Invariant cache hit.
[2023-03-09 23:10:52] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 23:10:52] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:52] [INFO ] Invariant cache hit.
[2023-03-09 23:10:52] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:53] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2023-03-09 23:10:53] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:53] [INFO ] Invariant cache hit.
[2023-03-09 23:10:53] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 419 ms. Remains : 34/34 places, 250/250 transitions.
Computed a total of 34 stabilizing places and 246 stable transitions
Computed a total of 34 stabilizing places and 246 stable transitions
Detected a total of 34/34 stabilizing places and 246/250 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND p4 p1 p0), (X p4), (X (NOT (AND (NOT p4) p1))), (X (NOT (AND p0 (NOT p4)))), true, (X (X p4)), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND p0 (NOT p4))))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p4 p1)), (X (NOT (AND p4 p1))), (X (AND p0 p4)), (X (NOT (AND p0 p4))), (X p0), (X (NOT p0)), (X (X (AND p4 p1))), (X (X (NOT (AND p4 p1)))), (X (X (AND p0 p4))), (X (X (NOT (AND p0 p4)))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 11 factoid took 811 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 268 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Finished random walk after 1171 steps, including 72 resets, run visited all 6 properties in 10 ms. (steps per millisecond=117 )
Knowledge obtained : [(AND p4 p1 p0), (X p4), (X (NOT (AND (NOT p4) p1))), (X (NOT (AND p0 (NOT p4)))), true, (X (X p4)), (X (X (NOT (AND (NOT p4) p1)))), (X (X (NOT (AND p0 (NOT p4))))), (F (OR (G p4) (G (NOT p4)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (AND p4 p1)), (X (NOT (AND p4 p1))), (X (AND p0 p4)), (X (NOT (AND p0 p4))), (X p0), (X (NOT p0)), (X (X (AND p4 p1))), (X (X (NOT (AND p4 p1)))), (X (X (AND p0 p4))), (X (X (NOT (AND p0 p4)))), (X (X p0)), (X (X (NOT p0))), (F (AND (NOT p4) p0)), (F (NOT p0)), (F (NOT (AND p4 p0))), (F (NOT p4)), (F (NOT (AND p4 p1))), (F (AND (NOT p4) p1))]
Knowledge based reduction with 11 factoid took 974 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 149 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Product exploration explored 100000 steps with 0 reset in 52 ms.
Product exploration explored 100000 steps with 0 reset in 53 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 181 ms :[(NOT p4), p0, (AND (NOT p4) p0), true, (NOT p4)]
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 7 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:56] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:56] [INFO ] Invariant cache hit.
[2023-03-09 23:10:56] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
[2023-03-09 23:10:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-09 23:10:56] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:56] [INFO ] Invariant cache hit.
[2023-03-09 23:10:56] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 189 ms. Remains : 34/34 places, 250/250 transitions.
Support contains 5 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 250/250 transitions.
Applied a total of 0 rules in 0 ms. Remains 34 /34 variables (removed 0) and now considering 250/250 (removed 0) transitions.
[2023-03-09 23:10:56] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:56] [INFO ] Invariant cache hit.
[2023-03-09 23:10:56] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
[2023-03-09 23:10:56] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:56] [INFO ] Invariant cache hit.
[2023-03-09 23:10:56] [INFO ] Implicit Places using invariants in 33 ms returned []
[2023-03-09 23:10:56] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:56] [INFO ] Invariant cache hit.
[2023-03-09 23:10:56] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-09 23:10:56] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-09 23:10:56] [INFO ] Flow matrix only has 247 transitions (discarded 3 similar events)
[2023-03-09 23:10:56] [INFO ] Invariant cache hit.
[2023-03-09 23:10:56] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 423 ms. Remains : 34/34 places, 250/250 transitions.
Treatment of property DNAwalker-PT-05track28LR-LTLCardinality-08 finished in 38699 ms.
[2023-03-09 23:10:56] [INFO ] Flatten gal took : 11 ms
[2023-03-09 23:10:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-09 23:10:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 250 transitions and 728 arcs took 2 ms.
Total runtime 92286 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2859/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2859/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DNAwalker-PT-05track28LR-LTLCardinality-04
Could not compute solution for formula : DNAwalker-PT-05track28LR-LTLCardinality-08

BK_STOP 1678403458033

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name DNAwalker-PT-05track28LR-LTLCardinality-04
ltl formula formula --ltl=/tmp/2859/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 34 places, 250 transitions and 728 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.040 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2859/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2859/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2859/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2859/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DNAwalker-PT-05track28LR-LTLCardinality-08
ltl formula formula --ltl=/tmp/2859/ltl_1_
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
pnml2lts-mc( 0/ 4): Petri net has 34 places, 250 transitions and 728 arcs
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.010 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2859/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2859/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2859/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2859/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 12 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-05track28LR"
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-05track28LR, 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-167814481800907"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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