Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 6.2K Feb 26 15:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 15:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 15:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 70K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678252252902

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-30a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 05:10:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 05:10:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 05:10:54] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2023-03-08 05:10:54] [INFO ] Transformed 234 places.
[2023-03-08 05:10:54] [INFO ] Transformed 191 transitions.
[2023-03-08 05:10:54] [INFO ] Found NUPN structural information;
[2023-03-08 05:10:54] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 111 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-30a-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 52 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 177/177 transitions.
Applied a total of 0 rules in 23 ms. Remains 234 /234 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 234 cols
[2023-03-08 05:10:54] [INFO ] Computed 59 place invariants in 22 ms
[2023-03-08 05:10:55] [INFO ] Implicit Places using invariants in 401 ms returned [131]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 424 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 233/234 places, 177/177 transitions.
Applied a total of 0 rules in 13 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 461 ms. Remains : 233/234 places, 177/177 transitions.
Support contains 52 out of 233 places after structural reductions.
[2023-03-08 05:10:55] [INFO ] Flatten gal took : 42 ms
[2023-03-08 05:10:55] [INFO ] Flatten gal took : 18 ms
[2023-03-08 05:10:55] [INFO ] Input system was already deterministic with 177 transitions.
Support contains 50 out of 233 places (down from 52) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 218 resets, run finished after 339 ms. (steps per millisecond=29 ) properties (out of 31) seen :17
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 53 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 14) seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 177 rows 233 cols
[2023-03-08 05:10:56] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:10:56] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 05:10:56] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 05:10:56] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-08 05:10:56] [INFO ] [Nat]Absence check using 32 positive place invariants in 11 ms returned sat
[2023-03-08 05:10:56] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 136 ms returned sat
[2023-03-08 05:11:00] [INFO ] After 3059ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-08 05:11:00] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 4 ms to minimize.
[2023-03-08 05:11:00] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 1 ms to minimize.
[2023-03-08 05:11:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2023-03-08 05:11:01] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-08 05:11:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-08 05:11:02] [INFO ] After 5687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 2240 ms.
[2023-03-08 05:11:04] [INFO ] After 8344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 0 properties in 585 ms.
Support contains 21 out of 233 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 233/233 places, 177/177 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 233 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 232 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 232 transition count 174
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 46 ms. Remains 232 /233 variables (removed 1) and now considering 174/177 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 232/233 places, 174/177 transitions.
Incomplete random walk after 10000 steps, including 130 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 29 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 14) seen :0
Interrupted probabilistic random walk after 602195 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :{}
Probabilistic random walk after 602195 steps, saw 86637 distinct states, run finished after 3004 ms. (steps per millisecond=200 ) properties seen :0
Running SMT prover for 14 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 05:11:09] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:11:09] [INFO ] [Real]Absence check using 36 positive place invariants in 22 ms returned sat
[2023-03-08 05:11:09] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2023-03-08 05:11:09] [INFO ] After 393ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:14
[2023-03-08 05:11:09] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 05:11:09] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 80 ms returned sat
[2023-03-08 05:11:10] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :14
[2023-03-08 05:11:10] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:11:10] [INFO ] After 267ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :14
[2023-03-08 05:11:11] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-08 05:11:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-08 05:11:11] [INFO ] After 679ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :14
Attempting to minimize the solution found.
Minimization took 314 ms.
[2023-03-08 05:11:11] [INFO ] After 1677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :14
Parikh walk visited 2 properties in 467 ms.
Support contains 19 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 05:11:11] [INFO ] Invariant cache hit.
[2023-03-08 05:11:12] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-08 05:11:12] [INFO ] Invariant cache hit.
[2023-03-08 05:11:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:11:12] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2023-03-08 05:11:12] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 05:11:12] [INFO ] Invariant cache hit.
[2023-03-08 05:11:12] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 19 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 12 properties.
[2023-03-08 05:11:12] [INFO ] Invariant cache hit.
[2023-03-08 05:11:13] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 05:11:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 05:11:13] [INFO ] After 372ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 05:11:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 61 ms returned sat
[2023-03-08 05:11:13] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 05:11:13] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-08 05:11:13] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2023-03-08 05:11:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 95 ms
[2023-03-08 05:11:14] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-03-08 05:11:14] [INFO ] After 1227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA DES-PT-30a-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 136 stabilizing places and 131 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 14 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 05:11:14] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:11:15] [INFO ] Implicit Places using invariants in 538 ms returned []
[2023-03-08 05:11:15] [INFO ] Invariant cache hit.
[2023-03-08 05:11:15] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 789 ms to find 0 implicit places.
[2023-03-08 05:11:15] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 05:11:15] [INFO ] Invariant cache hit.
[2023-03-08 05:11:15] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 973 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s82 1) (EQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 59 steps with 0 reset in 3 ms.
FORMULA DES-PT-30a-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-00 finished in 1183 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Support contains 10 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 4 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:11:15] [INFO ] Invariant cache hit.
[2023-03-08 05:11:16] [INFO ] Implicit Places using invariants in 250 ms returned []
[2023-03-08 05:11:16] [INFO ] Invariant cache hit.
[2023-03-08 05:11:16] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-08 05:11:16] [INFO ] Invariant cache hit.
[2023-03-08 05:11:16] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 600 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s78 1) (EQ s148 1)), p0:(OR (EQ s191 0) (EQ s193 0) (EQ s195 0) (EQ s197 0) (EQ s199 0) (EQ s201 0) (EQ s203 0) (EQ s205 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2211 reset in 345 ms.
Product exploration explored 100000 steps with 2226 reset in 344 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Finished random walk after 213 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=106 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 8 out of 232 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 05:11:17] [INFO ] Invariant cache hit.
[2023-03-08 05:11:18] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 05:11:18] [INFO ] Invariant cache hit.
[2023-03-08 05:11:18] [INFO ] Implicit Places using invariants and state equation in 365 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2023-03-08 05:11:18] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:11:18] [INFO ] Invariant cache hit.
[2023-03-08 05:11:18] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 676 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Finished random walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2236 reset in 198 ms.
Product exploration explored 100000 steps with 2198 reset in 219 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 8 ms. Remains 231 /232 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 231 cols
[2023-03-08 05:11:19] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 05:11:19] [INFO ] Implicit Places using invariants in 233 ms returned []
[2023-03-08 05:11:19] [INFO ] Invariant cache hit.
[2023-03-08 05:11:19] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2023-03-08 05:11:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:11:19] [INFO ] Invariant cache hit.
[2023-03-08 05:11:19] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 547 ms. Remains : 231/232 places, 175/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-01 finished in 4058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 231 transition count 175
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 231 transition count 175
Applied a total of 2 rules in 11 ms. Remains 231 /233 variables (removed 2) and now considering 175/177 (removed 2) transitions.
[2023-03-08 05:11:19] [INFO ] Invariant cache hit.
[2023-03-08 05:11:20] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-08 05:11:20] [INFO ] Invariant cache hit.
[2023-03-08 05:11:20] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 421 ms to find 0 implicit places.
[2023-03-08 05:11:20] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:11:20] [INFO ] Invariant cache hit.
[2023-03-08 05:11:20] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 231/233 places, 175/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 609 ms. Remains : 231/233 places, 175/177 transitions.
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (EQ s21 1) (EQ s150 1) (EQ s152 1)), p0:(AND (EQ s25 1) (EQ s150 1) (EQ s152 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 61 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-02 finished in 662 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(p0))||F(p1))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Applied a total of 0 rules in 2 ms. Remains 233 /233 variables (removed 0) and now considering 177/177 (removed 0) transitions.
// Phase 1: matrix 177 rows 233 cols
[2023-03-08 05:11:20] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:11:20] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 05:11:20] [INFO ] Invariant cache hit.
[2023-03-08 05:11:21] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 713 ms to find 0 implicit places.
[2023-03-08 05:11:21] [INFO ] Invariant cache hit.
[2023-03-08 05:11:21] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 878 ms. Remains : 233/233 places, 177/177 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s10 1) (EQ s151 1) (EQ s153 1)), p0:(OR (EQ s156 0) (EQ s225 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 337 ms.
Product exploration explored 100000 steps with 33333 reset in 290 ms.
Computed a total of 136 stabilizing places and 131 stable transitions
Computed a total of 136 stabilizing places and 131 stable transitions
Detected a total of 136/233 stabilizing places and 131/177 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p0)))))
Knowledge based reduction with 4 factoid took 115 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-03 finished in 1736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p1)))'
Support contains 4 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 8 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 05:11:22] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 05:11:22] [INFO ] Implicit Places using invariants in 148 ms returned []
[2023-03-08 05:11:22] [INFO ] Invariant cache hit.
[2023-03-08 05:11:22] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 372 ms to find 0 implicit places.
[2023-03-08 05:11:22] [INFO ] Invariant cache hit.
[2023-03-08 05:11:22] [INFO ] Dead Transitions using invariants and state equation in 115 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 504 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s66 1) (EQ s148 1)), p0:(AND (EQ s170 1) (EQ s187 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 149 steps with 2 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-04 finished in 791 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 21 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:11:23] [INFO ] Invariant cache hit.
[2023-03-08 05:11:23] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 05:11:23] [INFO ] Invariant cache hit.
[2023-03-08 05:11:23] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 324 ms to find 0 implicit places.
[2023-03-08 05:11:23] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:11:23] [INFO ] Invariant cache hit.
[2023-03-08 05:11:23] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 459 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-30a-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s115 1) (EQ s124 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 38 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-05 finished in 530 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!((!p1 U p2)&&p0)) U X(p1)))'
Support contains 6 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 7 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:11:23] [INFO ] Invariant cache hit.
[2023-03-08 05:11:23] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 05:11:23] [INFO ] Invariant cache hit.
[2023-03-08 05:11:23] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 316 ms to find 0 implicit places.
[2023-03-08 05:11:23] [INFO ] Invariant cache hit.
[2023-03-08 05:11:24] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (EQ s214 1) (EQ s228 1)), p0:(AND (EQ s152 1) (EQ s224 1)), p2:(AND (EQ s48 1) (EQ s227 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 9473 reset in 224 ms.
Product exploration explored 100000 steps with 9483 reset in 245 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 358 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:11:25] [INFO ] Invariant cache hit.
[2023-03-08 05:11:25] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:25] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 13 ms returned sat
[2023-03-08 05:11:25] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:11:25] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:25] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 27 ms returned sat
[2023-03-08 05:11:25] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:11:26] [INFO ] Deduced a trap composed of 9 places in 463 ms of which 0 ms to minimize.
[2023-03-08 05:11:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 484 ms
[2023-03-08 05:11:26] [INFO ] After 697ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-08 05:11:26] [INFO ] After 863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 45 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 15 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1010326 steps, run timeout after 3001 ms. (steps per millisecond=336 ) properties seen :{}
Probabilistic random walk after 1010326 steps, saw 142925 distinct states, run finished after 3001 ms. (steps per millisecond=336 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 05:11:29] [INFO ] Computed 60 place invariants in 6 ms
[2023-03-08 05:11:29] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:11:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:11:29] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:11:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-08 05:11:29] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:11:29] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:11:29] [INFO ] After 63ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:11:30] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2023-03-08 05:11:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-08 05:11:30] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 0 ms to minimize.
[2023-03-08 05:11:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-08 05:11:30] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 05:11:30] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 50 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 05:11:30] [INFO ] Invariant cache hit.
[2023-03-08 05:11:30] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 05:11:30] [INFO ] Invariant cache hit.
[2023-03-08 05:11:30] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:11:30] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-08 05:11:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:11:30] [INFO ] Invariant cache hit.
[2023-03-08 05:11:30] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 569 ms. Remains : 232/232 places, 174/174 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 174
Applied a total of 1 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 05:11:30] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 05:11:30] [INFO ] [Real]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 05:11:30] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 12 ms returned sat
[2023-03-08 05:11:30] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:11:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 79 ms returned sat
[2023-03-08 05:11:31] [INFO ] After 138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:11:31] [INFO ] After 213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-08 05:11:31] [INFO ] After 434ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p2))), true, (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 11 factoid took 481 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 05:11:32] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:11:32] [INFO ] [Real]Absence check using 32 positive place invariants in 9 ms returned sat
[2023-03-08 05:11:32] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 16 ms returned sat
[2023-03-08 05:11:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:11:32] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2023-03-08 05:11:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:11:32] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-08 05:11:32] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 90 ms returned sat
[2023-03-08 05:11:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:11:33] [INFO ] [Nat]Absence check using state equation in 526 ms returned sat
[2023-03-08 05:11:33] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 11 ms.
[2023-03-08 05:11:34] [INFO ] Added : 130 causal constraints over 26 iterations in 712 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 05:11:34] [INFO ] Invariant cache hit.
[2023-03-08 05:11:34] [INFO ] Implicit Places using invariants in 112 ms returned []
[2023-03-08 05:11:34] [INFO ] Invariant cache hit.
[2023-03-08 05:11:34] [INFO ] Implicit Places using invariants and state equation in 204 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2023-03-08 05:11:34] [INFO ] Invariant cache hit.
[2023-03-08 05:11:34] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 348 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 220 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10000 steps, including 42 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 05:11:35] [INFO ] Invariant cache hit.
[2023-03-08 05:11:35] [INFO ] [Real]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:35] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 14 ms returned sat
[2023-03-08 05:11:35] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:11:35] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:35] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-08 05:11:35] [INFO ] After 148ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:11:35] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 0 ms to minimize.
[2023-03-08 05:11:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-08 05:11:35] [INFO ] After 288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 49 ms.
[2023-03-08 05:11:35] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 52 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 232 transition count 174
Applied a total of 8 rules in 28 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 132 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1138720 steps, run timeout after 3001 ms. (steps per millisecond=379 ) properties seen :{}
Probabilistic random walk after 1138720 steps, saw 159459 distinct states, run finished after 3002 ms. (steps per millisecond=379 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 05:11:38] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 05:11:38] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:11:38] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:11:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:11:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 78 ms returned sat
[2023-03-08 05:11:39] [INFO ] After 165ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:11:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:11:39] [INFO ] After 61ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 05:11:39] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 0 ms to minimize.
[2023-03-08 05:11:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2023-03-08 05:11:39] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2023-03-08 05:11:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 81 ms
[2023-03-08 05:11:39] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-08 05:11:39] [INFO ] After 647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 43 ms.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 6 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 05:11:39] [INFO ] Invariant cache hit.
[2023-03-08 05:11:39] [INFO ] Implicit Places using invariants in 127 ms returned []
[2023-03-08 05:11:39] [INFO ] Invariant cache hit.
[2023-03-08 05:11:39] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 05:11:40] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2023-03-08 05:11:40] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:11:40] [INFO ] Invariant cache hit.
[2023-03-08 05:11:40] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 513 ms. Remains : 232/232 places, 174/174 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 232 transition count 174
Applied a total of 1 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 05:11:40] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 05:11:40] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:11:40] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:11:40] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 05:11:40] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:40] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 74 ms returned sat
[2023-03-08 05:11:40] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 05:11:40] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-08 05:11:40] [INFO ] After 435ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 (NOT p2) (NOT p1)))]
Knowledge based reduction with 11 factoid took 391 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 05:11:41] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:11:41] [INFO ] [Real]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-08 05:11:41] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 05:11:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 05:11:41] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2023-03-08 05:11:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 05:11:42] [INFO ] [Nat]Absence check using 32 positive place invariants in 6 ms returned sat
[2023-03-08 05:11:42] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 87 ms returned sat
[2023-03-08 05:11:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 05:11:42] [INFO ] [Nat]Absence check using state equation in 510 ms returned sat
[2023-03-08 05:11:42] [INFO ] Computed and/alt/rep : 168/504/168 causal constraints (skipped 7 transitions) in 23 ms.
[2023-03-08 05:11:43] [INFO ] Added : 130 causal constraints over 26 iterations in 752 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 130 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Product exploration explored 100000 steps with 9457 reset in 222 ms.
Product exploration explored 100000 steps with 9499 reset in 237 ms.
Applying partial POR strategy [true, true, true, false]
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (OR (NOT p1) p2), true, (NOT p1)]
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 28 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 05:11:44] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:11:44] [INFO ] Invariant cache hit.
[2023-03-08 05:11:44] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148 ms. Remains : 232/232 places, 176/176 transitions.
Support contains 6 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 05:11:44] [INFO ] Invariant cache hit.
[2023-03-08 05:11:44] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 05:11:44] [INFO ] Invariant cache hit.
[2023-03-08 05:11:44] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2023-03-08 05:11:44] [INFO ] Invariant cache hit.
[2023-03-08 05:11:44] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 428 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-06 finished in 21205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 15 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:11:44] [INFO ] Invariant cache hit.
[2023-03-08 05:11:45] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-08 05:11:45] [INFO ] Invariant cache hit.
[2023-03-08 05:11:45] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
[2023-03-08 05:11:45] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:11:45] [INFO ] Invariant cache hit.
[2023-03-08 05:11:45] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 501 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s12 1) (EQ s151 1) (EQ s153 1)), p1:(OR (NEQ s109 1) (NEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 44 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-07 finished in 617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 13 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:11:45] [INFO ] Invariant cache hit.
[2023-03-08 05:11:45] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 05:11:45] [INFO ] Invariant cache hit.
[2023-03-08 05:11:45] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-08 05:11:45] [INFO ] Invariant cache hit.
[2023-03-08 05:11:45] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 96 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s11 1) (EQ s151 1) (EQ s153 1)), p0:(OR (EQ s71 0) (EQ s148 0) (AND (EQ s11 1) (EQ s151 1) (EQ s153 1) (EQ s71 1) (EQ s148 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2238 reset in 216 ms.
Product exploration explored 100000 steps with 2238 reset in 238 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 323 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 50 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 839762 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :{}
Probabilistic random walk after 839762 steps, saw 124972 distinct states, run finished after 3001 ms. (steps per millisecond=279 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 05:11:50] [INFO ] Invariant cache hit.
[2023-03-08 05:11:50] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 05:11:50] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 05:11:50] [INFO ] After 115ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:11:50] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:50] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-08 05:11:50] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 05:11:50] [INFO ] After 276ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-08 05:11:50] [INFO ] After 542ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 74 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 232 transition count 174
Applied a total of 7 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1065542 steps, run timeout after 3001 ms. (steps per millisecond=355 ) properties seen :{}
Probabilistic random walk after 1065542 steps, saw 149822 distinct states, run finished after 3001 ms. (steps per millisecond=355 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 05:11:54] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:11:54] [INFO ] [Real]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:11:54] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 05:11:54] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:11:54] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:11:54] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 83 ms returned sat
[2023-03-08 05:11:54] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:11:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:11:54] [INFO ] After 77ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 05:11:54] [INFO ] After 165ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 84 ms.
[2023-03-08 05:11:54] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 67 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 05:11:54] [INFO ] Invariant cache hit.
[2023-03-08 05:11:55] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 05:11:55] [INFO ] Invariant cache hit.
[2023-03-08 05:11:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:11:55] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 416 ms to find 0 implicit places.
[2023-03-08 05:11:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:11:55] [INFO ] Invariant cache hit.
[2023-03-08 05:11:55] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 524 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 05:11:55] [INFO ] Invariant cache hit.
[2023-03-08 05:11:55] [INFO ] [Real]Absence check using 35 positive place invariants in 8 ms returned sat
[2023-03-08 05:11:55] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 05:11:55] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:11:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:11:55] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 91 ms returned sat
[2023-03-08 05:11:55] [INFO ] After 155ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:11:55] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2023-03-08 05:11:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-08 05:11:56] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2023-03-08 05:11:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2023-03-08 05:11:56] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-08 05:11:56] [INFO ] After 591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 454 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 05:11:56] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:11:56] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-08 05:11:56] [INFO ] Invariant cache hit.
[2023-03-08 05:11:57] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 345 ms to find 0 implicit places.
[2023-03-08 05:11:57] [INFO ] Invariant cache hit.
[2023-03-08 05:11:57] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1756184 steps, run timeout after 3001 ms. (steps per millisecond=585 ) properties seen :{}
Probabilistic random walk after 1756184 steps, saw 238282 distinct states, run finished after 3001 ms. (steps per millisecond=585 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:12:00] [INFO ] Invariant cache hit.
[2023-03-08 05:12:00] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:12:00] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 05:12:00] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 25 ms returned sat
[2023-03-08 05:12:00] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:12:00] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 05:12:00] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 232 transition count 174
Applied a total of 7 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 30 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1712345 steps, run timeout after 3001 ms. (steps per millisecond=570 ) properties seen :{}
Probabilistic random walk after 1712345 steps, saw 239674 distinct states, run finished after 3001 ms. (steps per millisecond=570 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 05:12:03] [INFO ] Computed 60 place invariants in 8 ms
[2023-03-08 05:12:03] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:12:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2023-03-08 05:12:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 86 ms returned sat
[2023-03-08 05:12:04] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:12:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:12:04] [INFO ] After 39ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:12:04] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 05:12:04] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 05:12:04] [INFO ] Invariant cache hit.
[2023-03-08 05:12:04] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-08 05:12:04] [INFO ] Invariant cache hit.
[2023-03-08 05:12:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:12:04] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2023-03-08 05:12:04] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:12:04] [INFO ] Invariant cache hit.
[2023-03-08 05:12:04] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:12:04] [INFO ] Invariant cache hit.
[2023-03-08 05:12:04] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:12:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:12:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 93 ms returned sat
[2023-03-08 05:12:05] [INFO ] After 115ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:12:05] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-08 05:12:05] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 169 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2226 reset in 194 ms.
Product exploration explored 100000 steps with 2194 reset in 212 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 12 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 05:12:06] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 05:12:06] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:12:06] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 232/232 places, 176/176 transitions.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 05:12:06] [INFO ] Invariant cache hit.
[2023-03-08 05:12:06] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-08 05:12:06] [INFO ] Invariant cache hit.
[2023-03-08 05:12:06] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 359 ms to find 0 implicit places.
[2023-03-08 05:12:06] [INFO ] Invariant cache hit.
[2023-03-08 05:12:06] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 465 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-09 finished in 21379 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 7 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 5 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:12:06] [INFO ] Invariant cache hit.
[2023-03-08 05:12:06] [INFO ] Implicit Places using invariants in 114 ms returned []
[2023-03-08 05:12:06] [INFO ] Invariant cache hit.
[2023-03-08 05:12:07] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
[2023-03-08 05:12:07] [INFO ] Invariant cache hit.
[2023-03-08 05:12:07] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 467 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-30a-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s19 0) (EQ s151 0) (EQ s153 0) (EQ s131 0) (EQ s138 0)), p0:(AND (EQ s130 1) (EQ s223 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 245 ms.
Product exploration explored 100000 steps with 33333 reset in 261 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-10 finished in 1295 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(p1))))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 6 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:12:08] [INFO ] Invariant cache hit.
[2023-03-08 05:12:08] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-08 05:12:08] [INFO ] Invariant cache hit.
[2023-03-08 05:12:08] [INFO ] Implicit Places using invariants and state equation in 218 ms returned []
Implicit Place search using SMT with State Equation took 344 ms to find 0 implicit places.
[2023-03-08 05:12:08] [INFO ] Invariant cache hit.
[2023-03-08 05:12:08] [INFO ] Dead Transitions using invariants and state equation in 105 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 457 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DES-PT-30a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s141 1) (EQ s143 1)), p1:(OR (EQ s141 0) (EQ s143 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 116 steps with 3 reset in 1 ms.
FORMULA DES-PT-30a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-12 finished in 555 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 8 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:12:08] [INFO ] Invariant cache hit.
[2023-03-08 05:12:08] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 05:12:08] [INFO ] Invariant cache hit.
[2023-03-08 05:12:09] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-08 05:12:09] [INFO ] Invariant cache hit.
[2023-03-08 05:12:09] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 444 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s21 1) (EQ s151 1) (EQ s153 1)), p1:(AND (EQ s121 1) (EQ s133 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-13 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 2 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 5 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:12:09] [INFO ] Invariant cache hit.
[2023-03-08 05:12:09] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 05:12:09] [INFO ] Invariant cache hit.
[2023-03-08 05:12:09] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
[2023-03-08 05:12:09] [INFO ] Invariant cache hit.
[2023-03-08 05:12:09] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 425 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-30a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s117 0) (EQ s124 0)), p1:(OR (NEQ s117 1) (NEQ s124 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 313 ms.
Product exploration explored 100000 steps with 50000 reset in 337 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 6 factoid took 122 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-30a-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-30a-LTLFireability-14 finished in 1326 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(G((p2 U X(p3))))&&p1))&&p0)))'
Support contains 7 out of 233 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 9 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:12:10] [INFO ] Invariant cache hit.
[2023-03-08 05:12:10] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-08 05:12:10] [INFO ] Invariant cache hit.
[2023-03-08 05:12:10] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2023-03-08 05:12:10] [INFO ] Invariant cache hit.
[2023-03-08 05:12:11] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 232/233 places, 176/177 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p3) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (OR (NOT p1) (NOT p3)), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : DES-PT-30a-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 5}, { cond=(AND p1 p2), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={0} source=4 dest: 5}, { cond=p2, acceptance={0} source=4 dest: 6}], [{ cond=(NOT p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=5 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={0} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=6 dest: 5}, { cond=(AND p2 (NOT p3)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s115 1) (EQ s124 1)), p1:(AND (EQ s98 1) (EQ s124 1)), p2:(AND (EQ s162 1) (EQ s179 1)), p3:(AND (EQ s208 1) (EQ s211 1))], 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-30a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-30a-LTLFireability-15 finished in 705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||G(p1)))))'
Found a Lengthening insensitive property : DES-PT-30a-LTLFireability-01
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 10 out of 233 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 15 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
[2023-03-08 05:12:11] [INFO ] Invariant cache hit.
[2023-03-08 05:12:11] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 05:12:11] [INFO ] Invariant cache hit.
[2023-03-08 05:12:11] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-08 05:12:11] [INFO ] Invariant cache hit.
[2023-03-08 05:12:11] [INFO ] Dead Transitions using invariants and state equation in 108 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 455 ms. Remains : 232/233 places, 176/177 transitions.
Running random walk in product with property : DES-PT-30a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(AND (EQ s78 1) (EQ s148 1)), p0:(OR (EQ s191 0) (EQ s193 0) (EQ s195 0) (EQ s197 0) (EQ s199 0) (EQ s201 0) (EQ s203 0) (EQ s205 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2162 reset in 223 ms.
Product exploration explored 100000 steps with 2197 reset in 222 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 56 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=56 )
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT p1))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 8 out of 232 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 05:12:12] [INFO ] Invariant cache hit.
[2023-03-08 05:12:12] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-08 05:12:12] [INFO ] Invariant cache hit.
[2023-03-08 05:12:13] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-08 05:12:13] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 05:12:13] [INFO ] Invariant cache hit.
[2023-03-08 05:12:13] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 460 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Finished random walk after 96 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=48 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2216 reset in 204 ms.
Product exploration explored 100000 steps with 2217 reset in 233 ms.
Support contains 8 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 4 ms. Remains 231 /232 variables (removed 1) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 231 cols
[2023-03-08 05:12:13] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:12:14] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 05:12:14] [INFO ] Invariant cache hit.
[2023-03-08 05:12:14] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 05:12:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:12:14] [INFO ] Invariant cache hit.
[2023-03-08 05:12:14] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 487 ms. Remains : 231/232 places, 175/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-01 finished in 3204 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!((!p1 U p2)&&p0)) U X(p1)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : DES-PT-30a-LTLFireability-09
Stuttering acceptance computed with spot in 113 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 5 out of 233 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 233/233 places, 177/177 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 232 transition count 176
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 232 transition count 176
Applied a total of 2 rules in 11 ms. Remains 232 /233 variables (removed 1) and now considering 176/177 (removed 1) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 05:12:14] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:12:14] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-08 05:12:14] [INFO ] Invariant cache hit.
[2023-03-08 05:12:15] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2023-03-08 05:12:15] [INFO ] Invariant cache hit.
[2023-03-08 05:12:15] [INFO ] Dead Transitions using invariants and state equation in 92 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 232/233 places, 176/177 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 474 ms. Remains : 232/233 places, 176/177 transitions.
Running random walk in product with property : DES-PT-30a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s11 1) (EQ s151 1) (EQ s153 1)), p0:(OR (EQ s71 0) (EQ s148 0) (AND (EQ s11 1) (EQ s151 1) (EQ s153 1) (EQ s71 1) (EQ s148 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2255 reset in 199 ms.
Product exploration explored 100000 steps with 2246 reset in 231 ms.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 478 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 231 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 52 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 898890 steps, run timeout after 3001 ms. (steps per millisecond=299 ) properties seen :{}
Probabilistic random walk after 898890 steps, saw 131508 distinct states, run finished after 3001 ms. (steps per millisecond=299 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-08 05:12:19] [INFO ] Invariant cache hit.
[2023-03-08 05:12:19] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 05:12:19] [INFO ] [Real]Absence check using 32 positive and 26 generalized place invariants in 15 ms returned sat
[2023-03-08 05:12:19] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-08 05:12:19] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 05:12:19] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 26 ms returned sat
[2023-03-08 05:12:19] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-08 05:12:20] [INFO ] After 253ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-03-08 05:12:20] [INFO ] After 510ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 232 transition count 174
Applied a total of 7 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 126 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1168181 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :{}
Probabilistic random walk after 1168181 steps, saw 163776 distinct states, run finished after 3001 ms. (steps per millisecond=389 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 05:12:23] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 05:12:23] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:12:23] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2023-03-08 05:12:23] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:12:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:12:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 83 ms returned sat
[2023-03-08 05:12:23] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:12:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:12:23] [INFO ] After 84ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 05:12:23] [INFO ] After 162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 80 ms.
[2023-03-08 05:12:24] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 62 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 05:12:24] [INFO ] Invariant cache hit.
[2023-03-08 05:12:24] [INFO ] Implicit Places using invariants in 110 ms returned []
[2023-03-08 05:12:24] [INFO ] Invariant cache hit.
[2023-03-08 05:12:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:12:24] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 368 ms to find 0 implicit places.
[2023-03-08 05:12:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:12:24] [INFO ] Invariant cache hit.
[2023-03-08 05:12:24] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 479 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 9 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-08 05:12:24] [INFO ] Invariant cache hit.
[2023-03-08 05:12:24] [INFO ] [Real]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:12:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 05:12:24] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 05:12:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 05:12:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 91 ms returned sat
[2023-03-08 05:12:25] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 05:12:25] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-08 05:12:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2023-03-08 05:12:25] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2023-03-08 05:12:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 65 ms
[2023-03-08 05:12:25] [INFO ] After 354ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-08 05:12:25] [INFO ] After 582ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 451 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 05:12:25] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 05:12:26] [INFO ] Implicit Places using invariants in 125 ms returned []
[2023-03-08 05:12:26] [INFO ] Invariant cache hit.
[2023-03-08 05:12:26] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-08 05:12:26] [INFO ] Invariant cache hit.
[2023-03-08 05:12:26] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 449 ms. Remains : 232/232 places, 176/176 transitions.
Computed a total of 135 stabilizing places and 130 stable transitions
Computed a total of 135 stabilizing places and 130 stable transitions
Detected a total of 135/232 stabilizing places and 130/176 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 160 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 225 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1669740 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :{}
Probabilistic random walk after 1669740 steps, saw 229046 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 05:12:29] [INFO ] Invariant cache hit.
[2023-03-08 05:12:29] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:12:29] [INFO ] [Nat]Absence check using 32 positive place invariants in 3 ms returned sat
[2023-03-08 05:12:29] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 25 ms returned sat
[2023-03-08 05:12:29] [INFO ] After 120ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:12:29] [INFO ] After 143ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-08 05:12:29] [INFO ] After 270ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 176/176 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 232 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 232 transition count 174
Applied a total of 7 rules in 8 ms. Remains 232 /232 variables (removed 0) and now considering 174/176 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 232/232 places, 174/176 transitions.
Incomplete random walk after 10000 steps, including 136 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1655150 steps, run timeout after 3001 ms. (steps per millisecond=551 ) properties seen :{}
Probabilistic random walk after 1655150 steps, saw 232203 distinct states, run finished after 3001 ms. (steps per millisecond=551 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 174 rows 232 cols
[2023-03-08 05:12:33] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 05:12:33] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:12:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:12:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 84 ms returned sat
[2023-03-08 05:12:33] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:12:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:12:33] [INFO ] After 38ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 05:12:33] [INFO ] After 80ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-08 05:12:33] [INFO ] After 401ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 3 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 232/232 places, 174/174 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2023-03-08 05:12:33] [INFO ] Invariant cache hit.
[2023-03-08 05:12:33] [INFO ] Implicit Places using invariants in 128 ms returned []
[2023-03-08 05:12:33] [INFO ] Invariant cache hit.
[2023-03-08 05:12:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 05:12:33] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 399 ms to find 0 implicit places.
[2023-03-08 05:12:33] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 05:12:33] [INFO ] Invariant cache hit.
[2023-03-08 05:12:34] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 515 ms. Remains : 232/232 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 232 /232 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 05:12:34] [INFO ] Invariant cache hit.
[2023-03-08 05:12:34] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 05:12:34] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 05:12:34] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 92 ms returned sat
[2023-03-08 05:12:34] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 05:12:34] [INFO ] After 147ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 05:12:34] [INFO ] After 308ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2233 reset in 193 ms.
Product exploration explored 100000 steps with 2222 reset in 217 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p0), (NOT p0)]
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 10 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 05:12:35] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 176 rows 232 cols
[2023-03-08 05:12:35] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 05:12:35] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 126 ms. Remains : 232/232 places, 176/176 transitions.
Support contains 5 out of 232 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 232/232 places, 176/176 transitions.
Applied a total of 0 rules in 1 ms. Remains 232 /232 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2023-03-08 05:12:35] [INFO ] Invariant cache hit.
[2023-03-08 05:12:35] [INFO ] Implicit Places using invariants in 120 ms returned []
[2023-03-08 05:12:35] [INFO ] Invariant cache hit.
[2023-03-08 05:12:35] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
[2023-03-08 05:12:35] [INFO ] Invariant cache hit.
[2023-03-08 05:12:35] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 232/232 places, 176/176 transitions.
Treatment of property DES-PT-30a-LTLFireability-09 finished in 21346 ms.
[2023-03-08 05:12:35] [INFO ] Flatten gal took : 17 ms
[2023-03-08 05:12:35] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 05:12:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 233 places, 177 transitions and 859 arcs took 3 ms.
Total runtime 101613 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-30a
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA DES-PT-30a-LTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678252467177

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:409
lola: RELEASE
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 7 (type EXCL) for 6 DES-PT-30a-LTLFireability-09
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1200 4/32 DES-PT-30a-LTLFireability-09 507120 m, 101424 m/sec, 3468508 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 10/1200 8/32 DES-PT-30a-LTLFireability-09 939802 m, 86536 m/sec, 6884227 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 15/1200 11/32 DES-PT-30a-LTLFireability-09 1351322 m, 82304 m/sec, 10297939 t fired, .

