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

About the Execution of ITS-Tools for DNAwalker-PT-16redondantChoiceR

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6231.871 1246064.00 4635788.00 811.90 FFFTFFFFFFTFFTFF 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.r101-tall-167814476100996.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 itstools
Input is DNAwalker-PT-16redondantChoiceR, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814476100996
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 8.4K Feb 25 13:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 13:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 25 13:02 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.7K Feb 25 15:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K 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 6.8K Feb 25 13:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 25 13:03 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 25 13:03 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K 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 19 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 211K 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-16redondantChoiceR-LTLFireability-00
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-01
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-02
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-03
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-04
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-05
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-06
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-07
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-08
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-09
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-10
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-11
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-12
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-13
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-14
FORMULA_NAME DNAwalker-PT-16redondantChoiceR-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678335569930

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DNAwalker-PT-16redondantChoiceR
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 04:19:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 04:19:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 04:19:31] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2023-03-09 04:19:31] [INFO ] Transformed 43 places.
[2023-03-09 04:19:31] [INFO ] Transformed 490 transitions.
[2023-03-09 04:19:31] [INFO ] Parsed PT model containing 43 places and 490 transitions and 1438 arcs in 129 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 14 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:19:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
// Phase 1: matrix 489 rows 43 cols
[2023-03-09 04:19:31] [INFO ] Computed 0 place invariants in 15 ms
[2023-03-09 04:19:32] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
[2023-03-09 04:19:32] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:32] [INFO ] Invariant cache hit.
[2023-03-09 04:19:32] [INFO ] Implicit Places using invariants in 31 ms returned []
[2023-03-09 04:19:32] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:32] [INFO ] Invariant cache hit.
[2023-03-09 04:19:32] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:19:32] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-09 04:19:32] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:32] [INFO ] Invariant cache hit.
[2023-03-09 04:19:32] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 966 ms. Remains : 43/43 places, 490/490 transitions.
Support contains 32 out of 43 places after structural reductions.
[2023-03-09 04:19:32] [INFO ] Flatten gal took : 54 ms
[2023-03-09 04:19:32] [INFO ] Flatten gal took : 23 ms
[2023-03-09 04:19:32] [INFO ] Input system was already deterministic with 490 transitions.
Incomplete random walk after 10000 steps, including 378 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 33) seen :32
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 04:19:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:33] [INFO ] Invariant cache hit.
[2023-03-09 04:19:33] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 04:19:41] [INFO ] After 8205ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 43 stabilizing places and 488 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((F(p0)&&(p0||X(p1)||G(p2)))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:19:41] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:41] [INFO ] Invariant cache hit.
[2023-03-09 04:19:42] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
[2023-03-09 04:19:42] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:42] [INFO ] Invariant cache hit.
[2023-03-09 04:19:42] [INFO ] Implicit Places using invariants in 43 ms returned []
[2023-03-09 04:19:42] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:42] [INFO ] Invariant cache hit.
[2023-03-09 04:19:42] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:19:43] [INFO ] Implicit Places using invariants and state equation in 864 ms returned []
Implicit Place search using SMT with State Equation took 918 ms to find 0 implicit places.
[2023-03-09 04:19:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:43] [INFO ] Invariant cache hit.
[2023-03-09 04:19:43] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1210 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 408 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), (AND (NOT p2) (NOT p1)), true, (NOT p2)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s30 1) (GEQ s39 2)), p2:(AND (GEQ s23 2) (GEQ s25 1)), p1:(AND (GEQ s31 1) (GEQ s39 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-00 finished in 1682 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||X((F(p1) U p2)))))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 8 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:19:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:43] [INFO ] Invariant cache hit.
[2023-03-09 04:19:43] [INFO ] Dead Transitions using invariants and state equation in 153 ms found 0 transitions.
[2023-03-09 04:19:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:43] [INFO ] Invariant cache hit.
[2023-03-09 04:19:43] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 04:19:43] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:43] [INFO ] Invariant cache hit.
[2023-03-09 04:19:43] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:19:44] [INFO ] Implicit Places using invariants and state equation in 670 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2023-03-09 04:19:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:44] [INFO ] Invariant cache hit.
[2023-03-09 04:19:44] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1023 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s35 2) (GEQ s37 1)), p2:(AND (GEQ s25 2) (GEQ s27 1)), p1:(AND (GEQ s8 1) (GEQ s10 2))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 37 steps with 1 reset in 3 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-01 finished in 1195 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 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 24 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:19:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:44] [INFO ] Invariant cache hit.
[2023-03-09 04:19:44] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
[2023-03-09 04:19:44] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:44] [INFO ] Invariant cache hit.
[2023-03-09 04:19:45] [INFO ] Implicit Places using invariants in 45 ms returned []
[2023-03-09 04:19:45] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:45] [INFO ] Invariant cache hit.
[2023-03-09 04:19:45] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:19:46] [INFO ] Implicit Places using invariants and state equation in 1068 ms returned []
Implicit Place search using SMT with State Equation took 1115 ms to find 0 implicit places.
[2023-03-09 04:19:46] [INFO ] Redundant transitions in 42 ms returned []
[2023-03-09 04:19:46] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:46] [INFO ] Invariant cache hit.
[2023-03-09 04:19:46] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1472 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-02 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:(LT s38 1)], 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 2 reset in 147 ms.
Product exploration explored 100000 steps with 3 reset in 67 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 171 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)]
Finished random walk after 14 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 192 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 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
[2023-03-09 04:19:47] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:47] [INFO ] Invariant cache hit.
[2023-03-09 04:19:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:19:47] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-09 04:19:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:19:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:19:49] [INFO ] [Nat]Absence check using state equation in 2455 ms returned sat
[2023-03-09 04:19:49] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:19:52] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 04:19:55] [INFO ] [Nat]Added 161 Read/Feed constraints in 6014 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 23 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:19:55] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:56] [INFO ] Invariant cache hit.
[2023-03-09 04:19:56] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
[2023-03-09 04:19:56] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:56] [INFO ] Invariant cache hit.
[2023-03-09 04:19:56] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 04:19:56] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:56] [INFO ] Invariant cache hit.
[2023-03-09 04:19:56] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:19:57] [INFO ] Implicit Places using invariants and state equation in 880 ms returned []
Implicit Place search using SMT with State Equation took 930 ms to find 0 implicit places.
[2023-03-09 04:19:57] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-09 04:19:57] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:57] [INFO ] Invariant cache hit.
[2023-03-09 04:19:57] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1272 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 149 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 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 158 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 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
[2023-03-09 04:19:57] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:19:57] [INFO ] Invariant cache hit.
[2023-03-09 04:19:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 04:19:58] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2023-03-09 04:19:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 04:19:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 04:20:00] [INFO ] [Nat]Absence check using state equation in 2434 ms returned sat
[2023-03-09 04:20:00] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:03] [INFO ] SMT solver returned unknown. Retrying;
[2023-03-09 04:20:06] [INFO ] [Nat]Added 161 Read/Feed constraints in 6018 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering criterion allowed to conclude after 125 steps with 13 reset in 2 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-02 finished in 21934 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)||(!p0&&((X(X(X(X(F(!p1)))))&&F(!p2))||G(F(!p1)))))))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 6 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:06] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:06] [INFO ] Invariant cache hit.
[2023-03-09 04:20:06] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
[2023-03-09 04:20:06] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:06] [INFO ] Invariant cache hit.
[2023-03-09 04:20:06] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-09 04:20:06] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:06] [INFO ] Invariant cache hit.
[2023-03-09 04:20:07] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:07] [INFO ] Implicit Places using invariants and state equation in 839 ms returned []
Implicit Place search using SMT with State Equation took 897 ms to find 0 implicit places.
[2023-03-09 04:20:07] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:07] [INFO ] Invariant cache hit.
[2023-03-09 04:20:07] [INFO ] Dead Transitions using invariants and state equation in 159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1226 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 300 ms :[p0, (AND p0 p1), (AND p2 p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p2 p1), (AND p0 p1)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1 p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p1 p2), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s14 2) (GEQ s20 1)), p2:(AND (GEQ s6 2) (GEQ s10 1)), p1:(AND (GEQ s22 1) (GEQ s30 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 19932 reset in 463 ms.
Product exploration explored 100000 steps with 19924 reset in 463 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
Knowledge based reduction with 16 factoid took 1041 ms. Reduced automaton from 7 states, 14 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 388 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-09 04:20:10] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:10] [INFO ] Invariant cache hit.
[2023-03-09 04:20:10] [INFO ] After 121ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 04:20:15] [INFO ] After 4356ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND p0 p1))), (X (NOT (AND p0 p1 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT p2))), true, (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge :(G (NOT (AND p0 p1)))
Knowledge based reduction with 17 factoid took 524 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-03 finished in 8847 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)&&F(p1))))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 17 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:15] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:15] [INFO ] Invariant cache hit.
[2023-03-09 04:20:15] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
[2023-03-09 04:20:15] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:15] [INFO ] Invariant cache hit.
[2023-03-09 04:20:15] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 04:20:15] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:15] [INFO ] Invariant cache hit.
[2023-03-09 04:20:15] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:16] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
[2023-03-09 04:20:16] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-09 04:20:16] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:16] [INFO ] Invariant cache hit.
[2023-03-09 04:20:16] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1039 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s23 2) (GEQ s24 1)), p1:(AND (GEQ s26 2) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 44 steps with 2 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-04 finished in 1174 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&&X(!p0))) U (X(G(p1)) U G(p2))))'
Support contains 6 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:16] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:16] [INFO ] Invariant cache hit.
[2023-03-09 04:20:16] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
[2023-03-09 04:20:16] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:16] [INFO ] Invariant cache hit.
[2023-03-09 04:20:16] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 04:20:16] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:16] [INFO ] Invariant cache hit.
[2023-03-09 04:20:17] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:17] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2023-03-09 04:20:17] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:17] [INFO ] Invariant cache hit.
[2023-03-09 04:20:17] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 473 ms :[(NOT p2), (AND p0 (NOT p1)), (AND p0 (NOT p2)), (AND p0 (NOT p2) (NOT p1)), true, p0, (NOT p1), (AND p0 (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) p1), (AND (NOT p2) p1 p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 5}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 6}, { cond=(AND p2 (NOT p0) p1), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p2) p0), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=p0, acceptance={} source=2 dest: 8}, { cond=(AND p2 p0), acceptance={} source=2 dest: 9}], [{ cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=3 dest: 10}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=3 dest: 11}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=(AND p2 p1), acceptance={} source=6 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=7 dest: 6}], [{ cond=(NOT p2), acceptance={} source=8 dest: 6}, { cond=p2, acceptance={} source=8 dest: 8}, { cond=(NOT p2), acceptance={0} source=8 dest: 8}, { cond=p2, acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=9 dest: 4}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p2) p1), acceptance={} source=10 dest: 4}, { cond=(AND p2 p1), acceptance={} source=10 dest: 10}], [{ cond=(AND (NOT p2) p0 p1), acceptance={} source=11 dest: 4}, { cond=(AND p2 p0 p1), acceptance={} source=11 dest: 10}]], initial=0, aps=[p2:(AND (GEQ s1 2) (GEQ s3 1)), p0:(AND (GEQ s14 1) (GEQ s29 2)), p1:(AND (GEQ s25 1) (GEQ s32 2))], nbAcceptance=1, 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]]
Entered a terminal (fully accepting) state of product in 8056 steps with 2317 reset in 27 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-05 finished in 1553 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 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:18] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:18] [INFO ] Invariant cache hit.
[2023-03-09 04:20:18] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
[2023-03-09 04:20:18] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:18] [INFO ] Invariant cache hit.
[2023-03-09 04:20:18] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 04:20:18] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:18] [INFO ] Invariant cache hit.
[2023-03-09 04:20:18] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:19] [INFO ] Implicit Places using invariants and state equation in 930 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2023-03-09 04:20:19] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:19] [INFO ] Invariant cache hit.
[2023-03-09 04:20:19] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1258 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, p0, p0]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s16 2) (GEQ s18 1))], 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]]
Product exploration explored 100000 steps with 0 reset in 98 ms.
Product exploration explored 100000 steps with 1 reset in 70 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, p0, p0]
Finished random walk after 555 steps, including 21 resets, run visited all 1 properties in 8 ms. (steps per millisecond=69 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 177 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 79 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 104 ms :[true, p0, p0]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:20] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:20] [INFO ] Invariant cache hit.
[2023-03-09 04:20:20] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
[2023-03-09 04:20:20] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:20] [INFO ] Invariant cache hit.
[2023-03-09 04:20:20] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 04:20:20] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:20] [INFO ] Invariant cache hit.
[2023-03-09 04:20:20] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:21] [INFO ] Implicit Places using invariants and state equation in 707 ms returned []
Implicit Place search using SMT with State Equation took 755 ms to find 0 implicit places.
[2023-03-09 04:20:21] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:21] [INFO ] Invariant cache hit.
[2023-03-09 04:20:21] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1043 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, p0, p0]
Finished random walk after 461 steps, including 16 resets, run visited all 1 properties in 6 ms. (steps per millisecond=76 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 5 factoid took 204 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 91 ms :[true, p0, p0]
Stuttering acceptance computed with spot in 93 ms :[true, p0, p0]
Product exploration explored 100000 steps with 0 reset in 53 ms.
Product exploration explored 100000 steps with 0 reset in 74 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 85 ms :[true, p0, p0]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 10 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:22] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:22] [INFO ] Invariant cache hit.
[2023-03-09 04:20:22] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
[2023-03-09 04:20:22] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 04:20:22] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:22] [INFO ] Invariant cache hit.
[2023-03-09 04:20:23] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 311 ms. Remains : 43/43 places, 490/490 transitions.
Built C files in :
/tmp/ltsmin3476794714639690265
[2023-03-09 04:20:23] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3476794714639690265
Running compilation step : cd /tmp/ltsmin3476794714639690265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 732 ms.
Running link step : cd /tmp/ltsmin3476794714639690265;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin3476794714639690265;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5252622236521883723.hoa' '--buchi-type=spotba'
LTSmin run took 3736 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-06 finished in 9322 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(G(p0)) U G(p1))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:27] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:27] [INFO ] Invariant cache hit.
[2023-03-09 04:20:27] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
[2023-03-09 04:20:27] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:27] [INFO ] Invariant cache hit.
[2023-03-09 04:20:27] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 04:20:27] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:27] [INFO ] Invariant cache hit.
[2023-03-09 04:20:27] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:28] [INFO ] Implicit Places using invariants and state equation in 897 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2023-03-09 04:20:28] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:28] [INFO ] Invariant cache hit.
[2023-03-09 04:20:28] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1248 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(GEQ s21 1), p0:(AND (GEQ s0 2) (GEQ s2 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 29 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-07 finished in 1396 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&&G(p1)) U p2)))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:29] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:29] [INFO ] Invariant cache hit.
[2023-03-09 04:20:29] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
[2023-03-09 04:20:29] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:29] [INFO ] Invariant cache hit.
[2023-03-09 04:20:29] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 04:20:29] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:29] [INFO ] Invariant cache hit.
[2023-03-09 04:20:29] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:30] [INFO ] Implicit Places using invariants and state equation in 871 ms returned []
Implicit Place search using SMT with State Equation took 933 ms to find 0 implicit places.
[2023-03-09 04:20:30] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:30] [INFO ] Invariant cache hit.
[2023-03-09 04:20:30] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1222 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (NOT p2), true, (NOT p1)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) (NOT p0)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={0} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s11 1) (GEQ s24 2)), p0:(OR (NOT (AND (GEQ s11 1) (GEQ s24 2))) (AND (GEQ s11 2) (GEQ s13 1))), p1:(AND (GEQ s31 2) (GEQ s32 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-08 finished in 1377 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(G(p0))))'
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:30] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:30] [INFO ] Invariant cache hit.
[2023-03-09 04:20:30] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
[2023-03-09 04:20:30] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:30] [INFO ] Invariant cache hit.
[2023-03-09 04:20:30] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 04:20:30] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:30] [INFO ] Invariant cache hit.
[2023-03-09 04:20:30] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:31] [INFO ] Implicit Places using invariants and state equation in 882 ms returned []
Implicit Place search using SMT with State Equation took 928 ms to find 0 implicit places.
[2023-03-09 04:20:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:31] [INFO ] Invariant cache hit.
[2023-03-09 04:20:31] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1211 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 121 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s25 1) (GEQ s33 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-09 finished in 1351 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 15 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:31] [INFO ] Invariant cache hit.
[2023-03-09 04:20:31] [INFO ] Dead Transitions using invariants and state equation in 137 ms found 0 transitions.
[2023-03-09 04:20:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:31] [INFO ] Invariant cache hit.
[2023-03-09 04:20:31] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 04:20:31] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:31] [INFO ] Invariant cache hit.
[2023-03-09 04:20:32] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:33] [INFO ] Implicit Places using invariants and state equation in 1095 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
[2023-03-09 04:20:33] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 04:20:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:33] [INFO ] Invariant cache hit.
[2023-03-09 04:20:33] [INFO ] Dead Transitions using invariants and state equation in 148 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1460 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s12 1) (LT s24 2)) (OR (LT s24 2) (LT s31 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 61 ms.
Product exploration explored 100000 steps with 0 reset in 71 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Finished random walk after 47 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
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 149 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 12 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:33] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:33] [INFO ] Invariant cache hit.
[2023-03-09 04:20:34] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
[2023-03-09 04:20:34] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:34] [INFO ] Invariant cache hit.
[2023-03-09 04:20:34] [INFO ] Implicit Places using invariants in 38 ms returned []
[2023-03-09 04:20:34] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:34] [INFO ] Invariant cache hit.
[2023-03-09 04:20:34] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:35] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 969 ms to find 0 implicit places.
[2023-03-09 04:20:35] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-09 04:20:35] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:35] [INFO ] Invariant cache hit.
[2023-03-09 04:20:35] [INFO ] Dead Transitions using invariants and state equation in 146 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1277 ms. Remains : 43/43 places, 490/490 transitions.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 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 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Finished random walk after 116 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=58 )
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 180 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 62 ms.
Product exploration explored 100000 steps with 0 reset in 59 ms.
Built C files in :
/tmp/ltsmin9803044854730926685
[2023-03-09 04:20:35] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2023-03-09 04:20:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:20:35] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2023-03-09 04:20:35] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:20:35] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2023-03-09 04:20:35] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:20:35] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9803044854730926685
Running compilation step : cd /tmp/ltsmin9803044854730926685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 990 ms.
Running link step : cd /tmp/ltsmin9803044854730926685;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9803044854730926685;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased11557387186887090639.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 7 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:20:51] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:51] [INFO ] Invariant cache hit.
[2023-03-09 04:20:51] [INFO ] Dead Transitions using invariants and state equation in 149 ms found 0 transitions.
[2023-03-09 04:20:51] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:51] [INFO ] Invariant cache hit.
[2023-03-09 04:20:51] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 04:20:51] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:51] [INFO ] Invariant cache hit.
[2023-03-09 04:20:51] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:20:52] [INFO ] Implicit Places using invariants and state equation in 863 ms returned []
Implicit Place search using SMT with State Equation took 909 ms to find 0 implicit places.
[2023-03-09 04:20:52] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-09 04:20:52] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:20:52] [INFO ] Invariant cache hit.
[2023-03-09 04:20:52] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1227 ms. Remains : 43/43 places, 490/490 transitions.
Built C files in :
/tmp/ltsmin2490064056611019781
[2023-03-09 04:20:52] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2023-03-09 04:20:52] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:20:52] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2023-03-09 04:20:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:20:52] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2023-03-09 04:20:52] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:20:52] [INFO ] Built C files in 71ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2490064056611019781
Running compilation step : cd /tmp/ltsmin2490064056611019781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 968 ms.
Running link step : cd /tmp/ltsmin2490064056611019781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2490064056611019781;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17288032738999710924.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-09 04:21:07] [INFO ] Flatten gal took : 20 ms
[2023-03-09 04:21:07] [INFO ] Flatten gal took : 19 ms
[2023-03-09 04:21:07] [INFO ] Time to serialize gal into /tmp/LTL12156881195396062602.gal : 4 ms
[2023-03-09 04:21:07] [INFO ] Time to serialize properties into /tmp/LTL7078940947691493398.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12156881195396062602.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8925456896513425702.hoa' '-atoms' '/tmp/LTL7078940947691493398.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7078940947691493398.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8925456896513425702.hoa
Detected timeout of ITS tools.
[2023-03-09 04:21:22] [INFO ] Flatten gal took : 16 ms
[2023-03-09 04:21:22] [INFO ] Flatten gal took : 16 ms
[2023-03-09 04:21:22] [INFO ] Time to serialize gal into /tmp/LTL7888115891727822115.gal : 4 ms
[2023-03-09 04:21:22] [INFO ] Time to serialize properties into /tmp/LTL8256488823451291487.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7888115891727822115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8256488823451291487.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((A11<1)||(A19<2))&&((A19<2)||(A26<1)))"))))
Formula 0 simplified : GF!"(((A11<1)||(A19<2))&&((A19<2)||(A26<1)))"
Detected timeout of ITS tools.
[2023-03-09 04:21:37] [INFO ] Flatten gal took : 16 ms
[2023-03-09 04:21:37] [INFO ] Applying decomposition
[2023-03-09 04:21:37] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13376969220393155320.txt' '-o' '/tmp/graph13376969220393155320.bin' '-w' '/tmp/graph13376969220393155320.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13376969220393155320.bin' '-l' '-1' '-v' '-w' '/tmp/graph13376969220393155320.weights' '-q' '0' '-e' '0.001'
[2023-03-09 04:21:37] [INFO ] Decomposing Gal with order
[2023-03-09 04:21:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 04:21:37] [INFO ] Removed a total of 872 redundant transitions.
[2023-03-09 04:21:37] [INFO ] Flatten gal took : 56 ms
[2023-03-09 04:21:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2023-03-09 04:21:37] [INFO ] Time to serialize gal into /tmp/LTL4217445358837104991.gal : 3 ms
[2023-03-09 04:21:37] [INFO ] Time to serialize properties into /tmp/LTL14438805546248664232.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4217445358837104991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14438805546248664232.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(((u10.A11<1)||(u18.A19<2))&&((u18.A19<2)||(u25.A26<1)))"))))
Formula 0 simplified : GF!"(((u10.A11<1)||(u18.A19<2))&&((u18.A19<2)||(u25.A26<1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10236084966757855180
[2023-03-09 04:21:52] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10236084966757855180
Running compilation step : cd /tmp/ltsmin10236084966757855180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 665 ms.
Running link step : cd /tmp/ltsmin10236084966757855180;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10236084966757855180;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-10 finished in 96171 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))||G(p1)))))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 1 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:22:07] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:07] [INFO ] Invariant cache hit.
[2023-03-09 04:22:08] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
[2023-03-09 04:22:08] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:08] [INFO ] Invariant cache hit.
[2023-03-09 04:22:08] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 04:22:08] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:08] [INFO ] Invariant cache hit.
[2023-03-09 04:22:08] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:22:08] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2023-03-09 04:22:08] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:08] [INFO ] Invariant cache hit.
[2023-03-09 04:22:09] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1170 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-11 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=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 1}, { cond=p1, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(OR (LT s23 2) (LT s32 1)), p1:(AND (OR (LT s9 1) (LT s16 2)) (OR (LT s23 2) (LT s32 1)))], 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, null, null][false, false, 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-16redondantChoiceR-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-11 finished in 1441 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)||X(p1))))'
Support contains 3 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:22:09] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:09] [INFO ] Invariant cache hit.
[2023-03-09 04:22:09] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
[2023-03-09 04:22:09] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:09] [INFO ] Invariant cache hit.
[2023-03-09 04:22:09] [INFO ] Implicit Places using invariants in 42 ms returned []
[2023-03-09 04:22:09] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:09] [INFO ] Invariant cache hit.
[2023-03-09 04:22:09] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:22:10] [INFO ] Implicit Places using invariants and state equation in 1006 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
[2023-03-09 04:22:10] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:10] [INFO ] Invariant cache hit.
[2023-03-09 04:22:10] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1341 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s24 1) (GEQ s32 2)), p1:(OR (LT s32 2) (LT s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 257 ms.
Product exploration explored 100000 steps with 33333 reset in 261 ms.
Computed a total of 43 stabilizing places and 488 stable transitions
Computed a total of 43 stabilizing places and 488 stable transitions
Detected a total of 43/43 stabilizing places and 488/490 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p1)))))
Knowledge based reduction with 5 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-13 finished in 2160 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' '!((!p0 U (p1&&X(G(p0)))))'
Support contains 5 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 12 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:22:11] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:11] [INFO ] Invariant cache hit.
[2023-03-09 04:22:11] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
[2023-03-09 04:22:11] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:11] [INFO ] Invariant cache hit.
[2023-03-09 04:22:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-09 04:22:11] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:11] [INFO ] Invariant cache hit.
[2023-03-09 04:22:11] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:22:12] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 892 ms to find 0 implicit places.
[2023-03-09 04:22:12] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-09 04:22:12] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:12] [INFO ] Invariant cache hit.
[2023-03-09 04:22:12] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1189 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), true, (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=3, aps=[p0:(AND (GEQ s13 1) (GEQ s30 2)), p1:(OR (GEQ s21 1) (AND (GEQ s10 2) (GEQ s29 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 35 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-14 finished in 1341 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)&&F(p1)))'
Support contains 4 out of 43 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 43/43 places, 490/490 transitions.
Applied a total of 0 rules in 2 ms. Remains 43 /43 variables (removed 0) and now considering 490/490 (removed 0) transitions.
[2023-03-09 04:22:12] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:12] [INFO ] Invariant cache hit.
[2023-03-09 04:22:13] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
[2023-03-09 04:22:13] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:13] [INFO ] Invariant cache hit.
[2023-03-09 04:22:13] [INFO ] Implicit Places using invariants in 41 ms returned []
[2023-03-09 04:22:13] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:13] [INFO ] Invariant cache hit.
[2023-03-09 04:22:13] [INFO ] State equation strengthened by 161 read => feed constraints.
[2023-03-09 04:22:13] [INFO ] Implicit Places using invariants and state equation in 841 ms returned []
Implicit Place search using SMT with State Equation took 886 ms to find 0 implicit places.
[2023-03-09 04:22:13] [INFO ] Flow matrix only has 489 transitions (discarded 1 similar events)
[2023-03-09 04:22:13] [INFO ] Invariant cache hit.
[2023-03-09 04:22:14] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1185 ms. Remains : 43/43 places, 490/490 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DNAwalker-PT-16redondantChoiceR-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (GEQ s13 1) (GEQ s29 2)), p0:(AND (GEQ s11 1) (GEQ s35 2))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DNAwalker-PT-16redondantChoiceR-LTLFireability-15 finished in 1338 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)))'
[2023-03-09 04:22:14] [INFO ] Flatten gal took : 15 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2543252685963017290
[2023-03-09 04:22:14] [INFO ] Computing symmetric may disable matrix : 490 transitions.
[2023-03-09 04:22:14] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:22:14] [INFO ] Computing symmetric may enable matrix : 490 transitions.
[2023-03-09 04:22:14] [INFO ] Applying decomposition
[2023-03-09 04:22:14] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:22:14] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6667909519105983996.txt' '-o' '/tmp/graph6667909519105983996.bin' '-w' '/tmp/graph6667909519105983996.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6667909519105983996.bin' '-l' '-1' '-v' '-w' '/tmp/graph6667909519105983996.weights' '-q' '0' '-e' '0.001'
[2023-03-09 04:22:14] [INFO ] Decomposing Gal with order
[2023-03-09 04:22:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 04:22:14] [INFO ] Computing Do-Not-Accords matrix : 490 transitions.
[2023-03-09 04:22:14] [INFO ] Removed a total of 872 redundant transitions.
[2023-03-09 04:22:14] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-09 04:22:14] [INFO ] Flatten gal took : 33 ms
[2023-03-09 04:22:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2023-03-09 04:22:14] [INFO ] Time to serialize gal into /tmp/LTLFireability1066207662395428526.gal : 3 ms
[2023-03-09 04:22:14] [INFO ] Time to serialize properties into /tmp/LTLFireability4374916441264977010.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1066207662395428526.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4374916441264977010.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
[2023-03-09 04:22:14] [INFO ] Built C files in 116ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2543252685963017290
Running compilation step : cd /tmp/ltsmin2543252685963017290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((F(G("(((u10.A11<1)||(u18.A19<2))&&((u18.A19<2)||(u25.A26<1)))"))))
Formula 0 simplified : GF!"(((u10.A11<1)||(u18.A19<2))&&((u18.A19<2)||(u25.A26<1)))"
Compilation finished in 1009 ms.
Running link step : cd /tmp/ltsmin2543252685963017290;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2543252685963017290;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t20, t21, t22, t23, t24, t26, t27, t28, t29, t30, t31, t33, t34, t35, t36, t37, t38, t39, t40...2999
Computing Next relation with stutter on 1.04294e+07 deadlock states
1 unique states visited
0 strongly connected components in search stack
0 transitions explored
1 items max in DFS search stack
45002 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,450.047,4404168,1,0,7.57771e+06,286,1598,1.91104e+07,36,270,5966250
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DNAwalker-PT-16redondantChoiceR-LTLFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1242721 ms.

BK_STOP 1678336815994

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DNAwalker-PT-16redondantChoiceR"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DNAwalker-PT-16redondantChoiceR, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814476100996"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DNAwalker-PT-16redondantChoiceR.tgz
mv DNAwalker-PT-16redondantChoiceR execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;