Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.5M
-rw-r--r-- 1 mcc users 9.2K Apr 30 02:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 30 02:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 30 02:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 30 02:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 08:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 6.2M May 10 09:34 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 JoinFreeModules-PT-2000-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652757904796

Running Version 202205111006
[2022-05-17 03:25:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 03:25:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 03:25:06] [INFO ] Load time of PNML (sax parser for PT used): 455 ms
[2022-05-17 03:25:06] [INFO ] Transformed 10001 places.
[2022-05-17 03:25:06] [INFO ] Transformed 16001 transitions.
[2022-05-17 03:25:06] [INFO ] Parsed PT model containing 10001 places and 16001 transitions in 608 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 68 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1500 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:25:08] [INFO ] Computed 2000 place invariants in 98 ms
[2022-05-17 03:25:09] [INFO ] Dead Transitions using invariants and state equation in 1433 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:25:09] [INFO ] Computed 2000 place invariants in 51 ms
[2022-05-17 03:25:11] [INFO ] Implicit Places using invariants in 1640 ms returned []
Implicit Place search using SMT only with invariants took 1646 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:25:11] [INFO ] Computed 2000 place invariants in 53 ms
[2022-05-17 03:25:12] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Support contains 33 out of 10000 places after structural reductions.
[2022-05-17 03:25:13] [INFO ] Flatten gal took : 661 ms
[2022-05-17 03:25:13] [INFO ] Flatten gal took : 480 ms
[2022-05-17 03:25:14] [INFO ] Input system was already deterministic with 16001 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 936 ms. (steps per millisecond=10 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 109 ms. (steps per millisecond=9 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 106 ms. (steps per millisecond=9 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 139 ms. (steps per millisecond=7 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 120 ms. (steps per millisecond=8 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 87 ms. (steps per millisecond=11 ) properties (out of 31) seen :0
Probabilistic random walk after 52039 steps, saw 52021 distinct states, run finished after 9004 ms. (steps per millisecond=5 ) properties seen :1
Running SMT prover for 30 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:25:27] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:25:33] [INFO ] [Real]Absence check using 2000 positive place invariants in 631 ms returned sat
[2022-05-17 03:25:52] [INFO ] After 15393ms SMT Verify possible using state equation in real domain returned unsat :0 sat :24 real:6
[2022-05-17 03:25:53] [INFO ] State equation strengthened by 2000 read => feed constraints.
[2022-05-17 03:25:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:25:53] [INFO ] After 25130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 30 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 32 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 160 are kept as prefixes of interest. Removing 9840 places using SCC suffix rule.26 ms
Discarding 9840 places :
Also discarding 15744 output transitions
Drop transitions removed 15744 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 160 transition count 256
Applied a total of 2 rules in 85 ms. Remains 160 /10000 variables (removed 9840) and now considering 256/16001 (removed 15745) transitions.
// Phase 1: matrix 256 rows 160 cols
[2022-05-17 03:25:53] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 03:25:53] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 160/10000 places, 256/16001 transitions.
Incomplete random walk after 11010 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=611 ) properties (out of 30) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) seen :1
Running SMT prover for 13 properties.
// Phase 1: matrix 256 rows 160 cols
[2022-05-17 03:25:53] [INFO ] Computed 32 place invariants in 1 ms
[2022-05-17 03:25:53] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2022-05-17 03:25:53] [INFO ] After 267ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2022-05-17 03:25:53] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2022-05-17 03:25:54] [INFO ] After 302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2022-05-17 03:25:54] [INFO ] State equation strengthened by 32 read => feed constraints.
[2022-05-17 03:25:54] [INFO ] After 221ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2022-05-17 03:25:54] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 3 ms to minimize.
[2022-05-17 03:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2022-05-17 03:25:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2022-05-17 03:25:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-17 03:25:54] [INFO ] After 576ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 196 ms.
[2022-05-17 03:25:54] [INFO ] After 1212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 12 different solutions.
Finished Parikh walk after 44118 steps, including 0 resets, run visited all 1 properties in 169 ms. (steps per millisecond=261 )
Parikh walk visited 13 properties in 9074 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(F(p0)))||F(p1)||G(p2)))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1234 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:06] [INFO ] Computed 2000 place invariants in 25 ms
[2022-05-17 03:26:07] [INFO ] Dead Transitions using invariants and state equation in 822 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:07] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 03:26:08] [INFO ] Implicit Places using invariants in 1658 ms returned []
Implicit Place search using SMT only with invariants took 1659 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:08] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:26:09] [INFO ] Dead Transitions using invariants and state equation in 905 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 258 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(GEQ s8108 3), p0:(GEQ s7400 3), p2:(GEQ s8814 5)], 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][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 5 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-00 finished in 4983 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(X(p0))&&(F(p1)||X(p2)||p3))))))'
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1061 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:11] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:26:12] [INFO ] Dead Transitions using invariants and state equation in 870 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:12] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:26:13] [INFO ] Implicit Places using invariants in 1371 ms returned []
Implicit Place search using SMT only with invariants took 1372 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:13] [INFO ] Computed 2000 place invariants in 32 ms
[2022-05-17 03:26:14] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 311 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(GEQ s9222 1), p1:(LT s5496 2), p0:(GEQ s5234 5), p2:(GEQ s4050 5)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-02 finished in 4628 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U !X((p1 U p2))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1053 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:15] [INFO ] Computed 2000 place invariants in 32 ms
[2022-05-17 03:26:16] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:16] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:26:17] [INFO ] Implicit Places using invariants in 1339 ms returned []
Implicit Place search using SMT only with invariants took 1341 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:17] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:26:18] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 107 ms :[p2, p2, p2, true]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s2009 5), p1:(GEQ s5910 5), p2:(GEQ s3248 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration timeout after 26140 steps with 13070 reset in 10004 ms.
Product exploration timeout after 25840 steps with 12920 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p0 p2))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (OR (AND (NOT p0) p1) (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p0) (NOT p1) (NOT p2))
Knowledge based reduction with 6 factoid took 194 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA JoinFreeModules-PT-2000-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-2000-LTLFireability-03 finished in 25548 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(((F(p0)&&p1) U !X(p1)))&&X(X(p2))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1070 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:41] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:26:42] [INFO ] Dead Transitions using invariants and state equation in 876 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:42] [INFO ] Computed 2000 place invariants in 25 ms
[2022-05-17 03:26:43] [INFO ] Implicit Places using invariants in 1364 ms returned []
Implicit Place search using SMT only with invariants took 1368 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:26:43] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:26:44] [INFO ] Dead Transitions using invariants and state equation in 897 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) p1), p1, p1, (NOT p2), (AND (NOT p0) p1), p1, true, (NOT p2), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=p1, acceptance={} source=1 dest: 6}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=p1, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 7}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 8}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=5 dest: 4}, { cond=p1, acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s7948 4), p0:(GEQ s9549 5), p2:(GEQ s9842 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]]
Product exploration timeout after 25180 steps with 8416 reset in 10008 ms.
Product exploration timeout after 24240 steps with 8138 reset in 10003 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 132 ms. Reduced automaton from 9 states, 17 edges and 3 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 150 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 769 ms. (steps per millisecond=13 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 849 ms. (steps per millisecond=11 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 992 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 877 ms. (steps per millisecond=11 ) properties (out of 3) seen :0
Probabilistic random walk after 66058 steps, saw 66033 distinct states, run finished after 9085 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:27:19] [INFO ] Computed 2000 place invariants in 32 ms
[2022-05-17 03:27:21] [INFO ] [Real]Absence check using 2000 positive place invariants in 617 ms returned sat
[2022-05-17 03:27:35] [INFO ] After 16840ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 03:27:37] [INFO ] [Nat]Absence check using 2000 positive place invariants in 627 ms returned sat
[2022-05-17 03:28:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:28:00] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.13 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 41 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:28:01] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 03:28:01] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10000 places, 16/16001 transitions.
Finished random walk after 3002 steps, including 0 resets, run visited all 3 properties in 1 ms. (steps per millisecond=3002 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1))]
False Knowledge obtained : [(F p1), (F (NOT (AND p2 (NOT p1)))), (F (OR (NOT p2) p1))]
Knowledge based reduction with 3 factoid took 194 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 151 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 155 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Support contains 2 out of 10000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1157 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:02] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:28:03] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:03] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:28:05] [INFO ] Implicit Places using invariants in 1372 ms returned []
Implicit Place search using SMT only with invariants took 1376 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:05] [INFO ] Computed 2000 place invariants in 29 ms
[2022-05-17 03:28:05] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 47 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 134 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 830 ms. (steps per millisecond=12 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 903 ms. (steps per millisecond=11 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 911 ms. (steps per millisecond=10 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=11 ) properties (out of 3) seen :0
Probabilistic random walk after 68058 steps, saw 68033 distinct states, run finished after 9043 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:28:19] [INFO ] Computed 2000 place invariants in 33 ms
[2022-05-17 03:28:21] [INFO ] [Real]Absence check using 2000 positive place invariants in 611 ms returned sat
[2022-05-17 03:28:35] [INFO ] After 16059ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2022-05-17 03:28:37] [INFO ] [Nat]Absence check using 2000 positive place invariants in 629 ms returned sat
[2022-05-17 03:29:00] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:29:00] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.4 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 27 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2022-05-17 03:29:00] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-17 03:29:01] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10/10000 places, 16/16001 transitions.
Finished random walk after 3002 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1501 )
Knowledge obtained : [(AND (NOT p1) p2)]
False Knowledge obtained : [(F p1), (F (NOT (AND (NOT p1) p2))), (F (OR p1 (NOT p2)))]
Knowledge based reduction with 1 factoid took 98 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 164 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 151 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Stuttering acceptance computed with spot in 157 ms :[true, p1, (OR (NOT p2) p1), (OR (NOT p2) p1), (OR (NOT p2) p1)]
Product exploration timeout after 13000 steps with 0 reset in 10007 ms.
Entered a terminal (fully accepting) state of product in 5072 steps with 0 reset in 3248 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-05 finished in 154643 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&p1))||X(F(X(p2)))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1164 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:29:16] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:29:16] [INFO ] Dead Transitions using invariants and state equation in 908 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:29:17] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:29:18] [INFO ] Implicit Places using invariants in 1366 ms returned []
Implicit Place search using SMT only with invariants took 1367 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:29:18] [INFO ] Computed 2000 place invariants in 25 ms
[2022-05-17 03:29:19] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p2:(LT s5765 3), p1:(GEQ s1070 5), p0:(GEQ s5203 4)], 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 timeout after 25920 steps with 8640 reset in 10002 ms.
Product exploration timeout after 24490 steps with 8163 reset in 10002 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 141 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 854 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Probabilistic random walk after 25011 steps, saw 25005 distinct states, run finished after 3089 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:29:45] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:29:47] [INFO ] [Real]Absence check using 2000 positive place invariants in 635 ms returned sat
[2022-05-17 03:30:00] [INFO ] After 15232ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:30:02] [INFO ] [Nat]Absence check using 2000 positive place invariants in 630 ms returned sat
[2022-05-17 03:30:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:30:25] [INFO ] After 25020ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 5 are kept as prefixes of interest. Removing 9995 places using SCC suffix rule.5 ms
Discarding 9995 places :
Also discarding 15992 output transitions
Drop transitions removed 15992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 35 ms. Remains 5 /10000 variables (removed 9995) and now considering 8/16001 (removed 15993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:30:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:30:25] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/10000 places, 8/16001 transitions.
Finished random walk after 2002 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2002 )
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (OR (NOT p1) (NOT p0)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 90 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 10000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1112 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:30:27] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 03:30:28] [INFO ] Dead Transitions using invariants and state equation in 861 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:30:28] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 03:30:29] [INFO ] Implicit Places using invariants in 1369 ms returned []
Implicit Place search using SMT only with invariants took 1372 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:30:29] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:30:30] [INFO ] Dead Transitions using invariants and state equation in 888 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 48 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 762 ms. (steps per millisecond=13 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 906 ms. (steps per millisecond=11 ) properties (out of 1) seen :0
Probabilistic random walk after 26011 steps, saw 26005 distinct states, run finished after 3155 ms. (steps per millisecond=8 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:30:36] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:30:38] [INFO ] [Real]Absence check using 2000 positive place invariants in 622 ms returned sat
[2022-05-17 03:30:49] [INFO ] After 13372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 03:30:51] [INFO ] [Nat]Absence check using 2000 positive place invariants in 637 ms returned sat
[2022-05-17 03:31:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:31:14] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 5 are kept as prefixes of interest. Removing 9995 places using SCC suffix rule.4 ms
Discarding 9995 places :
Also discarding 15992 output transitions
Drop transitions removed 15992 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 8
Applied a total of 2 rules in 24 ms. Remains 5 /10000 variables (removed 9995) and now considering 8/16001 (removed 15993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-17 03:31:14] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-17 03:31:14] [INFO ] Dead Transitions using invariants and state equation in 15 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/10000 places, 8/16001 transitions.
Finished random walk after 1002 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1002 )
Knowledge obtained : [p2]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 103 ms :[(NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p2), (NOT p2), (NOT p2)]
Product exploration timeout after 25360 steps with 8453 reset in 10003 ms.
Product exploration timeout after 24190 steps with 8063 reset in 10003 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 85 ms :[(NOT p2), (NOT p2), (NOT p2)]
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3123 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:38] [INFO ] Computed 2000 place invariants in 29 ms
[2022-05-17 03:31:39] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:31:39] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:31:40] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Product exploration timeout after 9270 steps with 3090 reset in 10011 ms.
Product exploration timeout after 9340 steps with 3113 reset in 10009 ms.
Built C files in :
/tmp/ltsmin16373619292189793993
[2022-05-17 03:32:00] [INFO ] Built C files in 157ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16373619292189793993
Running compilation step : cd /tmp/ltsmin16373619292189793993;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16373619292189793993;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16373619292189793993;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1173 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:04] [INFO ] Computed 2000 place invariants in 46 ms
[2022-05-17 03:32:05] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:05] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:32:07] [INFO ] Implicit Places using invariants in 1445 ms returned []
Implicit Place search using SMT only with invariants took 1446 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:07] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:32:08] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Built C files in :
/tmp/ltsmin7944785332918611296
[2022-05-17 03:32:08] [INFO ] Built C files in 137ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7944785332918611296
Running compilation step : cd /tmp/ltsmin7944785332918611296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7944785332918611296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7944785332918611296;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 03:32:12] [INFO ] Flatten gal took : 346 ms
[2022-05-17 03:32:12] [INFO ] Flatten gal took : 345 ms
[2022-05-17 03:32:12] [INFO ] Time to serialize gal into /tmp/LTL11987168723239327677.gal : 78 ms
[2022-05-17 03:32:12] [INFO ] Time to serialize properties into /tmp/LTL6077983350126466831.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11987168723239327677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6077983350126466831.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1198716...267
Read 1 LTL properties
Checking formula 0 : !(((X((G("(p5204>=4)"))&&("(p1071>=5)")))||(X(F(X("(p5766<3)"))))))
Formula 0 simplified : !(X("(p1071>=5)" & G"(p5204>=4)") | XFX"(p5766<3)")
Detected timeout of ITS tools.
[2022-05-17 03:32:28] [INFO ] Flatten gal took : 383 ms
[2022-05-17 03:32:28] [INFO ] Applying decomposition
[2022-05-17 03:32:28] [INFO ] Flatten gal took : 402 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2797126302226319498.txt' '-o' '/tmp/graph2797126302226319498.bin' '-w' '/tmp/graph2797126302226319498.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2797126302226319498.bin' '-l' '-1' '-v' '-w' '/tmp/graph2797126302226319498.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:32:30] [INFO ] Decomposing Gal with order
[2022-05-17 03:32:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:32:35] [INFO ] Flatten gal took : 398 ms
[2022-05-17 03:32:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 524 ms.
[2022-05-17 03:32:36] [INFO ] Time to serialize gal into /tmp/LTL13500693310088703808.gal : 160 ms
[2022-05-17 03:32:36] [INFO ] Time to serialize properties into /tmp/LTL4546402063554454806.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13500693310088703808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4546402063554454806.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1350069...246
Read 1 LTL properties
Checking formula 0 : !(((X((G("(u1040.p5204>=4)"))&&("(u214.p1071>=5)")))||(X(F(X("(u1153.p5766<3)"))))))
Formula 0 simplified : !(X("(u214.p1071>=5)" & G"(u1040.p5204>=4)") | XFX"(u1153.p5766<3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10710559746459287770
[2022-05-17 03:32:51] [INFO ] Built C files in 120ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10710559746459287770
Running compilation step : cd /tmp/ltsmin10710559746459287770;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10710559746459287770;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10710559746459287770;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property JoinFreeModules-PT-2000-LTLFireability-06 finished in 220001 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(!(G(X(X(X(p0)))) U (!p0 U (G(p1)||p2)))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1210 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:56] [INFO ] Computed 2000 place invariants in 24 ms
[2022-05-17 03:32:56] [INFO ] Dead Transitions using invariants and state equation in 796 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:56] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 03:32:58] [INFO ] Implicit Places using invariants in 1393 ms returned []
Implicit Place search using SMT only with invariants took 1399 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:32:58] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:32:59] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR p2 p1), (OR (AND p0 p2) (AND p0 p1)), (OR p2 p1), p1, (OR (AND p0 p2) (AND p0 p1)), (OR (AND p0 p2) (AND p0 p1)), (AND p0 p1)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=p2, acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 p2), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 p1), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(GEQ s652 1), p0:(LT s2190 5), p1:(GEQ s8648 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-07 finished in 4460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(G((F(X(F(p0)))||G(p1))))))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3194 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:33:02] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:33:03] [INFO ] Dead Transitions using invariants and state equation in 797 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:33:03] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:33:04] [INFO ] Implicit Places using invariants in 1313 ms returned []
Implicit Place search using SMT only with invariants took 1319 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:33:04] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:33:05] [INFO ] Dead Transitions using invariants and state equation in 790 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s2063 4), p0:(LT s6247 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-09 finished in 6189 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p1)) U G(!p0))||X(X(p2)))))'
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1141 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:33:06] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:33:07] [INFO ] Dead Transitions using invariants and state equation in 798 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:33:07] [INFO ] Computed 2000 place invariants in 32 ms
[2022-05-17 03:33:08] [INFO ] Implicit Places using invariants in 1347 ms returned []
Implicit Place search using SMT only with invariants took 1354 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:33:08] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 03:33:09] [INFO ] Dead Transitions using invariants and state equation in 802 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 449 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p2) p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), true, (AND (NOT p0) (NOT p1) (NOT p2)), p0, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}, { cond=(NOT p0), acceptance={} source=2 dest: 6}, { cond=p0, acceptance={} source=2 dest: 7}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 9}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 11}], [{ cond=(NOT p2), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=5 dest: 13}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 14}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=6 dest: 10}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=6 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 16}], [{ cond=(NOT p2), acceptance={} source=8 dest: 10}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=9 dest: 10}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=9 dest: 15}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=11 dest: 10}], [{ cond=(NOT p0), acceptance={} source=12 dest: 12}, { cond=p0, acceptance={0} source=12 dest: 12}, { cond=(NOT p0), acceptance={} source=12 dest: 13}, { cond=p0, acceptance={} source=12 dest: 14}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=13 dest: 10}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=13 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=14 dest: 16}], [{ cond=(AND p0 p1), acceptance={} source=15 dest: 10}, { cond=(AND (NOT p0) p1), acceptance={} source=15 dest: 15}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=16 dest: 10}]], initial=0, aps=[p0:(GEQ s8274 5), p1:(AND (GEQ s9419 5) (GEQ s4545 5)), p2:(GEQ s2028 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 23470 steps with 4704 reset in 10002 ms.
Product exploration timeout after 22070 steps with 4392 reset in 10004 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 17 states, 31 edges and 3 AP to 14 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 491 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND p1 p0 (NOT p2)), true, p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (AND p1 p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 850 ms. (steps per millisecond=11 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1454 ms. (steps per millisecond=6 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1051 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1060 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1054 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1088 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1055 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1058 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1210 ms. (steps per millisecond=8 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1121 ms. (steps per millisecond=8 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 988 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 931 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 935 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Probabilistic random walk exhausted memory after 117519 steps, saw 117468 distinct states, run finished after 27791 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:34:14] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:34:17] [INFO ] [Real]Absence check using 2000 positive place invariants in 605 ms returned sat
[2022-05-17 03:34:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:34:39] [INFO ] After 25030ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 20 are kept as prefixes of interest. Removing 9980 places using SCC suffix rule.4 ms
Discarding 9980 places :
Also discarding 15968 output transitions
Drop transitions removed 15968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 22 ms. Remains 20 /10000 variables (removed 9980) and now considering 32/16001 (removed 15969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:34:39] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 03:34:39] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/10000 places, 32/16001 transitions.
Incomplete random walk after 10256 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2051 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :2
Finished Best-First random walk after 450 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=450 )
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0))]
False Knowledge obtained : [(F (AND (NOT p1) p0 (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0)), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND p1 (NOT p0))), (F (NOT (OR p1 (NOT p0)))), (F (AND p1 p0)), (F p0), (F (AND p1 (NOT p0) (NOT p2))), (F (AND p1 p0 (NOT p2)))]
Knowledge based reduction with 2 factoid took 385 ms. Reduced automaton from 14 states, 27 edges and 3 AP to 14 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 479 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND p1 p0 (NOT p2)), true, p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (AND p1 p0), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 421 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND p1 p0 (NOT p2)), true, p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p0)), (AND p1 p0), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1140 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:34:42] [INFO ] Computed 2000 place invariants in 63 ms
[2022-05-17 03:34:43] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:34:43] [INFO ] Computed 2000 place invariants in 35 ms
[2022-05-17 03:34:44] [INFO ] Implicit Places using invariants in 1392 ms returned []
Implicit Place search using SMT only with invariants took 1405 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:34:44] [INFO ] Computed 2000 place invariants in 34 ms
[2022-05-17 03:34:45] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 14 states, 27 edges and 3 AP to 14 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 467 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), true, p0, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 p1), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 973 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1235 ms. (steps per millisecond=8 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1094 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1280 ms. (steps per millisecond=7 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1030 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1038 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1033 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1014 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1017 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1021 ms. (steps per millisecond=9 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 996 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 988 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 981 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 994 ms. (steps per millisecond=10 ) properties (out of 13) seen :0
Probabilistic random walk exhausted memory after 117447 steps, saw 117396 distinct states, run finished after 24841 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 13 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:35:27] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:35:30] [INFO ] [Real]Absence check using 2000 positive place invariants in 657 ms returned sat
[2022-05-17 03:35:52] [INFO ] After 20177ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:8
[2022-05-17 03:35:52] [INFO ] State equation strengthened by 2000 read => feed constraints.
[2022-05-17 03:35:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:35:52] [INFO ] After 25154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 20 are kept as prefixes of interest. Removing 9980 places using SCC suffix rule.4 ms
Discarding 9980 places :
Also discarding 15968 output transitions
Drop transitions removed 15968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 17 ms. Remains 20 /10000 variables (removed 9980) and now considering 32/16001 (removed 15969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:35:52] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-17 03:35:52] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/10000 places, 32/16001 transitions.
Incomplete random walk after 10131 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2532 ) properties (out of 13) seen :9
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 4) seen :2
Finished Best-First random walk after 652 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=326 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p2))), (F (AND p0 (NOT p2))), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p1))), (F (NOT (AND (NOT p0) (NOT p2)))), (F p2), (F (AND (NOT p0) p1)), (F (NOT (OR (NOT p0) p1))), (F (AND p0 p1)), (F p0), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 (NOT p2)))]
Knowledge based reduction with 1 factoid took 398 ms. Reduced automaton from 14 states, 27 edges and 3 AP to 14 states, 27 edges and 3 AP.
Stuttering acceptance computed with spot in 539 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), true, p0, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 626 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), true, p0, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 491 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), true, p0, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 p1), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 23680 steps with 4434 reset in 10002 ms.
Product exploration timeout after 22390 steps with 4184 reset in 10001 ms.
Applying partial POR strategy [false, false, false, false, true, false, true, true, true, false, true, false, true, true]
Stuttering acceptance computed with spot in 539 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND p0 p1 (NOT p2)), true, p0, (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND p0 p1), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3272 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:36:18] [INFO ] Computed 2000 place invariants in 37 ms
[2022-05-17 03:36:19] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:36:19] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:36:20] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Product exploration timeout after 12770 steps with 2411 reset in 10010 ms.
Product exploration timeout after 12730 steps with 2369 reset in 10003 ms.
Built C files in :
/tmp/ltsmin13487696686733517875
[2022-05-17 03:36:40] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13487696686733517875
Running compilation step : cd /tmp/ltsmin13487696686733517875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13487696686733517875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13487696686733517875;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1101 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:36:44] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:36:45] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:36:45] [INFO ] Computed 2000 place invariants in 28 ms
[2022-05-17 03:36:46] [INFO ] Implicit Places using invariants in 1438 ms returned []
Implicit Place search using SMT only with invariants took 1441 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:36:46] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:36:47] [INFO ] Dead Transitions using invariants and state equation in 867 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Built C files in :
/tmp/ltsmin6086079687946718748
[2022-05-17 03:36:47] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6086079687946718748
Running compilation step : cd /tmp/ltsmin6086079687946718748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6086079687946718748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6086079687946718748;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 03:36:51] [INFO ] Flatten gal took : 715 ms
[2022-05-17 03:36:52] [INFO ] Flatten gal took : 416 ms
[2022-05-17 03:36:52] [INFO ] Time to serialize gal into /tmp/LTL13891178140310138182.gal : 101 ms
[2022-05-17 03:36:52] [INFO ] Time to serialize properties into /tmp/LTL15488232103863790487.ltl : 31 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13891178140310138182.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15488232103863790487.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1389117...268
Read 1 LTL properties
Checking formula 0 : !((X(((("(p8275>=5)")U(X("((p9420>=5)&&(p4546>=5))")))U(G("(p8275<5)")))||(X(X("(p2029>=3)"))))))
Formula 0 simplified : !X((("(p8275>=5)" U X"((p9420>=5)&&(p4546>=5))") U G"(p8275<5)") | XX"(p2029>=3)")
Detected timeout of ITS tools.
[2022-05-17 03:37:07] [INFO ] Flatten gal took : 391 ms
[2022-05-17 03:37:07] [INFO ] Applying decomposition
[2022-05-17 03:37:08] [INFO ] Flatten gal took : 503 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15407249572477743666.txt' '-o' '/tmp/graph15407249572477743666.bin' '-w' '/tmp/graph15407249572477743666.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15407249572477743666.bin' '-l' '-1' '-v' '-w' '/tmp/graph15407249572477743666.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:37:09] [INFO ] Decomposing Gal with order
[2022-05-17 03:37:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:37:14] [INFO ] Flatten gal took : 606 ms
[2022-05-17 03:37:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 342 ms.
[2022-05-17 03:37:15] [INFO ] Time to serialize gal into /tmp/LTL5215376117650352614.gal : 65 ms
[2022-05-17 03:37:15] [INFO ] Time to serialize properties into /tmp/LTL6115826306849023858.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5215376117650352614.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6115826306849023858.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5215376...245
Read 1 LTL properties
Checking formula 0 : !((X(((("(u1654.p8275>=5)")U(X("((u1883.p9420>=5)&&(u909.p4546>=5))")))U(G("(u1654.p8275<5)")))||(X(X("(u405.p2029>=3)"))))))
Formula 0 simplified : !X((("(u1654.p8275>=5)" U X"((u1883.p9420>=5)&&(u909.p4546>=5))") U G"(u1654.p8275<5)") | XX"(u405.p2029>=3)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8912332221978877098
[2022-05-17 03:37:30] [INFO ] Built C files in 140ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8912332221978877098
Running compilation step : cd /tmp/ltsmin8912332221978877098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8912332221978877098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8912332221978877098;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property JoinFreeModules-PT-2000-LTLFireability-11 finished in 268098 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&F(X(G(p1))))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2619 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:37:36] [INFO ] Computed 2000 place invariants in 64 ms
[2022-05-17 03:37:37] [INFO ] Dead Transitions using invariants and state equation in 1508 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:37:37] [INFO ] Computed 2000 place invariants in 61 ms
[2022-05-17 03:37:39] [INFO ] Implicit Places using invariants in 1770 ms returned []
Implicit Place search using SMT only with invariants took 1779 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:37:39] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:37:40] [INFO ] Dead Transitions using invariants and state equation in 804 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (LT s8924 5) (LT s7892 2)), p1:(OR (LT s8924 5) (LT s7892 2))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-12 finished in 6934 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0) U G(p1)))||(G(!X(p2)) U G(p3)))))'
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1128 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:37:41] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:37:42] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:37:42] [INFO ] Computed 2000 place invariants in 102 ms
[2022-05-17 03:37:44] [INFO ] Implicit Places using invariants in 1537 ms returned []
Implicit Place search using SMT only with invariants took 1547 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:37:44] [INFO ] Computed 2000 place invariants in 32 ms
[2022-05-17 03:37:44] [INFO ] Dead Transitions using invariants and state equation in 806 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 944 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p3) p1 (NOT p0) p2), (AND (NOT p3) (NOT p1) p2), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p1 (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(AND p3 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 3}, { cond=(AND p3 p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 10}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 11}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=2 dest: 12}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=2 dest: 13}], [{ cond=(AND p3 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 14}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 15}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 16}, { cond=(AND p0 p2), acceptance={} source=3 dest: 17}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 14}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={} source=4 dest: 15}, { cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=4 dest: 16}, { cond=(AND (NOT p3) p0 p2), acceptance={} source=4 dest: 17}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 18}, { cond=(AND p3 p0 p2), acceptance={} source=4 dest: 19}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={} source=4 dest: 20}, { cond=(AND p3 p1 (NOT p0) p2), acceptance={} source=4 dest: 21}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 14}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={1} source=6 dest: 6}, { cond=(NOT p3), acceptance={0, 1} source=6 dest: 6}, { cond=p3, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=7 dest: 8}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=7 dest: 11}, { cond=(AND p3 p1 p0), acceptance={} source=7 dest: 12}], [{ cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p3 p1 p0 (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=8 dest: 14}, { cond=(AND p1 p0 p2), acceptance={} source=8 dest: 15}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(NOT p1), acceptance={} source=9 dest: 6}, { cond=p1, acceptance={} source=9 dest: 9}, { cond=(AND (NOT p3) p1), acceptance={} source=9 dest: 10}, { cond=(AND p3 (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(AND p3 p1), acceptance={} source=9 dest: 13}], [{ cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 14}, { cond=(AND p1 p2), acceptance={} source=10 dest: 16}], [{ cond=(AND (NOT p3) p2), acceptance={} source=11 dest: 14}, { cond=(AND p3 p2), acceptance={} source=11 dest: 18}], [{ cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=12 dest: 14}, { cond=(AND (NOT p3) p1 p0 p2), acceptance={} source=12 dest: 15}, { cond=(AND p3 p1 (NOT p0) p2), acceptance={} source=12 dest: 18}, { cond=(AND p3 p1 p0 p2), acceptance={} source=12 dest: 20}], [{ cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=13 dest: 14}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=13 dest: 16}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=13 dest: 18}, { cond=(AND p3 p1 p2), acceptance={} source=13 dest: 21}], [{ cond=true, acceptance={0, 1} source=14 dest: 14}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=15 dest: 14}, { cond=(AND p1 p0), acceptance={} source=15 dest: 15}], [{ cond=(NOT p1), acceptance={} source=16 dest: 14}, { cond=p1, acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=17 dest: 14}, { cond=(AND (NOT p1) p0), acceptance={} source=17 dest: 15}, { cond=(AND p1 (NOT p0)), acceptance={} source=17 dest: 16}, { cond=(AND p1 p0), acceptance={0} source=17 dest: 17}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=17 dest: 17}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=18 dest: 14}, { cond=(AND p3 (NOT p2)), acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=19 dest: 14}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=19 dest: 15}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=19 dest: 16}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=19 dest: 17}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=19 dest: 18}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=19 dest: 19}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=19 dest: 20}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=19 dest: 21}], [{ cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=20 dest: 14}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={} source=20 dest: 15}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=20 dest: 18}, { cond=(AND p3 p1 p0 (NOT p2)), acceptance={} source=20 dest: 20}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=21 dest: 14}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=21 dest: 16}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=21 dest: 18}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=21 dest: 21}]], initial=0, aps=[p3:(GEQ s9357 1), p1:(GEQ s5502 2), p0:(GEQ s6959 5), p2:(GEQ s9174 5)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 23260 steps with 5838 reset in 10005 ms.
Product exploration timeout after 21640 steps with 5401 reset in 10005 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p1 (NOT p0) (NOT p2)), (X p3)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 176 ms. Reduced automaton from 22 states, 99 edges and 4 AP to 22 states, 98 edges and 4 AP.
Stuttering acceptance computed with spot in 688 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3) p1 p2), (AND (NOT p3) (NOT p1) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Incomplete random walk after 10011 steps, including 2 resets, run finished after 882 ms. (steps per millisecond=11 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 183 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 168 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 97 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 169 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 125 ms. (steps per millisecond=8 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 103 ms. (steps per millisecond=9 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Probabilistic random walk after 64054 steps, saw 64030 distinct states, run finished after 15050 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 60 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:38:28] [INFO ] Computed 2000 place invariants in 26 ms
[2022-05-17 03:38:37] [INFO ] [Real]Absence check using 2000 positive place invariants in 668 ms returned sat
[2022-05-17 03:38:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:38:54] [INFO ] After 25021ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 60 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 20 are kept as prefixes of interest. Removing 9980 places using SCC suffix rule.5 ms
Discarding 9980 places :
Also discarding 15968 output transitions
Drop transitions removed 15968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 27 ms. Remains 20 /10000 variables (removed 9980) and now considering 32/16001 (removed 15969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:38:54] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 03:38:54] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/10000 places, 32/16001 transitions.
Incomplete random walk after 10661 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2132 ) properties (out of 60) seen :27
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:38:54] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 03:38:54] [INFO ] [Real]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 03:38:54] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-05-17 03:38:54] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2022-05-17 03:38:54] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-05-17 03:38:54] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 03:38:54] [INFO ] After 107ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :23
[2022-05-17 03:38:54] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2022-05-17 03:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2022-05-17 03:38:54] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2022-05-17 03:38:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-17 03:38:54] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :23
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-05-17 03:38:54] [INFO ] After 515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :23
Fused 23 Parikh solutions to 22 different solutions.
Finished Parikh walk after 5937 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=989 )
Parikh walk visited 23 properties in 2797 ms.
Knowledge obtained : [(AND p3 p1 (NOT p0) (NOT p2)), (X p3)]
False Knowledge obtained : [(F (AND p0 p3 p2)), (F (AND (NOT p0) p3 (NOT p1) p2)), (F (AND p0 (NOT p3) p2)), (F (AND (NOT p0) (NOT p3) p1 p2)), (F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p0) p3 p1 p2)), (F (AND p0 p3 (NOT p1) p2)), (F (AND p0 (NOT p3) (NOT p1) p2)), (F (AND (NOT p0) (NOT p3) (NOT p1) p2)), (F (AND p0 p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p3) p1)), (F (NOT p1)), (F (AND (NOT p3) (NOT p1))), (F (AND p0 p1 p2)), (F (NOT (AND p3 p1))), (F (AND p3 (NOT p1))), (F (AND p0 p3 p1 (NOT p2))), (F (AND p0 p1)), (F (NOT p3)), (F p2), (F (AND p0 (NOT p3))), (F (AND (NOT p3) (NOT p1) p2)), (F (AND p0 (NOT p3) (NOT p1))), (F (AND p0 p3 p1 p2)), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (AND p0 (NOT p3) p1 p2)), (F (AND p0 p3)), (F (AND p3 p2)), (F (AND p0 p3 p1)), (F (AND p0 p3 (NOT p1))), (F (AND p0 (NOT p3) p1)), (F (AND (NOT p3) p1 p2)), (F (AND p3 (NOT p1) (NOT p2))), (F (AND (NOT p3) p2)), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT (AND p3 p1 (NOT p2)))), (F (AND (NOT p3) p1 (NOT p2))), (F (AND p0 p3 (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p0) p3 (NOT p1) (NOT p2))), (F (AND p0 (NOT p3) p1 (NOT p2))), (F (AND p0 p3 (NOT p2))), (F (AND p0 (NOT p3) (NOT p2))), (F (NOT (AND (NOT p0) p3 p1))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (F (AND p3 p1 p2)), (F (AND p3 (NOT p1) p2)), (F (AND (NOT p0) (NOT p3) p1 (NOT p2))), (F (AND (NOT p0) p3 (NOT p1))), (F (AND p0 (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p3) p1)), (F (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 2 factoid took 1645 ms. Reduced automaton from 22 states, 98 edges and 4 AP to 22 states, 98 edges and 4 AP.
Stuttering acceptance computed with spot in 766 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3) p1 p2), (AND (NOT p3) (NOT p1) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 923 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3) p1 p2), (AND (NOT p3) (NOT p1) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1158 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:39:02] [INFO ] Computed 2000 place invariants in 29 ms
[2022-05-17 03:39:03] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:39:03] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:39:04] [INFO ] Implicit Places using invariants in 1307 ms returned []
Implicit Place search using SMT only with invariants took 1315 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:39:04] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 03:39:05] [INFO ] Dead Transitions using invariants and state equation in 787 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 22 states, 98 edges and 4 AP to 22 states, 98 edges and 4 AP.
Stuttering acceptance computed with spot in 787 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 890 ms. (steps per millisecond=11 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 185 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 160 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 100 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 97 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 104 ms. (steps per millisecond=9 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 97 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 98 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 99 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 97 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 97 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 111 ms. (steps per millisecond=9 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 96 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 97 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Probabilistic random walk after 82075 steps, saw 82043 distinct states, run finished after 15088 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 60 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:39:28] [INFO ] Computed 2000 place invariants in 33 ms
[2022-05-17 03:39:37] [INFO ] [Real]Absence check using 2000 positive place invariants in 607 ms returned sat
[2022-05-17 03:39:53] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:39:53] [INFO ] After 25026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 60 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 20 are kept as prefixes of interest. Removing 9980 places using SCC suffix rule.3 ms
Discarding 9980 places :
Also discarding 15968 output transitions
Drop transitions removed 15968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 17 ms. Remains 20 /10000 variables (removed 9980) and now considering 32/16001 (removed 15969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:39:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 03:39:53] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/10000 places, 32/16001 transitions.
Incomplete random walk after 10212 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2553 ) properties (out of 60) seen :31
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:39:53] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 03:39:53] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 03:39:53] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2022-05-17 03:39:53] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 03:39:53] [INFO ] After 122ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2022-05-17 03:39:53] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 03:39:53] [INFO ] After 123ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :29
[2022-05-17 03:39:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2022-05-17 03:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-17 03:39:53] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2022-05-17 03:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 20 ms
[2022-05-17 03:39:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2022-05-17 03:39:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2022-05-17 03:39:54] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:39:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2022-05-17 03:39:54] [INFO ] After 379ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 103 ms.
[2022-05-17 03:39:54] [INFO ] After 659ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Finished Parikh walk after 5096 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=849 )
Parikh walk visited 29 properties in 2933 ms.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2))]
False Knowledge obtained : [(F (AND p0 p2 p3)), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (AND p0 p2 (NOT p3))), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p0) p1 p2 p3)), (F (AND p0 (NOT p1) p2 p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND p0 p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p1 (NOT p3))), (F (NOT p1)), (F (AND (NOT p1) (NOT p3))), (F (AND p0 p1 p2)), (F (NOT (AND p1 p3))), (F (AND (NOT p1) p3)), (F (AND p0 p1 (NOT p2) p3)), (F (AND p0 p1)), (F (NOT p3)), (F p2), (F (AND p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3))), (F (AND p0 p1 p2 p3)), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 p1 p2 (NOT p3))), (F (AND p2 p3)), (F (AND p0 p3)), (F (AND p0 p1 p3)), (F (AND p0 (NOT p1) p3)), (F (AND p0 p1 (NOT p3))), (F (AND p1 p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) p3)), (F (AND p2 (NOT p3))), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT (AND p1 (NOT p2) p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND p0 p1 (NOT p2) (NOT p3))), (F (AND p0 (NOT p2) p3)), (F (NOT (AND (NOT p0) p1 p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 (NOT p2) p3))), (F (AND p1 p2 p3)), (F (AND (NOT p1) p2 p3)), (F (AND (NOT p0) (NOT p1) p3)), (F (AND (NOT p0) p1 (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 1 factoid took 1787 ms. Reduced automaton from 22 states, 98 edges and 4 AP to 22 states, 98 edges and 4 AP.
Stuttering acceptance computed with spot in 941 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 874 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 882 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Product exploration timeout after 24510 steps with 6154 reset in 10004 ms.
Product exploration timeout after 23310 steps with 5828 reset in 10001 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 868 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3045 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:40:25] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:40:26] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:40:26] [INFO ] Computed 2000 place invariants in 33 ms
[2022-05-17 03:40:27] [INFO ] Dead Transitions using invariants and state equation in 977 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Product exploration timeout after 11590 steps with 2890 reset in 10006 ms.
Product exploration timeout after 11170 steps with 2778 reset in 10010 ms.
Built C files in :
/tmp/ltsmin18272482243594339356
[2022-05-17 03:40:47] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18272482243594339356
Running compilation step : cd /tmp/ltsmin18272482243594339356;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18272482243594339356;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18272482243594339356;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1017 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:40:51] [INFO ] Computed 2000 place invariants in 34 ms
[2022-05-17 03:40:52] [INFO ] Dead Transitions using invariants and state equation in 982 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:40:52] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:40:54] [INFO ] Implicit Places using invariants in 1575 ms returned []
Implicit Place search using SMT only with invariants took 1576 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:40:54] [INFO ] Computed 2000 place invariants in 34 ms
[2022-05-17 03:40:55] [INFO ] Dead Transitions using invariants and state equation in 988 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Built C files in :
/tmp/ltsmin15034803566362467896
[2022-05-17 03:40:55] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15034803566362467896
Running compilation step : cd /tmp/ltsmin15034803566362467896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15034803566362467896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15034803566362467896;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 03:40:59] [INFO ] Flatten gal took : 354 ms
[2022-05-17 03:40:59] [INFO ] Flatten gal took : 372 ms
[2022-05-17 03:40:59] [INFO ] Time to serialize gal into /tmp/LTL199731373199203445.gal : 34 ms
[2022-05-17 03:40:59] [INFO ] Time to serialize properties into /tmp/LTL14930335961302837936.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL199731373199203445.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14930335961302837936.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1997313...266
Read 1 LTL properties
Checking formula 0 : !((X((X((G("(p6960>=5)"))U(G("(p5503>=2)"))))||((G(!(X("(p9175>=5)"))))U(G("(p9358>=1)"))))))
Formula 0 simplified : !X(X(G"(p6960>=5)" U G"(p5503>=2)") | (G!X"(p9175>=5)" U G"(p9358>=1)"))
Detected timeout of ITS tools.
[2022-05-17 03:41:14] [INFO ] Flatten gal took : 317 ms
[2022-05-17 03:41:14] [INFO ] Applying decomposition
[2022-05-17 03:41:15] [INFO ] Flatten gal took : 329 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1348572265350432845.txt' '-o' '/tmp/graph1348572265350432845.bin' '-w' '/tmp/graph1348572265350432845.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1348572265350432845.bin' '-l' '-1' '-v' '-w' '/tmp/graph1348572265350432845.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:41:16] [INFO ] Decomposing Gal with order
[2022-05-17 03:41:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:41:21] [INFO ] Flatten gal took : 434 ms
[2022-05-17 03:41:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 320 ms.
[2022-05-17 03:41:22] [INFO ] Time to serialize gal into /tmp/LTL9540598583547010169.gal : 30 ms
[2022-05-17 03:41:22] [INFO ] Time to serialize properties into /tmp/LTL14145090634719168656.ltl : 21 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9540598583547010169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14145090634719168656.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9540598...246
Read 1 LTL properties
Checking formula 0 : !((X((X((G("(u1391.p6960>=5)"))U(G("(u1100.p5503>=2)"))))||((G(!(X("(u1834.p9175>=5)"))))U(G("(u1871.p9358>=1)"))))))
Formula 0 simplified : !X(X(G"(u1391.p6960>=5)" U G"(u1100.p5503>=2)") | (G!X"(u1834.p9175>=5)" U G"(u1871.p9358>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7209528514390553714
[2022-05-17 03:41:37] [INFO ] Built C files in 112ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7209528514390553714
Running compilation step : cd /tmp/ltsmin7209528514390553714;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7209528514390553714;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7209528514390553714;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property JoinFreeModules-PT-2000-LTLFireability-14 finished in 239698 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 6623 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:41:47] [INFO ] Computed 2000 place invariants in 57 ms
[2022-05-17 03:41:49] [INFO ] Dead Transitions using invariants and state equation in 2584 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:41:49] [INFO ] Computed 2000 place invariants in 56 ms
[2022-05-17 03:41:52] [INFO ] Implicit Places using invariants in 2746 ms returned []
Implicit Place search using SMT only with invariants took 2751 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:41:52] [INFO ] Computed 2000 place invariants in 63 ms
[2022-05-17 03:41:53] [INFO ] Dead Transitions using invariants and state equation in 1496 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2388 4) (GEQ s3757 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-15 finished in 13663 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p0)&&p1))||X(F(X(p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((((p0 U X(p1)) U G(!p0))||X(X(p2)))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((G(p0) U G(p1)))||(G(!X(p2)) U G(p3)))))'
Found a SL insensitive property : JoinFreeModules-PT-2000-LTLFireability-14
Stuttering acceptance computed with spot in 1081 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p3) p1 (NOT p0) p2), (AND (NOT p3) (NOT p1) p2), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND p1 (NOT p0) (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 6841 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:42:02] [INFO ] Computed 2000 place invariants in 62 ms
[2022-05-17 03:42:03] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:42:03] [INFO ] Computed 2000 place invariants in 34 ms
[2022-05-17 03:42:06] [INFO ] Implicit Places using invariants in 2652 ms returned []
Implicit Place search using SMT only with invariants took 2685 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:42:06] [INFO ] Computed 2000 place invariants in 45 ms
[2022-05-17 03:42:07] [INFO ] Dead Transitions using invariants and state equation in 1608 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p3), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}], [{ cond=(AND p3 p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) p1 p0), acceptance={0} source=2 dest: 2}, { cond=(AND p3 (NOT p1) p0), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p3) p0), acceptance={} source=2 dest: 3}, { cond=(AND p3 p0), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 7}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 8}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 9}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=2 dest: 10}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=2 dest: 11}, { cond=(AND p3 (NOT p1) p0), acceptance={} source=2 dest: 12}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=2 dest: 13}], [{ cond=(AND p3 p0 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 14}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=3 dest: 15}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=3 dest: 16}, { cond=(AND p0 p2), acceptance={} source=3 dest: 17}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 14}, { cond=(AND (NOT p3) (NOT p1) p0 p2), acceptance={} source=4 dest: 15}, { cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=4 dest: 16}, { cond=(AND (NOT p3) p0 p2), acceptance={} source=4 dest: 17}, { cond=(AND p3 (NOT p1) (NOT p0) p2), acceptance={} source=4 dest: 18}, { cond=(AND p3 p0 p2), acceptance={} source=4 dest: 19}, { cond=(AND p3 (NOT p1) p0 p2), acceptance={} source=4 dest: 20}, { cond=(AND p3 p1 (NOT p0) p2), acceptance={} source=4 dest: 21}], [{ cond=(AND p3 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=p2, acceptance={} source=5 dest: 14}], [{ cond=(NOT p3), acceptance={} source=6 dest: 5}, { cond=p3, acceptance={1} source=6 dest: 6}, { cond=(NOT p3), acceptance={0, 1} source=6 dest: 6}, { cond=p3, acceptance={} source=6 dest: 11}], [{ cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=7 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=7 dest: 6}, { cond=(AND p1 p0), acceptance={} source=7 dest: 7}, { cond=(AND (NOT p3) p1 p0), acceptance={} source=7 dest: 8}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=7 dest: 11}, { cond=(AND p3 p1 p0), acceptance={} source=7 dest: 12}], [{ cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p3 p1 p0 (NOT p2)), acceptance={} source=8 dest: 8}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=8 dest: 14}, { cond=(AND p1 p0 p2), acceptance={} source=8 dest: 15}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=9 dest: 5}, { cond=(NOT p1), acceptance={} source=9 dest: 6}, { cond=p1, acceptance={} source=9 dest: 9}, { cond=(AND (NOT p3) p1), acceptance={} source=9 dest: 10}, { cond=(AND p3 (NOT p1)), acceptance={} source=9 dest: 11}, { cond=(AND p3 p1), acceptance={} source=9 dest: 13}], [{ cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=10 dest: 5}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) p2), acceptance={} source=10 dest: 14}, { cond=(AND p1 p2), acceptance={} source=10 dest: 16}], [{ cond=(AND (NOT p3) p2), acceptance={} source=11 dest: 14}, { cond=(AND p3 p2), acceptance={} source=11 dest: 18}], [{ cond=(AND (NOT p3) p1 (NOT p0) p2), acceptance={} source=12 dest: 14}, { cond=(AND (NOT p3) p1 p0 p2), acceptance={} source=12 dest: 15}, { cond=(AND p3 p1 (NOT p0) p2), acceptance={} source=12 dest: 18}, { cond=(AND p3 p1 p0 p2), acceptance={} source=12 dest: 20}], [{ cond=(AND (NOT p3) (NOT p1) p2), acceptance={} source=13 dest: 14}, { cond=(AND (NOT p3) p1 p2), acceptance={} source=13 dest: 16}, { cond=(AND p3 (NOT p1) p2), acceptance={} source=13 dest: 18}, { cond=(AND p3 p1 p2), acceptance={} source=13 dest: 21}], [{ cond=true, acceptance={0, 1} source=14 dest: 14}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=15 dest: 14}, { cond=(AND p1 p0), acceptance={} source=15 dest: 15}], [{ cond=(NOT p1), acceptance={} source=16 dest: 14}, { cond=p1, acceptance={} source=16 dest: 16}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=17 dest: 14}, { cond=(AND (NOT p1) p0), acceptance={} source=17 dest: 15}, { cond=(AND p1 (NOT p0)), acceptance={} source=17 dest: 16}, { cond=(AND p1 p0), acceptance={0} source=17 dest: 17}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=17 dest: 17}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=18 dest: 14}, { cond=(AND p3 (NOT p2)), acceptance={} source=18 dest: 18}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=19 dest: 14}, { cond=(AND (NOT p3) (NOT p1) p0 (NOT p2)), acceptance={} source=19 dest: 15}, { cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=19 dest: 16}, { cond=(AND (NOT p3) p0 (NOT p2)), acceptance={} source=19 dest: 17}, { cond=(AND p3 (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=19 dest: 18}, { cond=(AND p3 p0 (NOT p2)), acceptance={} source=19 dest: 19}, { cond=(AND p3 (NOT p1) p0 (NOT p2)), acceptance={} source=19 dest: 20}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=19 dest: 21}], [{ cond=(AND (NOT p3) p1 (NOT p0) (NOT p2)), acceptance={} source=20 dest: 14}, { cond=(AND (NOT p3) p1 p0 (NOT p2)), acceptance={} source=20 dest: 15}, { cond=(AND p3 p1 (NOT p0) (NOT p2)), acceptance={} source=20 dest: 18}, { cond=(AND p3 p1 p0 (NOT p2)), acceptance={} source=20 dest: 20}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p2)), acceptance={} source=21 dest: 14}, { cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=21 dest: 16}, { cond=(AND p3 (NOT p1) (NOT p2)), acceptance={} source=21 dest: 18}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=21 dest: 21}]], initial=0, aps=[p3:(GEQ s9357 1), p1:(GEQ s5502 2), p0:(GEQ s6959 5), p2:(GEQ s9174 5)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 11760 steps with 2968 reset in 10018 ms.
Product exploration timeout after 11170 steps with 2798 reset in 10011 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p3 p1 (NOT p0) (NOT p2)), (X p3)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 334 ms. Reduced automaton from 22 states, 99 edges and 4 AP to 22 states, 98 edges and 4 AP.
Stuttering acceptance computed with spot in 1292 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3) p1 p2), (AND (NOT p3) (NOT p1) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Incomplete random walk after 11008 steps, including 2 resets, run finished after 1454 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 175 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 190 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 191 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 174 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 185 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 193 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 382 ms. (steps per millisecond=2 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 189 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 194 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 190 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 179 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 202 ms. (steps per millisecond=4 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 174 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 186 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 174 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 171 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 171 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 189 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 176 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 175 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 171 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 191 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 262 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 191 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 193 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 186 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 193 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 192 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 192 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 176 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 183 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 171 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 171 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 188 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 176 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 175 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 192 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 171 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 276 ms. (steps per millisecond=3 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 174 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 190 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 192 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 194 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 195 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 193 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 174 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 191 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 172 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 175 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 189 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Probabilistic random walk after 89083 steps, saw 89047 distinct states, run finished after 33328 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 60 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:43:16] [INFO ] Computed 2000 place invariants in 62 ms
[2022-05-17 03:43:29] [INFO ] [Real]Absence check using 2000 positive place invariants in 564 ms returned sat
[2022-05-17 03:43:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:43:41] [INFO ] After 25071ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 60 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 20 are kept as prefixes of interest. Removing 9980 places using SCC suffix rule.4 ms
Discarding 9980 places :
Also discarding 15968 output transitions
Drop transitions removed 15968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 29 ms. Remains 20 /10000 variables (removed 9980) and now considering 32/16001 (removed 15969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:43:41] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 03:43:42] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/10000 places, 32/16001 transitions.
Incomplete random walk after 10050 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1435 ) properties (out of 60) seen :29
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:43:42] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 03:43:42] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 03:43:42] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2022-05-17 03:43:44] [INFO ] [Nat]Absence check using 4 positive place invariants in 32 ms returned sat
[2022-05-17 03:43:45] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2022-05-17 03:43:45] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 03:43:45] [INFO ] After 152ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :29
[2022-05-17 03:43:45] [INFO ] Deduced a trap composed of 3 places in 135 ms of which 16 ms to minimize.
[2022-05-17 03:43:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 154 ms
[2022-05-17 03:43:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2022-05-17 03:43:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-17 03:43:45] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2022-05-17 03:43:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2022-05-17 03:43:45] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2022-05-17 03:43:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-17 03:43:46] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2022-05-17 03:43:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 85 ms
[2022-05-17 03:43:46] [INFO ] After 778ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 212 ms.
[2022-05-17 03:43:46] [INFO ] After 4070ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Fused 29 Parikh solutions to 27 different solutions.
Finished Parikh walk after 3972 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=794 )
Parikh walk visited 29 properties in 2760 ms.
Knowledge obtained : [(AND p3 p1 (NOT p0) (NOT p2)), (X p3)]
False Knowledge obtained : [(F (AND p0 p3 p2)), (F (AND (NOT p0) p3 (NOT p1) p2)), (F (AND p0 (NOT p3) p2)), (F (AND (NOT p0) (NOT p3) p1 p2)), (F (NOT (AND p3 (NOT p2)))), (F (AND (NOT p0) p3 p1 p2)), (F (AND p0 p3 (NOT p1) p2)), (F (AND p0 (NOT p3) (NOT p1) p2)), (F (AND (NOT p0) (NOT p3) (NOT p1) p2)), (F (AND p0 p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND (NOT p3) p1)), (F (NOT p1)), (F (AND (NOT p3) (NOT p1))), (F (AND p0 p1 p2)), (F (NOT (AND p3 p1))), (F (AND p3 (NOT p1))), (F (AND p0 p3 p1 (NOT p2))), (F (AND p0 p1)), (F (NOT p3)), (F p2), (F (AND p0 (NOT p3))), (F (AND (NOT p3) (NOT p1) p2)), (F (AND p0 p3 p1 p2)), (F (AND p0 (NOT p3) (NOT p1))), (F (AND (NOT p0) (NOT p3) (NOT p1))), (F (AND p0 (NOT p3) p1 p2)), (F (AND p3 p2)), (F (AND p0 p3)), (F (AND p0 p3 p1)), (F (AND p0 p3 (NOT p1))), (F (AND p0 (NOT p3) p1)), (F (AND (NOT p3) p1 p2)), (F (AND p3 (NOT p1) (NOT p2))), (F (AND (NOT p3) p2)), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT (AND p3 p1 (NOT p2)))), (F (AND (NOT p3) p1 (NOT p2))), (F (AND p0 p3 (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p0) p3 (NOT p1) (NOT p2))), (F (AND p0 p3 (NOT p2))), (F (AND p0 (NOT p3) p1 (NOT p2))), (F (AND p0 (NOT p3) (NOT p2))), (F (NOT (AND (NOT p0) p3 p1))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p3 p1 (NOT p2)))), (F (AND p3 p1 p2)), (F (AND p3 (NOT p1) p2)), (F (AND (NOT p0) (NOT p3) p1 (NOT p2))), (F (AND (NOT p0) p3 (NOT p1))), (F (AND (NOT p0) (NOT p3) p1)), (F (AND p0 (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p3) (NOT p1) (NOT p2))), (F (AND (NOT p3) (NOT p2)))]
Knowledge based reduction with 2 factoid took 2872 ms. Reduced automaton from 22 states, 98 edges and 4 AP to 22 states, 98 edges and 4 AP.
Stuttering acceptance computed with spot in 1312 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3) p1 p2), (AND (NOT p3) (NOT p1) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 1319 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) (NOT p3) p1 p2), (AND (NOT p3) (NOT p1) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1290 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:43:55] [INFO ] Computed 2000 place invariants in 36 ms
[2022-05-17 03:43:56] [INFO ] Dead Transitions using invariants and state equation in 886 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:43:56] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:43:58] [INFO ] Implicit Places using invariants in 1401 ms returned []
Implicit Place search using SMT only with invariants took 1406 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:43:58] [INFO ] Computed 2000 place invariants in 29 ms
[2022-05-17 03:43:59] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 22 states, 98 edges and 4 AP to 22 states, 98 edges and 4 AP.
Stuttering acceptance computed with spot in 778 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Incomplete random walk after 11008 steps, including 2 resets, run finished after 944 ms. (steps per millisecond=11 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 192 ms. (steps per millisecond=5 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 129 ms. (steps per millisecond=7 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 146 ms. (steps per millisecond=6 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 112 ms. (steps per millisecond=8 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 93 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 94 ms. (steps per millisecond=10 ) properties (out of 60) seen :0
Probabilistic random walk after 89083 steps, saw 89047 distinct states, run finished after 15047 ms. (steps per millisecond=5 ) properties seen :0
Running SMT prover for 60 properties.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:44:22] [INFO ] Computed 2000 place invariants in 27 ms
[2022-05-17 03:44:31] [INFO ] [Real]Absence check using 2000 positive place invariants in 649 ms returned sat
[2022-05-17 03:44:47] [INFO ] After 14699ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:56
[2022-05-17 03:44:47] [INFO ] State equation strengthened by 2000 read => feed constraints.
[2022-05-17 03:44:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-17 03:44:47] [INFO ] After 25050ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 60 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 20 are kept as prefixes of interest. Removing 9980 places using SCC suffix rule.3 ms
Discarding 9980 places :
Also discarding 15968 output transitions
Drop transitions removed 15968 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 20 transition count 32
Applied a total of 2 rules in 14 ms. Remains 20 /10000 variables (removed 9980) and now considering 32/16001 (removed 15969) transitions.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:44:47] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-17 03:44:47] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/10000 places, 32/16001 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2001 ) properties (out of 60) seen :18
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 42) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) 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 29) 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 29) 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 29) 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 29) 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 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 27) seen :0
Running SMT prover for 27 properties.
// Phase 1: matrix 32 rows 20 cols
[2022-05-17 03:44:47] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 03:44:47] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 03:44:47] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:27
[2022-05-17 03:44:47] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2022-05-17 03:44:47] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :27
[2022-05-17 03:44:47] [INFO ] State equation strengthened by 4 read => feed constraints.
[2022-05-17 03:44:47] [INFO ] After 95ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :27
[2022-05-17 03:44:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2022-05-17 03:44:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 36 ms
[2022-05-17 03:44:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2022-05-17 03:44:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2022-05-17 03:44:48] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :27
Attempting to minimize the solution found.
Minimization took 137 ms.
[2022-05-17 03:44:48] [INFO ] After 594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :27
Fused 27 Parikh solutions to 26 different solutions.
Finished Parikh walk after 3979 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=795 )
Parikh walk visited 27 properties in 2744 ms.
Knowledge obtained : [(AND (NOT p0) p3 p1 (NOT p2))]
False Knowledge obtained : [(F (AND p0 p2 p3)), (F (AND (NOT p0) (NOT p1) p2 p3)), (F (AND p0 p2 (NOT p3))), (F (AND (NOT p0) p1 p2 (NOT p3))), (F (NOT (AND (NOT p2) p3))), (F (AND (NOT p0) p1 p2 p3)), (F (AND p0 (NOT p1) p2 p3)), (F (AND p0 (NOT p1) p2 (NOT p3))), (F (AND (NOT p0) (NOT p1) p2 (NOT p3))), (F (AND p0 p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1))), (F (AND p1 (NOT p3))), (F (NOT p1)), (F (AND (NOT p1) (NOT p3))), (F (AND p0 p1 p2)), (F (NOT (AND p1 p3))), (F (AND (NOT p1) p3)), (F (AND p0 p1 (NOT p2) p3)), (F (AND p0 p1)), (F (NOT p3)), (F p2), (F (AND p0 (NOT p3))), (F (AND (NOT p1) p2 (NOT p3))), (F (AND p0 p1 p2 p3)), (F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND p0 p1 p2 (NOT p3))), (F (AND p2 p3)), (F (AND p0 p3)), (F (AND p0 p1 p3)), (F (AND p0 (NOT p1) p3)), (F (AND p0 p1 (NOT p3))), (F (AND p1 p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) p3)), (F (AND p2 (NOT p3))), (F (AND p1 p2)), (F (AND (NOT p1) p2)), (F (NOT (AND p1 (NOT p2) p3))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) p3)), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) p3)), (F (AND p0 (NOT p2) p3)), (F (AND p0 p1 (NOT p2) (NOT p3))), (F (NOT (AND (NOT p0) p1 p3))), (F (AND p0 (NOT p2) (NOT p3))), (F (AND (NOT p0) p1 p2)), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 (NOT p2) p3))), (F (AND p1 p2 p3)), (F (AND (NOT p1) p2 p3)), (F (AND (NOT p0) p1 (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) p3)), (F (AND (NOT p0) p1 (NOT p3))), (F (AND p0 (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p2) (NOT p3)))]
Knowledge based reduction with 1 factoid took 1679 ms. Reduced automaton from 22 states, 98 edges and 4 AP to 22 states, 98 edges and 4 AP.
Stuttering acceptance computed with spot in 776 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 805 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Stuttering acceptance computed with spot in 956 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Product exploration timeout after 24330 steps with 6024 reset in 10012 ms.
Product exploration timeout after 23090 steps with 5764 reset in 10007 ms.
Applying partial POR strategy [false, false, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 777 ms :[(AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p1) p2 (NOT p3)), p2, (NOT p3), (AND (NOT p0) p1 (NOT p3)), (AND (NOT p0) p1 p2), (AND (NOT p1) (NOT p3)), (AND (NOT p1) p2), (AND (NOT p3) p2), (AND (NOT p0) p1 (NOT p3) p2), (AND (NOT p1) (NOT p3) p2), true, (AND (NOT p0) p1), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p0) p1 (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2))]
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2969 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:45:19] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:45:19] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:45:19] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:45:20] [INFO ] Dead Transitions using invariants and state equation in 873 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Product exploration timeout after 11860 steps with 2947 reset in 10009 ms.
Product exploration timeout after 11400 steps with 2867 reset in 10001 ms.
Built C files in :
/tmp/ltsmin12244664678338628002
[2022-05-17 03:45:40] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12244664678338628002
Running compilation step : cd /tmp/ltsmin12244664678338628002;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12244664678338628002;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12244664678338628002;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1039 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:45:44] [INFO ] Computed 2000 place invariants in 31 ms
[2022-05-17 03:45:45] [INFO ] Dead Transitions using invariants and state equation in 883 ms found 0 transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:45:45] [INFO ] Computed 2000 place invariants in 24 ms
[2022-05-17 03:45:47] [INFO ] Implicit Places using invariants in 1783 ms returned []
Implicit Place search using SMT only with invariants took 1784 ms to find 0 implicit places.
// Phase 1: matrix 16001 rows 10000 cols
[2022-05-17 03:45:47] [INFO ] Computed 2000 place invariants in 30 ms
[2022-05-17 03:45:48] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 10000/10000 places, 16001/16001 transitions.
Built C files in :
/tmp/ltsmin13864505336845324092
[2022-05-17 03:45:48] [INFO ] Built C files in 67ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13864505336845324092
Running compilation step : cd /tmp/ltsmin13864505336845324092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13864505336845324092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13864505336845324092;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 03:45:52] [INFO ] Flatten gal took : 318 ms
[2022-05-17 03:45:52] [INFO ] Flatten gal took : 327 ms
[2022-05-17 03:45:52] [INFO ] Time to serialize gal into /tmp/LTL1048278224261695795.gal : 57 ms
[2022-05-17 03:45:52] [INFO ] Time to serialize properties into /tmp/LTL3258568161807458054.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1048278224261695795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3258568161807458054.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1048278...266
Read 1 LTL properties
Checking formula 0 : !((X((X((G("(p6960>=5)"))U(G("(p5503>=2)"))))||((G(!(X("(p9175>=5)"))))U(G("(p9358>=1)"))))))
Formula 0 simplified : !X(X(G"(p6960>=5)" U G"(p5503>=2)") | (G!X"(p9175>=5)" U G"(p9358>=1)"))
Detected timeout of ITS tools.
[2022-05-17 03:46:07] [INFO ] Flatten gal took : 310 ms
[2022-05-17 03:46:07] [INFO ] Applying decomposition
[2022-05-17 03:46:08] [INFO ] Flatten gal took : 363 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1563578195358160304.txt' '-o' '/tmp/graph1563578195358160304.bin' '-w' '/tmp/graph1563578195358160304.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1563578195358160304.bin' '-l' '-1' '-v' '-w' '/tmp/graph1563578195358160304.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:46:09] [INFO ] Decomposing Gal with order
[2022-05-17 03:46:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:46:13] [INFO ] Flatten gal took : 324 ms
[2022-05-17 03:46:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 229 ms.
[2022-05-17 03:46:13] [INFO ] Time to serialize gal into /tmp/LTL8623166102763086894.gal : 37 ms
[2022-05-17 03:46:13] [INFO ] Time to serialize properties into /tmp/LTL11999631868471920844.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8623166102763086894.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11999631868471920844.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL8623166...246
Read 1 LTL properties
Checking formula 0 : !((X((X((G("(u1391.p6960>=5)"))U(G("(u1100.p5503>=2)"))))||((G(!(X("(u1834.p9175>=5)"))))U(G("(u1871.p9358>=1)"))))))
Formula 0 simplified : !X(X(G"(u1391.p6960>=5)" U G"(u1100.p5503>=2)") | (G!X"(u1834.p9175>=5)" U G"(u1871.p9358>=1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8866191504270823159
[2022-05-17 03:46:28] [INFO ] Built C files in 153ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8866191504270823159
Running compilation step : cd /tmp/ltsmin8866191504270823159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8866191504270823159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8866191504270823159;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property JoinFreeModules-PT-2000-LTLFireability-14 finished in 277674 ms.
[2022-05-17 03:46:32] [INFO ] Flatten gal took : 747 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12967212651311074789
[2022-05-17 03:46:33] [INFO ] Too many transitions (16001) to apply POR reductions. Disabling POR matrices.
[2022-05-17 03:46:33] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12967212651311074789
Running compilation step : cd /tmp/ltsmin12967212651311074789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '240' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 03:46:33] [INFO ] Applying decomposition
[2022-05-17 03:46:34] [INFO ] Flatten gal took : 604 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17029603794414960201.txt' '-o' '/tmp/graph17029603794414960201.bin' '-w' '/tmp/graph17029603794414960201.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17029603794414960201.bin' '-l' '-1' '-v' '-w' '/tmp/graph17029603794414960201.weights' '-q' '0' '-e' '0.001'
[2022-05-17 03:46:36] [INFO ] Decomposing Gal with order
[2022-05-17 03:46:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 03:46:42] [INFO ] Flatten gal took : 612 ms
[2022-05-17 03:46:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 335 ms.
[2022-05-17 03:46:42] [INFO ] Time to serialize gal into /tmp/LTLFireability12956980321552380548.gal : 30 ms
[2022-05-17 03:46:42] [INFO ] Time to serialize properties into /tmp/LTLFireability16789766666317996089.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12956980321552380548.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16789766666317996089.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 3 LTL properties
Checking formula 0 : !(((X((G("(u1040.p5204>=4)"))&&("(u214.p1071>=5)")))||(X(F(X("(u1153.p5766<3)"))))))
Formula 0 simplified : !(X("(u214.p1071>=5)" & G"(u1040.p5204>=4)") | XFX"(u1153.p5766<3)")
Compilation finished in 200929 ms.
Running link step : cd /tmp/ltsmin12967212651311074789;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 126 ms.
Running LTSmin : cd /tmp/ltsmin12967212651311074789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(([]((LTLAPp0==true))&&(LTLAPp1==true)))||X(<>(X((LTLAPp2==true)))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>1200 s) on command cd /tmp/ltsmin12967212651311074789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X(([]((LTLAPp0==true))&&(LTLAPp1==true)))||X(<>(X((LTLAPp2==true)))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin12967212651311074789;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(((((LTLAPp3==true) U X((LTLAPp4==true))) U [](!(LTLAPp3==true)))||X(X((LTLAPp5==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 04:13:54] [INFO ] Flatten gal took : 1148 ms
[2022-05-17 04:13:54] [INFO ] Time to serialize gal into /tmp/LTLFireability5551126602743605177.gal : 78 ms
[2022-05-17 04:13:54] [INFO ] Time to serialize properties into /tmp/LTLFireability11096225017092424473.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5551126602743605177.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11096225017092424473.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 3 LTL properties
Checking formula 0 : !(((X((G("(p5204>=4)"))&&("(p1071>=5)")))||(X(F(X("(p5766<3)"))))))
Formula 0 simplified : !(X("(p1071>=5)" & G"(p5204>=4)") | XFX"(p5766<3)")

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="JoinFreeModules-PT-2000"
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-4028"
echo " Executing tool itstools"
echo " Input is JoinFreeModules-PT-2000, 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 r132-tall-165271820600220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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