Time elapsed: 15 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 20/1200 14/32 DES-PT-30a-LTLFireability-09 1732154 m, 76166 m/sec, 13708482 t fired, .

Time elapsed: 20 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 25/1200 17/32 DES-PT-30a-LTLFireability-09 2123870 m, 78343 m/sec, 17154805 t fired, .

Time elapsed: 25 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 30/1200 20/32 DES-PT-30a-LTLFireability-09 2536786 m, 82583 m/sec, 20537173 t fired, .

Time elapsed: 30 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 35/1200 23/32 DES-PT-30a-LTLFireability-09 2934216 m, 79486 m/sec, 24000023 t fired, .

Time elapsed: 35 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 40/1200 26/32 DES-PT-30a-LTLFireability-09 3399898 m, 93136 m/sec, 27539734 t fired, .

Time elapsed: 40 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 45/1200 30/32 DES-PT-30a-LTLFireability-09 3835612 m, 87142 m/sec, 30963416 t fired, .

Time elapsed: 45 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 50/1200 32/32 DES-PT-30a-LTLFireability-09 4228038 m, 78485 m/sec, 34299702 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 7 (type EXCL) for DES-PT-30a-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-06: LTL 0 1 0 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-30a-LTLFireability-06
lola: time limit : 1772 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for DES-PT-30a-LTLFireability-06
lola: result : true
lola: markings : 5409
lola: fired transitions : 13279
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-30a-LTLFireability-01
lola: time limit : 3545 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3545 4/32 DES-PT-30a-LTLFireability-01 485652 m, 97130 m/sec, 3579786 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3545 7/32 DES-PT-30a-LTLFireability-01 925031 m, 87875 m/sec, 7117554 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3545 10/32 DES-PT-30a-LTLFireability-01 1329655 m, 80924 m/sec, 10653456 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3545 13/32 DES-PT-30a-LTLFireability-01 1704931 m, 75055 m/sec, 14153178 t fired, .

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3545 16/32 DES-PT-30a-LTLFireability-01 2086144 m, 76242 m/sec, 17707175 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3545 19/32 DES-PT-30a-LTLFireability-01 2473219 m, 77415 m/sec, 21188524 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3545 22/32 DES-PT-30a-LTLFireability-01 2864718 m, 78299 m/sec, 24756363 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3545 25/32 DES-PT-30a-LTLFireability-01 3272027 m, 81461 m/sec, 28306521 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3545 28/32 DES-PT-30a-LTLFireability-01 3710534 m, 87701 m/sec, 31859955 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 1 0 1 0 0 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3545 31/32 DES-PT-30a-LTLFireability-01 4121613 m, 82215 m/sec, 35317902 t fired, .

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: CANCELED task # 1 (type EXCL) for DES-PT-30a-LTLFireability-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-06: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-30a-LTLFireability-01: LTL 0 0 0 0 1 0 1 0
DES-PT-30a-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: Portfolio finished: no open tasks 3

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-30a-LTLFireability-01: LTL unknown AGGR
DES-PT-30a-LTLFireability-06: LTL true LTL model checker
DES-PT-30a-LTLFireability-09: LTL unknown AGGR


Time elapsed: 110 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is DES-PT-30a, 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 r103-tall-167814478300444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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