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-167814478300411.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-10a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478300411
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 15:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 26 15:46 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.3K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 11K Feb 26 15:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 15:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K Feb 26 15:49 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 43K 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-10a-LTLCardinality-00
FORMULA_NAME DES-PT-10a-LTLCardinality-01
FORMULA_NAME DES-PT-10a-LTLCardinality-02
FORMULA_NAME DES-PT-10a-LTLCardinality-03
FORMULA_NAME DES-PT-10a-LTLCardinality-04
FORMULA_NAME DES-PT-10a-LTLCardinality-05
FORMULA_NAME DES-PT-10a-LTLCardinality-06
FORMULA_NAME DES-PT-10a-LTLCardinality-07
FORMULA_NAME DES-PT-10a-LTLCardinality-08
FORMULA_NAME DES-PT-10a-LTLCardinality-09
FORMULA_NAME DES-PT-10a-LTLCardinality-10
FORMULA_NAME DES-PT-10a-LTLCardinality-11
FORMULA_NAME DES-PT-10a-LTLCardinality-12
FORMULA_NAME DES-PT-10a-LTLCardinality-13
FORMULA_NAME DES-PT-10a-LTLCardinality-14
FORMULA_NAME DES-PT-10a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678251015236

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-10a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 04:50:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 04:50:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:50:16] [INFO ] Load time of PNML (sax parser for PT used): 42 ms
[2023-03-08 04:50:16] [INFO ] Transformed 155 places.
[2023-03-08 04:50:16] [INFO ] Transformed 112 transitions.
[2023-03-08 04:50:16] [INFO ] Found NUPN structural information;
[2023-03-08 04:50:16] [INFO ] Parsed PT model containing 155 places and 112 transitions and 552 arcs in 100 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-10a-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-10a-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-10a-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 98/98 transitions.
Applied a total of 0 rules in 20 ms. Remains 155 /155 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 155 cols
[2023-03-08 04:50:17] [INFO ] Computed 59 place invariants in 18 ms
[2023-03-08 04:50:17] [INFO ] Implicit Places using invariants in 239 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 261 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 154/155 places, 98/98 transitions.
Applied a total of 0 rules in 6 ms. Remains 154 /154 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 287 ms. Remains : 154/155 places, 98/98 transitions.
Support contains 29 out of 154 places after structural reductions.
[2023-03-08 04:50:17] [INFO ] Flatten gal took : 34 ms
[2023-03-08 04:50:17] [INFO ] Flatten gal took : 14 ms
[2023-03-08 04:50:17] [INFO ] Input system was already deterministic with 98 transitions.
Incomplete random walk after 10000 steps, including 215 resets, run finished after 243 ms. (steps per millisecond=41 ) properties (out of 17) seen :14
Incomplete Best-First random walk after 10001 steps, including 52 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 98 rows 154 cols
[2023-03-08 04:50:17] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 04:50:18] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:50:18] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 04:50:18] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:50:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 04:50:18] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 97 ms returned sat
[2023-03-08 04:50:18] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:50:18] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 34 ms.
[2023-03-08 04:50:18] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 154/154 places, 98/98 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 154 transition count 96
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 153 transition count 95
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 153 transition count 95
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 153 transition count 95
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 152 transition count 94
Applied a total of 9 rules in 34 ms. Remains 152 /154 variables (removed 2) and now considering 94/98 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 152/154 places, 94/98 transitions.
Incomplete random walk after 10000 steps, including 135 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:50:18] [INFO ] Computed 60 place invariants in 13 ms
[2023-03-08 04:50:18] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:50:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 04:50:18] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:50:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2023-03-08 04:50:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 24 ms returned sat
[2023-03-08 04:50:18] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:50:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:50:18] [INFO ] After 17ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 04:50:19] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-08 04:50:19] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 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 152 transition count 94
Applied a total of 1 rules in 10 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 152/152 places, 94/94 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1254561 steps, run timeout after 3001 ms. (steps per millisecond=418 ) properties seen :{}
Probabilistic random walk after 1254561 steps, saw 175368 distinct states, run finished after 3001 ms. (steps per millisecond=418 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:50:22] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 04:50:22] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 04:50:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-08 04:50:22] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:50:22] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 04:50:22] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-08 04:50:22] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:50:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:50:22] [INFO ] After 16ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 04:50:22] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 04:50:22] [INFO ] After 252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 23 ms.
Support contains 4 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 152/152 places, 94/94 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 94/94 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
[2023-03-08 04:50:22] [INFO ] Invariant cache hit.
[2023-03-08 04:50:22] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 04:50:22] [INFO ] Invariant cache hit.
[2023-03-08 04:50:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-08 04:50:22] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-08 04:50:22] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:50:22] [INFO ] Invariant cache hit.
[2023-03-08 04:50:22] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 152/152 places, 94/94 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 152 transition count 94
Applied a total of 1 rules in 7 ms. Remains 152 /152 variables (removed 0) and now considering 94/94 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:50:22] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 04:50:22] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 04:50:22] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 6 ms returned sat
[2023-03-08 04:50:22] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 04:50:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 04:50:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 23 ms returned sat
[2023-03-08 04:50:23] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 04:50:23] [INFO ] After 102ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 04:50:23] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
FORMULA DES-PT-10a-LTLCardinality-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 57 stabilizing places and 52 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 4 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:50:23] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:50:23] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 04:50:23] [INFO ] Invariant cache hit.
[2023-03-08 04:50:23] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2023-03-08 04:50:23] [INFO ] Invariant cache hit.
[2023-03-08 04:50:23] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 297 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s7 0) (EQ s54 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 25000 reset in 370 ms.
Product exploration explored 100000 steps with 25000 reset in 249 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 04:50:25] [INFO ] Invariant cache hit.
[2023-03-08 04:50:25] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:50:25] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 04:50:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:50:25] [INFO ] [Real]Absence check using state equation in 433 ms returned sat
[2023-03-08 04:50:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:50:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 04:50:25] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 55 ms returned sat
[2023-03-08 04:50:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:50:26] [INFO ] [Nat]Absence check using state equation in 152 ms returned sat
[2023-03-08 04:50:26] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 10 ms.
[2023-03-08 04:50:26] [INFO ] Added : 0 causal constraints over 0 iterations in 34 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:50:26] [INFO ] Invariant cache hit.
[2023-03-08 04:50:26] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 04:50:26] [INFO ] Invariant cache hit.
[2023-03-08 04:50:26] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-08 04:50:26] [INFO ] Invariant cache hit.
[2023-03-08 04:50:26] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 317 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 04:50:27] [INFO ] Invariant cache hit.
[2023-03-08 04:50:27] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:50:27] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 14 ms returned sat
[2023-03-08 04:50:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:50:27] [INFO ] [Real]Absence check using state equation in 437 ms returned sat
[2023-03-08 04:50:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:50:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:50:27] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-08 04:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:50:27] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-08 04:50:27] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 8 ms.
[2023-03-08 04:50:27] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 203 ms.
Product exploration explored 100000 steps with 25000 reset in 246 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 22 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:50:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:50:28] [INFO ] Invariant cache hit.
[2023-03-08 04:50:28] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:50:28] [INFO ] Invariant cache hit.
[2023-03-08 04:50:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 04:50:29] [INFO ] Invariant cache hit.
[2023-03-08 04:50:29] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
[2023-03-08 04:50:29] [INFO ] Invariant cache hit.
[2023-03-08 04:50:29] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 283 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-01 finished in 5867 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 3 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 11 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 04:50:29] [INFO ] Invariant cache hit.
[2023-03-08 04:50:29] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 04:50:29] [INFO ] Invariant cache hit.
[2023-03-08 04:50:29] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-08 04:50:29] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:50:29] [INFO ] Invariant cache hit.
[2023-03-08 04:50:29] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-02 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:(EQ s123 1), p1:(AND (EQ s131 1) (EQ s142 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 129 steps with 2 reset in 1 ms.
FORMULA DES-PT-10a-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-02 finished in 421 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 11 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 04:50:29] [INFO ] Invariant cache hit.
[2023-03-08 04:50:29] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-08 04:50:29] [INFO ] Invariant cache hit.
[2023-03-08 04:50:29] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2023-03-08 04:50:29] [INFO ] Invariant cache hit.
[2023-03-08 04:50:29] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 293 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (NEQ s49 0) (NEQ s150 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-04 finished in 389 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 U X(p2)))))'
Support contains 4 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Applied a total of 0 rules in 5 ms. Remains 154 /154 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 154 cols
[2023-03-08 04:50:30] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:50:30] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-08 04:50:30] [INFO ] Invariant cache hit.
[2023-03-08 04:50:30] [INFO ] Implicit Places using invariants and state equation in 191 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2023-03-08 04:50:30] [INFO ] Invariant cache hit.
[2023-03-08 04:50:30] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 154/154 places, 98/98 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : DES-PT-10a-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}, { cond=(NOT p1), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s82 0) (EQ s111 1)), p1:(OR (EQ s111 0) (EQ s82 1)), p2:(AND (OR (EQ s117 0) (EQ s147 1)) (OR (EQ s111 0) (EQ s82 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 44 steps with 3 reset in 0 ms.
FORMULA DES-PT-10a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-05 finished in 593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 6 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:50:30] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 04:50:31] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-08 04:50:31] [INFO ] Invariant cache hit.
[2023-03-08 04:50:31] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
[2023-03-08 04:50:31] [INFO ] Invariant cache hit.
[2023-03-08 04:50:31] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 688 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 171 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s92 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 1 reset in 1 ms.
FORMULA DES-PT-10a-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-06 finished in 888 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)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 10 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 04:50:31] [INFO ] Invariant cache hit.
[2023-03-08 04:50:31] [INFO ] Implicit Places using invariants in 159 ms returned []
[2023-03-08 04:50:31] [INFO ] Invariant cache hit.
[2023-03-08 04:50:31] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2023-03-08 04:50:31] [INFO ] Invariant cache hit.
[2023-03-08 04:50:31] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s136 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 250 ms.
Product exploration explored 100000 steps with 50000 reset in 266 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLCardinality-08 finished in 1156 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 3 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 04:50:32] [INFO ] Invariant cache hit.
[2023-03-08 04:50:32] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 04:50:32] [INFO ] Invariant cache hit.
[2023-03-08 04:50:32] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-08 04:50:33] [INFO ] Invariant cache hit.
[2023-03-08 04:50:33] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 399 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s78 0) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA DES-PT-10a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-10a-LTLCardinality-09 finished in 500 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(!p1 U X(!p2))))))'
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 3 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 04:50:33] [INFO ] Invariant cache hit.
[2023-03-08 04:50:33] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-08 04:50:33] [INFO ] Invariant cache hit.
[2023-03-08 04:50:33] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 288 ms to find 0 implicit places.
[2023-03-08 04:50:33] [INFO ] Invariant cache hit.
[2023-03-08 04:50:33] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 396 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : DES-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s151 1)), p1:(OR (EQ s33 0) (EQ s20 1)), p2:(OR (EQ s105 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33411 reset in 262 ms.
Product exploration explored 100000 steps with 33478 reset in 326 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 1081 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 221 resets, run finished after 219 ms. (steps per millisecond=45 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 04:50:35] [INFO ] Invariant cache hit.
[2023-03-08 04:50:36] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:50:36] [INFO ] [Nat]Absence check using 33 positive place invariants in 3 ms returned sat
[2023-03-08 04:50:36] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 04:50:36] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:50:36] [INFO ] Deduced a trap composed of 9 places in 32 ms of which 1 ms to minimize.
[2023-03-08 04:50:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-08 04:50:36] [INFO ] After 210ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-08 04:50:36] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 36 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 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 153 transition count 95
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 153 transition count 95
Applied a total of 8 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 129 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 26 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 972798 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :{}
Probabilistic random walk after 972798 steps, saw 138000 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 04:50:39] [INFO ] Computed 60 place invariants in 5 ms
[2023-03-08 04:50:39] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:50:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:50:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 04:50:40] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:50:40] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 04:50:40] [INFO ] After 74ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 04:50:40] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-08 04:50:40] [INFO ] After 414ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Finished Parikh walk after 825 steps, including 3 resets, run visited all 3 properties in 10 ms. (steps per millisecond=82 )
Parikh walk visited 3 properties in 17 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) p2)), (F (AND (NOT p1) p2)), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (AND p0 (NOT p1))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 20 factoid took 832 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:50:41] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 04:50:41] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 04:50:41] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 16 ms returned sat
[2023-03-08 04:50:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:50:41] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-08 04:50:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:50:41] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:50:41] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 60 ms returned sat
[2023-03-08 04:50:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:50:41] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2023-03-08 04:50:41] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 04:50:41] [INFO ] Added : 75 causal constraints over 15 iterations in 183 ms. Result :sat
Could not prove EG p2
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 7 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:50:41] [INFO ] Invariant cache hit.
[2023-03-08 04:50:42] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 04:50:42] [INFO ] Invariant cache hit.
[2023-03-08 04:50:42] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2023-03-08 04:50:42] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:50:42] [INFO ] Invariant cache hit.
[2023-03-08 04:50:42] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 632 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 229 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 53 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 04:50:43] [INFO ] Invariant cache hit.
[2023-03-08 04:50:43] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:50:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:50:43] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 04:50:43] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:50:43] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 0 ms to minimize.
[2023-03-08 04:50:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-08 04:50:43] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 65 ms.
[2023-03-08 04:50:43] [INFO ] After 380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 55 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 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 153 transition count 95
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 153 transition count 95
Applied a total of 8 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1222916 steps, run timeout after 3001 ms. (steps per millisecond=407 ) properties seen :{}
Probabilistic random walk after 1222916 steps, saw 171208 distinct states, run finished after 3001 ms. (steps per millisecond=407 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 04:50:47] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 04:50:47] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:50:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:50:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 04:50:47] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:50:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 04:50:47] [INFO ] After 67ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 04:50:47] [INFO ] After 131ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-08 04:50:47] [INFO ] After 456ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 31 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 10 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 04:50:47] [INFO ] Invariant cache hit.
[2023-03-08 04:50:47] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 04:50:47] [INFO ] Invariant cache hit.
[2023-03-08 04:50:47] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 04:50:47] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
[2023-03-08 04:50:47] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 04:50:47] [INFO ] Invariant cache hit.
[2023-03-08 04:50:47] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 307 ms. Remains : 153/153 places, 95/95 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 153 transition count 95
Applied a total of 1 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 04:50:47] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 04:50:48] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:50:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:50:48] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 04:50:48] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:50:48] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2023-03-08 04:50:48] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2023-03-08 04:50:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2023-03-08 04:50:48] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-08 04:50:48] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 18 factoid took 684 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:50:49] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:50:49] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:50:49] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 04:50:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:50:49] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-08 04:50:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:50:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:50:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 59 ms returned sat
[2023-03-08 04:50:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:50:49] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2023-03-08 04:50:49] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 9 ms.
[2023-03-08 04:50:50] [INFO ] Added : 75 causal constraints over 15 iterations in 169 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 25024 reset in 303 ms.
Product exploration explored 100000 steps with 25038 reset in 290 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:50:50] [INFO ] Invariant cache hit.
[2023-03-08 04:50:50] [INFO ] Implicit Places using invariants in 86 ms returned []
[2023-03-08 04:50:50] [INFO ] Invariant cache hit.
[2023-03-08 04:50:50] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
[2023-03-08 04:50:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:50:50] [INFO ] Invariant cache hit.
[2023-03-08 04:50:51] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-11 finished in 17853 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 7 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 04:50:51] [INFO ] Invariant cache hit.
[2023-03-08 04:50:51] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 04:50:51] [INFO ] Invariant cache hit.
[2023-03-08 04:50:51] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
[2023-03-08 04:50:51] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:50:51] [INFO ] Invariant cache hit.
[2023-03-08 04:50:51] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s31 0) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 2215 reset in 183 ms.
Product exploration explored 100000 steps with 2233 reset in 200 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 120 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 30 ms :[(NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 98 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 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 8 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:50:52] [INFO ] Invariant cache hit.
[2023-03-08 04:50:52] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 04:50:52] [INFO ] Invariant cache hit.
[2023-03-08 04:50:52] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2023-03-08 04:50:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:50:52] [INFO ] Invariant cache hit.
[2023-03-08 04:50:52] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 308 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 104 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)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0, (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 150 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 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2211 reset in 196 ms.
Product exploration explored 100000 steps with 2235 reset in 212 ms.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 4 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:50:53] [INFO ] Invariant cache hit.
[2023-03-08 04:50:53] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-08 04:50:53] [INFO ] Invariant cache hit.
[2023-03-08 04:50:53] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 267 ms to find 0 implicit places.
[2023-03-08 04:50:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:50:53] [INFO ] Invariant cache hit.
[2023-03-08 04:50:53] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 355 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-13 finished in 2570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 154/154 places, 98/98 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 152 transition count 96
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 152 transition count 96
Applied a total of 2 rules in 8 ms. Remains 152 /154 variables (removed 2) and now considering 96/98 (removed 2) transitions.
// Phase 1: matrix 96 rows 152 cols
[2023-03-08 04:50:53] [INFO ] Computed 58 place invariants in 0 ms
[2023-03-08 04:50:53] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-08 04:50:53] [INFO ] Invariant cache hit.
[2023-03-08 04:50:53] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 298 ms to find 0 implicit places.
[2023-03-08 04:50:53] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:50:53] [INFO ] Invariant cache hit.
[2023-03-08 04:50:54] [INFO ] Dead Transitions using invariants and state equation in 86 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/154 places, 96/98 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 152/154 places, 96/98 transitions.
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s5 0) (EQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2265 reset in 173 ms.
Product exploration explored 100000 steps with 2287 reset in 199 ms.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Detected a total of 55/152 stabilizing places and 50/96 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 237 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2093927 steps, run timeout after 3001 ms. (steps per millisecond=697 ) properties seen :{}
Probabilistic random walk after 2093927 steps, saw 282641 distinct states, run finished after 3001 ms. (steps per millisecond=697 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 04:50:57] [INFO ] Invariant cache hit.
[2023-03-08 04:50:57] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 04:50:57] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 04:50:57] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 18 ms returned sat
[2023-03-08 04:50:57] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 04:50:58] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2023-03-08 04:50:58] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2023-03-08 04:50:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 88 ms
[2023-03-08 04:50:58] [INFO ] After 181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 04:50:58] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 96/96 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 152 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 152 transition count 94
Applied a total of 3 rules in 11 ms. Remains 152 /152 variables (removed 0) and now considering 94/96 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 152/152 places, 94/96 transitions.
Incomplete random walk after 10000 steps, including 163 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 28 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2053274 steps, run timeout after 3001 ms. (steps per millisecond=684 ) properties seen :{}
Probabilistic random walk after 2053274 steps, saw 279106 distinct states, run finished after 3003 ms. (steps per millisecond=683 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:51:01] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 04:51:01] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 04:51:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:51:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2023-03-08 04:51:01] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 04:51:01] [INFO ] After 76ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-08 04:51:01] [INFO ] After 164ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 424 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=212 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 152 cols
[2023-03-08 04:51:01] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:51:01] [INFO ] Implicit Places using invariants in 101 ms returned []
[2023-03-08 04:51:01] [INFO ] Invariant cache hit.
[2023-03-08 04:51:01] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2023-03-08 04:51:01] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 04:51:01] [INFO ] Invariant cache hit.
[2023-03-08 04:51:02] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 152/152 places, 96/96 transitions.
Computed a total of 55 stabilizing places and 50 stable transitions
Computed a total of 55 stabilizing places and 50 stable transitions
Detected a total of 55/152 stabilizing places and 50/96 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 222 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 51 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2098103 steps, run timeout after 3001 ms. (steps per millisecond=699 ) properties seen :{}
Probabilistic random walk after 2098103 steps, saw 283245 distinct states, run finished after 3001 ms. (steps per millisecond=699 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 04:51:05] [INFO ] Invariant cache hit.
[2023-03-08 04:51:05] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 04:51:05] [INFO ] [Nat]Absence check using 32 positive place invariants in 4 ms returned sat
[2023-03-08 04:51:05] [INFO ] [Nat]Absence check using 32 positive and 26 generalized place invariants in 17 ms returned sat
[2023-03-08 04:51:05] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 04:51:05] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-08 04:51:05] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2023-03-08 04:51:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 102 ms
[2023-03-08 04:51:05] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 04:51:05] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 96/96 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 152 transition count 94
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 152 transition count 94
Applied a total of 3 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 94/96 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 152/152 places, 94/96 transitions.
Incomplete random walk after 10000 steps, including 161 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2082050 steps, run timeout after 3001 ms. (steps per millisecond=693 ) properties seen :{}
Probabilistic random walk after 2082050 steps, saw 282043 distinct states, run finished after 3001 ms. (steps per millisecond=693 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 94 rows 152 cols
[2023-03-08 04:51:08] [INFO ] Computed 60 place invariants in 4 ms
[2023-03-08 04:51:08] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 04:51:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 04:51:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2023-03-08 04:51:09] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 04:51:09] [INFO ] After 92ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 04:51:09] [INFO ] After 180ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 469 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=156 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2256 reset in 181 ms.
Product exploration explored 100000 steps with 2259 reset in 191 ms.
Support contains 2 out of 152 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 152/152 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 152 cols
[2023-03-08 04:51:09] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:51:09] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-08 04:51:09] [INFO ] Invariant cache hit.
[2023-03-08 04:51:09] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2023-03-08 04:51:10] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 04:51:10] [INFO ] Invariant cache hit.
[2023-03-08 04:51:10] [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 344 ms. Remains : 152/152 places, 96/96 transitions.
Treatment of property DES-PT-10a-LTLCardinality-14 finished in 16526 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(p0)))'
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 2 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:51:10] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:51:10] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 04:51:10] [INFO ] Invariant cache hit.
[2023-03-08 04:51:10] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
[2023-03-08 04:51:10] [INFO ] Invariant cache hit.
[2023-03-08 04:51:10] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 334 ms. Remains : 153/154 places, 97/98 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : DES-PT-10a-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=3, aps=[p0:(OR (EQ s26 0) (EQ s70 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 222 ms.
Product exploration explored 100000 steps with 33333 reset in 230 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p0, (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 3 factoid took 50 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-10a-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-10a-LTLCardinality-15 finished in 958 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : DES-PT-10a-LTLCardinality-01
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 15 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 04:51:11] [INFO ] Invariant cache hit.
[2023-03-08 04:51:11] [INFO ] Implicit Places using invariants in 98 ms returned []
[2023-03-08 04:51:11] [INFO ] Invariant cache hit.
[2023-03-08 04:51:11] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 254 ms to find 0 implicit places.
[2023-03-08 04:51:11] [INFO ] Invariant cache hit.
[2023-03-08 04:51:11] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 363 ms. Remains : 153/154 places, 97/98 transitions.
Running random walk in product with property : DES-PT-10a-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s7 0) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 194 ms.
Product exploration explored 100000 steps with 25000 reset in 212 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 04:51:12] [INFO ] Invariant cache hit.
[2023-03-08 04:51:12] [INFO ] [Real]Absence check using 33 positive place invariants in 10 ms returned sat
[2023-03-08 04:51:12] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 29 ms returned sat
[2023-03-08 04:51:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:51:13] [INFO ] [Real]Absence check using state equation in 431 ms returned sat
[2023-03-08 04:51:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:51:13] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:51:13] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-08 04:51:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:51:13] [INFO ] [Nat]Absence check using state equation in 143 ms returned sat
[2023-03-08 04:51:13] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 04:51:13] [INFO ] Added : 0 causal constraints over 0 iterations in 37 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:51:13] [INFO ] Invariant cache hit.
[2023-03-08 04:51:13] [INFO ] Implicit Places using invariants in 259 ms returned []
[2023-03-08 04:51:13] [INFO ] Invariant cache hit.
[2023-03-08 04:51:14] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-08 04:51:14] [INFO ] Invariant cache hit.
[2023-03-08 04:51:14] [INFO ] Dead Transitions using invariants and state equation in 68 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 499 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 70 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2023-03-08 04:51:14] [INFO ] Invariant cache hit.
[2023-03-08 04:51:14] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:51:14] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 04:51:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:51:15] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2023-03-08 04:51:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:51:15] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:51:15] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 54 ms returned sat
[2023-03-08 04:51:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:51:15] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-08 04:51:15] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 8 ms.
[2023-03-08 04:51:15] [INFO ] Added : 0 causal constraints over 0 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 198 ms.
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 113 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:51:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:51:16] [INFO ] Invariant cache hit.
[2023-03-08 04:51:16] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 102 ms. Remains : 153/153 places, 97/97 transitions.
Support contains 2 out of 153 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 0 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:51:16] [INFO ] Invariant cache hit.
[2023-03-08 04:51:16] [INFO ] Implicit Places using invariants in 82 ms returned []
[2023-03-08 04:51:16] [INFO ] Invariant cache hit.
[2023-03-08 04:51:16] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-08 04:51:16] [INFO ] Invariant cache hit.
[2023-03-08 04:51:16] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 356 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-01 finished in 5589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0&&(!p1 U X(!p2))))))'
Found a Lengthening insensitive property : DES-PT-10a-LTLCardinality-11
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) p2), p2, p2]
Support contains 6 out of 154 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 154/154 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 153 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 153 transition count 97
Applied a total of 2 rules in 4 ms. Remains 153 /154 variables (removed 1) and now considering 97/98 (removed 1) transitions.
[2023-03-08 04:51:16] [INFO ] Invariant cache hit.
[2023-03-08 04:51:17] [INFO ] Implicit Places using invariants in 124 ms returned []
[2023-03-08 04:51:17] [INFO ] Invariant cache hit.
[2023-03-08 04:51:17] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2023-03-08 04:51:17] [INFO ] Invariant cache hit.
[2023-03-08 04:51:17] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 153/154 places, 97/98 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 366 ms. Remains : 153/154 places, 97/98 transitions.
Running random walk in product with property : DES-PT-10a-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND p1 p2), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={0} source=2 dest: 1}, { cond=(AND p0 p1 p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s112 0) (EQ s151 1)), p1:(OR (EQ s33 0) (EQ s20 1)), p2:(OR (EQ s105 0) (EQ s80 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33551 reset in 252 ms.
Product exploration explored 100000 steps with 33348 reset in 271 ms.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 20 factoid took 847 ms. Reduced automaton from 3 states, 10 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 218 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 54 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 04:51:18] [INFO ] Invariant cache hit.
[2023-03-08 04:51:18] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:51:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:51:18] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 33 ms returned sat
[2023-03-08 04:51:19] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:51:19] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 0 ms to minimize.
[2023-03-08 04:51:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2023-03-08 04:51:19] [INFO ] After 216ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-08 04:51:19] [INFO ] After 385ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 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 153 transition count 95
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 153 transition count 95
Applied a total of 8 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 133 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 1341109 steps, run timeout after 3001 ms. (steps per millisecond=446 ) properties seen :{}
Probabilistic random walk after 1341109 steps, saw 187368 distinct states, run finished after 3001 ms. (steps per millisecond=446 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 04:51:22] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 04:51:22] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:51:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:51:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 04:51:22] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:51:22] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 04:51:22] [INFO ] After 61ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 04:51:22] [INFO ] After 151ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-08 04:51:23] [INFO ] After 444ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 41 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 04:51:23] [INFO ] Invariant cache hit.
[2023-03-08 04:51:23] [INFO ] Implicit Places using invariants in 100 ms returned []
[2023-03-08 04:51:23] [INFO ] Invariant cache hit.
[2023-03-08 04:51:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 04:51:23] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
[2023-03-08 04:51:23] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:51:23] [INFO ] Invariant cache hit.
[2023-03-08 04:51:23] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 359 ms. Remains : 153/153 places, 95/95 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 153 transition count 95
Applied a total of 1 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 04:51:23] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 04:51:23] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:51:23] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:51:23] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 04:51:23] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:51:23] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 1 ms to minimize.
[2023-03-08 04:51:23] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 0 ms to minimize.
[2023-03-08 04:51:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-08 04:51:23] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-08 04:51:23] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND p0 p1 p2))), (X (NOT (AND p1 p2))), (X (NOT (AND p0 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1) p2))), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 20 factoid took 962 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:51:25] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 04:51:25] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:51:25] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 17 ms returned sat
[2023-03-08 04:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:51:25] [INFO ] [Real]Absence check using state equation in 198 ms returned sat
[2023-03-08 04:51:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:51:25] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:51:25] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 57 ms returned sat
[2023-03-08 04:51:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:51:25] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-08 04:51:25] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 04:51:25] [INFO ] Added : 75 causal constraints over 15 iterations in 173 ms. Result :sat
Could not prove EG p2
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:51:25] [INFO ] Invariant cache hit.
[2023-03-08 04:51:25] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-03-08 04:51:25] [INFO ] Invariant cache hit.
[2023-03-08 04:51:26] [INFO ] Implicit Places using invariants and state equation in 122 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
[2023-03-08 04:51:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:51:26] [INFO ] Invariant cache hit.
[2023-03-08 04:51:26] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 153/153 places, 97/97 transitions.
Computed a total of 56 stabilizing places and 51 stable transitions
Computed a total of 56 stabilizing places and 51 stable transitions
Detected a total of 56/153 stabilizing places and 51/97 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 665 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) p2), p2, p2]
Incomplete random walk after 10000 steps, including 226 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 8) seen :5
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 48 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-08 04:51:27] [INFO ] Invariant cache hit.
[2023-03-08 04:51:27] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:51:27] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 04:51:27] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 34 ms returned sat
[2023-03-08 04:51:27] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:51:27] [INFO ] Deduced a trap composed of 9 places in 29 ms of which 1 ms to minimize.
[2023-03-08 04:51:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-08 04:51:27] [INFO ] After 200ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 66 ms.
[2023-03-08 04:51:27] [INFO ] After 359ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 44 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 97/97 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 153 transition count 95
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 153 transition count 95
Applied a total of 8 rules in 6 ms. Remains 153 /153 variables (removed 0) and now considering 95/97 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 153/153 places, 95/97 transitions.
Incomplete random walk after 10000 steps, including 131 resets, run finished after 180 ms. (steps per millisecond=55 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 952389 steps, run timeout after 3001 ms. (steps per millisecond=317 ) properties seen :{}
Probabilistic random walk after 952389 steps, saw 135359 distinct states, run finished after 3001 ms. (steps per millisecond=317 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 04:51:30] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 04:51:30] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:51:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 3 ms returned sat
[2023-03-08 04:51:31] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2023-03-08 04:51:31] [INFO ] After 96ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:51:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 04:51:31] [INFO ] After 64ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-08 04:51:31] [INFO ] After 119ms 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 04:51:31] [INFO ] After 387ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 41 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 153/153 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 95/95 transitions.
Applied a total of 0 rules in 2 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2023-03-08 04:51:31] [INFO ] Invariant cache hit.
[2023-03-08 04:51:31] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-08 04:51:31] [INFO ] Invariant cache hit.
[2023-03-08 04:51:31] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-08 04:51:31] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 362 ms to find 0 implicit places.
[2023-03-08 04:51:31] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:51:31] [INFO ] Invariant cache hit.
[2023-03-08 04:51:31] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 456 ms. Remains : 153/153 places, 95/95 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 153 transition count 95
Applied a total of 1 rules in 19 ms. Remains 153 /153 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 95 rows 153 cols
[2023-03-08 04:51:31] [INFO ] Computed 60 place invariants in 1 ms
[2023-03-08 04:51:31] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-08 04:51:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 04:51:32] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2023-03-08 04:51:32] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-08 04:51:32] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 0 ms to minimize.
[2023-03-08 04:51:32] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2023-03-08 04:51:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2023-03-08 04:51:32] [INFO ] After 304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-08 04:51:32] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p1 p2))), (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (OR (NOT p0) (AND p1 p2)))), (X (AND p0 p1 (NOT p2))), (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (X (NOT (AND p0 (NOT p1) p2))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (OR (NOT p0) (AND p1 p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (OR (AND p0 (NOT p1)) (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND p1 p2))), (F (AND p0 p1 (NOT p2))), (F (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (AND p1 p2)))), (F (NOT (OR (AND (NOT p0) p2) (AND p1 p2))))]
Knowledge based reduction with 18 factoid took 926 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) p2), p2, p2]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) p2), p2, p2]
// Phase 1: matrix 97 rows 153 cols
[2023-03-08 04:51:33] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 04:51:33] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:51:33] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 15 ms returned sat
[2023-03-08 04:51:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 04:51:33] [INFO ] [Real]Absence check using state equation in 130 ms returned sat
[2023-03-08 04:51:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 04:51:33] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 04:51:33] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 58 ms returned sat
[2023-03-08 04:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 04:51:34] [INFO ] [Nat]Absence check using state equation in 100 ms returned sat
[2023-03-08 04:51:34] [INFO ] Computed and/alt/rep : 89/267/89 causal constraints (skipped 7 transitions) in 7 ms.
[2023-03-08 04:51:34] [INFO ] Added : 75 causal constraints over 15 iterations in 169 ms. Result :sat
Could not prove EG p2
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) p2), p2, p2]
Product exploration explored 100000 steps with 24987 reset in 272 ms.
Product exploration explored 100000 steps with 25032 reset in 276 ms.
Support contains 6 out of 153 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 153/153 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 153 /153 variables (removed 0) and now considering 97/97 (removed 0) transitions.
[2023-03-08 04:51:34] [INFO ] Invariant cache hit.
[2023-03-08 04:51:35] [INFO ] Implicit Places using invariants in 117 ms returned []
[2023-03-08 04:51:35] [INFO ] Invariant cache hit.
[2023-03-08 04:51:35] [INFO ] Implicit Places using invariants and state equation in 123 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-08 04:51:35] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 04:51:35] [INFO ] Invariant cache hit.
[2023-03-08 04:51:35] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 350 ms. Remains : 153/153 places, 97/97 transitions.
Treatment of property DES-PT-10a-LTLCardinality-11 finished in 18658 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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)))'
[2023-03-08 04:51:35] [INFO ] Flatten gal took : 17 ms
[2023-03-08 04:51:35] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-08 04:51:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 154 places, 98 transitions and 485 arcs took 3 ms.
Total runtime 78901 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DES-PT-10a
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality

