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.r489-tall-167912707100668.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is TokenRing-PT-015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707100668
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 41M
-rw-r--r-- 1 mcc users 369K Feb 25 15:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.9M Feb 25 15:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.4M Feb 25 14:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 13M Feb 25 14:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 134K Feb 25 17:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 472K Feb 25 17:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.5M Feb 25 17:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 4.2M Feb 25 17:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 274K Feb 25 15:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Feb 25 15:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0M Feb 25 15:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 11M Feb 25 15:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 28K Feb 25 17:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K Feb 25 17:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 5 18:23 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 TokenRing-PT-015-LTLFireability-00
FORMULA_NAME TokenRing-PT-015-LTLFireability-01
FORMULA_NAME TokenRing-PT-015-LTLFireability-02
FORMULA_NAME TokenRing-PT-015-LTLFireability-03
FORMULA_NAME TokenRing-PT-015-LTLFireability-04
FORMULA_NAME TokenRing-PT-015-LTLFireability-05
FORMULA_NAME TokenRing-PT-015-LTLFireability-06
FORMULA_NAME TokenRing-PT-015-LTLFireability-07
FORMULA_NAME TokenRing-PT-015-LTLFireability-08
FORMULA_NAME TokenRing-PT-015-LTLFireability-09
FORMULA_NAME TokenRing-PT-015-LTLFireability-10
FORMULA_NAME TokenRing-PT-015-LTLFireability-11
FORMULA_NAME TokenRing-PT-015-LTLFireability-12
FORMULA_NAME TokenRing-PT-015-LTLFireability-13
FORMULA_NAME TokenRing-PT-015-LTLFireability-14
FORMULA_NAME TokenRing-PT-015-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679297660931

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TokenRing-PT-015
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 07:34:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 07:34:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 07:34:22] [INFO ] Load time of PNML (sax parser for PT used): 142 ms
[2023-03-20 07:34:22] [INFO ] Transformed 256 places.
[2023-03-20 07:34:22] [INFO ] Transformed 3616 transitions.
[2023-03-20 07:34:22] [INFO ] Found NUPN structural information;
[2023-03-20 07:34:22] [INFO ] Completing missing partition info from NUPN : creating a component with [State_14_5, State_12_6, State_14_7, State_12_2, State_1_11, State_10_3, State_8_5, State_15_5, State_1_14, State_0_10, State_10_15, State_6_4, State_8_14, State_2_3, State_3_12, State_15_13, State_4_7, State_2_11, State_6_8, State_0_6, State_7_1, State_3_7, State_5_0, State_13_12, State_11_15, State_11_11, State_9_14, State_5_4, State_13_8, State_4_8, State_7_3, State_9_2, State_14_9, State_13_15, State_12_4, State_10_5, State_3_10, State_14_3, State_12_14, State_2_1, State_6_15, State_5_14, State_13_6, State_6_6, State_10_8, State_11_0, State_1_13, State_15_3, State_8_0, State_1_0, State_11_5, State_3_13, State_15_8, State_9_4, State_4_10, State_9_9, State_7_11, State_8_3, State_0_12, State_2_9, State_7_8, State_5_6, State_4_5, State_0_7]
[2023-03-20 07:34:22] [INFO ] Parsed PT model containing 256 places and 3616 transitions and 14464 arcs in 226 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 119 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA TokenRing-PT-015-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 24 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2023-03-20 07:34:25] [INFO ] Computed 16 place invariants in 33 ms
[2023-03-20 07:34:26] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-20 07:34:26] [INFO ] Invariant cache hit.
[2023-03-20 07:34:26] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:34:26] [INFO ] Implicit Places using invariants and state equation in 784 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
[2023-03-20 07:34:26] [INFO ] Invariant cache hit.
[2023-03-20 07:34:27] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2012 ms. Remains : 256/256 places, 3616/3616 transitions.
Support contains 256 out of 256 places after structural reductions.
[2023-03-20 07:34:33] [INFO ] Flatten gal took : 4474 ms
[2023-03-20 07:34:36] [INFO ] Flatten gal took : 520 ms
[2023-03-20 07:34:39] [INFO ] Input system was already deterministic with 3616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1731 ms. (steps per millisecond=5 ) properties (out of 19) seen :14
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1249 ms. (steps per millisecond=8 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1326 ms. (steps per millisecond=7 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1080 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1102 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 1085 ms. (steps per millisecond=9 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-20 07:34:47] [INFO ] Invariant cache hit.
[2023-03-20 07:34:54] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-20 07:34:55] [INFO ] After 636ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:3
[2023-03-20 07:34:55] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:34:55] [INFO ] After 426ms SMT Verify possible using 3390 Read/Feed constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-20 07:34:55] [INFO ] After 1370ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:4
[2023-03-20 07:34:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 07:34:57] [INFO ] After 671ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-03-20 07:34:57] [INFO ] After 806ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-03-20 07:34:58] [INFO ] Deduced a trap composed of 139 places in 234 ms of which 5 ms to minimize.
[2023-03-20 07:34:58] [INFO ] Deduced a trap composed of 141 places in 284 ms of which 1 ms to minimize.
[2023-03-20 07:34:59] [INFO ] Deduced a trap composed of 143 places in 432 ms of which 1 ms to minimize.
[2023-03-20 07:34:59] [INFO ] Deduced a trap composed of 141 places in 223 ms of which 3 ms to minimize.
[2023-03-20 07:34:59] [INFO ] Deduced a trap composed of 140 places in 250 ms of which 2 ms to minimize.
[2023-03-20 07:35:00] [INFO ] Deduced a trap composed of 140 places in 214 ms of which 1 ms to minimize.
[2023-03-20 07:35:00] [INFO ] Deduced a trap composed of 140 places in 210 ms of which 0 ms to minimize.
[2023-03-20 07:35:00] [INFO ] Deduced a trap composed of 140 places in 206 ms of which 1 ms to minimize.
[2023-03-20 07:35:01] [INFO ] Deduced a trap composed of 140 places in 203 ms of which 0 ms to minimize.
[2023-03-20 07:35:01] [INFO ] Deduced a trap composed of 141 places in 203 ms of which 0 ms to minimize.
[2023-03-20 07:35:01] [INFO ] Deduced a trap composed of 147 places in 200 ms of which 0 ms to minimize.
[2023-03-20 07:35:02] [INFO ] Deduced a trap composed of 139 places in 212 ms of which 1 ms to minimize.
[2023-03-20 07:35:02] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4215 ms
[2023-03-20 07:35:02] [INFO ] After 5442ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 351 ms.
[2023-03-20 07:35:02] [INFO ] After 7095ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 85 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 299 ms. (steps per millisecond=33 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 129054 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 129054 steps, saw 25216 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 07:35:07] [INFO ] Invariant cache hit.
[2023-03-20 07:35:10] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 07:35:10] [INFO ] After 660ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-20 07:35:10] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:35:11] [INFO ] After 422ms SMT Verify possible using 3390 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:35:11] [INFO ] After 1303ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 07:35:11] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:35:12] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:35:12] [INFO ] After 740ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 07:35:13] [INFO ] Deduced a trap composed of 145 places in 217 ms of which 0 ms to minimize.
[2023-03-20 07:35:13] [INFO ] Deduced a trap composed of 143 places in 211 ms of which 0 ms to minimize.
[2023-03-20 07:35:13] [INFO ] Deduced a trap composed of 145 places in 221 ms of which 1 ms to minimize.
[2023-03-20 07:35:14] [INFO ] Deduced a trap composed of 145 places in 217 ms of which 1 ms to minimize.
[2023-03-20 07:35:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1335 ms
[2023-03-20 07:35:14] [INFO ] After 2484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 335 ms.
[2023-03-20 07:35:14] [INFO ] After 3623ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 68 ms.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 56 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 49 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:35:15] [INFO ] Invariant cache hit.
[2023-03-20 07:35:15] [INFO ] Implicit Places using invariants in 62 ms returned []
[2023-03-20 07:35:15] [INFO ] Invariant cache hit.
[2023-03-20 07:35:15] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:35:15] [INFO ] Implicit Places using invariants and state equation in 709 ms returned []
Implicit Place search using SMT with State Equation took 775 ms to find 0 implicit places.
[2023-03-20 07:35:16] [INFO ] Redundant transitions in 286 ms returned []
[2023-03-20 07:35:16] [INFO ] Invariant cache hit.
[2023-03-20 07:35:17] [INFO ] Dead Transitions using invariants and state equation in 955 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2079 ms. Remains : 256/256 places, 3616/3616 transitions.
Drop transitions removed 3110 transitions
Redundant transition composition rules discarded 3110 transitions
Iterating global reduction 0 with 3110 rules applied. Total rules applied 3110 place count 256 transition count 506
Applied a total of 3110 rules in 30 ms. Remains 256 /256 variables (removed 0) and now considering 506/3616 (removed 3110) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 506 rows 256 cols
[2023-03-20 07:35:17] [INFO ] Computed 16 place invariants in 3 ms
[2023-03-20 07:35:18] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:35:36] [INFO ] After 17672ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 07:35:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 07:35:53] [INFO ] After 16773ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 07:36:09] [INFO ] After 32887ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 16969 ms.
[2023-03-20 07:36:26] [INFO ] After 50018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
FORMULA TokenRing-PT-015-LTLFireability-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA TokenRing-PT-015-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(!(p1 U p2))||(X(p2) U p2))&&p0)))'
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 6 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2023-03-20 07:36:27] [INFO ] Computed 16 place invariants in 13 ms
[2023-03-20 07:36:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-20 07:36:27] [INFO ] Invariant cache hit.
[2023-03-20 07:36:27] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:36:27] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 746 ms to find 0 implicit places.
[2023-03-20 07:36:27] [INFO ] Invariant cache hit.
[2023-03-20 07:36:28] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1663 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 489 ms :[true, (NOT p0), (NOT p0), false, p2]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (OR (EQ s104 0) (EQ s105 0)) (OR (EQ s153 0) (EQ s174 0)) (OR (EQ s129 0) (EQ s179 0)) (OR (EQ s25 0) (EQ s87 0)) (OR (EQ s26 0) (EQ s166 0)) (OR ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA TokenRing-PT-015-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-015-LTLFireability-00 finished in 2570 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(((!p0&&F(p0)) U p0)))'
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 75 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:36:29] [INFO ] Invariant cache hit.
[2023-03-20 07:36:29] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-20 07:36:29] [INFO ] Invariant cache hit.
[2023-03-20 07:36:30] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:36:30] [INFO ] Implicit Places using invariants and state equation in 703 ms returned []
Implicit Place search using SMT with State Equation took 762 ms to find 0 implicit places.
[2023-03-20 07:36:30] [INFO ] Redundant transitions in 170 ms returned []
[2023-03-20 07:36:30] [INFO ] Invariant cache hit.
[2023-03-20 07:36:31] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1924 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-01 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:(OR (AND (EQ s104 1) (EQ s105 1)) (AND (EQ s153 1) (EQ s174 1)) (AND (EQ s129 1) (EQ s179 1)) (AND (EQ s25 1) (EQ s87 1)) (AND (EQ s26 1) (EQ s166 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 1591 reset in 6442 ms.
Product exploration explored 100000 steps with 1592 reset in 6465 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 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 43 steps, including 0 resets, run visited all 1 properties in 10 ms. (steps per millisecond=4 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 152 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 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 63 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:36:45] [INFO ] Invariant cache hit.
[2023-03-20 07:36:45] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 07:36:45] [INFO ] Invariant cache hit.
[2023-03-20 07:36:45] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:36:45] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2023-03-20 07:36:46] [INFO ] Redundant transitions in 265 ms returned []
[2023-03-20 07:36:46] [INFO ] Invariant cache hit.
[2023-03-20 07:36:47] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2002 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 371 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 59 ms :[(NOT p0), (NOT p0)]
Finished random walk after 43 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=10 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 1612 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1564 reset in 6582 ms.
Product exploration explored 100000 steps with 1593 reset in 6566 ms.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 59 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:37:02] [INFO ] Invariant cache hit.
[2023-03-20 07:37:02] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 07:37:02] [INFO ] Invariant cache hit.
[2023-03-20 07:37:03] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:37:03] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2023-03-20 07:37:03] [INFO ] Redundant transitions in 171 ms returned []
[2023-03-20 07:37:03] [INFO ] Invariant cache hit.
[2023-03-20 07:37:04] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1882 ms. Remains : 256/256 places, 3616/3616 transitions.
Treatment of property TokenRing-PT-015-LTLFireability-01 finished in 36128 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(((X(!p1) U ((!p1&&X(!p1))||X(G(!p1))))||p0)))'
Support contains 32 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 140 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:37:05] [INFO ] Invariant cache hit.
[2023-03-20 07:37:05] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-20 07:37:05] [INFO ] Invariant cache hit.
[2023-03-20 07:37:06] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:37:11] [INFO ] Implicit Places using invariants and state equation in 5446 ms returned []
Implicit Place search using SMT with State Equation took 5732 ms to find 0 implicit places.
[2023-03-20 07:37:11] [INFO ] Invariant cache hit.
[2023-03-20 07:37:12] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6745 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (EQ s20 1) (EQ s255 1)) (AND (EQ s18 1) (EQ s132 1)) (AND (EQ s67 1) (EQ s234 1)) (AND (EQ s186 1) (EQ s247 1)) (AND (EQ s117 1) (EQ s173 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 663 ms.
Product exploration explored 100000 steps with 50000 reset in 650 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1))
Knowledge based reduction with 5 factoid took 472 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA TokenRing-PT-015-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property TokenRing-PT-015-LTLFireability-02 finished in 8642 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 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 64 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:37:14] [INFO ] Invariant cache hit.
[2023-03-20 07:37:14] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-20 07:37:14] [INFO ] Invariant cache hit.
[2023-03-20 07:37:14] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:37:14] [INFO ] Implicit Places using invariants and state equation in 680 ms returned []
Implicit Place search using SMT with State Equation took 737 ms to find 0 implicit places.
[2023-03-20 07:37:15] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-20 07:37:15] [INFO ] Invariant cache hit.
[2023-03-20 07:37:16] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1860 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (EQ s104 1) (EQ s105 1)) (AND (EQ s153 1) (EQ s174 1)) (AND (EQ s129 1) (EQ s179 1)) (AND (EQ s25 1) (EQ s87 1)) (AND (EQ s26 1) (EQ s166 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 timeout after 45910 steps with 0 reset in 10001 ms.
Stack based approach found an accepted trace after 304 steps with 0 reset with depth 305 and stack size 305 in 60 ms.
FORMULA TokenRing-PT-015-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-015-LTLFireability-03 finished in 12015 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((X(G(p1))&&p0))))'
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 9 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:37:26] [INFO ] Invariant cache hit.
[2023-03-20 07:37:26] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 07:37:26] [INFO ] Invariant cache hit.
[2023-03-20 07:37:26] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:37:26] [INFO ] Implicit Places using invariants and state equation in 682 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
[2023-03-20 07:37:26] [INFO ] Invariant cache hit.
[2023-03-20 07:37:27] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1646 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (NOT (OR (AND (EQ s104 1) (EQ s105 1)) (AND (EQ s153 1) (EQ s174 1)) (AND (EQ s129 1) (EQ s179 1)) (AND (EQ s25 1) (EQ s87 1)) (AND (EQ s26 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 46090 steps with 0 reset in 10002 ms.
Stack based approach found an accepted trace after 299 steps with 0 reset with depth 300 and stack size 300 in 59 ms.
FORMULA TokenRing-PT-015-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TokenRing-PT-015-LTLFireability-04 finished in 11883 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 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 47 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:37:38] [INFO ] Invariant cache hit.
[2023-03-20 07:37:38] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-20 07:37:38] [INFO ] Invariant cache hit.
[2023-03-20 07:37:38] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:37:38] [INFO ] Implicit Places using invariants and state equation in 646 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2023-03-20 07:37:39] [INFO ] Redundant transitions in 168 ms returned []
[2023-03-20 07:37:39] [INFO ] Invariant cache hit.
[2023-03-20 07:37:39] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1839 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 366 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s104 1) (EQ s105 1)) (AND (EQ s153 1) (EQ s174 1)) (AND (EQ s129 1) (EQ s179 1)) (AND (EQ s25 1) (EQ s87 1)) (AND (EQ s26 1) (EQ s166 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 1567 reset in 6587 ms.
Product exploration explored 100000 steps with 1603 reset in 6460 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 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 61 ms :[(NOT p0), (NOT p0)]
Finished random walk after 44 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 314 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 216 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 1200 ms :[(NOT p0), (NOT p0)]
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 49 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:37:55] [INFO ] Invariant cache hit.
[2023-03-20 07:37:55] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-20 07:37:55] [INFO ] Invariant cache hit.
[2023-03-20 07:37:55] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:37:56] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2023-03-20 07:37:56] [INFO ] Redundant transitions in 170 ms returned []
[2023-03-20 07:37:56] [INFO ] Invariant cache hit.
[2023-03-20 07:37:57] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1848 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 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 51 ms :[(NOT p0), (NOT p0)]
Finished random walk after 57 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=11 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 143 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 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1597 reset in 6455 ms.
Product exploration explored 100000 steps with 1597 reset in 6413 ms.
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 45 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:38:10] [INFO ] Invariant cache hit.
[2023-03-20 07:38:10] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-20 07:38:10] [INFO ] Invariant cache hit.
[2023-03-20 07:38:11] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:38:11] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
[2023-03-20 07:38:11] [INFO ] Redundant transitions in 176 ms returned []
[2023-03-20 07:38:11] [INFO ] Invariant cache hit.
[2023-03-20 07:38:12] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1836 ms. Remains : 256/256 places, 3616/3616 transitions.
Treatment of property TokenRing-PT-015-LTLFireability-05 finished in 35263 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)) U p1))'
Support contains 256 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 7 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:38:13] [INFO ] Invariant cache hit.
[2023-03-20 07:38:13] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-20 07:38:13] [INFO ] Invariant cache hit.
[2023-03-20 07:38:13] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:38:14] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 724 ms to find 0 implicit places.
[2023-03-20 07:38:14] [INFO ] Invariant cache hit.
[2023-03-20 07:38:14] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1597 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), true, (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-06 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=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(OR (AND (EQ s20 1) (EQ s255 1)) (AND (EQ s18 1) (EQ s132 1)) (AND (EQ s67 1) (EQ s234 1)) (AND (EQ s186 1) (EQ s247 1)) (AND (EQ s117 1) (EQ s173 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TokenRing-PT-015-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-015-LTLFireability-06 finished in 1771 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(p0)))))'
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 178 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:38:15] [INFO ] Invariant cache hit.
[2023-03-20 07:38:15] [INFO ] Implicit Places using invariants in 274 ms returned []
[2023-03-20 07:38:15] [INFO ] Invariant cache hit.
[2023-03-20 07:38:16] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:38:21] [INFO ] Implicit Places using invariants and state equation in 5635 ms returned []
Implicit Place search using SMT with State Equation took 5910 ms to find 0 implicit places.
[2023-03-20 07:38:21] [INFO ] Invariant cache hit.
[2023-03-20 07:38:22] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6989 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s142 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1064 reset in 538 ms.
Product exploration explored 100000 steps with 1069 reset in 468 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 90 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=90 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 198 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
[2023-03-20 07:38:23] [INFO ] Invariant cache hit.
[2023-03-20 07:38:24] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 07:38:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:38:25] [INFO ] [Real]Absence check using state equation in 416 ms returned sat
[2023-03-20 07:38:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:38:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-20 07:38:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:38:26] [INFO ] [Nat]Absence check using state equation in 406 ms returned sat
[2023-03-20 07:38:26] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:38:26] [INFO ] [Nat]Added 3390 Read/Feed constraints in 315 ms returned sat
[2023-03-20 07:38:27] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 227 ms.
[2023-03-20 07:38:27] [INFO ] Added : 0 causal constraints over 0 iterations in 451 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 78 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:38:27] [INFO ] Invariant cache hit.
[2023-03-20 07:38:27] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-20 07:38:27] [INFO ] Invariant cache hit.
[2023-03-20 07:38:28] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:38:33] [INFO ] Implicit Places using invariants and state equation in 5646 ms returned []
Implicit Place search using SMT with State Equation took 5931 ms to find 0 implicit places.
[2023-03-20 07:38:33] [INFO ] Redundant transitions in 176 ms returned []
[2023-03-20 07:38:33] [INFO ] Invariant cache hit.
[2023-03-20 07:38:34] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7077 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 100 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=100 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-20 07:38:34] [INFO ] Invariant cache hit.
[2023-03-20 07:38:36] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 07:38:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:38:36] [INFO ] [Real]Absence check using state equation in 449 ms returned sat
[2023-03-20 07:38:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:38:37] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 07:38:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:38:37] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-20 07:38:38] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:38:38] [INFO ] [Nat]Added 3390 Read/Feed constraints in 293 ms returned sat
[2023-03-20 07:38:38] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 173 ms.
[2023-03-20 07:38:38] [INFO ] Added : 0 causal constraints over 0 iterations in 380 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1063 reset in 424 ms.
Product exploration explored 100000 steps with 1068 reset in 398 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 61 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:38:39] [INFO ] Invariant cache hit.
[2023-03-20 07:38:39] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-03-20 07:38:39] [INFO ] Invariant cache hit.
[2023-03-20 07:38:40] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:38:45] [INFO ] Implicit Places using invariants and state equation in 5484 ms returned []
Implicit Place search using SMT with State Equation took 5750 ms to find 0 implicit places.
[2023-03-20 07:38:45] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-20 07:38:45] [INFO ] Invariant cache hit.
[2023-03-20 07:38:46] [INFO ] Dead Transitions using invariants and state equation in 869 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6861 ms. Remains : 256/256 places, 3616/3616 transitions.
Treatment of property TokenRing-PT-015-LTLFireability-09 finished in 32079 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&(!p1 U (G(!p1)||(!p1&&G(!p2))))))))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 21 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:38:47] [INFO ] Invariant cache hit.
[2023-03-20 07:38:47] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-20 07:38:47] [INFO ] Invariant cache hit.
[2023-03-20 07:38:47] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:38:52] [INFO ] Implicit Places using invariants and state equation in 5446 ms returned []
Implicit Place search using SMT with State Equation took 5734 ms to find 0 implicit places.
[2023-03-20 07:38:52] [INFO ] Invariant cache hit.
[2023-03-20 07:38:53] [INFO ] Dead Transitions using invariants and state equation in 857 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6614 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 545 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), true, (NOT p0), p1, (AND p1 p2), p2]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 6}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p2 p1), acceptance={} source=6 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 7}], [{ cond=p2, acceptance={} source=7 dest: 3}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p1:(AND (EQ s176 1) (EQ s242 1)), p0:(OR (EQ s43 0) (EQ s196 0)), p2:(AND (EQ s43 1) (EQ s196 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 474 steps with 0 reset in 2 ms.
FORMULA TokenRing-PT-015-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TokenRing-PT-015-LTLFireability-10 finished in 7185 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 U (p1||G(!p0))))))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 58 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:38:54] [INFO ] Invariant cache hit.
[2023-03-20 07:38:54] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-20 07:38:54] [INFO ] Invariant cache hit.
[2023-03-20 07:38:55] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:00] [INFO ] Implicit Places using invariants and state equation in 5652 ms returned []
Implicit Place search using SMT with State Equation took 5936 ms to find 0 implicit places.
[2023-03-20 07:39:00] [INFO ] Redundant transitions in 176 ms returned []
[2023-03-20 07:39:00] [INFO ] Invariant cache hit.
[2023-03-20 07:39:01] [INFO ] Dead Transitions using invariants and state equation in 893 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7073 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s23 1) (EQ s104 1))) (NOT (AND (EQ s50 1) (EQ s54 1)))), p0:(AND (EQ s50 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 319 reset in 450 ms.
Product exploration explored 100000 steps with 321 reset in 406 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 192 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:39:02] [INFO ] Invariant cache hit.
[2023-03-20 07:39:02] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:39:02] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:39:03] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:03] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:03] [INFO ] After 488ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:04] [INFO ] After 648ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-20 07:39:04] [INFO ] After 1289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 57 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 108587 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108587 steps, saw 21509 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:39:07] [INFO ] Invariant cache hit.
[2023-03-20 07:39:07] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:39:07] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:39:07] [INFO ] After 455ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:07] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:08] [INFO ] After 491ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:08] [INFO ] After 640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-20 07:39:08] [INFO ] After 1289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 57 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 57 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:39:08] [INFO ] Invariant cache hit.
[2023-03-20 07:39:09] [INFO ] Implicit Places using invariants in 292 ms returned []
[2023-03-20 07:39:09] [INFO ] Invariant cache hit.
[2023-03-20 07:39:09] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:15] [INFO ] Implicit Places using invariants and state equation in 5894 ms returned []
Implicit Place search using SMT with State Equation took 6187 ms to find 0 implicit places.
[2023-03-20 07:39:15] [INFO ] Redundant transitions in 178 ms returned []
[2023-03-20 07:39:15] [INFO ] Invariant cache hit.
[2023-03-20 07:39:16] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7316 ms. Remains : 256/256 places, 3616/3616 transitions.
Graph (trivial) has 3524 edges and 256 vertex of which 237 / 256 are part of one of the 15 SCC in 2 ms
Free SCC test removed 222 places
Drop transitions removed 3510 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 3594 transitions.
Graph (complete) has 22 edges and 34 vertex of which 22 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 22 transition count 9
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 8 transition count 8
Applied a total of 30 rules in 11 ms. Remains 8 /256 variables (removed 248) and now considering 8/3616 (removed 3608) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-20 07:39:16] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 07:39:16] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:39:16] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2023-03-20 07:39:16] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:16] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 07:39:16] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 189 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 65 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2023-03-20 07:39:16] [INFO ] Computed 16 place invariants in 15 ms
[2023-03-20 07:39:16] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-03-20 07:39:16] [INFO ] Invariant cache hit.
[2023-03-20 07:39:17] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:22] [INFO ] Implicit Places using invariants and state equation in 5550 ms returned []
Implicit Place search using SMT with State Equation took 5828 ms to find 0 implicit places.
[2023-03-20 07:39:22] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-20 07:39:22] [INFO ] Invariant cache hit.
[2023-03-20 07:39:23] [INFO ] Dead Transitions using invariants and state equation in 932 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7006 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 171 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:39:23] [INFO ] Invariant cache hit.
[2023-03-20 07:39:23] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:39:23] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:39:24] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:24] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:24] [INFO ] After 488ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:25] [INFO ] After 638ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-20 07:39:25] [INFO ] After 1281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 56 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 108881 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108881 steps, saw 21567 distinct states, run finished after 3003 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:39:28] [INFO ] Invariant cache hit.
[2023-03-20 07:39:28] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:39:28] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:39:28] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:28] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:29] [INFO ] After 481ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:29] [INFO ] After 637ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-20 07:39:29] [INFO ] After 1273ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 54 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 54 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:39:29] [INFO ] Invariant cache hit.
[2023-03-20 07:39:30] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-03-20 07:39:30] [INFO ] Invariant cache hit.
[2023-03-20 07:39:30] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:35] [INFO ] Implicit Places using invariants and state equation in 5534 ms returned []
Implicit Place search using SMT with State Equation took 5820 ms to find 0 implicit places.
[2023-03-20 07:39:35] [INFO ] Redundant transitions in 170 ms returned []
[2023-03-20 07:39:35] [INFO ] Invariant cache hit.
[2023-03-20 07:39:36] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6954 ms. Remains : 256/256 places, 3616/3616 transitions.
Graph (trivial) has 3524 edges and 256 vertex of which 237 / 256 are part of one of the 15 SCC in 1 ms
Free SCC test removed 222 places
Drop transitions removed 3510 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 3594 transitions.
Graph (complete) has 22 edges and 34 vertex of which 22 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 0 output transitions
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 15 place count 22 transition count 9
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 9 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 8 transition count 8
Applied a total of 30 rules in 5 ms. Remains 8 /256 variables (removed 248) and now considering 8/3616 (removed 3608) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-20 07:39:36] [INFO ] Computed 4 place invariants in 0 ms
[2023-03-20 07:39:36] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:39:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-20 07:39:36] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:36] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 07:39:36] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 919 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 86 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 76 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 282 reset in 377 ms.
Product exploration explored 100000 steps with 291 reset in 400 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 54 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2023-03-20 07:39:38] [INFO ] Computed 16 place invariants in 15 ms
[2023-03-20 07:39:39] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-20 07:39:39] [INFO ] Invariant cache hit.
[2023-03-20 07:39:39] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:44] [INFO ] Implicit Places using invariants and state equation in 5463 ms returned []
Implicit Place search using SMT with State Equation took 5754 ms to find 0 implicit places.
[2023-03-20 07:39:44] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-20 07:39:44] [INFO ] Invariant cache hit.
[2023-03-20 07:39:45] [INFO ] Dead Transitions using invariants and state equation in 900 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6889 ms. Remains : 256/256 places, 3616/3616 transitions.
Treatment of property TokenRing-PT-015-LTLFireability-13 finished in 51875 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 U (p1||G(!p0))))))'
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 60 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:39:46] [INFO ] Invariant cache hit.
[2023-03-20 07:39:46] [INFO ] Implicit Places using invariants in 340 ms returned []
[2023-03-20 07:39:46] [INFO ] Invariant cache hit.
[2023-03-20 07:39:47] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:51] [INFO ] Implicit Places using invariants and state equation in 5351 ms returned []
Implicit Place search using SMT with State Equation took 5695 ms to find 0 implicit places.
[2023-03-20 07:39:52] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-20 07:39:52] [INFO ] Invariant cache hit.
[2023-03-20 07:39:53] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6807 ms. Remains : 256/256 places, 3616/3616 transitions.
Stuttering acceptance computed with spot in 1375 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : TokenRing-PT-015-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s9 1) (EQ s210 1))) (NOT (AND (EQ s129 1) (EQ s249 1)))), p0:(AND (EQ s129 1) (EQ s249 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 445 ms.
Product exploration explored 100000 steps with 0 reset in 391 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:39:55] [INFO ] Invariant cache hit.
[2023-03-20 07:39:55] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:39:56] [INFO ] After 514ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:39:56] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:39:56] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:56] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:39:57] [INFO ] After 489ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:39:57] [INFO ] After 630ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-20 07:39:57] [INFO ] After 1248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 53 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 109243 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 109243 steps, saw 21637 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:40:00] [INFO ] Invariant cache hit.
[2023-03-20 07:40:00] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:40:01] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:40:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:40:01] [INFO ] After 430ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:40:01] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:02] [INFO ] After 485ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:40:02] [INFO ] After 621ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 89 ms.
[2023-03-20 07:40:02] [INFO ] After 1225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 54 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 53 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:40:02] [INFO ] Invariant cache hit.
[2023-03-20 07:40:02] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-20 07:40:02] [INFO ] Invariant cache hit.
[2023-03-20 07:40:03] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:08] [INFO ] Implicit Places using invariants and state equation in 5593 ms returned []
Implicit Place search using SMT with State Equation took 5882 ms to find 0 implicit places.
[2023-03-20 07:40:08] [INFO ] Redundant transitions in 173 ms returned []
[2023-03-20 07:40:08] [INFO ] Invariant cache hit.
[2023-03-20 07:40:09] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6992 ms. Remains : 256/256 places, 3616/3616 transitions.
Graph (trivial) has 3556 edges and 256 vertex of which 254 / 256 are part of one of the 16 SCC in 1 ms
Free SCC test removed 238 places
Drop transitions removed 3556 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 3612 transitions.
Graph (complete) has 4 edges and 18 vertex of which 4 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 4 ms. Remains 4 /256 variables (removed 252) and now considering 4/3616 (removed 3612) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-20 07:40:09] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-20 07:40:09] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 07:40:09] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 07:40:09] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-20 07:40:09] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 202 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 90 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 60 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2023-03-20 07:40:09] [INFO ] Computed 16 place invariants in 21 ms
[2023-03-20 07:40:10] [INFO ] Implicit Places using invariants in 307 ms returned []
[2023-03-20 07:40:10] [INFO ] Invariant cache hit.
[2023-03-20 07:40:10] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:15] [INFO ] Implicit Places using invariants and state equation in 5533 ms returned []
Implicit Place search using SMT with State Equation took 5842 ms to find 0 implicit places.
[2023-03-20 07:40:15] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-20 07:40:15] [INFO ] Invariant cache hit.
[2023-03-20 07:40:16] [INFO ] Dead Transitions using invariants and state equation in 864 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6951 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 179 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:40:17] [INFO ] Invariant cache hit.
[2023-03-20 07:40:17] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:40:17] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:40:17] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:40:18] [INFO ] After 442ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:40:18] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:18] [INFO ] After 507ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:40:18] [INFO ] After 652ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-20 07:40:18] [INFO ] After 1276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 57 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 108974 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108974 steps, saw 21595 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-20 07:40:22] [INFO ] Invariant cache hit.
[2023-03-20 07:40:22] [INFO ] [Real]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:40:22] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 07:40:22] [INFO ] [Nat]Absence check using 16 positive place invariants in 3 ms returned sat
[2023-03-20 07:40:23] [INFO ] After 449ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 07:40:23] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:23] [INFO ] After 492ms SMT Verify possible using 3390 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 07:40:23] [INFO ] After 636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-20 07:40:23] [INFO ] After 1261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 56 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 53 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:40:23] [INFO ] Invariant cache hit.
[2023-03-20 07:40:24] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-20 07:40:24] [INFO ] Invariant cache hit.
[2023-03-20 07:40:24] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:29] [INFO ] Implicit Places using invariants and state equation in 5220 ms returned []
Implicit Place search using SMT with State Equation took 5506 ms to find 0 implicit places.
[2023-03-20 07:40:29] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-20 07:40:29] [INFO ] Invariant cache hit.
[2023-03-20 07:40:30] [INFO ] Dead Transitions using invariants and state equation in 871 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6611 ms. Remains : 256/256 places, 3616/3616 transitions.
Graph (trivial) has 3556 edges and 256 vertex of which 254 / 256 are part of one of the 16 SCC in 1 ms
Free SCC test removed 238 places
Drop transitions removed 3556 transitions
Ensure Unique test removed 56 transitions
Reduce isomorphic transitions removed 3612 transitions.
Graph (complete) has 4 edges and 18 vertex of which 4 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 2 rules in 3 ms. Remains 4 /256 variables (removed 252) and now considering 4/3616 (removed 3612) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 4 rows 4 cols
[2023-03-20 07:40:30] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-20 07:40:30] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-03-20 07:40:30] [INFO ] After 1ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 07:40:30] [INFO ] After 2ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-20 07:40:30] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 933 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Product exploration explored 100000 steps with 0 reset in 400 ms.
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 54 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2023-03-20 07:40:32] [INFO ] Computed 16 place invariants in 14 ms
[2023-03-20 07:40:32] [INFO ] Implicit Places using invariants in 293 ms returned []
[2023-03-20 07:40:32] [INFO ] Invariant cache hit.
[2023-03-20 07:40:33] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:38] [INFO ] Implicit Places using invariants and state equation in 5487 ms returned []
Implicit Place search using SMT with State Equation took 5781 ms to find 0 implicit places.
[2023-03-20 07:40:38] [INFO ] Redundant transitions in 173 ms returned []
[2023-03-20 07:40:38] [INFO ] Invariant cache hit.
[2023-03-20 07:40:39] [INFO ] Dead Transitions using invariants and state equation in 875 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6889 ms. Remains : 256/256 places, 3616/3616 transitions.
Treatment of property TokenRing-PT-015-LTLFireability-15 finished in 53714 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(((!p0&&F(p0)) U p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||X(p0)))))'
Found a Shortening insensitive property : TokenRing-PT-015-LTLFireability-09
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 38 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:40:40] [INFO ] Invariant cache hit.
[2023-03-20 07:40:40] [INFO ] Implicit Places using invariants in 284 ms returned []
[2023-03-20 07:40:40] [INFO ] Invariant cache hit.
[2023-03-20 07:40:41] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:46] [INFO ] Implicit Places using invariants and state equation in 5331 ms returned []
Implicit Place search using SMT with State Equation took 5619 ms to find 0 implicit places.
[2023-03-20 07:40:46] [INFO ] Invariant cache hit.
[2023-03-20 07:40:46] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 6526 ms. Remains : 256/256 places, 3616/3616 transitions.
Running random walk in product with property : TokenRing-PT-015-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s142 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 1066 reset in 446 ms.
Product exploration explored 100000 steps with 1064 reset in 397 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
[2023-03-20 07:40:48] [INFO ] Invariant cache hit.
[2023-03-20 07:40:49] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 07:40:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:40:49] [INFO ] [Real]Absence check using state equation in 417 ms returned sat
[2023-03-20 07:40:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:40:50] [INFO ] [Nat]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 07:40:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:40:51] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2023-03-20 07:40:51] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:51] [INFO ] [Nat]Added 3390 Read/Feed constraints in 296 ms returned sat
[2023-03-20 07:40:51] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 171 ms.
[2023-03-20 07:40:51] [INFO ] Added : 0 causal constraints over 0 iterations in 373 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 58 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:40:51] [INFO ] Invariant cache hit.
[2023-03-20 07:40:52] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-20 07:40:52] [INFO ] Invariant cache hit.
[2023-03-20 07:40:52] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:40:57] [INFO ] Implicit Places using invariants and state equation in 5541 ms returned []
Implicit Place search using SMT with State Equation took 5830 ms to find 0 implicit places.
[2023-03-20 07:40:57] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-20 07:40:57] [INFO ] Invariant cache hit.
[2023-03-20 07:40:58] [INFO ] Dead Transitions using invariants and state equation in 916 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6992 ms. Remains : 256/256 places, 3616/3616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 96 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=96 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
[2023-03-20 07:40:59] [INFO ] Invariant cache hit.
[2023-03-20 07:41:00] [INFO ] [Real]Absence check using 16 positive place invariants in 4 ms returned sat
[2023-03-20 07:41:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-20 07:41:00] [INFO ] [Real]Absence check using state equation in 448 ms returned sat
[2023-03-20 07:41:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-20 07:41:01] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-20 07:41:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-20 07:41:02] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2023-03-20 07:41:02] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:41:02] [INFO ] [Nat]Added 3390 Read/Feed constraints in 293 ms returned sat
[2023-03-20 07:41:02] [INFO ] Computed and/alt/rep : 15/15/15 causal constraints (skipped 3586 transitions) in 172 ms.
[2023-03-20 07:41:03] [INFO ] Added : 0 causal constraints over 0 iterations in 375 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1062 reset in 387 ms.
Product exploration explored 100000 steps with 1072 reset in 384 ms.
Support contains 2 out of 256 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 53 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
[2023-03-20 07:41:03] [INFO ] Invariant cache hit.
[2023-03-20 07:41:04] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-20 07:41:04] [INFO ] Invariant cache hit.
[2023-03-20 07:41:04] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2023-03-20 07:41:09] [INFO ] Implicit Places using invariants and state equation in 5190 ms returned []
Implicit Place search using SMT with State Equation took 5469 ms to find 0 implicit places.
[2023-03-20 07:41:09] [INFO ] Redundant transitions in 174 ms returned []
[2023-03-20 07:41:09] [INFO ] Invariant cache hit.
[2023-03-20 07:41:10] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6575 ms. Remains : 256/256 places, 3616/3616 transitions.
Treatment of property TokenRing-PT-015-LTLFireability-09 finished in 30767 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 U (p1||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
[2023-03-20 07:41:11] [INFO ] Flatten gal took : 172 ms
[2023-03-20 07:41:12] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/LTLFireability.sr.xml took 65 ms.
[2023-03-20 07:41:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 256 places, 3616 transitions and 14464 arcs took 12 ms.
Total runtime 409796 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1858/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393232 kB
MemFree: 11720468 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16059172 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1858/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
TIME LIMIT: Killed by timeout after 714 seconds
MemTotal: 16393232 kB
MemFree: 11853960 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16052628 kB
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1858/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1858/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1858/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : TokenRing-PT-015-LTLFireability-01
Could not compute solution for formula : TokenRing-PT-015-LTLFireability-05
Could not compute solution for formula : TokenRing-PT-015-LTLFireability-09
Could not compute solution for formula : TokenRing-PT-015-LTLFireability-13
Could not compute solution for formula : TokenRing-PT-015-LTLFireability-15

BK_STOP 1679299515395

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name TokenRing-PT-015-LTLFireability-01
ltl formula formula --ltl=/tmp/1858/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 256 places, 3616 transitions and 14464 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.090 user 0.090 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1858/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1858/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1858/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1858/ltl_0_
Killing (15) : 1864 1865 1866 1867 1868
Killing (9) : 1864 1865 1866 1867 1868
ltl formula name TokenRing-PT-015-LTLFireability-05
ltl formula formula --ltl=/tmp/1858/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 256 places, 3616 transitions and 14464 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.100 user 0.060 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1858/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1858/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1858/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1858/ltl_1_
Killing (15) : 1880 1881 1882 1883 1884
Killing (9) : 1880 1881 1882 1883 1884
ltl formula name TokenRing-PT-015-LTLFireability-09
ltl formula formula --ltl=/tmp/1858/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 256 places, 3616 transitions and 14464 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.090 user 0.080 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1858/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1858/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1858/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1858/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name TokenRing-PT-015-LTLFireability-13
ltl formula formula --ltl=/tmp/1858/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 256 places, 3616 transitions and 14464 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.240 real 0.090 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1858/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1858/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1858/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1858/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name TokenRing-PT-015-LTLFireability-15
ltl formula formula --ltl=/tmp/1858/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 256 places, 3616 transitions and 14464 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.250 real 0.090 user 0.070 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1858/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1858/ltl_4_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1858/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1858/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TokenRing-PT-015"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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