Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 15:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 15:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 15:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 15:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 57K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678267238957

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 09:20:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 09:20:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:20:40] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-08 09:20:40] [INFO ] Transformed 195 places.
[2023-03-08 09:20:40] [INFO ] Transformed 152 transitions.
[2023-03-08 09:20:40] [INFO ] Found NUPN structural information;
[2023-03-08 09:20:40] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 115 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Support contains 57 out of 195 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 195/195 places, 138/138 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 137
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 137
Applied a total of 2 rules in 27 ms. Remains 194 /195 variables (removed 1) and now considering 137/138 (removed 1) transitions.
// Phase 1: matrix 137 rows 194 cols
[2023-03-08 09:20:40] [INFO ] Computed 59 place invariants in 24 ms
[2023-03-08 09:20:41] [INFO ] Implicit Places using invariants in 485 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 509 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 193/195 places, 137/138 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 546 ms. Remains : 193/195 places, 137/138 transitions.
Support contains 57 out of 193 places after structural reductions.
[2023-03-08 09:20:41] [INFO ] Flatten gal took : 38 ms
[2023-03-08 09:20:41] [INFO ] Flatten gal took : 18 ms
[2023-03-08 09:20:41] [INFO ] Input system was already deterministic with 137 transitions.
Incomplete random walk after 10000 steps, including 210 resets, run finished after 424 ms. (steps per millisecond=23 ) properties (out of 38) seen :17
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 09:20:42] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 09:20:42] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 09:20:42] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 09:20:42] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-08 09:20:42] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 09:20:42] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 130 ms returned sat
[2023-03-08 09:20:43] [INFO ] After 672ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :21
[2023-03-08 09:20:44] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 4 ms to minimize.
[2023-03-08 09:20:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 09:20:44] [INFO ] After 1597ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :21
Attempting to minimize the solution found.
Minimization took 602 ms.
[2023-03-08 09:20:45] [INFO ] After 2659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :21
Parikh walk visited 17 properties in 686 ms.
Support contains 16 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 4 place count 193 transition count 135
Applied a total of 4 rules in 20 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 892728 steps, run timeout after 3001 ms. (steps per millisecond=297 ) properties seen :{}
Probabilistic random walk after 892728 steps, saw 127217 distinct states, run finished after 3010 ms. (steps per millisecond=296 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:20:49] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 09:20:49] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 09:20:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 09:20:49] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:20:49] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:20:49] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 56 ms returned sat
[2023-03-08 09:20:49] [INFO ] After 197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:20:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 09:20:49] [INFO ] After 93ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-08 09:20:49] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2023-03-08 09:20:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2023-03-08 09:20:49] [INFO ] After 337ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 117 ms.
[2023-03-08 09:20:49] [INFO ] After 823ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 102 ms.
Support contains 16 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 09:20:50] [INFO ] Invariant cache hit.
[2023-03-08 09:20:50] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 09:20:50] [INFO ] Invariant cache hit.
[2023-03-08 09:20:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 09:20:50] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-08 09:20:50] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 09:20:50] [INFO ] Invariant cache hit.
[2023-03-08 09:20:50] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 405 ms. Remains : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-08 09:20:50] [INFO ] Invariant cache hit.
[2023-03-08 09:20:50] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:20:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 09:20:50] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:20:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 09:20:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 41 ms returned sat
[2023-03-08 09:20:50] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:20:51] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 94 ms.
[2023-03-08 09:20:51] [INFO ] After 534ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA DES-PT-20a-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 96 stabilizing places and 91 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((G(p0)||G(p1))) U (p2 U p3)))'
Support contains 9 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 09:20:51] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 09:20:51] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 09:20:51] [INFO ] Invariant cache hit.
[2023-03-08 09:20:51] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
[2023-03-08 09:20:51] [INFO ] Invariant cache hit.
[2023-03-08 09:20:51] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 499 ms :[(NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p3)), true, (NOT p0), (NOT p1), (NOT p3), (AND p0 (NOT p1) (NOT p3)), (AND (NOT p0) p1 (NOT p3))]
Running random walk in product with property : DES-PT-20a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p3) p2 (NOT p0) (NOT p1)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 3}, { cond=p1, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=6 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p3) (NOT p2) p0 (NOT p1)), acceptance={} source=7 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) p2 p0 (NOT p1)), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=7 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p0) p1), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p0 p1), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p0) p1), acceptance={} source=8 dest: 6}, { cond=(AND (NOT p3) p2 p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p3:(AND (EQ s20 1) (EQ s112 1) (EQ s114 1)), p2:(AND (EQ s22 1) (EQ s188 1)), p0:(AND (EQ s24 1) (EQ s188 1)), p1:(AND (EQ s13 1) (EQ s112 1) (EQ s114 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DES-PT-20a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-00 finished in 913 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(((F(p1)&&p0) U p2))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 11 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:20:52] [INFO ] Invariant cache hit.
[2023-03-08 09:20:52] [INFO ] Implicit Places using invariants in 111 ms returned []
[2023-03-08 09:20:52] [INFO ] Invariant cache hit.
[2023-03-08 09:20:52] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 284 ms to find 0 implicit places.
[2023-03-08 09:20:52] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 09:20:52] [INFO ] Invariant cache hit.
[2023-03-08 09:20:52] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 396 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p2), (AND (NOT p2) (NOT p1)), (NOT p2)]
Running random walk in product with property : DES-PT-20a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(OR p2 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (EQ s38 1) (EQ s188 1) (EQ s143 1) (EQ s159 1)), p0:(AND (EQ s38 1) (EQ s188 1)), p1:(AND (EQ s38 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 49 steps with 0 reset in 4 ms.
FORMULA DES-PT-20a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-01 finished in 559 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))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:20:52] [INFO ] Invariant cache hit.
[2023-03-08 09:20:53] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 09:20:53] [INFO ] Invariant cache hit.
[2023-03-08 09:20:53] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
[2023-03-08 09:20:53] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 09:20:53] [INFO ] Invariant cache hit.
[2023-03-08 09:20:53] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 401 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (EQ s67 0) (EQ s85 0) (EQ s89 0) (EQ s173 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2262 reset in 361 ms.
Product exploration explored 100000 steps with 2210 reset in 264 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1754001 steps, run timeout after 3001 ms. (steps per millisecond=584 ) properties seen :{}
Probabilistic random walk after 1754001 steps, saw 238064 distinct states, run finished after 3001 ms. (steps per millisecond=584 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 09:20:57] [INFO ] Invariant cache hit.
[2023-03-08 09:20:57] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:20:57] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 09:20:57] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 09:20:57] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:20:57] [INFO ] After 111ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 09:20:57] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 193 transition count 135
Applied a total of 5 rules in 12 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1712543 steps, run timeout after 3001 ms. (steps per millisecond=570 ) properties seen :{}
Probabilistic random walk after 1712543 steps, saw 239734 distinct states, run finished after 3001 ms. (steps per millisecond=570 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:21:00] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 09:21:00] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:21:00] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:21:00] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2023-03-08 09:21:00] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:21:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:21:00] [INFO ] After 26ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 09:21:00] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 09:21:00] [INFO ] After 276ms 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 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 09:21:00] [INFO ] Invariant cache hit.
[2023-03-08 09:21:01] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-08 09:21:01] [INFO ] Invariant cache hit.
[2023-03-08 09:21:01] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:21:01] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-08 09:21:01] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 09:21:01] [INFO ] Invariant cache hit.
[2023-03-08 09:21:01] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 435 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 10 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:21:01] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 09:21:01] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:21:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 09:21:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2023-03-08 09:21:01] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:21:01] [INFO ] After 125ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-08 09:21:01] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 156 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 55 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0)]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 09:21:02] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 09:21:02] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-08 09:21:02] [INFO ] Invariant cache hit.
[2023-03-08 09:21:02] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
[2023-03-08 09:21:02] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:21:02] [INFO ] Invariant cache hit.
[2023-03-08 09:21:02] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 402 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 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 44 ms :[true, (NOT p0)]
Incomplete random walk after 10000 steps, including 230 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1670910 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :{}
Probabilistic random walk after 1670910 steps, saw 229166 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 09:21:05] [INFO ] Invariant cache hit.
[2023-03-08 09:21:05] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:21:05] [INFO ] [Nat]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 09:21:05] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 09:21:05] [INFO ] After 78ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:21:05] [INFO ] After 103ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 09:21:05] [INFO ] After 224ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 5 place count 193 transition count 135
Applied a total of 5 rules in 13 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1647938 steps, run timeout after 3001 ms. (steps per millisecond=549 ) properties seen :{}
Probabilistic random walk after 1647938 steps, saw 231171 distinct states, run finished after 3001 ms. (steps per millisecond=549 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:21:09] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 09:21:09] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:21:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:21:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 58 ms returned sat
[2023-03-08 09:21:09] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:21:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:21:09] [INFO ] After 23ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 09:21:09] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-08 09:21:09] [INFO ] After 276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 5 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 09:21:09] [INFO ] Invariant cache hit.
[2023-03-08 09:21:09] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 09:21:09] [INFO ] Invariant cache hit.
[2023-03-08 09:21:09] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:21:09] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-08 09:21:09] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 09:21:09] [INFO ] Invariant cache hit.
[2023-03-08 09:21:09] [INFO ] Dead Transitions using invariants and state equation in 117 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 446 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:21:09] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 09:21:09] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:21:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:21:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2023-03-08 09:21:10] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:21:10] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 09:21:10] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 163 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 37 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 2228 reset in 204 ms.
Product exploration explored 100000 steps with 2218 reset in 248 ms.
Built C files in :
/tmp/ltsmin14413960472212737387
[2023-03-08 09:21:10] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2023-03-08 09:21:10] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:21:10] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2023-03-08 09:21:10] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:21:10] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2023-03-08 09:21:10] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:21:10] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14413960472212737387
Running compilation step : cd /tmp/ltsmin14413960472212737387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 399 ms.
Running link step : cd /tmp/ltsmin14413960472212737387;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin14413960472212737387;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased988941652165101678.hoa' '--buchi-type=spotba'
LTSmin run took 1425 ms.
FORMULA DES-PT-20a-LTLFireability-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-20a-LTLFireability-02 finished in 19865 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||G(F(p1))))))'
Support contains 5 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 09:21:12] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 09:21:12] [INFO ] Implicit Places using invariants in 130 ms returned []
[2023-03-08 09:21:12] [INFO ] Invariant cache hit.
[2023-03-08 09:21:13] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2023-03-08 09:21:13] [INFO ] Invariant cache hit.
[2023-03-08 09:21:13] [INFO ] Dead Transitions using invariants and state equation in 85 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s96 1) (EQ s110 1)), p1:(AND (EQ s4 1) (EQ s112 1) (EQ s114 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 95 steps with 5 reset in 1 ms.
FORMULA DES-PT-20a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-03 finished in 518 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (!p1 U (G(!p1)||(!p1&&G(!p2))))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:21:13] [INFO ] Invariant cache hit.
[2023-03-08 09:21:13] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-08 09:21:13] [INFO ] Invariant cache hit.
[2023-03-08 09:21:13] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 283 ms to find 0 implicit places.
[2023-03-08 09:21:13] [INFO ] Invariant cache hit.
[2023-03-08 09:21:13] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 366 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 402 ms :[p1, (NOT p0), (AND p2 p1 (NOT p0)), (AND p1 p2), (AND (NOT p0) p1), true, p2, (AND p0 p1), (AND p2 p1 p0), (AND p2 (NOT p0))]
Running random walk in product with property : DES-PT-20a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0, 1} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(AND p2 p1 (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 8}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p2 p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={1} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 9}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}, { cond=(AND p2 (NOT p1) (NOT p0)), acceptance={} source=4 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=true, acceptance={0, 1} source=5 dest: 5}], [{ cond=p2, acceptance={} source=6 dest: 5}, { cond=(NOT p2), acceptance={} source=6 dest: 6}], [{ cond=(AND p1 p0), acceptance={} source=7 dest: 5}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=7 dest: 8}], [{ cond=(AND p2 p1 p0), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=8 dest: 6}, { cond=(AND p2 (NOT p1) p0), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=8 dest: 8}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=9 dest: 5}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=9 dest: 6}]], initial=0, aps=[p2:(AND (EQ s28 1) (EQ s188 1)), p1:(OR (EQ s0 1) (AND (EQ s28 1) (EQ s188 1))), p0:(EQ s0 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-04 finished in 792 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&F(p1)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 1 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:21:14] [INFO ] Invariant cache hit.
[2023-03-08 09:21:14] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-08 09:21:14] [INFO ] Invariant cache hit.
[2023-03-08 09:21:14] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 09:21:14] [INFO ] Invariant cache hit.
[2023-03-08 09:21:14] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-20a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s29 1) (EQ s188 1)) (EQ s119 0) (EQ s136 0)), p0:(OR (EQ s62 0) (EQ s85 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 383 ms.
Product exploration explored 100000 steps with 50000 reset in 348 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 6 factoid took 201 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-05 finished in 1445 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 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:21:15] [INFO ] Invariant cache hit.
[2023-03-08 09:21:15] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 09:21:15] [INFO ] Invariant cache hit.
[2023-03-08 09:21:15] [INFO ] Implicit Places using invariants and state equation in 165 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-08 09:21:15] [INFO ] Invariant cache hit.
[2023-03-08 09:21:15] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 368 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DES-PT-20a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s86 1), p0:(AND (EQ s6 1) (EQ s112 1) (EQ s114 1) (OR (EQ s14 1) (AND (EQ s86 1) (EQ s107 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-06 finished in 529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U p1))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:21:16] [INFO ] Invariant cache hit.
[2023-03-08 09:21:16] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-08 09:21:16] [INFO ] Invariant cache hit.
[2023-03-08 09:21:16] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-08 09:21:16] [INFO ] Invariant cache hit.
[2023-03-08 09:21:16] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Running random walk in product with property : DES-PT-20a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s182 1) (EQ s187 1)), p0:(AND (EQ s65 1) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2251 reset in 269 ms.
Product exploration explored 100000 steps with 2228 reset in 267 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 09:21:17] [INFO ] Invariant cache hit.
[2023-03-08 09:21:17] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 09:21:17] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 7 ms returned sat
[2023-03-08 09:21:17] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:21:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 09:21:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 09:21:17] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:21:17] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-08 09:21:18] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 50 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 193 transition count 135
Applied a total of 7 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 73 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1234127 steps, run timeout after 3001 ms. (steps per millisecond=411 ) properties seen :{}
Probabilistic random walk after 1234127 steps, saw 172677 distinct states, run finished after 3001 ms. (steps per millisecond=411 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:21:21] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 09:21:21] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:21:21] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 09:21:21] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:21:21] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:21:21] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 59 ms returned sat
[2023-03-08 09:21:21] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:21:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:21:21] [INFO ] After 46ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 09:21:21] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2023-03-08 09:21:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-08 09:21:21] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-08 09:21:21] [INFO ] After 464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 33 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 09:21:21] [INFO ] Invariant cache hit.
[2023-03-08 09:21:21] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-08 09:21:21] [INFO ] Invariant cache hit.
[2023-03-08 09:21:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:21:22] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2023-03-08 09:21:22] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:21:22] [INFO ] Invariant cache hit.
[2023-03-08 09:21:22] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 424 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 20 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:21:22] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 09:21:22] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:21:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 09:21:22] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:21:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:21:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 54 ms returned sat
[2023-03-08 09:21:22] [INFO ] After 147ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:21:22] [INFO ] After 197ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-08 09:21:22] [INFO ] After 343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 175 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 177 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 09:21:23] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 09:21:23] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 09:21:23] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 09:21:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:21:23] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2023-03-08 09:21:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:21:23] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 09:21:23] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 51 ms returned sat
[2023-03-08 09:21:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:21:23] [INFO ] [Nat]Absence check using state equation in 201 ms returned sat
[2023-03-08 09:21:23] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 10 ms.
[2023-03-08 09:21:24] [INFO ] Added : 66 causal constraints over 14 iterations in 256 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:21:24] [INFO ] Invariant cache hit.
[2023-03-08 09:21:24] [INFO ] Implicit Places using invariants in 104 ms returned []
[2023-03-08 09:21:24] [INFO ] Invariant cache hit.
[2023-03-08 09:21:24] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
[2023-03-08 09:21:24] [INFO ] Invariant cache hit.
[2023-03-08 09:21:24] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Incomplete random walk after 10000 steps, including 216 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 09:21:25] [INFO ] Invariant cache hit.
[2023-03-08 09:21:25] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 09:21:25] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 09:21:25] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:21:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 09:21:25] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2023-03-08 09:21:25] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:21:25] [INFO ] After 177ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-08 09:21:25] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 64 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 193 transition count 135
Applied a total of 7 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 137 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1021298 steps, run timeout after 3001 ms. (steps per millisecond=340 ) properties seen :{}
Probabilistic random walk after 1021298 steps, saw 144350 distinct states, run finished after 3009 ms. (steps per millisecond=339 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:21:28] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 09:21:28] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 09:21:28] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 09:21:28] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:21:28] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 09:21:28] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 47 ms returned sat
[2023-03-08 09:21:28] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:21:28] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:21:29] [INFO ] After 47ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 09:21:29] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-08 09:21:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-08 09:21:29] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-08 09:21:29] [INFO ] After 453ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 43 ms.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 09:21:29] [INFO ] Invariant cache hit.
[2023-03-08 09:21:29] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 09:21:29] [INFO ] Invariant cache hit.
[2023-03-08 09:21:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:21:29] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 346 ms to find 0 implicit places.
[2023-03-08 09:21:29] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:21:29] [INFO ] Invariant cache hit.
[2023-03-08 09:21:29] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 8 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:21:29] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 09:21:29] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 09:21:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 09:21:29] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 09:21:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 09:21:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-08 09:21:29] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 09:21:30] [INFO ] After 189ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-03-08 09:21:30] [INFO ] After 329ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 164 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 09:21:30] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 09:21:30] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 09:21:30] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 09:21:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 09:21:30] [INFO ] [Real]Absence check using state equation in 269 ms returned sat
[2023-03-08 09:21:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 09:21:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 09:21:31] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 51 ms returned sat
[2023-03-08 09:21:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 09:21:31] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2023-03-08 09:21:31] [INFO ] Computed and/alt/rep : 129/387/129 causal constraints (skipped 7 transitions) in 10 ms.
[2023-03-08 09:21:31] [INFO ] Added : 66 causal constraints over 14 iterations in 244 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Product exploration explored 100000 steps with 2226 reset in 207 ms.
Product exploration explored 100000 steps with 2224 reset in 225 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), true, p0]
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 25 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:21:32] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:21:32] [INFO ] Invariant cache hit.
[2023-03-08 09:21:32] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 114 ms. Remains : 193/193 places, 137/137 transitions.
Built C files in :
/tmp/ltsmin3126251414277108694
[2023-03-08 09:21:32] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3126251414277108694
Running compilation step : cd /tmp/ltsmin3126251414277108694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 272 ms.
Running link step : cd /tmp/ltsmin3126251414277108694;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3126251414277108694;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3989857310495894014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 9 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:21:47] [INFO ] Invariant cache hit.
[2023-03-08 09:21:47] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 09:21:47] [INFO ] Invariant cache hit.
[2023-03-08 09:21:48] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-08 09:21:48] [INFO ] Invariant cache hit.
[2023-03-08 09:21:48] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 394 ms. Remains : 193/193 places, 137/137 transitions.
Built C files in :
/tmp/ltsmin14180239191501373927
[2023-03-08 09:21:48] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14180239191501373927
Running compilation step : cd /tmp/ltsmin14180239191501373927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 259 ms.
Running link step : cd /tmp/ltsmin14180239191501373927;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin14180239191501373927;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5171644535135146147.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 09:22:03] [INFO ] Flatten gal took : 14 ms
[2023-03-08 09:22:03] [INFO ] Flatten gal took : 12 ms
[2023-03-08 09:22:03] [INFO ] Time to serialize gal into /tmp/LTL10914886552411126897.gal : 3 ms
[2023-03-08 09:22:03] [INFO ] Time to serialize properties into /tmp/LTL11255204453792460956.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10914886552411126897.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17964717368125552889.hoa' '-atoms' '/tmp/LTL11255204453792460956.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G(!("((p65==1)&&(p85==1))")))U("((p183==1)&&(p189==1))")))))
Formula 0 simplified : XX(F"((p65==1)&&(p85==1))" R !"((p183==1)&&(p189==1))")
Detected timeout of ITS tools.
[2023-03-08 09:22:33] [INFO ] Flatten gal took : 14 ms
[2023-03-08 09:22:33] [INFO ] Applying decomposition
[2023-03-08 09:22:33] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6064467102472738665.txt' '-o' '/tmp/graph6064467102472738665.bin' '-w' '/tmp/graph6064467102472738665.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6064467102472738665.bin' '-l' '-1' '-v' '-w' '/tmp/graph6064467102472738665.weights' '-q' '0' '-e' '0.001'
[2023-03-08 09:22:34] [INFO ] Decomposing Gal with order
[2023-03-08 09:22:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 09:22:34] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 09:22:34] [INFO ] Flatten gal took : 40 ms
[2023-03-08 09:22:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 5 ms.
[2023-03-08 09:22:34] [INFO ] Time to serialize gal into /tmp/LTL765071088645089313.gal : 4 ms
[2023-03-08 09:22:34] [INFO ] Time to serialize properties into /tmp/LTL4956846332917448212.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL765071088645089313.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4956846332917448212.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((X(X((G(!("((i1.u2.p65==1)&&(i1.u2.p85==1))")))U("((i12.u46.p183==1)&&(i12.u47.p189==1))")))))
Formula 0 simplified : XX(F"((i1.u2.p65==1)&&(i1.u2.p85==1))" R !"((i12.u46.p183==1)&&(i12.u47.p189==1))")
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t130, u13.t90, u14.t11, u48.t5, u48.t31, i0.i0.t0, i0.i0.t128, i0.i0.t134, i0.i...516
Computing Next relation with stutter on 850244 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2430790662875478923
[2023-03-08 09:22:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2430790662875478923
Running compilation step : cd /tmp/ltsmin2430790662875478923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 270 ms.
Running link step : cd /tmp/ltsmin2430790662875478923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2430790662875478923;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](!(LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-20a-LTLFireability-07 finished in 108270 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(p1)||F(p2)||p0)))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:23:04] [INFO ] Invariant cache hit.
[2023-03-08 09:23:04] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-08 09:23:04] [INFO ] Invariant cache hit.
[2023-03-08 09:23:04] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
[2023-03-08 09:23:04] [INFO ] Invariant cache hit.
[2023-03-08 09:23:04] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 383 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-20a-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 2}]], initial=1, aps=[p2:(AND (EQ s86 1) (EQ s107 1)), p1:(AND (EQ s89 1) (EQ s173 1)), p0:(OR (EQ s9 0) (EQ s112 0) (EQ s114 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 275 ms.
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1 (NOT p2))))
Knowledge based reduction with 7 factoid took 297 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-08 finished in 1446 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 U p1)) U (!p2 U G(p0))))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:23:05] [INFO ] Invariant cache hit.
[2023-03-08 09:23:06] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 09:23:06] [INFO ] Invariant cache hit.
[2023-03-08 09:23:06] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
[2023-03-08 09:23:06] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:23:06] [INFO ] Invariant cache hit.
[2023-03-08 09:23:06] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 423 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 258 ms :[(NOT p0), true, (OR (AND (NOT p1) (NOT p2)) (AND p0 (NOT p1))), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND p0 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(OR p0 (AND (NOT p2) p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 1}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s95 1) (EQ s105 1)), p1:(AND (EQ s171 1) (EQ s176 1)), p2:(AND (EQ s116 1) (EQ s118 1) (EQ s175 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-09 finished in 712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X(X(F(p1))))||p0))))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:23:06] [INFO ] Invariant cache hit.
[2023-03-08 09:23:06] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 09:23:06] [INFO ] Invariant cache hit.
[2023-03-08 09:23:06] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2023-03-08 09:23:06] [INFO ] Invariant cache hit.
[2023-03-08 09:23:06] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-20a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (EQ s62 0) (EQ s85 0)), p1:(OR (EQ s46 0) (EQ s109 0) (EQ s15 0) (EQ s112 0) (EQ s114 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 229 ms.
Product exploration explored 100000 steps with 33333 reset in 240 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 6 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-10 finished in 1179 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((((F(p1)&&p0) U p1)&&F(p2)))))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:23:07] [INFO ] Invariant cache hit.
[2023-03-08 09:23:07] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-08 09:23:07] [INFO ] Invariant cache hit.
[2023-03-08 09:23:08] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
[2023-03-08 09:23:08] [INFO ] Invariant cache hit.
[2023-03-08 09:23:08] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 251 ms :[(NOT p2), (NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-20a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=5 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0} source=5 dest: 5}]], initial=3, aps=[p2:(AND (EQ s73 1) (EQ s85 1)), p1:(AND (EQ s101 1) (EQ s106 1) (EQ s108 1)), p0:(AND (EQ s75 1) (EQ s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 39 steps with 0 reset in 1 ms.
FORMULA DES-PT-20a-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-11 finished in 628 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)&&(p1||X(p2)))))'
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:23:08] [INFO ] Invariant cache hit.
[2023-03-08 09:23:08] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 09:23:08] [INFO ] Invariant cache hit.
[2023-03-08 09:23:08] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-08 09:23:08] [INFO ] Invariant cache hit.
[2023-03-08 09:23:08] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 136 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-20a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s10 0) (EQ s112 0) (EQ s114 0)), p1:(AND (EQ s76 1) (EQ s85 1)), p2:(OR (EQ s175 0) (EQ s189 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4331 reset in 202 ms.
Product exploration explored 100000 steps with 4222 reset in 227 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 584 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 63 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 09:23:10] [INFO ] Invariant cache hit.
[2023-03-08 09:23:10] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:23:10] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 09:23:10] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 37 ms returned sat
[2023-03-08 09:23:10] [INFO ] After 140ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:23:10] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 1 ms to minimize.
[2023-03-08 09:23:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 79 ms
[2023-03-08 09:23:10] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-08 09:23:10] [INFO ] After 467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 798 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=266 )
Parikh walk visited 3 properties in 22 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p0 (NOT p1))), (X p0), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p0 (NOT p1)))), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 667 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:23:11] [INFO ] Invariant cache hit.
[2023-03-08 09:23:12] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 09:23:12] [INFO ] Invariant cache hit.
[2023-03-08 09:23:12] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-08 09:23:12] [INFO ] Invariant cache hit.
[2023-03-08 09:23:12] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 525 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Incomplete random walk after 10000 steps, including 223 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 09:23:13] [INFO ] Invariant cache hit.
[2023-03-08 09:23:13] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 09:23:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 09:23:13] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 38 ms returned sat
[2023-03-08 09:23:13] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 09:23:13] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 0 ms to minimize.
[2023-03-08 09:23:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2023-03-08 09:23:13] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-08 09:23:13] [INFO ] After 468ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 837 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=279 )
Parikh walk visited 3 properties in 21 ms.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p0)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 12 factoid took 638 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 4214 reset in 203 ms.
Product exploration explored 100000 steps with 4114 reset in 220 ms.
Built C files in :
/tmp/ltsmin5140320785358440274
[2023-03-08 09:23:15] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5140320785358440274
Running compilation step : cd /tmp/ltsmin5140320785358440274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 277 ms.
Running link step : cd /tmp/ltsmin5140320785358440274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin5140320785358440274;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2551429220173689832.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:23:30] [INFO ] Invariant cache hit.
[2023-03-08 09:23:30] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 09:23:30] [INFO ] Invariant cache hit.
[2023-03-08 09:23:30] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 273 ms to find 0 implicit places.
[2023-03-08 09:23:30] [INFO ] Invariant cache hit.
[2023-03-08 09:23:30] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 193/193 places, 137/137 transitions.
Built C files in :
/tmp/ltsmin7147356866684591224
[2023-03-08 09:23:30] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7147356866684591224
Running compilation step : cd /tmp/ltsmin7147356866684591224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 266 ms.
Running link step : cd /tmp/ltsmin7147356866684591224;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin7147356866684591224;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11419205486165149403.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 09:23:45] [INFO ] Flatten gal took : 10 ms
[2023-03-08 09:23:45] [INFO ] Flatten gal took : 10 ms
[2023-03-08 09:23:45] [INFO ] Time to serialize gal into /tmp/LTL11276192347430527300.gal : 2 ms
[2023-03-08 09:23:45] [INFO ] Time to serialize properties into /tmp/LTL9558228353954458834.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11276192347430527300.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8632692321771308125.hoa' '-atoms' '/tmp/LTL9558228353954458834.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9558228353954458834.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8632692321771308125.hoa
Detected timeout of ITS tools.
[2023-03-08 09:24:00] [INFO ] Flatten gal took : 9 ms
[2023-03-08 09:24:00] [INFO ] Flatten gal took : 10 ms
[2023-03-08 09:24:00] [INFO ] Time to serialize gal into /tmp/LTL8171486782028985798.gal : 1 ms
[2023-03-08 09:24:00] [INFO ] Time to serialize properties into /tmp/LTL13704844865272432934.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8171486782028985798.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13704844865272432934.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p10==0)||(p113==0))||(p115==0))"))&&((X("((p176==0)||(p191==0))"))||("((p76==1)&&(p85==1))")))))
Formula 0 simplified : G(F!"(((p10==0)||(p113==0))||(p115==0))" | (!"((p76==1)&&(p85==1))" & X!"((p176==0)||(p191==0))"))
Detected timeout of ITS tools.
[2023-03-08 09:24:15] [INFO ] Flatten gal took : 9 ms
[2023-03-08 09:24:15] [INFO ] Applying decomposition
[2023-03-08 09:24:15] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11913080319718280382.txt' '-o' '/tmp/graph11913080319718280382.bin' '-w' '/tmp/graph11913080319718280382.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11913080319718280382.bin' '-l' '-1' '-v' '-w' '/tmp/graph11913080319718280382.weights' '-q' '0' '-e' '0.001'
[2023-03-08 09:24:15] [INFO ] Decomposing Gal with order
[2023-03-08 09:24:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 09:24:15] [INFO ] Removed a total of 16 redundant transitions.
[2023-03-08 09:24:15] [INFO ] Flatten gal took : 14 ms
[2023-03-08 09:24:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2023-03-08 09:24:15] [INFO ] Time to serialize gal into /tmp/LTL11559675839912526296.gal : 3 ms
[2023-03-08 09:24:15] [INFO ] Time to serialize properties into /tmp/LTL14673299543860347249.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11559675839912526296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14673299543860347249.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G("(((u14.p10==0)||(u14.p113==0))||(u14.p115==0))"))&&((X("((i12.u44.p176==0)||(u48.p191==0))"))||("((i1.u2.p76==1)&&(i1.u2.p85=...165
Formula 0 simplified : G(F!"(((u14.p10==0)||(u14.p113==0))||(u14.p115==0))" | (!"((i1.u2.p76==1)&&(i1.u2.p85==1))" & X!"((i12.u44.p176==0)||(u48.p191==0))"...157
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t130, u13.t90, u14.t11, u48.t5, u48.t31, i0.i0.t0, i0.i0.t128, i0.i0.t134, i0.i...516
Computing Next relation with stutter on 850244 deadlock states
75 unique states visited
74 strongly connected components in search stack
75 transitions explored
74 items max in DFS search stack
1454 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,14.5687,404860,1,0,951585,36883,2055,1.12594e+06,2355,181187,1189223
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-20a-LTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property DES-PT-20a-LTLFireability-13 finished in 82667 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(((G(p0)||p1) U !(G(F(X(p2)))||(p0 U p2)))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
[2023-03-08 09:24:31] [INFO ] Invariant cache hit.
[2023-03-08 09:24:31] [INFO ] Implicit Places using invariants in 109 ms returned []
[2023-03-08 09:24:31] [INFO ] Invariant cache hit.
[2023-03-08 09:24:31] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2023-03-08 09:24:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:24:31] [INFO ] Invariant cache hit.
[2023-03-08 09:24:31] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 397 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 382 ms :[p2, true, (NOT p0), p2, p2, (AND (NOT p0) p2), p2]
Running random walk in product with property : DES-PT-20a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(OR p0 (NOT p2) p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}, { cond=p2, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=4 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(OR (AND p0 p2) (AND p2 p1)), acceptance={0} source=6 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s35 1) (EQ s188 1)), p2:(AND (EQ s2 1) (EQ s112 1) (EQ s114 1)), p1:(AND (EQ s33 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 2243 reset in 220 ms.
Product exploration explored 100000 steps with 2204 reset in 275 ms.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (OR p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p2))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1222 ms. Reduced automaton from 7 states, 24 edges and 3 AP (stutter insensitive) to 7 states, 24 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 267 ms :[p2, true, (NOT p0), p2, p2, (AND (NOT p0) p2), p2]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 203 ms. (steps per millisecond=49 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 39 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 44 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 672471 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :{}
Probabilistic random walk after 672471 steps, saw 104557 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
Running SMT prover for 10 properties.
[2023-03-08 09:24:37] [INFO ] Invariant cache hit.
[2023-03-08 09:24:37] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 09:24:37] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 09:24:37] [INFO ] After 88ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 09:24:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 09:24:37] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 09:24:38] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :7
[2023-03-08 09:24:38] [INFO ] Deduced a trap composed of 13 places in 44 ms of which 1 ms to minimize.
[2023-03-08 09:24:38] [INFO ] Deduced a trap composed of 13 places in 39 ms of which 1 ms to minimize.
[2023-03-08 09:24:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2023-03-08 09:24:38] [INFO ] After 834ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :7
Attempting to minimize the solution found.
Minimization took 287 ms.
[2023-03-08 09:24:38] [INFO ] After 1317ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :7
Fused 10 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 255 ms.
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Applied a total of 8 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/137 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 193/193 places, 135/137 transitions.
Incomplete random walk after 10000 steps, including 134 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 834268 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{}
Probabilistic random walk after 834268 steps, saw 118777 distinct states, run finished after 3001 ms. (steps per millisecond=277 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:24:42] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 09:24:42] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 09:24:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 09:24:42] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-08 09:24:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 09:24:42] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 09:24:43] [INFO ] After 282ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-08 09:24:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:24:43] [INFO ] After 185ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-08 09:24:43] [INFO ] After 385ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 171 ms.
[2023-03-08 09:24:43] [INFO ] After 995ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 125 ms.
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 193/193 places, 135/135 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 135/135 transitions.
Applied a total of 0 rules in 2 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
[2023-03-08 09:24:43] [INFO ] Invariant cache hit.
[2023-03-08 09:24:43] [INFO ] Implicit Places using invariants in 103 ms returned []
[2023-03-08 09:24:43] [INFO ] Invariant cache hit.
[2023-03-08 09:24:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 09:24:44] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-08 09:24:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:24:44] [INFO ] Invariant cache hit.
[2023-03-08 09:24:44] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 193/193 places, 135/135 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 193 transition count 135
Applied a total of 1 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 135 rows 193 cols
[2023-03-08 09:24:44] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 09:24:44] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 09:24:44] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 09:24:44] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 09:24:44] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 09:24:44] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 09:24:44] [INFO ] After 163ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-08 09:24:44] [INFO ] After 286ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-08 09:24:44] [INFO ] After 466ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT p2)), (X (OR p0 (NOT p2) p1)), (X (NOT (AND p0 (NOT p2)))), (X (NOT (OR (AND p0 p2) (AND p2 p1)))), (X (NOT (AND p0 p2))), (X (NOT p0)), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2)))), true, (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT p2))), (X (X (OR p0 (NOT p2) p1))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p0 p2) (AND p2 p1))))), (X (X (NOT (AND p0 p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (OR (AND p2 p1) (AND p2 p0)))), (G (NOT (AND p2 (NOT p1) p0))), (G (NOT (AND p2 p0)))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1) p0)), (F p0), (F (AND (NOT p2) p0))]
Knowledge based reduction with 28 factoid took 1308 ms. Reduced automaton from 7 states, 24 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 87 ms :[true, p2]
Stuttering acceptance computed with spot in 38 ms :[true, p2]
Support contains 3 out of 193 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 7 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 09:24:46] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 09:24:46] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-08 09:24:46] [INFO ] Invariant cache hit.
[2023-03-08 09:24:46] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-08 09:24:46] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 09:24:46] [INFO ] Invariant cache hit.
[2023-03-08 09:24:46] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 379 ms. Remains : 193/193 places, 137/137 transitions.
Computed a total of 96 stabilizing places and 91 stable transitions
Computed a total of 96 stabilizing places and 91 stable transitions
Detected a total of 96/193 stabilizing places and 91/137 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 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 38 ms :[true, p2]
Incomplete random walk after 10000 steps, including 217 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1776917 steps, run timeout after 3001 ms. (steps per millisecond=592 ) properties seen :{}
Probabilistic random walk after 1776917 steps, saw 241240 distinct states, run finished after 3004 ms. (steps per millisecond=591 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 09:24:49] [INFO ] Invariant cache hit.
[2023-03-08 09:24:49] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 09:24:49] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 8 ms returned sat
[2023-03-08 09:24:49] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:24:50] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 09:24:50] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 18 ms returned sat
[2023-03-08 09:24:50] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:24:50] [INFO ] After 152ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-08 09:24:50] [INFO ] After 238ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 193/193 places, 137/137 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 193 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 193 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 192 transition count 134
Applied a total of 9 rules in 12 ms. Remains 192 /193 variables (removed 1) and now considering 134/137 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 192/193 places, 134/137 transitions.
Incomplete random walk after 10000 steps, including 142 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1718911 steps, run timeout after 3001 ms. (steps per millisecond=572 ) properties seen :{}
Probabilistic random walk after 1718911 steps, saw 240397 distinct states, run finished after 3001 ms. (steps per millisecond=572 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 134 rows 192 cols
[2023-03-08 09:24:53] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 09:24:53] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 09:24:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 09:24:53] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 09:24:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 09:24:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 42 ms returned sat
[2023-03-08 09:24:53] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 09:24:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 09:24:53] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 09:24:53] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 09:24:53] [INFO ] After 253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1257 steps, including 2 resets, run visited all 1 properties in 11 ms. (steps per millisecond=114 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), true, (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p2)]
Property proved to be false thanks to negative knowledge :(F p2)
Knowledge based reduction with 5 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-20a-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-20a-LTLFireability-14 finished in 22661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 137/137 transitions.
Applied a total of 0 rules in 6 ms. Remains 193 /193 variables (removed 0) and now considering 137/137 (removed 0) transitions.
// Phase 1: matrix 137 rows 193 cols
[2023-03-08 09:24:53] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 09:24:53] [INFO ] Implicit Places using invariants in 106 ms returned []
[2023-03-08 09:24:53] [INFO ] Invariant cache hit.
[2023-03-08 09:24:53] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 09:24:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:24:53] [INFO ] Invariant cache hit.
[2023-03-08 09:24:54] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 393 ms. Remains : 193/193 places, 137/137 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-20a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s39 1) (EQ s188 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 95 steps with 0 reset in 0 ms.
FORMULA DES-PT-20a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-20a-LTLFireability-15 finished in 446 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(!p0) U p1))))'
[2023-03-08 09:24:54] [INFO ] Flatten gal took : 22 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14793560065134466469
[2023-03-08 09:24:54] [INFO ] Computing symmetric may disable matrix : 137 transitions.
[2023-03-08 09:24:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:24:54] [INFO ] Applying decomposition
[2023-03-08 09:24:54] [INFO ] Computing symmetric may enable matrix : 137 transitions.
[2023-03-08 09:24:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:24:54] [INFO ] Flatten gal took : 7 ms
[2023-03-08 09:24:54] [INFO ] Computing Do-Not-Accords matrix : 137 transitions.
[2023-03-08 09:24:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 09:24:54] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14793560065134466469
Running compilation step : cd /tmp/ltsmin14793560065134466469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph13441549405020658152.txt' '-o' '/tmp/graph13441549405020658152.bin' '-w' '/tmp/graph13441549405020658152.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13441549405020658152.bin' '-l' '-1' '-v' '-w' '/tmp/graph13441549405020658152.weights' '-q' '0' '-e' '0.001'
[2023-03-08 09:24:54] [INFO ] Decomposing Gal with order
[2023-03-08 09:24:54] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 09:24:54] [INFO ] Removed a total of 31 redundant transitions.
[2023-03-08 09:24:54] [INFO ] Flatten gal took : 13 ms
[2023-03-08 09:24:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 17 labels/synchronizations in 2 ms.
[2023-03-08 09:24:54] [INFO ] Time to serialize gal into /tmp/LTLFireability12549390831444153253.gal : 2 ms
[2023-03-08 09:24:54] [INFO ] Time to serialize properties into /tmp/LTLFireability7878345571369703140.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12549390831444153253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7878345571369703140.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(X((G(!("((i1.u2.p65==1)&&(i1.u2.p85==1))")))U("((i12.u47.p183==1)&&(i12.u48.p189==1))")))))
Formula 0 simplified : XX(F"((i1.u2.p65==1)&&(i1.u2.p85==1))" R !"((i12.u47.p183==1)&&(i12.u48.p189==1))")
Compilation finished in 325 ms.
Running link step : cd /tmp/ltsmin14793560065134466469;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin14793560065134466469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](!(LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t1, t97, t98, t130, u13.t90, u49.t5, u49.t31, i0.i0.t0, i0.i0.t128, i0.i0.t134, i0.i0.u1.t9, ...514
Computing Next relation with stutter on 850244 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: LTL layer: formula: X(X(([](!(LTLAPp0==true)) U (LTLAPp1==true))))
pins2lts-mc-linux64( 0/ 8), 0.003: "X(X(([](!(LTLAPp0==true)) U (LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.004: Using Spin LTL semantics
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.014: buchi has 6 states
pins2lts-mc-linux64( 1/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.026: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.093: DFS-FIFO for weak LTL, using special progress label 140
pins2lts-mc-linux64( 0/ 8), 0.093: There are 141 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.093: State length is 194, there are 147 groups
pins2lts-mc-linux64( 0/ 8), 0.093: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.093: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.093: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.094: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.125: ~16 levels ~960 states ~4368 transitions
pins2lts-mc-linux64( 0/ 8), 0.164: ~1 levels ~1920 states ~6880 transitions
pins2lts-mc-linux64( 0/ 8), 0.187: ~1 levels ~3840 states ~15096 transitions
pins2lts-mc-linux64( 0/ 8), 0.216: ~1 levels ~7680 states ~28728 transitions
pins2lts-mc-linux64( 0/ 8), 0.390: ~1 levels ~15360 states ~69656 transitions
pins2lts-mc-linux64( 0/ 8), 0.623: ~1 levels ~30720 states ~141536 transitions
pins2lts-mc-linux64( 5/ 8), 1.019: ~1 levels ~61440 states ~329624 transitions
pins2lts-mc-linux64( 2/ 8), 1.631: ~1 levels ~122880 states ~727880 transitions
pins2lts-mc-linux64( 2/ 8), 2.668: ~1 levels ~245760 states ~1465896 transitions
pins2lts-mc-linux64( 2/ 8), 4.429: ~1 levels ~491520 states ~3320288 transitions
pins2lts-mc-linux64( 2/ 8), 7.609: ~1 levels ~983040 states ~8566776 transitions
pins2lts-mc-linux64( 4/ 8), 13.755: ~51 levels ~1966080 states ~15957728 transitions
pins2lts-mc-linux64( 1/ 8), 26.123: ~1 levels ~3932160 states ~38346904 transitions
pins2lts-mc-linux64( 1/ 8), 49.873: ~1 levels ~7864320 states ~76395240 transitions
pins2lts-mc-linux64( 1/ 8), 99.745: ~1 levels ~15728640 states ~156604952 transitions
pins2lts-mc-linux64( 0/ 8), 189.396: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 189.452:
pins2lts-mc-linux64( 0/ 8), 189.452: mean standard work distribution: 4.5% (states) 5.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 189.452:
pins2lts-mc-linux64( 0/ 8), 189.452: Explored 27862152 states 288242234 transitions, fanout: 10.345
pins2lts-mc-linux64( 0/ 8), 189.452: Total exploration time 189.360 sec (189.300 sec minimum, 189.319 sec on average)
pins2lts-mc-linux64( 0/ 8), 189.452: States per second: 147139, Transitions per second: 1522192
pins2lts-mc-linux64( 0/ 8), 189.452:
pins2lts-mc-linux64( 0/ 8), 189.452: Progress states detected: 40415071
pins2lts-mc-linux64( 0/ 8), 189.452: Redundant explorations: -41.3060
pins2lts-mc-linux64( 0/ 8), 189.452:
pins2lts-mc-linux64( 0/ 8), 189.452: Queue width: 8B, total height: 28497680, memory: 217.42MB
pins2lts-mc-linux64( 0/ 8), 189.452: Tree memory: 618.2MB, 13.7 B/state, compr.: 1.8%
pins2lts-mc-linux64( 0/ 8), 189.452: Tree fill ratio (roots/leafs): 35.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 189.452: Stored 137 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 189.452: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 189.452: Est. total memory use: 835.6MB (~1241.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14793560065134466469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](!(LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14793560065134466469;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](!(LTLAPp0==true)) U (LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
59 unique states visited
58 strongly connected components in search stack
59 transitions explored
58 items max in DFS search stack
36639 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,366.417,3330912,1,0,7.30458e+06,29447,902,7.64514e+06,730,155403,994433
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA DES-PT-20a-LTLFireability-07 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 731937 ms.

BK_STOP 1678267973419

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-20a, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475300428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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