Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r041-tajo-167813694600363.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is BugTracking-PT-q3m064, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694600363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 06:43 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Feb 26 06:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 06:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 26 06:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 07:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 26 07:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 07:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 07:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678630499892

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m064
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:15:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:15:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:15:02] [INFO ] Load time of PNML (sax parser for PT used): 652 ms
[2023-03-12 14:15:02] [INFO ] Transformed 754 places.
[2023-03-12 14:15:02] [INFO ] Transformed 27370 transitions.
[2023-03-12 14:15:02] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 821 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Deduced a syphon composed of 514 places in 117 ms
Reduce places removed 514 places and 24601 transitions.
FORMULA BugTracking-PT-q3m064-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m064-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 3 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 69 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-12 14:15:02] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:15:02] [INFO ] Computed 8 place invariants in 37 ms
[2023-03-12 14:15:03] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-12 14:15:03] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:15:03] [INFO ] Invariant cache hit.
[2023-03-12 14:15:03] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:15:04] [INFO ] Implicit Places using invariants and state equation in 1706 ms returned []
Implicit Place search using SMT with State Equation took 2255 ms to find 0 implicit places.
[2023-03-12 14:15:04] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:15:04] [INFO ] Invariant cache hit.
[2023-03-12 14:15:05] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3168 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 3 out of 237 places after structural reductions.
[2023-03-12 14:15:06] [INFO ] Flatten gal took : 282 ms
[2023-03-12 14:15:06] [INFO ] Flatten gal took : 148 ms
[2023-03-12 14:15:06] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10003 steps, including 8 resets, run finished after 240 ms. (steps per millisecond=41 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-12 14:15:07] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:15:07] [INFO ] Invariant cache hit.
[2023-03-12 14:15:07] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:15:07] [INFO ] After 485ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1
[2023-03-12 14:15:07] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:15:07] [INFO ] After 105ms SMT Verify possible using 240 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 14:15:07] [INFO ] After 690ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-03-12 14:15:07] [INFO ] [Nat]Absence check using 8 positive place invariants in 17 ms returned sat
[2023-03-12 14:15:08] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2023-03-12 14:15:08] [INFO ] After 241ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2023-03-12 14:15:09] [INFO ] Deduced a trap composed of 15 places in 377 ms of which 16 ms to minimize.
[2023-03-12 14:15:09] [INFO ] Deduced a trap composed of 11 places in 395 ms of which 1 ms to minimize.
[2023-03-12 14:15:09] [INFO ] Deduced a trap composed of 51 places in 372 ms of which 2 ms to minimize.
[2023-03-12 14:15:10] [INFO ] Deduced a trap composed of 24 places in 210 ms of which 2 ms to minimize.
[2023-03-12 14:15:10] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1659 ms
[2023-03-12 14:15:10] [INFO ] After 1997ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-12 14:15:10] [INFO ] After 2619ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 353 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 190382 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 190382 steps, saw 91126 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:15:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:15:13] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 14:15:13] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 14:15:14] [INFO ] After 487ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:15:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:15:14] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:15:14] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:15:14] [INFO ] After 151ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:15:15] [INFO ] Deduced a trap composed of 11 places in 215 ms of which 1 ms to minimize.
[2023-03-12 14:15:15] [INFO ] Deduced a trap composed of 19 places in 210 ms of which 1 ms to minimize.
[2023-03-12 14:15:15] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 1 ms to minimize.
[2023-03-12 14:15:15] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 1 ms to minimize.
[2023-03-12 14:15:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1007 ms
[2023-03-12 14:15:15] [INFO ] After 1196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-12 14:15:15] [INFO ] After 1668ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 66 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 65 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:15:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:15:16] [INFO ] Invariant cache hit.
[2023-03-12 14:15:16] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 14:15:16] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:15:16] [INFO ] Invariant cache hit.
[2023-03-12 14:15:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:15:17] [INFO ] Implicit Places using invariants and state equation in 1353 ms returned []
Implicit Place search using SMT with State Equation took 1747 ms to find 0 implicit places.
[2023-03-12 14:15:18] [INFO ] Redundant transitions in 175 ms returned []
[2023-03-12 14:15:18] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:15:18] [INFO ] Invariant cache hit.
[2023-03-12 14:15:18] [INFO ] Dead Transitions using invariants and state equation in 799 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2796 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 399 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:15:19] [INFO ] Computed 9 place invariants in 13 ms
[2023-03-12 14:15:19] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:15:19] [INFO ] After 414ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:15:19] [INFO ] After 483ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 14:15:19] [INFO ] After 570ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 3 simplifications.
FORMULA BugTracking-PT-q3m064-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 4 place count 235 transition count 2753
Applied a total of 4 rules in 112 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 14:15:20] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:15:20] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 14:15:20] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-12 14:15:20] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:15:20] [INFO ] Invariant cache hit.
[2023-03-12 14:15:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:15:21] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1705 ms to find 0 implicit places.
[2023-03-12 14:15:21] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-12 14:15:21] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:15:21] [INFO ] Invariant cache hit.
[2023-03-12 14:15:22] [INFO ] Dead Transitions using invariants and state equation in 859 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2850 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m064-LTLCardinality-00 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 3 s165)], 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 92 reset in 834 ms.
Product exploration explored 100000 steps with 91 reset in 757 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 170 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Finished random walk after 474 steps, including 2 resets, run visited all 1 properties in 3 ms. (steps per millisecond=158 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 34 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:15:25] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:15:25] [INFO ] Invariant cache hit.
[2023-03-12 14:15:25] [INFO ] Implicit Places using invariants in 397 ms returned []
[2023-03-12 14:15:25] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:15:25] [INFO ] Invariant cache hit.
[2023-03-12 14:15:25] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:15:27] [INFO ] Implicit Places using invariants and state equation in 1793 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
[2023-03-12 14:15:27] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-12 14:15:27] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:15:27] [INFO ] Invariant cache hit.
[2023-03-12 14:15:28] [INFO ] Dead Transitions using invariants and state equation in 855 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3203 ms. Remains : 235/235 places, 2753/2753 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4156 steps, including 1 resets, run visited all 1 properties in 36 ms. (steps per millisecond=115 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 94 reset in 663 ms.
Product exploration explored 100000 steps with 97 reset in 724 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 35 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:15:30] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:15:30] [INFO ] Invariant cache hit.
[2023-03-12 14:15:30] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-12 14:15:30] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:15:30] [INFO ] Invariant cache hit.
[2023-03-12 14:15:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:15:32] [INFO ] Implicit Places using invariants and state equation in 1496 ms returned []
Implicit Place search using SMT with State Equation took 1881 ms to find 0 implicit places.
[2023-03-12 14:15:32] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-12 14:15:32] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:15:32] [INFO ] Invariant cache hit.
[2023-03-12 14:15:33] [INFO ] Dead Transitions using invariants and state equation in 960 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2976 ms. Remains : 235/235 places, 2753/2753 transitions.
Treatment of property BugTracking-PT-q3m064-LTLCardinality-00 finished in 13583 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-12 14:15:33] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:15:33] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 14:15:33] [INFO ] Implicit Places using invariants in 290 ms returned []
[2023-03-12 14:15:33] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:15:33] [INFO ] Invariant cache hit.
[2023-03-12 14:15:34] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:15:35] [INFO ] Implicit Places using invariants and state equation in 1640 ms returned []
Implicit Place search using SMT with State Equation took 1933 ms to find 0 implicit places.
[2023-03-12 14:15:35] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:15:35] [INFO ] Invariant cache hit.
[2023-03-12 14:15:36] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2896 ms. Remains : 237/237 places, 2750/2750 transitions.
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m064-LTLCardinality-02 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 3 s189)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1193 ms.
Product exploration explored 100000 steps with 25000 reset in 1168 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 180499 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 180499 steps, saw 89197 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:15:42] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:15:42] [INFO ] Invariant cache hit.
[2023-03-12 14:15:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:15:42] [INFO ] After 463ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:15:42] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:15:42] [INFO ] After 120ms SMT Verify possible using 240 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:15:42] [INFO ] After 684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:15:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:15:43] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:15:43] [INFO ] After 228ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:15:44] [INFO ] Deduced a trap composed of 15 places in 341 ms of which 1 ms to minimize.
[2023-03-12 14:15:44] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 0 ms to minimize.
[2023-03-12 14:15:45] [INFO ] Deduced a trap composed of 51 places in 381 ms of which 0 ms to minimize.
[2023-03-12 14:15:45] [INFO ] Deduced a trap composed of 24 places in 216 ms of which 1 ms to minimize.
[2023-03-12 14:15:45] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1576 ms
[2023-03-12 14:15:45] [INFO ] After 1882ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 88 ms.
[2023-03-12 14:15:45] [INFO ] After 2550ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 114 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10034 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 182179 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 182179 steps, saw 85629 distinct states, run finished after 3001 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:15:48] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:15:48] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-12 14:15:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:15:49] [INFO ] After 422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:15:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:15:49] [INFO ] After 355ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:15:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:15:49] [INFO ] After 158ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:15:50] [INFO ] Deduced a trap composed of 11 places in 226 ms of which 1 ms to minimize.
[2023-03-12 14:15:50] [INFO ] Deduced a trap composed of 19 places in 258 ms of which 0 ms to minimize.
[2023-03-12 14:15:50] [INFO ] Deduced a trap composed of 10 places in 253 ms of which 1 ms to minimize.
[2023-03-12 14:15:50] [INFO ] Deduced a trap composed of 39 places in 147 ms of which 0 ms to minimize.
[2023-03-12 14:15:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1133 ms
[2023-03-12 14:15:50] [INFO ] After 1327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-12 14:15:50] [INFO ] After 1831ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 45 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:15:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:15:51] [INFO ] Invariant cache hit.
[2023-03-12 14:15:51] [INFO ] Implicit Places using invariants in 261 ms returned []
[2023-03-12 14:15:51] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:15:51] [INFO ] Invariant cache hit.
[2023-03-12 14:15:51] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:15:52] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 1813 ms to find 0 implicit places.
[2023-03-12 14:15:52] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-12 14:15:52] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:15:52] [INFO ] Invariant cache hit.
[2023-03-12 14:15:53] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2773 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 273 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:15:54] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-12 14:15:54] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:15:54] [INFO ] After 447ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:15:54] [INFO ] After 514ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-12 14:15:54] [INFO ] After 604ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 109 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 7 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-12 14:15:55] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:15:55] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 14:15:55] [INFO ] Implicit Places using invariants in 282 ms returned []
[2023-03-12 14:15:55] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:15:55] [INFO ] Invariant cache hit.
[2023-03-12 14:15:55] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:15:56] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 1848 ms to find 0 implicit places.
[2023-03-12 14:15:56] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:15:56] [INFO ] Invariant cache hit.
[2023-03-12 14:15:57] [INFO ] Dead Transitions using invariants and state equation in 805 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2664 ms. Remains : 237/237 places, 2750/2750 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188808 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188808 steps, saw 93358 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:16:01] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:16:01] [INFO ] Invariant cache hit.
[2023-03-12 14:16:01] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:16:01] [INFO ] After 473ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:16:01] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:16:01] [INFO ] After 104ms SMT Verify possible using 240 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:16:01] [INFO ] After 638ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:16:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:16:02] [INFO ] After 418ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:02] [INFO ] After 168ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:02] [INFO ] Deduced a trap composed of 15 places in 430 ms of which 1 ms to minimize.
[2023-03-12 14:16:03] [INFO ] Deduced a trap composed of 11 places in 366 ms of which 1 ms to minimize.
[2023-03-12 14:16:03] [INFO ] Deduced a trap composed of 51 places in 422 ms of which 1 ms to minimize.
[2023-03-12 14:16:04] [INFO ] Deduced a trap composed of 24 places in 252 ms of which 6 ms to minimize.
[2023-03-12 14:16:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1787 ms
[2023-03-12 14:16:04] [INFO ] After 2013ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-12 14:16:04] [INFO ] After 2545ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 125 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10041 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=836 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 202702 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202702 steps, saw 98937 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:16:07] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:16:07] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-12 14:16:07] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:16:08] [INFO ] After 575ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:16:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 14:16:08] [INFO ] After 385ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:16:08] [INFO ] After 164ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:08] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 0 ms to minimize.
[2023-03-12 14:16:09] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 1 ms to minimize.
[2023-03-12 14:16:09] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 0 ms to minimize.
[2023-03-12 14:16:09] [INFO ] Deduced a trap composed of 39 places in 174 ms of which 1 ms to minimize.
[2023-03-12 14:16:09] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1112 ms
[2023-03-12 14:16:09] [INFO ] After 1311ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-12 14:16:09] [INFO ] After 1804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 38 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:16:09] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:16:09] [INFO ] Invariant cache hit.
[2023-03-12 14:16:10] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-12 14:16:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:16:10] [INFO ] Invariant cache hit.
[2023-03-12 14:16:10] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:16:11] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1732 ms to find 0 implicit places.
[2023-03-12 14:16:11] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-12 14:16:11] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:16:11] [INFO ] Invariant cache hit.
[2023-03-12 14:16:12] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2624 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 319 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:16:12] [INFO ] Computed 9 place invariants in 8 ms
[2023-03-12 14:16:12] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:16:13] [INFO ] After 401ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:16:13] [INFO ] After 468ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 14:16:13] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1346 ms.
Product exploration explored 100000 steps with 25000 reset in 1175 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 237 transition count 2757
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 94 ms. Remains 237 /237 variables (removed 0) and now considering 2757/2750 (removed -7) transitions.
[2023-03-12 14:16:17] [INFO ] Redundant transitions in 73 ms returned []
[2023-03-12 14:16:17] [INFO ] Flow matrix only has 2628 transitions (discarded 129 similar events)
// Phase 1: matrix 2628 rows 237 cols
[2023-03-12 14:16:17] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 14:16:18] [INFO ] Dead Transitions using invariants and state equation in 1034 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/237 places, 2757/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1209 ms. Remains : 237/237 places, 2757/2750 transitions.
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-12 14:16:18] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:16:18] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-12 14:16:18] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-12 14:16:18] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:16:18] [INFO ] Invariant cache hit.
[2023-03-12 14:16:18] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:16:19] [INFO ] Implicit Places using invariants and state equation in 1504 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2023-03-12 14:16:19] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:16:19] [INFO ] Invariant cache hit.
[2023-03-12 14:16:20] [INFO ] Dead Transitions using invariants and state equation in 810 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2632 ms. Remains : 237/237 places, 2750/2750 transitions.
Treatment of property BugTracking-PT-q3m064-LTLCardinality-02 finished in 47402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Found a Shortening insensitive property : BugTracking-PT-q3m064-LTLCardinality-02
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 60 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 14:16:21] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:16:21] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 14:16:21] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-12 14:16:21] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:16:21] [INFO ] Invariant cache hit.
[2023-03-12 14:16:22] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:16:23] [INFO ] Implicit Places using invariants and state equation in 1533 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
[2023-03-12 14:16:23] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:16:23] [INFO ] Invariant cache hit.
[2023-03-12 14:16:24] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2939 ms. Remains : 235/237 places, 2753/2750 transitions.
Running random walk in product with property : BugTracking-PT-q3m064-LTLCardinality-02 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 3 s187)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1160 ms.
Product exploration explored 100000 steps with 25000 reset in 1157 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 200 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10047 steps, including 13 resets, run finished after 43 ms. (steps per millisecond=233 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 174564 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174564 steps, saw 86864 distinct states, run finished after 3003 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:16:29] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:16:29] [INFO ] Invariant cache hit.
[2023-03-12 14:16:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:16:30] [INFO ] After 536ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:16:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:16:30] [INFO ] After 156ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:16:30] [INFO ] After 781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:16:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 14:16:31] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:31] [INFO ] After 210ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:32] [INFO ] Deduced a trap composed of 11 places in 389 ms of which 1 ms to minimize.
[2023-03-12 14:16:32] [INFO ] Deduced a trap composed of 12 places in 278 ms of which 0 ms to minimize.
[2023-03-12 14:16:32] [INFO ] Deduced a trap composed of 12 places in 301 ms of which 0 ms to minimize.
[2023-03-12 14:16:33] [INFO ] Deduced a trap composed of 17 places in 441 ms of which 1 ms to minimize.
[2023-03-12 14:16:33] [INFO ] Deduced a trap composed of 12 places in 245 ms of which 1 ms to minimize.
[2023-03-12 14:16:33] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2009 ms
[2023-03-12 14:16:33] [INFO ] After 2259ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-12 14:16:33] [INFO ] After 2996ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 83 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10033 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=771 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 202711 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202711 steps, saw 98944 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:16:36] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:16:36] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-12 14:16:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:16:37] [INFO ] After 526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:16:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:16:37] [INFO ] After 387ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:16:37] [INFO ] After 141ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:38] [INFO ] Deduced a trap composed of 11 places in 222 ms of which 1 ms to minimize.
[2023-03-12 14:16:38] [INFO ] Deduced a trap composed of 19 places in 246 ms of which 1 ms to minimize.
[2023-03-12 14:16:38] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 1 ms to minimize.
[2023-03-12 14:16:39] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 0 ms to minimize.
[2023-03-12 14:16:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1100 ms
[2023-03-12 14:16:39] [INFO ] After 1275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-12 14:16:39] [INFO ] After 1777ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:16:39] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:16:39] [INFO ] Invariant cache hit.
[2023-03-12 14:16:39] [INFO ] Implicit Places using invariants in 356 ms returned []
[2023-03-12 14:16:39] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:16:39] [INFO ] Invariant cache hit.
[2023-03-12 14:16:40] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:16:41] [INFO ] Implicit Places using invariants and state equation in 1613 ms returned []
Implicit Place search using SMT with State Equation took 1974 ms to find 0 implicit places.
[2023-03-12 14:16:41] [INFO ] Redundant transitions in 105 ms returned []
[2023-03-12 14:16:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:16:41] [INFO ] Invariant cache hit.
[2023-03-12 14:16:42] [INFO ] Dead Transitions using invariants and state equation in 782 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2914 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 292 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:16:42] [INFO ] Computed 9 place invariants in 19 ms
[2023-03-12 14:16:42] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 14:16:43] [INFO ] After 517ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:16:43] [INFO ] After 586ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-12 14:16:43] [INFO ] After 710ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 14 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:16:43] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:16:43] [INFO ] Computed 8 place invariants in 16 ms
[2023-03-12 14:16:44] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-12 14:16:44] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:16:44] [INFO ] Invariant cache hit.
[2023-03-12 14:16:44] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:16:45] [INFO ] Implicit Places using invariants and state equation in 1543 ms returned []
Implicit Place search using SMT with State Equation took 1927 ms to find 0 implicit places.
[2023-03-12 14:16:45] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:16:45] [INFO ] Invariant cache hit.
[2023-03-12 14:16:46] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2831 ms. Remains : 235/235 places, 2753/2753 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 9 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 173494 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 173494 steps, saw 86321 distinct states, run finished after 3003 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:16:49] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:16:49] [INFO ] Invariant cache hit.
[2023-03-12 14:16:49] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 14:16:50] [INFO ] After 429ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:16:50] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:16:50] [INFO ] After 115ms SMT Verify possible using 241 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:16:50] [INFO ] After 598ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:16:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 14:16:50] [INFO ] After 437ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:51] [INFO ] After 173ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:51] [INFO ] Deduced a trap composed of 11 places in 294 ms of which 1 ms to minimize.
[2023-03-12 14:16:51] [INFO ] Deduced a trap composed of 12 places in 319 ms of which 0 ms to minimize.
[2023-03-12 14:16:52] [INFO ] Deduced a trap composed of 12 places in 397 ms of which 0 ms to minimize.
[2023-03-12 14:16:52] [INFO ] Deduced a trap composed of 17 places in 338 ms of which 0 ms to minimize.
[2023-03-12 14:16:53] [INFO ] Deduced a trap composed of 12 places in 306 ms of which 0 ms to minimize.
[2023-03-12 14:16:53] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2093 ms
[2023-03-12 14:16:53] [INFO ] After 2303ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-12 14:16:53] [INFO ] After 2846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 66 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10039 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=836 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 208917 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 208917 steps, saw 102884 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:16:56] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:16:56] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 14:16:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:16:56] [INFO ] After 457ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:16:56] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:16:57] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:16:57] [INFO ] After 145ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:16:57] [INFO ] Deduced a trap composed of 11 places in 219 ms of which 1 ms to minimize.
[2023-03-12 14:16:57] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 1 ms to minimize.
[2023-03-12 14:16:58] [INFO ] Deduced a trap composed of 10 places in 267 ms of which 0 ms to minimize.
[2023-03-12 14:16:58] [INFO ] Deduced a trap composed of 39 places in 178 ms of which 1 ms to minimize.
[2023-03-12 14:16:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1149 ms
[2023-03-12 14:16:58] [INFO ] After 1343ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-12 14:16:58] [INFO ] After 1945ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 75 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 55 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:16:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:16:58] [INFO ] Invariant cache hit.
[2023-03-12 14:16:59] [INFO ] Implicit Places using invariants in 351 ms returned []
[2023-03-12 14:16:59] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:16:59] [INFO ] Invariant cache hit.
[2023-03-12 14:16:59] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:17:00] [INFO ] Implicit Places using invariants and state equation in 1500 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
[2023-03-12 14:17:00] [INFO ] Redundant transitions in 75 ms returned []
[2023-03-12 14:17:00] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:17:00] [INFO ] Invariant cache hit.
[2023-03-12 14:17:01] [INFO ] Dead Transitions using invariants and state equation in 759 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2766 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
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 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 371 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:17:02] [INFO ] Computed 9 place invariants in 19 ms
[2023-03-12 14:17:02] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 14:17:02] [INFO ] After 453ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 14:17:02] [INFO ] After 526ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-12 14:17:02] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 66 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 1284 ms.
Product exploration explored 100000 steps with 25000 reset in 1117 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 27 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:17:05] [INFO ] Redundant transitions in 57 ms returned []
[2023-03-12 14:17:05] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:17:05] [INFO ] Computed 8 place invariants in 15 ms
[2023-03-12 14:17:06] [INFO ] Dead Transitions using invariants and state equation in 907 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1001 ms. Remains : 235/235 places, 2753/2753 transitions.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 7 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:17:06] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:17:06] [INFO ] Invariant cache hit.
[2023-03-12 14:17:07] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-12 14:17:07] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:17:07] [INFO ] Invariant cache hit.
[2023-03-12 14:17:07] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:17:08] [INFO ] Implicit Places using invariants and state equation in 1545 ms returned []
Implicit Place search using SMT with State Equation took 1819 ms to find 0 implicit places.
[2023-03-12 14:17:08] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:17:08] [INFO ] Invariant cache hit.
[2023-03-12 14:17:09] [INFO ] Dead Transitions using invariants and state equation in 661 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2489 ms. Remains : 235/235 places, 2753/2753 transitions.
Treatment of property BugTracking-PT-q3m064-LTLCardinality-02 finished in 48293 ms.
[2023-03-12 14:17:09] [INFO ] Flatten gal took : 114 ms
[2023-03-12 14:17:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 14:17:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 18 ms.
Total runtime 128107 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1382/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1382/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BugTracking-PT-q3m064-LTLCardinality-00
Could not compute solution for formula : BugTracking-PT-q3m064-LTLCardinality-02

BK_STOP 1678630631390

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BugTracking-PT-q3m064-LTLCardinality-00
ltl formula formula --ltl=/tmp/1382/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 237 places, 2750 transitions and 13477 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.540 real 0.090 user 0.150 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1382/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1382/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1382/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1382/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name BugTracking-PT-q3m064-LTLCardinality-02
ltl formula formula --ltl=/tmp/1382/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 237 places, 2750 transitions and 13477 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.550 real 0.140 user 0.170 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1382/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1382/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1382/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1382/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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="BugTracking-PT-q3m064"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q3m064, 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 r041-tajo-167813694600363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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