Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K Apr 29 12:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K Apr 29 12:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 29 12:39 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 12:39 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.6K May 9 08:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K May 9 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 6 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 14M May 10 09:34 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652803741844

Running Version 202205111006
[2022-05-17 16:09:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 16:09:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 16:09:04] [INFO ] Load time of PNML (sax parser for PT used): 746 ms
[2022-05-17 16:09:04] [INFO ] Transformed 21462 places.
[2022-05-17 16:09:04] [INFO ] Transformed 21129 transitions.
[2022-05-17 16:09:04] [INFO ] Parsed PT model containing 21462 places and 21129 transitions in 966 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 25 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4219 places and 0 transitions.
Iterating post reduction 0 with 4219 rules applied. Total rules applied 4219 place count 17243 transition count 21129
Applied a total of 4219 rules in 319 ms. Remains 17243 /21462 variables (removed 4219) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17243 cols
[2022-05-17 16:09:07] [INFO ] Computed 198 place invariants in 1918 ms
[2022-05-17 16:09:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:09:09] [INFO ] Implicit Places using invariants in 3716 ms returned []
Implicit Place search using SMT only with invariants took 3743 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17243 cols
[2022-05-17 16:09:10] [INFO ] Computed 198 place invariants in 1840 ms
[2022-05-17 16:09:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:09:12] [INFO ] Dead Transitions using invariants and state equation in 3461 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17243/21462 places, 21129/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17243/21462 places, 21129/21129 transitions.
Support contains 32 out of 17243 places after structural reductions.
[2022-05-17 16:09:13] [INFO ] Flatten gal took : 848 ms
[2022-05-17 16:09:14] [INFO ] Flatten gal took : 657 ms
[2022-05-17 16:09:15] [INFO ] Input system was already deterministic with 21129 transitions.
Incomplete random walk after 10000 steps, including 388 resets, run finished after 888 ms. (steps per millisecond=11 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Interrupted probabilistic random walk after 9214 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{4=1, 16=1}
Probabilistic random walk after 9214 steps, saw 5108 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :2
Running SMT prover for 18 properties.
// Phase 1: matrix 21129 rows 17243 cols
[2022-05-17 16:09:21] [INFO ] Computed 198 place invariants in 1680 ms
[2022-05-17 16:09:27] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 418 ms returned sat
[2022-05-17 16:09:28] [INFO ] After 6698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2022-05-17 16:09:34] [INFO ] [Nat]Absence check using 0 positive and 198 generalized place invariants in 388 ms returned sat
[2022-05-17 16:09:53] [INFO ] After 15152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2022-05-17 16:09:53] [INFO ] After 15194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 11 ms.
[2022-05-17 16:09:53] [INFO ] After 25081ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Fused 18 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 26 out of 17243 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Graph (complete) has 38166 edges and 17243 vertex of which 1321 are kept as prefixes of interest. Removing 15922 places using SCC suffix rule.39 ms
Discarding 15922 places :
Also discarding 11555 output transitions
Drop transitions removed 11555 transitions
Drop transitions removed 4250 transitions
Reduce isomorphic transitions removed 4250 transitions.
Drop transitions removed 507 transitions
Trivial Post-agglo rules discarded 507 transitions
Performed 507 trivial Post agglomeration. Transition count delta: 507
Iterating post reduction 0 with 4757 rules applied. Total rules applied 4758 place count 1321 transition count 4817
Reduce places removed 509 places and 0 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 525 rules applied. Total rules applied 5283 place count 812 transition count 4801
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 5299 place count 796 transition count 4801
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 5299 place count 796 transition count 4778
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 5345 place count 773 transition count 4778
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 5350 place count 773 transition count 4773
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 5355 place count 768 transition count 4773
Partial Free-agglomeration rule applied 496 times.
Drop transitions removed 496 transitions
Iterating global reduction 4 with 496 rules applied. Total rules applied 5851 place count 768 transition count 4773
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 4 with 16 rules applied. Total rules applied 5867 place count 752 transition count 4773
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 5878 place count 752 transition count 4762
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 5889 place count 741 transition count 4762
Applied a total of 5889 rules in 645 ms. Remains 741 /17243 variables (removed 16502) and now considering 4762/21129 (removed 16367) transitions.
Finished structural reductions, in 1 iterations. Remains : 741/17243 places, 4762/21129 transitions.
Incomplete random walk after 10000 steps, including 1385 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 18) seen :12
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2022-05-17 16:09:54] [INFO ] Flow matrix only has 1189 transitions (discarded 3573 similar events)
// Phase 1: matrix 1189 rows 741 cols
[2022-05-17 16:09:54] [INFO ] Computed 2 place invariants in 14 ms
[2022-05-17 16:09:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-17 16:09:54] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2022-05-17 16:09:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-17 16:09:55] [INFO ] After 499ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 6 atomic propositions for a total of 12 simplifications.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17243 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17243 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(!G(X(p0))) U !F(p1))))'
Support contains 3 out of 17243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 17234 transition count 21129
Applied a total of 9 rules in 105 ms. Remains 17234 /17243 variables (removed 9) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:09:57] [INFO ] Computed 198 place invariants in 1667 ms
[2022-05-17 16:09:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:09:58] [INFO ] Implicit Places using invariants in 3289 ms returned []
Implicit Place search using SMT only with invariants took 3290 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:10:00] [INFO ] Computed 198 place invariants in 1544 ms
[2022-05-17 16:10:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:10:01] [INFO ] Dead Transitions using invariants and state equation in 3123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17234/17243 places, 21129/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17234/17243 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 309 ms :[p1, p1, p0, (AND p0 (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LEQ s8962 s2918), p0:(LEQ 1 s17079)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25033 reset in 8339 ms.
Product exploration explored 100000 steps with 24975 reset in 8097 ms.
Computed a total of 17234 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17234 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 371 ms. Reduced automaton from 4 states, 8 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 260 ms :[(OR p0 p1), p1, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 387 resets, run finished after 415 ms. (steps per millisecond=24 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 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 21129 rows 17234 cols
[2022-05-17 16:10:41] [INFO ] Computed 198 place invariants in 1684 ms
[2022-05-17 16:10:43] [INFO ] After 2063ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-17 16:10:45] [INFO ] [Nat]Absence check using 0 positive and 198 generalized place invariants in 343 ms returned sat
[2022-05-17 16:11:08] [INFO ] After 22203ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:11:08] [INFO ] After 22219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-17 16:11:08] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 17234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17234/17234 places, 21129/21129 transitions.
Graph (complete) has 38157 edges and 17234 vertex of which 336 are kept as prefixes of interest. Removing 16898 places using SCC suffix rule.9 ms
Discarding 16898 places :
Also discarding 12607 output transitions
Drop transitions removed 12607 transitions
Drop transitions removed 4289 transitions
Reduce isomorphic transitions removed 4289 transitions.
Discarding 61 places :
Implicit places reduction removed 61 places
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 4414 rules applied. Total rules applied 4415 place count 275 transition count 4169
Reduce places removed 68 places and 0 transitions.
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 1 with 193 rules applied. Total rules applied 4608 place count 207 transition count 4044
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 4671 place count 144 transition count 4044
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 4671 place count 144 transition count 4041
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 4677 place count 141 transition count 4041
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 4680 place count 141 transition count 4038
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 4683 place count 138 transition count 4038
Free-agglomeration rule (complex) applied 61 times.
Iterating global reduction 4 with 61 rules applied. Total rules applied 4744 place count 138 transition count 3977
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 4 with 61 rules applied. Total rules applied 4805 place count 77 transition count 3977
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 5 with 62 rules applied. Total rules applied 4867 place count 77 transition count 3977
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 5 with 2 rules applied. Total rules applied 4869 place count 75 transition count 3977
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 6 with 2 rules applied. Total rules applied 4871 place count 75 transition count 3975
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 4873 place count 73 transition count 3975
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 7 with 62 rules applied. Total rules applied 4935 place count 73 transition count 3913
Applied a total of 4935 rules in 590 ms. Remains 73 /17234 variables (removed 17161) and now considering 3913/21129 (removed 17216) transitions.
[2022-05-17 16:11:08] [INFO ] Flow matrix only has 132 transitions (discarded 3781 similar events)
// Phase 1: matrix 132 rows 73 cols
[2022-05-17 16:11:08] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-17 16:11:09] [INFO ] Dead Transitions using invariants and state equation in 1048 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 73/17234 places, 3913/21129 transitions.
Finished random walk after 2253 steps, including 607 resets, run visited all 2 properties in 97 ms. (steps per millisecond=23 )
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (AND p1 p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 940 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 132 ms :[(OR p0 p1), p1, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 162 ms :[(OR p0 p1), p1, p0, (AND p0 (NOT p1))]
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:11:12] [INFO ] Computed 198 place invariants in 1573 ms
Could not prove EG p1
Support contains 3 out of 17234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17234/17234 places, 21129/21129 transitions.
Graph (complete) has 42514 edges and 17234 vertex of which 17232 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.45 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8317 transitions
Trivial Post-agglo rules discarded 8317 transitions
Performed 8317 trivial Post agglomeration. Transition count delta: 8317
Iterating post reduction 0 with 8317 rules applied. Total rules applied 8318 place count 17232 transition count 12810
Reduce places removed 8317 places and 0 transitions.
Iterating post reduction 1 with 8317 rules applied. Total rules applied 16635 place count 8915 transition count 12810
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16635 place count 8915 transition count 12680
Deduced a syphon composed of 130 places in 3 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16895 place count 8785 transition count 12680
Discarding 4028 places :
Symmetric choice reduction at 2 with 4028 rule applications. Total rules 20923 place count 4757 transition count 8652
Iterating global reduction 2 with 4028 rules applied. Total rules applied 24951 place count 4757 transition count 8652
Applied a total of 24951 rules in 2341 ms. Remains 4757 /17234 variables (removed 12477) and now considering 8652/21129 (removed 12477) transitions.
// Phase 1: matrix 8652 rows 4757 cols
[2022-05-17 16:11:30] [INFO ] Computed 198 place invariants in 90 ms
[2022-05-17 16:11:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:11:33] [INFO ] Implicit Places using invariants in 3568 ms returned [249, 890, 1458, 2420, 2667]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3576 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4752/17234 places, 8652/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4749 transition count 8649
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4749 transition count 8649
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4746 transition count 8646
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4746 transition count 8646
Discarding 91 places :
Symmetric choice reduction at 0 with 91 rule applications. Total rules 103 place count 4655 transition count 8555
Iterating global reduction 0 with 91 rules applied. Total rules applied 194 place count 4655 transition count 8555
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 198 place count 4653 transition count 8553
Applied a total of 198 rules in 3020 ms. Remains 4653 /4752 variables (removed 99) and now considering 8553/8652 (removed 99) transitions.
[2022-05-17 16:11:36] [INFO ] Flow matrix only has 8462 transitions (discarded 91 similar events)
// Phase 1: matrix 8462 rows 4653 cols
[2022-05-17 16:11:36] [INFO ] Computed 193 place invariants in 90 ms
[2022-05-17 16:11:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:11:40] [INFO ] Implicit Places using invariants in 3223 ms returned [178, 1177, 1640, 2819, 3278]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3231 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4648/17234 places, 8553/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 4645 transition count 8550
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 4645 transition count 8550
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 4642 transition count 8547
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 4642 transition count 8547
Discarding 66 places :
Symmetric choice reduction at 0 with 66 rule applications. Total rules 78 place count 4576 transition count 8481
Iterating global reduction 0 with 66 rules applied. Total rules applied 144 place count 4576 transition count 8481
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 148 place count 4574 transition count 8479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 150 place count 4572 transition count 8477
Iterating global reduction 0 with 2 rules applied. Total rules applied 152 place count 4572 transition count 8477
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 220 place count 4504 transition count 8409
Iterating global reduction 0 with 68 rules applied. Total rules applied 288 place count 4504 transition count 8409
Applied a total of 288 rules in 3659 ms. Remains 4504 /4648 variables (removed 144) and now considering 8409/8553 (removed 144) transitions.
[2022-05-17 16:11:43] [INFO ] Flow matrix only has 8184 transitions (discarded 225 similar events)
// Phase 1: matrix 8184 rows 4504 cols
[2022-05-17 16:11:43] [INFO ] Computed 188 place invariants in 79 ms
[2022-05-17 16:11:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:11:47] [INFO ] Implicit Places using invariants in 3258 ms returned [784, 998, 1753, 2520, 3595]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3264 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4499/17234 places, 8409/21129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4498 transition count 8408
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4498 transition count 8408
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4497 transition count 8407
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4497 transition count 8407
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 36 place count 4465 transition count 8375
Iterating global reduction 0 with 32 rules applied. Total rules applied 68 place count 4465 transition count 8375
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 310 place count 4344 transition count 8254
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 312 place count 4342 transition count 8252
Iterating global reduction 0 with 2 rules applied. Total rules applied 314 place count 4342 transition count 8252
Discarding 62 places :
Symmetric choice reduction at 0 with 62 rule applications. Total rules 376 place count 4280 transition count 8190
Iterating global reduction 0 with 62 rules applied. Total rules applied 438 place count 4280 transition count 8190
Applied a total of 438 rules in 3501 ms. Remains 4280 /4499 variables (removed 219) and now considering 8190/8409 (removed 219) transitions.
[2022-05-17 16:11:50] [INFO ] Flow matrix only has 7869 transitions (discarded 321 similar events)
// Phase 1: matrix 7869 rows 4280 cols
[2022-05-17 16:11:50] [INFO ] Computed 183 place invariants in 80 ms
[2022-05-17 16:11:51] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:11:53] [INFO ] Implicit Places using invariants in 2960 ms returned [802, 1951, 2591, 2660, 2729]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2968 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4275/17234 places, 8190/21129 transitions.
Discarding 117 places :
Symmetric choice reduction at 0 with 117 rule applications. Total rules 117 place count 4158 transition count 8073
Iterating global reduction 0 with 117 rules applied. Total rules applied 234 place count 4158 transition count 8073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 235 place count 4157 transition count 8072
Iterating global reduction 0 with 1 rules applied. Total rules applied 236 place count 4157 transition count 8072
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 250 place count 4143 transition count 8058
Iterating global reduction 0 with 14 rules applied. Total rules applied 264 place count 4143 transition count 8058
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 382 place count 4084 transition count 7999
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 383 place count 4083 transition count 7998
Iterating global reduction 0 with 1 rules applied. Total rules applied 384 place count 4083 transition count 7998
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 429 place count 4038 transition count 7953
Iterating global reduction 0 with 45 rules applied. Total rules applied 474 place count 4038 transition count 7953
Applied a total of 474 rules in 3471 ms. Remains 4038 /4275 variables (removed 237) and now considering 7953/8190 (removed 237) transitions.
[2022-05-17 16:11:56] [INFO ] Flow matrix only has 7568 transitions (discarded 385 similar events)
// Phase 1: matrix 7568 rows 4038 cols
[2022-05-17 16:11:57] [INFO ] Computed 178 place invariants in 66 ms
[2022-05-17 16:11:59] [INFO ] Implicit Places using invariants in 2823 ms returned [302, 837, 1068, 1271, 1947]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2835 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 4033/17234 places, 7953/21129 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 4002 transition count 7922
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 4002 transition count 7922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 4001 transition count 7921
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 4001 transition count 7921
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 86 place count 3979 transition count 7899
Iterating global reduction 0 with 22 rules applied. Total rules applied 108 place count 3979 transition count 7899
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 1 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 0 with 182 rules applied. Total rules applied 290 place count 3888 transition count 7808
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 292 place count 3886 transition count 7806
Iterating global reduction 0 with 2 rules applied. Total rules applied 294 place count 3886 transition count 7806
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 352 place count 3828 transition count 7748
Iterating global reduction 0 with 58 rules applied. Total rules applied 410 place count 3828 transition count 7748
Applied a total of 410 rules in 2848 ms. Remains 3828 /4033 variables (removed 205) and now considering 7748/7953 (removed 205) transitions.
[2022-05-17 16:12:02] [INFO ] Flow matrix only has 7274 transitions (discarded 474 similar events)
// Phase 1: matrix 7274 rows 3828 cols
[2022-05-17 16:12:02] [INFO ] Computed 173 place invariants in 70 ms
[2022-05-17 16:12:05] [INFO ] Implicit Places using invariants in 2686 ms returned [1442, 1735, 2030, 2812, 3580]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2694 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3823/17234 places, 7748/21129 transitions.
Discarding 57 places :
Symmetric choice reduction at 0 with 57 rule applications. Total rules 57 place count 3766 transition count 7691
Iterating global reduction 0 with 57 rules applied. Total rules applied 114 place count 3766 transition count 7691
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 115 place count 3765 transition count 7690
Iterating global reduction 0 with 1 rules applied. Total rules applied 116 place count 3765 transition count 7690
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 142 place count 3739 transition count 7664
Iterating global reduction 0 with 26 rules applied. Total rules applied 168 place count 3739 transition count 7664
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 2 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 0 with 228 rules applied. Total rules applied 396 place count 3625 transition count 7550
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 397 place count 3624 transition count 7549
Iterating global reduction 0 with 1 rules applied. Total rules applied 398 place count 3624 transition count 7549
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 430 place count 3592 transition count 7517
Iterating global reduction 0 with 32 rules applied. Total rules applied 462 place count 3592 transition count 7517
Applied a total of 462 rules in 2551 ms. Remains 3592 /3823 variables (removed 231) and now considering 7517/7748 (removed 231) transitions.
[2022-05-17 16:12:07] [INFO ] Flow matrix only has 6978 transitions (discarded 539 similar events)
// Phase 1: matrix 6978 rows 3592 cols
[2022-05-17 16:12:07] [INFO ] Computed 168 place invariants in 66 ms
[2022-05-17 16:12:11] [INFO ] Implicit Places using invariants in 3654 ms returned [3, 32, 61, 64, 93, 122, 125, 182, 185, 215, 218, 247, 276, 307, 336, 339, 368, 397, 400, 429, 458, 461, 490, 519, 522, 551, 580, 583, 612, 641, 676, 679, 709, 720, 748, 752, 782, 811, 840, 843, 872, 901, 906, 936, 965, 994, 997, 1026, 1055, 1058, 1088, 1091, 1121, 1124, 1153, 1182, 1185, 1214, 1243, 1252, 1280, 1283, 1312, 1341, 1344, 1374, 1380, 1408, 1411, 1440, 1469, 1472, 1501, 1530, 1533, 1562, 1591, 1598, 1627, 1629, 1659, 1690, 1719, 1748, 1752, 1780, 1783, 1812, 1841, 1844, 1873, 1902, 1909, 1911, 1939, 1942, 1971, 2000, 2003, 2032, 2061, 2063, 2094, 2123, 2155, 2184, 2216, 2245, 2274, 2277, 2306, 2335, 2338, 2367, 2396, 2399, 2437, 2440, 2469, 2498, 2501, 2530, 2559, 2562, 2591, 2623, 2652, 2681, 2684, 2713, 2742, 2745, 2774, 2806, 2835, 2864, 2867, 2896, 2925, 2928, 2957, 2986, 2989, 3018, 3047, 3050, 3079, 3108, 3111, 3140, 3169, 3172, 3201, 3230, 3233, 3262, 3291, 3294, 3323, 3355, 3384, 3413, 3416, 3477]
Discarding 164 places :
Implicit Place search using SMT only with invariants took 3662 ms to find 164 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3428/17234 places, 7517/21129 transitions.
Discarding 3054 places :
Symmetric choice reduction at 0 with 3054 rule applications. Total rules 3054 place count 374 transition count 4463
Iterating global reduction 0 with 3054 rules applied. Total rules applied 6108 place count 374 transition count 4463
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 6214 place count 268 transition count 4357
Iterating global reduction 0 with 106 rules applied. Total rules applied 6320 place count 268 transition count 4357
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 6426 place count 162 transition count 4251
Iterating global reduction 0 with 106 rules applied. Total rules applied 6532 place count 162 transition count 4251
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 6552 place count 152 transition count 4241
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6554 place count 150 transition count 4239
Iterating global reduction 0 with 2 rules applied. Total rules applied 6556 place count 150 transition count 4239
Applied a total of 6556 rules in 173 ms. Remains 150 /3428 variables (removed 3278) and now considering 4239/7517 (removed 3278) transitions.
[2022-05-17 16:12:11] [INFO ] Flow matrix only has 210 transitions (discarded 4029 similar events)
// Phase 1: matrix 210 rows 150 cols
[2022-05-17 16:12:11] [INFO ] Computed 4 place invariants in 4 ms
[2022-05-17 16:12:12] [INFO ] Implicit Places using invariants in 297 ms returned []
[2022-05-17 16:12:12] [INFO ] Flow matrix only has 210 transitions (discarded 4029 similar events)
// Phase 1: matrix 210 rows 150 cols
[2022-05-17 16:12:12] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:12:12] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 150/17234 places, 4239/21129 transitions.
Finished structural reductions, in 8 iterations. Remains : 150/17234 places, 4239/21129 transitions.
Computed a total of 150 stabilizing places and 4239 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 150 transition count 4239
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 392 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 148 ms :[(OR p0 p1), p1, p0, (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 762 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-17 16:12:13] [INFO ] Flow matrix only has 210 transitions (discarded 4029 similar events)
// Phase 1: matrix 210 rows 150 cols
[2022-05-17 16:12:13] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-17 16:12:13] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-17 16:12:13] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 3 ms returned sat
[2022-05-17 16:12:13] [INFO ] After 43ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-17 16:12:13] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2022-05-17 16:12:13] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 150/150 places, 4239/4239 transitions.
Graph (complete) has 481 edges and 150 vertex of which 142 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 136 transitions
Reduce isomorphic transitions removed 136 transitions.
Iterating post reduction 0 with 136 rules applied. Total rules applied 137 place count 142 transition count 4103
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 203 place count 138 transition count 4041
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 203 place count 138 transition count 4038
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 209 place count 135 transition count 4038
Free-agglomeration rule (complex) applied 63 times.
Iterating global reduction 2 with 63 rules applied. Total rules applied 272 place count 135 transition count 3975
Reduce places removed 63 places and 0 transitions.
Iterating post reduction 2 with 63 rules applied. Total rules applied 335 place count 72 transition count 3975
Partial Free-agglomeration rule applied 62 times.
Drop transitions removed 62 transitions
Iterating global reduction 3 with 62 rules applied. Total rules applied 397 place count 72 transition count 3975
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 3 with 2 rules applied. Total rules applied 399 place count 70 transition count 3975
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 401 place count 70 transition count 3973
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 403 place count 68 transition count 3973
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 5 with 62 rules applied. Total rules applied 465 place count 68 transition count 3911
Applied a total of 465 rules in 557 ms. Remains 68 /150 variables (removed 82) and now considering 3911/4239 (removed 328) transitions.
[2022-05-17 16:12:14] [INFO ] Flow matrix only has 130 transitions (discarded 3781 similar events)
// Phase 1: matrix 130 rows 68 cols
[2022-05-17 16:12:14] [INFO ] Computed 1 place invariants in 2 ms
[2022-05-17 16:12:15] [INFO ] Dead Transitions using invariants and state equation in 1296 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 68/150 places, 3911/4239 transitions.
Finished random walk after 227 steps, including 60 resets, run visited all 1 properties in 6 ms. (steps per millisecond=37 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) p0))), (X p1), (X (NOT (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (NOT p1)), (F p0), (F (AND p1 p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 10 factoid took 425 ms. Reduced automaton from 4 states, 9 edges and 2 AP to 4 states, 9 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(OR p0 p1), p1, p0, (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 114 ms :[(OR p0 p1), p1, p0, (AND p0 (NOT p1))]
[2022-05-17 16:12:16] [INFO ] Flow matrix only has 210 transitions (discarded 4029 similar events)
// Phase 1: matrix 210 rows 150 cols
[2022-05-17 16:12:16] [INFO ] Computed 4 place invariants in 3 ms
[2022-05-17 16:12:17] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 16:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 16:12:17] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2022-05-17 16:12:17] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 16:12:18] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2022-05-17 16:12:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 16:12:18] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2022-05-17 16:12:18] [INFO ] Computed and/alt/rep : 73/79/73 causal constraints (skipped 72 transitions) in 47 ms.
[2022-05-17 16:12:18] [INFO ] Added : 3 causal constraints over 1 iterations in 102 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 133 ms :[(OR p0 p1), p1, p0, (AND p0 (NOT p1))]
Stuttering criterion allowed to conclude after 8078 steps with 2702 reset in 58 ms.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-00 finished in 143196 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X(G(F(p0)))))'
Support contains 2 out of 17243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Graph (complete) has 42523 edges and 17243 vertex of which 17232 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.23 ms
Discarding 11 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8318 transitions
Trivial Post-agglo rules discarded 8318 transitions
Performed 8318 trivial Post agglomeration. Transition count delta: 8318
Iterating post reduction 0 with 8318 rules applied. Total rules applied 8319 place count 17232 transition count 12809
Reduce places removed 8318 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16638 place count 8914 transition count 12808
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16639 place count 8913 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 16639 place count 8913 transition count 12678
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 16899 place count 8783 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20928 place count 4754 transition count 8649
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24957 place count 4754 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24957 place count 4754 transition count 8648
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24959 place count 4753 transition count 8648
Applied a total of 24959 rules in 1999 ms. Remains 4753 /17243 variables (removed 12490) and now considering 8648/21129 (removed 12481) transitions.
// Phase 1: matrix 8648 rows 4753 cols
[2022-05-17 16:12:20] [INFO ] Computed 198 place invariants in 88 ms
[2022-05-17 16:12:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:12:24] [INFO ] Implicit Places using invariants in 3531 ms returned [642, 1210, 1917, 3945]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 3543 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4749/17243 places, 8648/21129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 4748 transition count 8647
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 4748 transition count 8647
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 4747 transition count 8646
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 4747 transition count 8646
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 28 place count 4723 transition count 8622
Iterating global reduction 0 with 24 rules applied. Total rules applied 52 place count 4723 transition count 8622
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 2 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 0 with 128 rules applied. Total rules applied 180 place count 4659 transition count 8558
Applied a total of 180 rules in 2491 ms. Remains 4659 /4749 variables (removed 90) and now considering 8558/8648 (removed 90) transitions.
[2022-05-17 16:12:26] [INFO ] Flow matrix only has 8534 transitions (discarded 24 similar events)
// Phase 1: matrix 8534 rows 4659 cols
[2022-05-17 16:12:26] [INFO ] Computed 194 place invariants in 90 ms
[2022-05-17 16:12:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:12:30] [INFO ] Implicit Places using invariants in 3601 ms returned [1234, 2568, 2708, 3338, 3411]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3609 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4654/17243 places, 8558/21129 transitions.
Discarding 128 places :
Symmetric choice reduction at 0 with 128 rule applications. Total rules 128 place count 4526 transition count 8430
Iterating global reduction 0 with 128 rules applied. Total rules applied 256 place count 4526 transition count 8430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 257 place count 4525 transition count 8429
Iterating global reduction 0 with 1 rules applied. Total rules applied 258 place count 4525 transition count 8429
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 276 place count 4507 transition count 8411
Iterating global reduction 0 with 18 rules applied. Total rules applied 294 place count 4507 transition count 8411
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 1 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 0 with 256 rules applied. Total rules applied 550 place count 4379 transition count 8283
Applied a total of 550 rules in 2283 ms. Remains 4379 /4654 variables (removed 275) and now considering 8283/8558 (removed 275) transitions.
[2022-05-17 16:12:32] [INFO ] Flow matrix only has 8240 transitions (discarded 43 similar events)
// Phase 1: matrix 8240 rows 4379 cols
[2022-05-17 16:12:32] [INFO ] Computed 189 place invariants in 86 ms
[2022-05-17 16:12:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:12:35] [INFO ] Implicit Places using invariants in 3064 ms returned [693, 1294, 2982, 3212, 3391]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3072 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4374/17243 places, 8283/21129 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 4309 transition count 8218
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 4309 transition count 8218
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 131 place count 4308 transition count 8217
Iterating global reduction 0 with 1 rules applied. Total rules applied 132 place count 4308 transition count 8217
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 149 place count 4291 transition count 8200
Iterating global reduction 0 with 17 rules applied. Total rules applied 166 place count 4291 transition count 8200
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 2 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 0 with 254 rules applied. Total rules applied 420 place count 4164 transition count 8073
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 421 place count 4163 transition count 8072
Iterating global reduction 0 with 1 rules applied. Total rules applied 422 place count 4163 transition count 8072
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 442 place count 4143 transition count 8052
Iterating global reduction 0 with 20 rules applied. Total rules applied 462 place count 4143 transition count 8052
Applied a total of 462 rules in 2767 ms. Remains 4143 /4374 variables (removed 231) and now considering 8052/8283 (removed 231) transitions.
[2022-05-17 16:12:38] [INFO ] Flow matrix only has 7962 transitions (discarded 90 similar events)
// Phase 1: matrix 7962 rows 4143 cols
[2022-05-17 16:12:38] [INFO ] Computed 184 place invariants in 86 ms
[2022-05-17 16:12:40] [INFO ] Implicit Places using invariants in 2644 ms returned [96, 411, 1615, 2027, 2342]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2652 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4138/17243 places, 8052/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4134 transition count 8048
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4134 transition count 8048
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 4130 transition count 8044
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 4130 transition count 8044
Discarding 107 places :
Symmetric choice reduction at 0 with 107 rule applications. Total rules 123 place count 4023 transition count 7937
Iterating global reduction 0 with 107 rules applied. Total rules applied 230 place count 4023 transition count 7937
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 232 place count 4022 transition count 7936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 233 place count 4021 transition count 7935
Iterating global reduction 0 with 1 rules applied. Total rules applied 234 place count 4021 transition count 7935
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 265 place count 3990 transition count 7904
Iterating global reduction 0 with 31 rules applied. Total rules applied 296 place count 3990 transition count 7904
Applied a total of 296 rules in 2762 ms. Remains 3990 /4138 variables (removed 148) and now considering 7904/8052 (removed 148) transitions.
[2022-05-17 16:12:43] [INFO ] Flow matrix only has 7654 transitions (discarded 250 similar events)
// Phase 1: matrix 7654 rows 3990 cols
[2022-05-17 16:12:43] [INFO ] Computed 179 place invariants in 75 ms
[2022-05-17 16:12:46] [INFO ] Implicit Places using invariants in 2717 ms returned [729, 1209, 1655, 2235, 3428]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2724 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 3985/17243 places, 7904/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3981 transition count 7900
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3981 transition count 7900
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3979 transition count 7898
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3979 transition count 7898
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 68 place count 3923 transition count 7842
Iterating global reduction 0 with 56 rules applied. Total rules applied 124 place count 3923 transition count 7842
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 1 ms
Reduce places removed 119 places and 0 transitions.
Iterating global reduction 0 with 238 rules applied. Total rules applied 362 place count 3804 transition count 7723
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 363 place count 3803 transition count 7722
Iterating global reduction 0 with 1 rules applied. Total rules applied 364 place count 3803 transition count 7722
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 390 place count 3777 transition count 7696
Iterating global reduction 0 with 26 rules applied. Total rules applied 416 place count 3777 transition count 7696
Applied a total of 416 rules in 2342 ms. Remains 3777 /3985 variables (removed 208) and now considering 7696/7904 (removed 208) transitions.
[2022-05-17 16:12:48] [INFO ] Flow matrix only has 7348 transitions (discarded 348 similar events)
// Phase 1: matrix 7348 rows 3777 cols
[2022-05-17 16:12:48] [INFO ] Computed 174 place invariants in 74 ms
[2022-05-17 16:12:52] [INFO ] Implicit Places using invariants in 4074 ms returned [3, 32, 61, 64, 121, 124, 153, 182, 185, 214, 243, 246, 275, 304, 307, 336, 365, 368, 398, 401, 430, 459, 462, 491, 520, 551, 580, 583, 613, 616, 645, 674, 677, 707, 710, 739, 768, 771, 800, 829, 832, 861, 890, 893, 922, 951, 962, 992, 1021, 1050, 1053, 1083, 1114, 1144, 1147, 1176, 1205, 1208, 1237, 1266, 1269, 1298, 1327, 1330, 1359, 1388, 1391, 1420, 1449, 1459, 1489, 1519, 1550, 1611, 1614, 1643, 1672, 1675, 1704, 1733, 1736, 1765, 1794, 1796, 1798, 1828, 1831, 1860, 1889, 1892, 1921, 1950, 1953, 1982, 2011, 2014, 2043, 2075, 2111, 2140, 2172, 2201, 2230, 2233, 2262, 2291, 2294, 2323, 2352, 2355, 2384, 2413, 2416, 2445, 2474, 2477, 2506, 2535, 2538, 2574, 2577, 2606, 2635, 2638, 2667, 2699, 2728, 2764, 2792, 2795, 2824, 2853, 2856, 2885, 2917, 2946, 2975, 2978, 3007, 3036, 3039, 3068, 3097, 3100, 3137, 3140, 3169, 3198, 3201, 3230, 3259, 3262, 3290, 3293, 3322, 3351, 3354, 3383, 3412, 3415, 3444, 3473, 3476, 3505, 3534, 3537, 3566, 3595, 3598, 3627, 3656]
Discarding 171 places :
Implicit Place search using SMT only with invariants took 4087 ms to find 171 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3606/17243 places, 7696/21129 transitions.
Discarding 3227 places :
Symmetric choice reduction at 0 with 3227 rule applications. Total rules 3227 place count 379 transition count 4469
Iterating global reduction 0 with 3227 rules applied. Total rules applied 6454 place count 379 transition count 4469
Discarding 114 places :
Symmetric choice reduction at 0 with 114 rule applications. Total rules 6568 place count 265 transition count 4355
Iterating global reduction 0 with 114 rules applied. Total rules applied 6682 place count 265 transition count 4355
Discarding 114 places :
Symmetric choice reduction at 0 with 114 rule applications. Total rules 6796 place count 151 transition count 4241
Iterating global reduction 0 with 114 rules applied. Total rules applied 6910 place count 151 transition count 4241
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 6922 place count 145 transition count 4235
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6923 place count 144 transition count 4234
Iterating global reduction 0 with 1 rules applied. Total rules applied 6924 place count 144 transition count 4234
Applied a total of 6924 rules in 177 ms. Remains 144 /3606 variables (removed 3462) and now considering 4234/7696 (removed 3462) transitions.
[2022-05-17 16:12:53] [INFO ] Flow matrix only has 173 transitions (discarded 4061 similar events)
// Phase 1: matrix 173 rows 144 cols
[2022-05-17 16:12:53] [INFO ] Computed 3 place invariants in 3 ms
[2022-05-17 16:12:53] [INFO ] Implicit Places using invariants in 285 ms returned []
[2022-05-17 16:12:53] [INFO ] Flow matrix only has 173 transitions (discarded 4061 similar events)
// Phase 1: matrix 173 rows 144 cols
[2022-05-17 16:12:53] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 16:12:53] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 144/17243 places, 4234/21129 transitions.
Finished structural reductions, in 7 iterations. Remains : 144/17243 places, 4234/21129 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-02 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:(LEQ s46 s64)], 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 8592 reset in 573 ms.
Product exploration explored 100000 steps with 8576 reset in 549 ms.
Computed a total of 144 stabilizing places and 4234 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 144 transition count 4234
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 111 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-02 finished in 36920 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 17243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Graph (complete) has 42523 edges and 17243 vertex of which 17231 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.40 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8317 transitions
Trivial Post-agglo rules discarded 8317 transitions
Performed 8317 trivial Post agglomeration. Transition count delta: 8317
Iterating post reduction 0 with 8317 rules applied. Total rules applied 8318 place count 17231 transition count 12810
Reduce places removed 8317 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16636 place count 8914 transition count 12809
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16637 place count 8913 transition count 12809
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 16637 place count 8913 transition count 12679
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 16897 place count 8783 transition count 12679
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20926 place count 4754 transition count 8650
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24955 place count 4754 transition count 8650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24955 place count 4754 transition count 8649
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Applied a total of 24957 rules in 2047 ms. Remains 4753 /17243 variables (removed 12490) and now considering 8649/21129 (removed 12480) transitions.
// Phase 1: matrix 8649 rows 4753 cols
[2022-05-17 16:12:57] [INFO ] Computed 198 place invariants in 95 ms
[2022-05-17 16:12:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:13:00] [INFO ] Implicit Places using invariants in 3318 ms returned [642, 1851, 2168, 3911, 4619]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3327 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4748/17243 places, 8649/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4746 transition count 8647
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4746 transition count 8647
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4744 transition count 8645
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4744 transition count 8645
Discarding 41 places :
Symmetric choice reduction at 0 with 41 rule applications. Total rules 49 place count 4703 transition count 8604
Iterating global reduction 0 with 41 rules applied. Total rules applied 90 place count 4703 transition count 8604
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 2 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 0 with 130 rules applied. Total rules applied 220 place count 4638 transition count 8539
Applied a total of 220 rules in 2482 ms. Remains 4638 /4748 variables (removed 110) and now considering 8539/8649 (removed 110) transitions.
[2022-05-17 16:13:03] [INFO ] Flow matrix only has 8498 transitions (discarded 41 similar events)
// Phase 1: matrix 8498 rows 4638 cols
[2022-05-17 16:13:03] [INFO ] Computed 193 place invariants in 111 ms
[2022-05-17 16:13:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:13:06] [INFO ] Implicit Places using invariants in 3118 ms returned [912, 1751, 2717, 3660, 4333]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3129 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4633/17243 places, 8539/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4629 transition count 8535
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4629 transition count 8535
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 4626 transition count 8532
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 4626 transition count 8532
Discarding 46 places :
Symmetric choice reduction at 0 with 46 rule applications. Total rules 60 place count 4580 transition count 8486
Iterating global reduction 0 with 46 rules applied. Total rules applied 106 place count 4580 transition count 8486
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 2 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 0 with 124 rules applied. Total rules applied 230 place count 4518 transition count 8424
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 231 place count 4517 transition count 8423
Iterating global reduction 0 with 1 rules applied. Total rules applied 232 place count 4517 transition count 8423
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 281 place count 4468 transition count 8374
Iterating global reduction 0 with 49 rules applied. Total rules applied 330 place count 4468 transition count 8374
Applied a total of 330 rules in 3399 ms. Remains 4468 /4633 variables (removed 165) and now considering 8374/8539 (removed 165) transitions.
[2022-05-17 16:13:09] [INFO ] Flow matrix only has 8234 transitions (discarded 140 similar events)
// Phase 1: matrix 8234 rows 4468 cols
[2022-05-17 16:13:09] [INFO ] Computed 188 place invariants in 82 ms
[2022-05-17 16:13:10] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:13:12] [INFO ] Implicit Places using invariants in 3009 ms returned [35, 2995, 3236, 4160, 4203]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3019 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4463/17243 places, 8374/21129 transitions.
Discarding 65 places :
Symmetric choice reduction at 0 with 65 rule applications. Total rules 65 place count 4398 transition count 8309
Iterating global reduction 0 with 65 rules applied. Total rules applied 130 place count 4398 transition count 8309
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 132 place count 4396 transition count 8307
Iterating global reduction 0 with 2 rules applied. Total rules applied 134 place count 4396 transition count 8307
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 194 place count 4336 transition count 8247
Iterating global reduction 0 with 60 rules applied. Total rules applied 254 place count 4336 transition count 8247
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 0 with 124 rules applied. Total rules applied 378 place count 4274 transition count 8185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 379 place count 4273 transition count 8184
Iterating global reduction 0 with 1 rules applied. Total rules applied 380 place count 4273 transition count 8184
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 411 place count 4242 transition count 8153
Iterating global reduction 0 with 31 rules applied. Total rules applied 442 place count 4242 transition count 8153
Applied a total of 442 rules in 2894 ms. Remains 4242 /4463 variables (removed 221) and now considering 8153/8374 (removed 221) transitions.
[2022-05-17 16:13:15] [INFO ] Flow matrix only has 7916 transitions (discarded 237 similar events)
// Phase 1: matrix 7916 rows 4242 cols
[2022-05-17 16:13:15] [INFO ] Computed 183 place invariants in 82 ms
[2022-05-17 16:13:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:13:18] [INFO ] Implicit Places using invariants in 3036 ms returned [369, 1311, 2131, 2924, 3471]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3043 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4237/17243 places, 8153/21129 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 4205 transition count 8121
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 4205 transition count 8121
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 4203 transition count 8119
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 4203 transition count 8119
Discarding 58 places :
Symmetric choice reduction at 0 with 58 rule applications. Total rules 126 place count 4145 transition count 8061
Iterating global reduction 0 with 58 rules applied. Total rules applied 184 place count 4145 transition count 8061
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 364 place count 4055 transition count 7971
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 365 place count 4054 transition count 7970
Iterating global reduction 0 with 1 rules applied. Total rules applied 366 place count 4054 transition count 7970
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 396 place count 4024 transition count 7940
Iterating global reduction 0 with 30 rules applied. Total rules applied 426 place count 4024 transition count 7940
Applied a total of 426 rules in 2624 ms. Remains 4024 /4237 variables (removed 213) and now considering 7940/8153 (removed 213) transitions.
[2022-05-17 16:13:21] [INFO ] Flow matrix only has 7606 transitions (discarded 334 similar events)
// Phase 1: matrix 7606 rows 4024 cols
[2022-05-17 16:13:21] [INFO ] Computed 178 place invariants in 75 ms
[2022-05-17 16:13:24] [INFO ] Implicit Places using invariants in 2843 ms returned [1470, 1710, 3133, 3373, 3698]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2852 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 4019/17243 places, 7940/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 4015 transition count 7936
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 4015 transition count 7936
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 4012 transition count 7933
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 4012 transition count 7933
Discarding 88 places :
Symmetric choice reduction at 0 with 88 rule applications. Total rules 102 place count 3924 transition count 7845
Iterating global reduction 0 with 88 rules applied. Total rules applied 190 place count 3924 transition count 7845
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: 57
Deduced a syphon composed of 57 places in 1 ms
Reduce places removed 57 places and 0 transitions.
Iterating global reduction 0 with 114 rules applied. Total rules applied 304 place count 3867 transition count 7788
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 305 place count 3866 transition count 7787
Iterating global reduction 0 with 1 rules applied. Total rules applied 306 place count 3866 transition count 7787
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 336 place count 3836 transition count 7757
Iterating global reduction 0 with 30 rules applied. Total rules applied 366 place count 3836 transition count 7757
Applied a total of 366 rules in 2368 ms. Remains 3836 /4019 variables (removed 183) and now considering 7757/7940 (removed 183) transitions.
[2022-05-17 16:13:26] [INFO ] Flow matrix only has 7294 transitions (discarded 463 similar events)
// Phase 1: matrix 7294 rows 3836 cols
[2022-05-17 16:13:26] [INFO ] Computed 173 place invariants in 75 ms
[2022-05-17 16:13:29] [INFO ] Implicit Places using invariants in 2555 ms returned [1290, 1351, 1452, 1516, 3260]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2564 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3831/17243 places, 7757/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3827 transition count 7753
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3827 transition count 7753
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 3824 transition count 7750
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 3824 transition count 7750
Discarding 83 places :
Symmetric choice reduction at 0 with 83 rule applications. Total rules 97 place count 3741 transition count 7667
Iterating global reduction 0 with 83 rules applied. Total rules applied 180 place count 3741 transition count 7667
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 2 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 0 with 112 rules applied. Total rules applied 292 place count 3685 transition count 7611
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 293 place count 3684 transition count 7610
Iterating global reduction 0 with 1 rules applied. Total rules applied 294 place count 3684 transition count 7610
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 325 place count 3653 transition count 7579
Iterating global reduction 0 with 31 rules applied. Total rules applied 356 place count 3653 transition count 7579
Applied a total of 356 rules in 2171 ms. Remains 3653 /3831 variables (removed 178) and now considering 7579/7757 (removed 178) transitions.
[2022-05-17 16:13:31] [INFO ] Flow matrix only has 6987 transitions (discarded 592 similar events)
// Phase 1: matrix 6987 rows 3653 cols
[2022-05-17 16:13:31] [INFO ] Computed 168 place invariants in 64 ms
[2022-05-17 16:13:35] [INFO ] Implicit Places using invariants in 3797 ms returned [3, 62, 65, 94, 125, 128, 157, 188, 191, 220, 251, 254, 283, 314, 317, 347, 350, 379, 410, 413, 442, 473, 476, 505, 536, 567, 598, 601, 630, 661, 664, 693, 724, 727, 756, 787, 794, 824, 858, 889, 892, 921, 952, 955, 984, 1015, 1018, 1047, 1078, 1081, 1110, 1141, 1144, 1174, 1207, 1236, 1267, 1277, 1309, 1338, 1369, 1372, 1402, 1407, 1439, 1469, 1473, 1503, 1506, 1536, 1539, 1568, 1599, 1602, 1631, 1662, 1665, 1695, 1698, 1727, 1758, 1760, 1762, 1792, 1825, 1854, 1885, 1888, 1917, 1948, 1951, 1980, 2011, 2014, 2043, 2074, 2077, 2106, 2137, 2140, 2169, 2200, 2208, 2238, 2241, 2270, 2301, 2304, 2333, 2364, 2367, 2396, 2427, 2430, 2459, 2490, 2493, 2535, 2538, 2570, 2573, 2602, 2633, 2636, 2665, 2699, 2728, 2759, 2762, 2791, 2822, 2825, 2854, 2888, 2917, 2948, 2951, 2987, 2990, 3019, 3050, 3052, 3082, 3084, 3114, 3121, 3124, 3153, 3184, 3187, 3216, 3247, 3250, 3279, 3310, 3313, 3342, 3373, 3375, 3406, 3417, 3446, 3477, 3480, 3509]
Discarding 165 places :
Implicit Place search using SMT only with invariants took 3803 ms to find 165 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3488/17243 places, 7579/21129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3488 transition count 7578
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3487 transition count 7578
Discarding 3125 places :
Symmetric choice reduction at 0 with 3125 rule applications. Total rules 3127 place count 362 transition count 4453
Iterating global reduction 0 with 3125 rules applied. Total rules applied 6252 place count 362 transition count 4453
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 6358 place count 256 transition count 4347
Iterating global reduction 0 with 106 rules applied. Total rules applied 6464 place count 256 transition count 4347
Discarding 106 places :
Symmetric choice reduction at 0 with 106 rule applications. Total rules 6570 place count 150 transition count 4241
Iterating global reduction 0 with 106 rules applied. Total rules applied 6676 place count 150 transition count 4241
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 6686 place count 145 transition count 4236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6687 place count 144 transition count 4235
Iterating global reduction 0 with 1 rules applied. Total rules applied 6688 place count 144 transition count 4235
Applied a total of 6688 rules in 181 ms. Remains 144 /3488 variables (removed 3344) and now considering 4235/7579 (removed 3344) transitions.
[2022-05-17 16:13:35] [INFO ] Flow matrix only has 174 transitions (discarded 4061 similar events)
// Phase 1: matrix 174 rows 144 cols
[2022-05-17 16:13:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 16:13:35] [INFO ] Implicit Places using invariants in 322 ms returned []
[2022-05-17 16:13:35] [INFO ] Flow matrix only has 174 transitions (discarded 4061 similar events)
// Phase 1: matrix 174 rows 144 cols
[2022-05-17 16:13:35] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-17 16:13:36] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 739 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 144/17243 places, 4235/21129 transitions.
Finished structural reductions, in 8 iterations. Remains : 144/17243 places, 4235/21129 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-03 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:(GT s34 s131)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-03 finished in 40744 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(G(X(X(p0)))))))'
Support contains 1 out of 17243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Graph (complete) has 42523 edges and 17243 vertex of which 17231 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.38 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 8318 transitions
Trivial Post-agglo rules discarded 8318 transitions
Performed 8318 trivial Post agglomeration. Transition count delta: 8318
Iterating post reduction 0 with 8318 rules applied. Total rules applied 8319 place count 17231 transition count 12809
Reduce places removed 8318 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16638 place count 8913 transition count 12808
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16639 place count 8912 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 130 Pre rules applied. Total rules applied 16639 place count 8912 transition count 12678
Deduced a syphon composed of 130 places in 5 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 16899 place count 8782 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20928 place count 4753 transition count 8649
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24957 place count 4753 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24957 place count 4753 transition count 8648
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24959 place count 4752 transition count 8648
Applied a total of 24959 rules in 2020 ms. Remains 4752 /17243 variables (removed 12491) and now considering 8648/21129 (removed 12481) transitions.
// Phase 1: matrix 8648 rows 4752 cols
[2022-05-17 16:13:38] [INFO ] Computed 198 place invariants in 88 ms
[2022-05-17 16:13:38] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:13:41] [INFO ] Implicit Places using invariants in 3570 ms returned [391, 994, 2451, 3835, 4334]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3577 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4747/17243 places, 8648/21129 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 4683 transition count 8584
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 4683 transition count 8584
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 4682 transition count 8583
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 4682 transition count 8583
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 159 place count 4653 transition count 8554
Iterating global reduction 0 with 29 rules applied. Total rules applied 188 place count 4653 transition count 8554
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 2 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 0 with 258 rules applied. Total rules applied 446 place count 4524 transition count 8425
Applied a total of 446 rules in 2499 ms. Remains 4524 /4747 variables (removed 223) and now considering 8425/8648 (removed 223) transitions.
[2022-05-17 16:13:44] [INFO ] Flow matrix only has 8395 transitions (discarded 30 similar events)
// Phase 1: matrix 8395 rows 4524 cols
[2022-05-17 16:13:44] [INFO ] Computed 193 place invariants in 82 ms
[2022-05-17 16:13:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:13:47] [INFO ] Implicit Places using invariants in 3184 ms returned [1122, 1291, 1498, 2829, 4155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3189 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4519/17243 places, 8425/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4517 transition count 8423
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4517 transition count 8423
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4515 transition count 8421
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4515 transition count 8421
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 32 place count 4491 transition count 8397
Iterating global reduction 0 with 24 rules applied. Total rules applied 56 place count 4491 transition count 8397
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 0 with 128 rules applied. Total rules applied 184 place count 4427 transition count 8333
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 185 place count 4426 transition count 8332
Iterating global reduction 0 with 1 rules applied. Total rules applied 186 place count 4426 transition count 8332
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 218 place count 4394 transition count 8300
Iterating global reduction 0 with 32 rules applied. Total rules applied 250 place count 4394 transition count 8300
Applied a total of 250 rules in 3062 ms. Remains 4394 /4519 variables (removed 125) and now considering 8300/8425 (removed 125) transitions.
[2022-05-17 16:13:50] [INFO ] Flow matrix only has 8209 transitions (discarded 91 similar events)
// Phase 1: matrix 8209 rows 4394 cols
[2022-05-17 16:13:50] [INFO ] Computed 188 place invariants in 85 ms
[2022-05-17 16:13:53] [INFO ] Implicit Places using invariants in 3103 ms returned [134, 201, 1809, 2930, 3268]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 3110 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 4389/17243 places, 8300/21129 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 4325 transition count 8236
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 4325 transition count 8236
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 129 place count 4324 transition count 8235
Iterating global reduction 0 with 1 rules applied. Total rules applied 130 place count 4324 transition count 8235
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 159 place count 4295 transition count 8206
Iterating global reduction 0 with 29 rules applied. Total rules applied 188 place count 4295 transition count 8206
Performed 125 Post agglomeration using F-continuation condition.Transition count delta: 125
Deduced a syphon composed of 125 places in 2 ms
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 0 with 250 rules applied. Total rules applied 438 place count 4170 transition count 8081
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 439 place count 4169 transition count 8080
Iterating global reduction 0 with 1 rules applied. Total rules applied 440 place count 4169 transition count 8080
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 469 place count 4140 transition count 8051
Iterating global reduction 0 with 29 rules applied. Total rules applied 498 place count 4140 transition count 8051
Applied a total of 498 rules in 2803 ms. Remains 4140 /4389 variables (removed 249) and now considering 8051/8300 (removed 249) transitions.
[2022-05-17 16:13:56] [INFO ] Flow matrix only has 7895 transitions (discarded 156 similar events)
// Phase 1: matrix 7895 rows 4140 cols
[2022-05-17 16:13:56] [INFO ] Computed 183 place invariants in 80 ms
[2022-05-17 16:13:59] [INFO ] Implicit Places using invariants in 2699 ms returned [161, 1312, 1570, 1986, 3381]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2705 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 4135/17243 places, 8051/21129 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 4133 transition count 8049
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 4133 transition count 8049
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 4131 transition count 8047
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 4131 transition count 8047
Discarding 56 places :
Symmetric choice reduction at 0 with 56 rule applications. Total rules 64 place count 4075 transition count 7991
Iterating global reduction 0 with 56 rules applied. Total rules applied 120 place count 4075 transition count 7991
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 242 place count 4014 transition count 7930
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 243 place count 4013 transition count 7929
Iterating global reduction 0 with 1 rules applied. Total rules applied 244 place count 4013 transition count 7929
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 273 place count 3984 transition count 7900
Iterating global reduction 0 with 29 rules applied. Total rules applied 302 place count 3984 transition count 7900
Applied a total of 302 rules in 2554 ms. Remains 3984 /4135 variables (removed 151) and now considering 7900/8051 (removed 151) transitions.
[2022-05-17 16:14:01] [INFO ] Flow matrix only has 7648 transitions (discarded 252 similar events)
// Phase 1: matrix 7648 rows 3984 cols
[2022-05-17 16:14:01] [INFO ] Computed 178 place invariants in 72 ms
[2022-05-17 16:14:04] [INFO ] Implicit Places using invariants in 2709 ms returned [251, 317, 1353, 2729, 2820]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2722 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 3979/17243 places, 7900/21129 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 3976 transition count 7897
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 3976 transition count 7897
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 3973 transition count 7894
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 3973 transition count 7894
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 67 place count 3918 transition count 7839
Iterating global reduction 0 with 55 rules applied. Total rules applied 122 place count 3918 transition count 7839
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 0 with 118 rules applied. Total rules applied 240 place count 3859 transition count 7780
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 241 place count 3858 transition count 7779
Iterating global reduction 0 with 1 rules applied. Total rules applied 242 place count 3858 transition count 7779
Discarding 43 places :
Symmetric choice reduction at 0 with 43 rule applications. Total rules 285 place count 3815 transition count 7736
Iterating global reduction 0 with 43 rules applied. Total rules applied 328 place count 3815 transition count 7736
Applied a total of 328 rules in 2421 ms. Remains 3815 /3979 variables (removed 164) and now considering 7736/7900 (removed 164) transitions.
[2022-05-17 16:14:06] [INFO ] Flow matrix only has 7370 transitions (discarded 366 similar events)
// Phase 1: matrix 7370 rows 3815 cols
[2022-05-17 16:14:06] [INFO ] Computed 173 place invariants in 70 ms
[2022-05-17 16:14:09] [INFO ] Implicit Places using invariants in 2681 ms returned [30, 1571, 2100, 2902, 2937]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 2689 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 6 : 3810/17243 places, 7736/21129 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 3806 transition count 7732
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 3806 transition count 7732
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 3804 transition count 7730
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 3804 transition count 7730
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 50 place count 3766 transition count 7692
Iterating global reduction 0 with 38 rules applied. Total rules applied 88 place count 3766 transition count 7692
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 0 with 228 rules applied. Total rules applied 316 place count 3652 transition count 7578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 317 place count 3651 transition count 7577
Iterating global reduction 0 with 1 rules applied. Total rules applied 318 place count 3651 transition count 7577
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 363 place count 3606 transition count 7532
Iterating global reduction 0 with 45 rules applied. Total rules applied 408 place count 3606 transition count 7532
Applied a total of 408 rules in 2274 ms. Remains 3606 /3810 variables (removed 204) and now considering 7532/7736 (removed 204) transitions.
[2022-05-17 16:14:11] [INFO ] Flow matrix only has 7068 transitions (discarded 464 similar events)
// Phase 1: matrix 7068 rows 3606 cols
[2022-05-17 16:14:11] [INFO ] Computed 168 place invariants in 63 ms
[2022-05-17 16:14:15] [INFO ] Implicit Places using invariants in 3897 ms returned [2, 59, 62, 89, 122, 152, 179, 212, 238, 269, 298, 301, 327, 358, 361, 387, 418, 421, 447, 478, 481, 507, 538, 541, 567, 598, 601, 627, 658, 661, 687, 718, 721, 748, 781, 807, 838, 841, 867, 898, 901, 928, 931, 957, 988, 991, 1018, 1051, 1077, 1108, 1111, 1138, 1171, 1197, 1228, 1245, 1248, 1274, 1305, 1308, 1334, 1365, 1371, 1401, 1404, 1430, 1461, 1464, 1494, 1520, 1551, 1554, 1580, 1611, 1614, 1640, 1671, 1674, 1700, 1731, 1734, 1760, 1791, 1794, 1820, 1851, 1854, 1883, 1886, 1912, 1943, 1946, 1972, 2006, 2032, 2063, 2066, 2092, 2123, 2126, 2152, 2183, 2186, 2212, 2243, 2246, 2272, 2303, 2312, 2342, 2345, 2371, 2402, 2405, 2431, 2465, 2491, 2522, 2525, 2555, 2558, 2596, 2599, 2625, 2656, 2659, 2685, 2716, 2719, 2749, 2752, 2783, 2786, 2816, 2819, 2845, 2879, 2905, 2936, 2939, 2969, 2972, 2998, 3029, 3032, 3058, 3089, 3092, 3118, 3149, 3152, 3178, 3209, 3212, 3274, 3309, 3312, 3338, 3369, 3372, 3398, 3429, 3432, 3458, 3489]
Discarding 165 places :
Implicit Place search using SMT only with invariants took 3906 ms to find 165 implicit places.
Starting structural reductions in SI_LTL mode, iteration 7 : 3441/17243 places, 7532/21129 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 3441 transition count 7531
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3440 transition count 7531
Discarding 3072 places :
Symmetric choice reduction at 0 with 3072 rule applications. Total rules 3074 place count 368 transition count 4459
Iterating global reduction 0 with 3072 rules applied. Total rules applied 6146 place count 368 transition count 4459
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 6256 place count 258 transition count 4349
Iterating global reduction 0 with 110 rules applied. Total rules applied 6366 place count 258 transition count 4349
Discarding 110 places :
Symmetric choice reduction at 0 with 110 rule applications. Total rules 6476 place count 148 transition count 4239
Iterating global reduction 0 with 110 rules applied. Total rules applied 6586 place count 148 transition count 4239
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 6596 place count 143 transition count 4234
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 6597 place count 142 transition count 4233
Iterating global reduction 0 with 1 rules applied. Total rules applied 6598 place count 142 transition count 4233
Applied a total of 6598 rules in 190 ms. Remains 142 /3441 variables (removed 3299) and now considering 4233/7532 (removed 3299) transitions.
[2022-05-17 16:14:15] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
// Phase 1: matrix 171 rows 142 cols
[2022-05-17 16:14:15] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 16:14:16] [INFO ] Implicit Places using invariants in 289 ms returned []
[2022-05-17 16:14:16] [INFO ] Flow matrix only has 171 transitions (discarded 4062 similar events)
// Phase 1: matrix 171 rows 142 cols
[2022-05-17 16:14:16] [INFO ] Computed 3 place invariants in 2 ms
[2022-05-17 16:14:16] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 705 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 8 : 142/17243 places, 4233/21129 transitions.
Finished structural reductions, in 8 iterations. Remains : 142/17243 places, 4233/21129 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ 1 s126)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-04 finished in 40496 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||X(((p1 U p0)||p0))))'
Support contains 3 out of 17243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 17234 transition count 21129
Applied a total of 9 rules in 99 ms. Remains 17234 /17243 variables (removed 9) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:14:18] [INFO ] Computed 198 place invariants in 1624 ms
[2022-05-17 16:14:19] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:14:19] [INFO ] Implicit Places using invariants in 3085 ms returned []
Implicit Place search using SMT only with invariants took 3086 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:14:21] [INFO ] Computed 198 place invariants in 1610 ms
[2022-05-17 16:14:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:14:23] [INFO ] Dead Transitions using invariants and state equation in 3218 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17234/17243 places, 21129/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17234/17243 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s16586 s9220), p1:(LEQ 1 s10834)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 72850 steps with 36425 reset in 10001 ms.
Product exploration timeout after 72850 steps with 36425 reset in 10002 ms.
Computed a total of 17234 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17234 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (G p0)), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 (NOT p1))
Knowledge based reduction with 8 factoid took 272 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-06 finished in 53857 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(p0))))'
Support contains 2 out of 17243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 17234 transition count 21129
Applied a total of 9 rules in 85 ms. Remains 17234 /17243 variables (removed 9) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:15:12] [INFO ] Computed 198 place invariants in 1557 ms
[2022-05-17 16:15:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:15:13] [INFO ] Implicit Places using invariants in 3002 ms returned []
Implicit Place search using SMT only with invariants took 3011 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:15:15] [INFO ] Computed 198 place invariants in 1576 ms
[2022-05-17 16:15:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:15:16] [INFO ] Dead Transitions using invariants and state equation in 3144 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17234/17243 places, 21129/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17234/17243 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s14783 s14490)], 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 timeout after 74160 steps with 37080 reset in 10001 ms.
Product exploration timeout after 75360 steps with 37680 reset in 10001 ms.
Computed a total of 17234 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17234 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-07 finished in 49059 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 17243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 17233 transition count 21129
Applied a total of 10 rules in 102 ms. Remains 17233 /17243 variables (removed 10) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 16:16:01] [INFO ] Computed 198 place invariants in 1568 ms
[2022-05-17 16:16:02] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:16:02] [INFO ] Implicit Places using invariants in 3024 ms returned []
Implicit Place search using SMT only with invariants took 3025 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 16:16:04] [INFO ] Computed 198 place invariants in 1564 ms
[2022-05-17 16:16:05] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:16:05] [INFO ] Dead Transitions using invariants and state equation in 3099 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17233/17243 places, 21129/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17243 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s16943 s596)], 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 timeout after 73730 steps with 36865 reset in 10001 ms.
Product exploration timeout after 74300 steps with 37150 reset in 10001 ms.
Computed a total of 17233 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17233 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 394 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-12 finished in 48055 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(p1)))))'
Support contains 3 out of 17243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 17234 transition count 21129
Applied a total of 9 rules in 97 ms. Remains 17234 /17243 variables (removed 9) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:16:49] [INFO ] Computed 198 place invariants in 1580 ms
[2022-05-17 16:16:50] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:16:50] [INFO ] Implicit Places using invariants in 3117 ms returned []
Implicit Place search using SMT only with invariants took 3118 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:16:52] [INFO ] Computed 198 place invariants in 1579 ms
[2022-05-17 16:16:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:16:54] [INFO ] Dead Transitions using invariants and state equation in 3203 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17234/17243 places, 21129/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17234/17243 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={} source=4 dest: 0}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=p0, acceptance={} source=6 dest: 2}, { cond=(NOT p0), acceptance={} source=6 dest: 4}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=1, aps=[p1:(GT 1 s6301), p0:(GT s7074 s1397)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 9022 ms.
Product exploration explored 100000 steps with 25000 reset in 8865 ms.
Computed a total of 17234 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17234 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 216 ms. Reduced automaton from 8 states, 12 edges and 2 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 388 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9692 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9692 steps, saw 5373 distinct states, run finished after 3002 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:17:43] [INFO ] Computed 198 place invariants in 1562 ms
[2022-05-17 16:17:45] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 347 ms returned sat
[2022-05-17 16:18:08] [INFO ] After 25017ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 17234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17234/17234 places, 21129/21129 transitions.
Graph (complete) has 38157 edges and 17234 vertex of which 7 are kept as prefixes of interest. Removing 17227 places using SCC suffix rule.6 ms
Discarding 17227 places :
Also discarding 20808 output transitions
Drop transitions removed 20808 transitions
Drop transitions removed 317 transitions
Reduce isomorphic transitions removed 317 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 318 rules applied. Total rules applied 319 place count 6 transition count 4
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 322 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 323 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 323 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 2 transition count 2
Applied a total of 325 rules in 27 ms. Remains 2 /17234 variables (removed 17232) and now considering 2/21129 (removed 21127) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/17234 places, 2/21129 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT p0)), true, (X (X (NOT p0))), (F (G p1)), (F (G (NOT p0)))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 6 factoid took 270 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 156 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 17234 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 17234/17234 places, 21129/21129 transitions.
Applied a total of 0 rules in 71 ms. Remains 17234 /17234 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:18:10] [INFO ] Computed 198 place invariants in 1645 ms
[2022-05-17 16:18:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:18:12] [INFO ] Implicit Places using invariants in 3268 ms returned []
Implicit Place search using SMT only with invariants took 3268 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:18:13] [INFO ] Computed 198 place invariants in 1620 ms
[2022-05-17 16:18:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:18:15] [INFO ] Dead Transitions using invariants and state equation in 3252 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 17234/17234 places, 21129/21129 transitions.
Computed a total of 17234 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17234 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p1, true, (F (G p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Incomplete random walk after 10000 steps, including 388 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 9794 steps, run timeout after 3001 ms. (steps per millisecond=3 ) properties seen :{}
Probabilistic random walk after 9794 steps, saw 5414 distinct states, run finished after 3001 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:18:44] [INFO ] Computed 198 place invariants in 1607 ms
[2022-05-17 16:18:46] [INFO ] [Real]Absence check using 0 positive and 198 generalized place invariants in 384 ms returned sat
[2022-05-17 16:19:09] [INFO ] After 25020ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 17234 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 17234/17234 places, 21129/21129 transitions.
Graph (complete) has 38157 edges and 17234 vertex of which 7 are kept as prefixes of interest. Removing 17227 places using SCC suffix rule.7 ms
Discarding 17227 places :
Also discarding 20808 output transitions
Drop transitions removed 20808 transitions
Drop transitions removed 317 transitions
Reduce isomorphic transitions removed 317 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 318 rules applied. Total rules applied 319 place count 6 transition count 4
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 322 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 323 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 323 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 325 place count 2 transition count 2
Applied a total of 325 rules in 28 ms. Remains 2 /17234 variables (removed 17232) and now considering 2/21129 (removed 21127) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/17234 places, 2/21129 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1, true, (F (G p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 25000 reset in 8785 ms.
Product exploration explored 100000 steps with 25000 reset in 8781 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 168 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 1 out of 17234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17234/17234 places, 21129/21129 transitions.
Graph (complete) has 42514 edges and 17234 vertex of which 17231 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.19 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 8319 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8320 place count 17231 transition count 21127
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8449 places in 7 ms
Iterating global reduction 1 with 130 rules applied. Total rules applied 8450 place count 17231 transition count 21127
Deduced a syphon composed of 8449 places in 7 ms
Applied a total of 8450 rules in 3233 ms. Remains 17231 /17234 variables (removed 3) and now considering 21127/21129 (removed 2) transitions.
// Phase 1: matrix 21127 rows 17231 cols
[2022-05-17 16:19:34] [INFO ] Computed 198 place invariants in 2040 ms
[2022-05-17 16:19:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:19:35] [INFO ] Dead Transitions using invariants and state equation in 3426 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 17231/17234 places, 21127/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17231/17234 places, 21127/21129 transitions.
Product exploration timeout after 23430 steps with 5857 reset in 10005 ms.
Product exploration timeout after 23450 steps with 5862 reset in 10004 ms.
Built C files in :
/tmp/ltsmin725163536370738243
[2022-05-17 16:19:55] [INFO ] Built C files in 257ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin725163536370738243
Running compilation step : cd /tmp/ltsmin725163536370738243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin725163536370738243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin725163536370738243;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 1 out of 17234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17234/17234 places, 21129/21129 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 17233 transition count 21129
Applied a total of 1 rules in 98 ms. Remains 17233 /17234 variables (removed 1) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 16:20:00] [INFO ] Computed 198 place invariants in 1592 ms
[2022-05-17 16:20:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:20:01] [INFO ] Implicit Places using invariants in 3106 ms returned []
Implicit Place search using SMT only with invariants took 3107 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17233 cols
[2022-05-17 16:20:03] [INFO ] Computed 198 place invariants in 1604 ms
[2022-05-17 16:20:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:20:05] [INFO ] Dead Transitions using invariants and state equation in 3080 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17233/17234 places, 21129/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17233/17234 places, 21129/21129 transitions.
Built C files in :
/tmp/ltsmin14397611617305170935
[2022-05-17 16:20:05] [INFO ] Built C files in 196ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14397611617305170935
Running compilation step : cd /tmp/ltsmin14397611617305170935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14397611617305170935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14397611617305170935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-17 16:20:10] [INFO ] Flatten gal took : 705 ms
[2022-05-17 16:20:10] [INFO ] Flatten gal took : 667 ms
[2022-05-17 16:20:10] [INFO ] Time to serialize gal into /tmp/LTL17316686479853703915.gal : 141 ms
[2022-05-17 16:20:10] [INFO ] Time to serialize properties into /tmp/LTL7458799526890233479.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17316686479853703915.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7458799526890233479.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1731668...267
Read 1 LTL properties
Checking formula 0 : !((X((G("(Node26ManageTheBreakDownOfNode59>Node20FailureProcessedByNode5)"))||(X(X("(Node23ManageTheBreakDownOfNode63<1)"))))))
Formula 0 simplified : !X(G"(Node26ManageTheBreakDownOfNode59>Node20FailureProcessedByNode5)" | XX"(Node23ManageTheBreakDownOfNode63<1)")
Detected timeout of ITS tools.
[2022-05-17 16:20:26] [INFO ] Flatten gal took : 653 ms
[2022-05-17 16:20:26] [INFO ] Applying decomposition
[2022-05-17 16:20:27] [INFO ] Flatten gal took : 624 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18267080058575392186.txt' '-o' '/tmp/graph18267080058575392186.bin' '-w' '/tmp/graph18267080058575392186.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18267080058575392186.bin' '-l' '-1' '-v' '-w' '/tmp/graph18267080058575392186.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:20:29] [INFO ] Decomposing Gal with order
[2022-05-17 16:20:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:20:55] [INFO ] Removed a total of 16052 redundant transitions.
[2022-05-17 16:20:56] [INFO ] Flatten gal took : 7523 ms
[2022-05-17 16:20:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 279 labels/synchronizations in 425 ms.
[2022-05-17 16:21:00] [INFO ] Time to serialize gal into /tmp/LTL11591101425406002390.gal : 212 ms
[2022-05-17 16:21:00] [INFO ] Time to serialize properties into /tmp/LTL5547781083493307527.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11591101425406002390.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5547781083493307527.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1159110...267
Read 1 LTL properties
Checking formula 0 : !((X((G("(gu380.Node26ManageTheBreakDownOfNode59>gu380.Node20FailureProcessedByNode5)"))||(X(X("(gi1.gi1.gi18.gu1584.Node23ManageTheBr...180
Formula 0 simplified : !X(G"(gu380.Node26ManageTheBreakDownOfNode59>gu380.Node20FailureProcessedByNode5)" | XX"(gi1.gi1.gi18.gu1584.Node23ManageTheBreakDow...169
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2969572371698174448
[2022-05-17 16:21:16] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2969572371698174448
Running compilation step : cd /tmp/ltsmin2969572371698174448;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2969572371698174448;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2969572371698174448;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-14 finished in 271392 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(X(p0))))))'
Support contains 2 out of 17243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17243/17243 places, 21129/21129 transitions.
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 17234 transition count 21129
Applied a total of 9 rules in 488 ms. Remains 17234 /17243 variables (removed 9) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:21:21] [INFO ] Computed 198 place invariants in 1953 ms
[2022-05-17 16:21:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:21:22] [INFO ] Implicit Places using invariants in 3329 ms returned []
Implicit Place search using SMT only with invariants took 3330 ms to find 0 implicit places.
// Phase 1: matrix 21129 rows 17234 cols
[2022-05-17 16:21:24] [INFO ] Computed 198 place invariants in 1668 ms
[2022-05-17 16:21:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-05-17 16:21:25] [INFO ] Dead Transitions using invariants and state equation in 2980 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 17234/17243 places, 21129/21129 transitions.
Finished structural reductions, in 1 iterations. Remains : 17234/17243 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-15 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:(GT s10672 s4936)], 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]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-15 finished in 6976 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||X(X(p1)))))'
[2022-05-17 16:21:27] [INFO ] Flatten gal took : 895 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3244025157491115176
[2022-05-17 16:21:27] [INFO ] Too many transitions (21129) to apply POR reductions. Disabling POR matrices.
[2022-05-17 16:21:27] [INFO ] Built C files in 249ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3244025157491115176
Running compilation step : cd /tmp/ltsmin3244025157491115176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-17 16:21:27] [INFO ] Applying decomposition
[2022-05-17 16:21:28] [INFO ] Flatten gal took : 800 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11916001042370062854.txt' '-o' '/tmp/graph11916001042370062854.bin' '-w' '/tmp/graph11916001042370062854.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11916001042370062854.bin' '-l' '-1' '-v' '-w' '/tmp/graph11916001042370062854.weights' '-q' '0' '-e' '0.001'
[2022-05-17 16:21:31] [INFO ] Decomposing Gal with order
[2022-05-17 16:21:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 16:22:11] [INFO ] Removed a total of 16056 redundant transitions.
[2022-05-17 16:22:12] [INFO ] Flatten gal took : 9674 ms
[2022-05-17 16:22:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 514 ms.
[2022-05-17 16:22:18] [INFO ] Time to serialize gal into /tmp/LTLCardinality9278887742900489882.gal : 236 ms
[2022-05-17 16:22:18] [INFO ] Time to serialize properties into /tmp/LTLCardinality16022023528105666195.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9278887742900489882.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality16022023528105666195.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X((G("(gu1777.Node26ManageTheBreakDownOfNode59>gu1777.Node20FailureProcessedByNode5)"))||(X(X("(gi1.gi1.gi47.gu1586.Node23ManageThe...182
Formula 0 simplified : !X(G"(gu1777.Node26ManageTheBreakDownOfNode59>gu1777.Node20FailureProcessedByNode5)" | XX"(gi1.gi1.gi47.gu1586.Node23ManageTheBreakD...171
Compilation finished in 377770 ms.
Running link step : cd /tmp/ltsmin3244025157491115176;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 191 ms.
Running LTSmin : cd /tmp/ltsmin3244025157491115176;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp0==true))||X(X((LTLAPp1==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-17 16:46:29] [INFO ] Flatten gal took : 2623 ms
[2022-05-17 16:46:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality14102941654912851337.gal : 839 ms
[2022-05-17 16:46:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality4080500300006351457.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality14102941654912851337.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4080500300006351457.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLCardina...289
Read 1 LTL properties
Checking formula 0 : !((X((G("(Node26ManageTheBreakDownOfNode59>Node20FailureProcessedByNode5)"))||(X(X("(Node23ManageTheBreakDownOfNode63<1)"))))))
Formula 0 simplified : !X(G"(Node26ManageTheBreakDownOfNode59>Node20FailureProcessedByNode5)" | XX"(Node23ManageTheBreakDownOfNode63<1)")

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is LeafsetExtension-PT-S64C3, 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 r132-tall-165271821000531"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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