FORMULA DES-PT-10a-LTLCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DES-PT-10a-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678251171723

--------------------
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 LTLCardinality -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/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 DES-PT-10a-LTLCardinality-01
lola: time limit : 900 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for DES-PT-10a-LTLCardinality-01
lola: result : true
lola: markings : 9
lola: fired transitions : 11
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 DES-PT-10a-LTLCardinality-13
lola: time limit : 1200 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
7 LTL EXCL 5/1200 18/32 DES-PT-10a-LTLCardinality-13 2606644 m, 521328 m/sec, 3177070 t fired, .

Time elapsed: 5 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 4
lola: CANCELED task # 7 (type EXCL) for DES-PT-10a-LTLCardinality-13 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 1 0 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 10 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 4 (type EXCL) for 3 DES-PT-10a-LTLCardinality-11
lola: time limit : 1795 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1795 4/32 DES-PT-10a-LTLCardinality-11 513177 m, 102635 m/sec, 5948072 t fired, .

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1795 7/32 DES-PT-10a-LTLCardinality-11 973575 m, 92079 m/sec, 11877973 t fired, .

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1795 10/32 DES-PT-10a-LTLCardinality-11 1402259 m, 85736 m/sec, 17615971 t fired, .

Time elapsed: 25 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/1795 12/32 DES-PT-10a-LTLCardinality-11 1761905 m, 71929 m/sec, 23343991 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/1795 14/32 DES-PT-10a-LTLCardinality-11 2114064 m, 70431 m/sec, 29018851 t fired, .

Time elapsed: 35 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/1795 17/32 DES-PT-10a-LTLCardinality-11 2546671 m, 86521 m/sec, 34694928 t fired, .

Time elapsed: 40 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/1795 19/32 DES-PT-10a-LTLCardinality-11 2928553 m, 76376 m/sec, 40370626 t fired, .

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/1795 22/32 DES-PT-10a-LTLCardinality-11 3275782 m, 69445 m/sec, 46022278 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/1795 24/32 DES-PT-10a-LTLCardinality-11 3619280 m, 68699 m/sec, 51639148 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/1795 26/32 DES-PT-10a-LTLCardinality-11 3970096 m, 70163 m/sec, 57392678 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/1795 28/32 DES-PT-10a-LTLCardinality-11 4320666 m, 70114 m/sec, 63110993 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 1 0 1 0 0 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/1795 30/32 DES-PT-10a-LTLCardinality-11 4618625 m, 59591 m/sec, 68685710 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DES-PT-10a-LTLCardinality-11: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-13: LTL 0 0 0 0 1 0 1 0
DES-PT-10a-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 4
lola: LAUNCH task # 10 (type EXCL) for 9 DES-PT-10a-LTLCardinality-14
lola: time limit : 3525 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for DES-PT-10a-LTLCardinality-14
lola: result : false
lola: markings : 3349
lola: fired transitions : 3567
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 4

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DES-PT-10a-LTLCardinality-01: LTL true LTL model checker
DES-PT-10a-LTLCardinality-11: LTL unknown AGGR
DES-PT-10a-LTLCardinality-13: LTL unknown AGGR
DES-PT-10a-LTLCardinality-14: LTL false LTL model checker


Time elapsed: 75 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-10a"
export BK_EXAMINATION="LTLCardinality"
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-10a, examination is LTLCardinality"
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-167814478300411"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-10a.tgz
mv DES-PT-10a execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;