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-167813694700435.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-q8m128, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r041-tajo-167813694700435
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Feb 26 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 06:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 06:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 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-q8m128-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m128-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678637102014

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-q8m128
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 16:05:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 16:05:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:05:05] [INFO ] Load time of PNML (sax parser for PT used): 1126 ms
[2023-03-12 16:05:05] [INFO ] Transformed 754 places.
[2023-03-12 16:05:05] [INFO ] Transformed 27370 transitions.
[2023-03-12 16:05:05] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1496 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 191 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 187 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-12 16:05:06] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 16:05:06] [INFO ] Computed 8 place invariants in 92 ms
[2023-03-12 16:05:07] [INFO ] Implicit Places using invariants in 1103 ms returned []
[2023-03-12 16:05:07] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 16:05:07] [INFO ] Invariant cache hit.
[2023-03-12 16:05:08] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 16:05:10] [INFO ] Implicit Places using invariants and state equation in 2457 ms returned []
Implicit Place search using SMT with State Equation took 3621 ms to find 0 implicit places.
[2023-03-12 16:05:10] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 16:05:10] [INFO ] Invariant cache hit.
[2023-03-12 16:05:12] [INFO ] Dead Transitions using invariants and state equation in 1885 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5696 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 15 out of 277 places after structural reductions.
[2023-03-12 16:05:13] [INFO ] Flatten gal took : 666 ms
[2023-03-12 16:05:13] [INFO ] Flatten gal took : 476 ms
[2023-03-12 16:05:14] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 470 ms. (steps per millisecond=21 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 9) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-12 16:05:15] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 16:05:15] [INFO ] Invariant cache hit.
[2023-03-12 16:05:15] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 16:05:15] [INFO ] After 163ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-12 16:05:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:05:17] [INFO ] After 1126ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-12 16:05:17] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 16:05:18] [INFO ] After 1133ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :2 sat :5
[2023-03-12 16:05:19] [INFO ] Deduced a trap composed of 38 places in 735 ms of which 6 ms to minimize.
[2023-03-12 16:05:20] [INFO ] Deduced a trap composed of 31 places in 808 ms of which 2 ms to minimize.
[2023-03-12 16:05:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1729 ms
[2023-03-12 16:05:21] [INFO ] Deduced a trap composed of 7 places in 1054 ms of which 2 ms to minimize.
[2023-03-12 16:05:22] [INFO ] Deduced a trap composed of 89 places in 809 ms of which 2 ms to minimize.
[2023-03-12 16:05:23] [INFO ] Deduced a trap composed of 20 places in 906 ms of which 1 ms to minimize.
[2023-03-12 16:05:24] [INFO ] Deduced a trap composed of 60 places in 653 ms of which 0 ms to minimize.
[2023-03-12 16:05:24] [INFO ] Deduced a trap composed of 23 places in 479 ms of which 1 ms to minimize.
[2023-03-12 16:05:25] [INFO ] Deduced a trap composed of 62 places in 415 ms of which 17 ms to minimize.
[2023-03-12 16:05:25] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5051 ms
[2023-03-12 16:05:25] [INFO ] After 8582ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 559 ms.
[2023-03-12 16:05:26] [INFO ] After 10399ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 177 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 269 transition count 3871
Applied a total of 16 rules in 528 ms. Remains 269 /277 variables (removed 8) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 541 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10037 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=669 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 86302 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86302 steps, saw 34902 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 16:05:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:05:30] [INFO ] Computed 8 place invariants in 34 ms
[2023-03-12 16:05:30] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:05:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:05:32] [INFO ] After 1580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:05:32] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:05:32] [INFO ] After 670ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 16:05:33] [INFO ] Deduced a trap composed of 19 places in 523 ms of which 1 ms to minimize.
[2023-03-12 16:05:34] [INFO ] Deduced a trap composed of 57 places in 528 ms of which 1 ms to minimize.
[2023-03-12 16:05:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1300 ms
[2023-03-12 16:05:34] [INFO ] After 2616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 704 ms.
[2023-03-12 16:05:35] [INFO ] After 5064ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 502 ms.
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 125 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 142 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:05:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:05:36] [INFO ] Invariant cache hit.
[2023-03-12 16:05:36] [INFO ] Implicit Places using invariants in 546 ms returned []
[2023-03-12 16:05:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:05:36] [INFO ] Invariant cache hit.
[2023-03-12 16:05:37] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:05:42] [INFO ] Implicit Places using invariants and state equation in 5670 ms returned []
Implicit Place search using SMT with State Equation took 6222 ms to find 0 implicit places.
[2023-03-12 16:05:42] [INFO ] Redundant transitions in 326 ms returned []
[2023-03-12 16:05:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:05:42] [INFO ] Invariant cache hit.
[2023-03-12 16:05:45] [INFO ] Dead Transitions using invariants and state equation in 2131 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8838 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
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 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 394 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 16:05:45] [INFO ] Computed 9 place invariants in 19 ms
[2023-03-12 16:05:45] [INFO ] After 302ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 16:05:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 16:05:47] [INFO ] After 1305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 16:05:47] [INFO ] After 1963ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 426 ms.
[2023-03-12 16:05:48] [INFO ] After 2515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 3 atomic propositions for a total of 7 simplifications.
FORMULA BugTracking-PT-q8m128-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 131 stable transitions
FORMULA BugTracking-PT-q8m128-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 3 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Applied a total of 4 rules in 226 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-12 16:05:48] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 16:05:48] [INFO ] Computed 8 place invariants in 28 ms
[2023-03-12 16:05:49] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 16:05:49] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:05:49] [INFO ] Invariant cache hit.
[2023-03-12 16:05:49] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:05:51] [INFO ] Implicit Places using invariants and state equation in 2280 ms returned []
Implicit Place search using SMT with State Equation took 2801 ms to find 0 implicit places.
[2023-03-12 16:05:51] [INFO ] Redundant transitions in 283 ms returned []
[2023-03-12 16:05:51] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:05:51] [INFO ] Invariant cache hit.
[2023-03-12 16:05:53] [INFO ] Dead Transitions using invariants and state equation in 1244 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4596 ms. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BugTracking-PT-q8m128-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LEQ 1 s99) (LEQ s154 s224)), p1:(LEQ s154 s224)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9360 steps with 6 reset in 164 ms.
FORMULA BugTracking-PT-q8m128-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m128-LTLCardinality-01 finished in 5077 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 17 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:05:53] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 16:05:53] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-12 16:06:05] [INFO ] Implicit Places using invariants in 11934 ms returned []
[2023-03-12 16:06:05] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 16:06:05] [INFO ] Invariant cache hit.
[2023-03-12 16:06:06] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 16:06:08] [INFO ] Implicit Places using invariants and state equation in 2781 ms returned []
Implicit Place search using SMT with State Equation took 14721 ms to find 0 implicit places.
[2023-03-12 16:06:08] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 16:06:08] [INFO ] Invariant cache hit.
[2023-03-12 16:06:10] [INFO ] Dead Transitions using invariants and state equation in 1735 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16476 ms. Remains : 277/277 places, 3871/3871 transitions.
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m128-LTLCardinality-03 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: 1}]], initial=2, aps=[p0:(GT 1 s139)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1220 ms.
Product exploration explored 100000 steps with 33333 reset in 1642 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BugTracking-PT-q8m128-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BugTracking-PT-q8m128-LTLCardinality-03 finished in 19795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 15 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:06:13] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 16:06:13] [INFO ] Invariant cache hit.
[2023-03-12 16:06:13] [INFO ] Implicit Places using invariants in 461 ms returned []
[2023-03-12 16:06:13] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 16:06:13] [INFO ] Invariant cache hit.
[2023-03-12 16:06:14] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 16:06:17] [INFO ] Implicit Places using invariants and state equation in 3773 ms returned []
Implicit Place search using SMT with State Equation took 4253 ms to find 0 implicit places.
[2023-03-12 16:06:17] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 16:06:17] [INFO ] Invariant cache hit.
[2023-03-12 16:06:47] [INFO ] Performed 1270/3871 'is it Dead' test of which 0 returned DEAD in 30 seconds.
[2023-03-12 16:06:54] [INFO ] Dead Transitions using invariants and state equation in 37310 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41609 ms. Remains : 277/277 places, 3871/3871 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BugTracking-PT-q8m128-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GT s4 s73), p1:(GT s49 s253)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2146 reset in 1003 ms.
Product exploration explored 100000 steps with 2138 reset in 934 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 436 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1428 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1428 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 6 factoid took 396 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
[2023-03-12 16:06:58] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 16:06:58] [INFO ] Invariant cache hit.
[2023-03-12 16:07:00] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 16:07:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:07:01] [INFO ] [Real]Absence check using state equation in 1318 ms returned sat
[2023-03-12 16:07:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:07:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:07:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:07:03] [INFO ] [Nat]Absence check using state equation in 681 ms returned sat
[2023-03-12 16:07:03] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 16:07:04] [INFO ] [Nat]Added 282 Read/Feed constraints in 1017 ms returned sat
[2023-03-12 16:07:05] [INFO ] Deduced a trap composed of 17 places in 426 ms of which 1 ms to minimize.
[2023-03-12 16:07:05] [INFO ] Deduced a trap composed of 24 places in 345 ms of which 0 ms to minimize.
[2023-03-12 16:07:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1143 ms
[2023-03-12 16:07:06] [INFO ] Computed and/alt/rep : 469/1767/469 causal constraints (skipped 3236 transitions) in 584 ms.
[2023-03-12 16:07:07] [INFO ] Added : 9 causal constraints over 2 iterations in 1252 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 277 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Applied a total of 4 rules in 168 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-12 16:07:07] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 16:07:07] [INFO ] Computed 8 place invariants in 26 ms
[2023-03-12 16:07:07] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-12 16:07:08] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:08] [INFO ] Invariant cache hit.
[2023-03-12 16:07:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:07:17] [INFO ] Implicit Places using invariants and state equation in 9496 ms returned []
Implicit Place search using SMT with State Equation took 10049 ms to find 0 implicit places.
[2023-03-12 16:07:17] [INFO ] Redundant transitions in 187 ms returned []
[2023-03-12 16:07:17] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:17] [INFO ] Invariant cache hit.
[2023-03-12 16:07:19] [INFO ] Dead Transitions using invariants and state equation in 1717 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12137 ms. Remains : 275/277 places, 3877/3871 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 195 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0)]
Finished random walk after 521 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=260 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 208 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
[2023-03-12 16:07:20] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:20] [INFO ] Invariant cache hit.
[2023-03-12 16:07:22] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-12 16:07:22] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2023-03-12 16:07:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-12 16:07:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-12 16:07:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-12 16:07:25] [INFO ] [Nat]Absence check using state equation in 1141 ms returned sat
[2023-03-12 16:07:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:07:26] [INFO ] [Nat]Added 283 Read/Feed constraints in 939 ms returned sat
[2023-03-12 16:07:27] [INFO ] Deduced a trap composed of 31 places in 683 ms of which 2 ms to minimize.
[2023-03-12 16:07:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 980 ms
[2023-03-12 16:07:27] [INFO ] Computed and/alt/rep : 465/1763/465 causal constraints (skipped 3238 transitions) in 351 ms.
[2023-03-12 16:07:28] [INFO ] Added : 2 causal constraints over 1 iterations in 804 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2164 reset in 933 ms.
Product exploration explored 100000 steps with 2165 reset in 1033 ms.
Support contains 2 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 102 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-12 16:07:30] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:30] [INFO ] Invariant cache hit.
[2023-03-12 16:07:30] [INFO ] Implicit Places using invariants in 485 ms returned []
[2023-03-12 16:07:30] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:30] [INFO ] Invariant cache hit.
[2023-03-12 16:07:31] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:07:33] [INFO ] Implicit Places using invariants and state equation in 2088 ms returned []
Implicit Place search using SMT with State Equation took 2604 ms to find 0 implicit places.
[2023-03-12 16:07:33] [INFO ] Redundant transitions in 192 ms returned []
[2023-03-12 16:07:33] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:33] [INFO ] Invariant cache hit.
[2023-03-12 16:07:35] [INFO ] Dead Transitions using invariants and state equation in 1959 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4886 ms. Remains : 275/275 places, 3877/3877 transitions.
Treatment of property BugTracking-PT-q8m128-LTLCardinality-04 finished in 82593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Applied a total of 4 rules in 146 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-12 16:07:36] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:36] [INFO ] Invariant cache hit.
[2023-03-12 16:07:36] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-12 16:07:36] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:36] [INFO ] Invariant cache hit.
[2023-03-12 16:07:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:07:39] [INFO ] Implicit Places using invariants and state equation in 3101 ms returned []
Implicit Place search using SMT with State Equation took 3570 ms to find 0 implicit places.
[2023-03-12 16:07:39] [INFO ] Redundant transitions in 170 ms returned []
[2023-03-12 16:07:39] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:39] [INFO ] Invariant cache hit.
[2023-03-12 16:07:41] [INFO ] Dead Transitions using invariants and state equation in 1759 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5663 ms. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m128-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s164)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 45 reset in 603 ms.
Product exploration explored 100000 steps with 46 reset in 673 ms.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 134 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 145884 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145884 steps, saw 70340 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:07:46] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:07:46] [INFO ] Invariant cache hit.
[2023-03-12 16:07:46] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 16:07:47] [INFO ] After 743ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 16:07:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:07:47] [INFO ] After 171ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:07:47] [INFO ] After 1012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:07:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:07:48] [INFO ] After 705ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:07:48] [INFO ] After 281ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:07:49] [INFO ] Deduced a trap composed of 46 places in 752 ms of which 1 ms to minimize.
[2023-03-12 16:07:50] [INFO ] Deduced a trap composed of 58 places in 749 ms of which 0 ms to minimize.
[2023-03-12 16:07:50] [INFO ] Deduced a trap composed of 17 places in 748 ms of which 1 ms to minimize.
[2023-03-12 16:07:51] [INFO ] Deduced a trap composed of 15 places in 541 ms of which 1 ms to minimize.
[2023-03-12 16:07:52] [INFO ] Deduced a trap composed of 62 places in 367 ms of which 1 ms to minimize.
[2023-03-12 16:07:52] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 1 ms to minimize.
[2023-03-12 16:07:52] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4223 ms
[2023-03-12 16:07:52] [INFO ] After 4612ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-12 16:07:52] [INFO ] After 5527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 269 transition count 3871
Applied a total of 12 rules in 155 ms. Remains 269 /275 variables (removed 6) and now considering 3871/3877 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 269/275 places, 3871/3877 transitions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1252 ) 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 126770 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126770 steps, saw 52610 distinct states, run finished after 3003 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:07:55] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:07:56] [INFO ] Computed 8 place invariants in 42 ms
[2023-03-12 16:07:56] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:07:56] [INFO ] After 729ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 16:07:56] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:07:57] [INFO ] After 179ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:07:57] [INFO ] After 1036ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:07:57] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:07:57] [INFO ] After 782ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:07:58] [INFO ] After 129ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:07:58] [INFO ] Deduced a trap composed of 54 places in 464 ms of which 1 ms to minimize.
[2023-03-12 16:07:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 625 ms
[2023-03-12 16:07:58] [INFO ] After 820ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-12 16:07:58] [INFO ] After 1791ms 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 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 81 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:07:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:07:59] [INFO ] Invariant cache hit.
[2023-03-12 16:07:59] [INFO ] Implicit Places using invariants in 474 ms returned []
[2023-03-12 16:07:59] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:07:59] [INFO ] Invariant cache hit.
[2023-03-12 16:08:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:08:01] [INFO ] Implicit Places using invariants and state equation in 1970 ms returned []
Implicit Place search using SMT with State Equation took 2457 ms to find 0 implicit places.
[2023-03-12 16:08:01] [INFO ] Redundant transitions in 116 ms returned []
[2023-03-12 16:08:01] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:08:01] [INFO ] Invariant cache hit.
[2023-03-12 16:08:03] [INFO ] Dead Transitions using invariants and state equation in 1860 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4520 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
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 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 376 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 16:08:03] [INFO ] Computed 9 place invariants in 12 ms
[2023-03-12 16:08:03] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 16:08:04] [INFO ] After 656ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 16:08:04] [INFO ] After 817ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-12 16:08:04] [INFO ] After 1049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 72 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-12 16:08:05] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 16:08:05] [INFO ] Computed 8 place invariants in 32 ms
[2023-03-12 16:08:05] [INFO ] Implicit Places using invariants in 640 ms returned []
[2023-03-12 16:08:05] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:08:05] [INFO ] Invariant cache hit.
[2023-03-12 16:08:07] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:08:09] [INFO ] Implicit Places using invariants and state equation in 3686 ms returned []
Implicit Place search using SMT with State Equation took 4342 ms to find 0 implicit places.
[2023-03-12 16:08:09] [INFO ] Redundant transitions in 119 ms returned []
[2023-03-12 16:08:09] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:08:09] [INFO ] Invariant cache hit.
[2023-03-12 16:08:11] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6434 ms. Remains : 275/275 places, 3877/3877 transitions.
Computed a total of 6 stabilizing places and 131 stable transitions
Computed a total of 6 stabilizing places and 131 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 166 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 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 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 147564 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 147564 steps, saw 71136 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:08:14] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:08:14] [INFO ] Invariant cache hit.
[2023-03-12 16:08:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:08:15] [INFO ] After 643ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 16:08:15] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:08:15] [INFO ] After 206ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:08:15] [INFO ] After 952ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:08:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:08:16] [INFO ] After 774ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:08:17] [INFO ] After 425ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:08:18] [INFO ] Deduced a trap composed of 46 places in 773 ms of which 1 ms to minimize.
[2023-03-12 16:08:18] [INFO ] Deduced a trap composed of 58 places in 816 ms of which 3 ms to minimize.
[2023-03-12 16:08:20] [INFO ] Deduced a trap composed of 17 places in 1319 ms of which 1 ms to minimize.
[2023-03-12 16:08:21] [INFO ] Deduced a trap composed of 15 places in 518 ms of which 0 ms to minimize.
[2023-03-12 16:08:21] [INFO ] Deduced a trap composed of 62 places in 332 ms of which 0 ms to minimize.
[2023-03-12 16:08:21] [INFO ] Deduced a trap composed of 33 places in 498 ms of which 0 ms to minimize.
[2023-03-12 16:08:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 4853 ms
[2023-03-12 16:08:22] [INFO ] After 5345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-12 16:08:22] [INFO ] After 6301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 269 transition count 3871
Applied a total of 12 rules in 154 ms. Remains 269 /275 variables (removed 6) and now considering 3871/3877 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 269/275 places, 3871/3877 transitions.
Incomplete random walk after 10012 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 126022 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 126022 steps, saw 52109 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 16:08:25] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 16:08:25] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-12 16:08:25] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 16:08:26] [INFO ] After 736ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 16:08:26] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:08:26] [INFO ] After 159ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:08:26] [INFO ] After 998ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 16:08:26] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 16:08:27] [INFO ] After 755ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 16:08:27] [INFO ] After 112ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 16:08:27] [INFO ] Deduced a trap composed of 54 places in 401 ms of which 3 ms to minimize.
[2023-03-12 16:08:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 611 ms
[2023-03-12 16:08:28] [INFO ] After 816ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-12 16:08:28] [INFO ] After 1769ms 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 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 83 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 61 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 16:08:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:08:28] [INFO ] Invariant cache hit.
[2023-03-12 16:08:28] [INFO ] Implicit Places using invariants in 501 ms returned []
[2023-03-12 16:08:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:08:28] [INFO ] Invariant cache hit.
[2023-03-12 16:08:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:08:30] [INFO ] Implicit Places using invariants and state equation in 1844 ms returned []
Implicit Place search using SMT with State Equation took 2347 ms to find 0 implicit places.
[2023-03-12 16:08:30] [INFO ] Redundant transitions in 116 ms returned []
[2023-03-12 16:08:30] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 16:08:30] [INFO ] Invariant cache hit.
[2023-03-12 16:08:32] [INFO ] Dead Transitions using invariants and state equation in 1894 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4460 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
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 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 312 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 16:08:33] [INFO ] Computed 9 place invariants in 12 ms
[2023-03-12 16:08:33] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 16:08:33] [INFO ] After 661ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 16:08:33] [INFO ] After 765ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 16:08:34] [INFO ] After 912ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 153 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 46 reset in 650 ms.
Product exploration explored 100000 steps with 44 reset in 650 ms.
Support contains 1 out of 275 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 275/275 places, 3877/3877 transitions.
Applied a total of 0 rules in 61 ms. Remains 275 /275 variables (removed 0) and now considering 3877/3877 (removed 0) transitions.
[2023-03-12 16:08:35] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2023-03-12 16:08:35] [INFO ] Computed 8 place invariants in 11 ms
[2023-03-12 16:08:36] [INFO ] Implicit Places using invariants in 524 ms returned []
[2023-03-12 16:08:36] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:08:36] [INFO ] Invariant cache hit.
[2023-03-12 16:08:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:08:38] [INFO ] Implicit Places using invariants and state equation in 2058 ms returned []
Implicit Place search using SMT with State Equation took 2598 ms to find 0 implicit places.
[2023-03-12 16:08:38] [INFO ] Redundant transitions in 115 ms returned []
[2023-03-12 16:08:38] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:08:38] [INFO ] Invariant cache hit.
[2023-03-12 16:08:39] [INFO ] Dead Transitions using invariants and state equation in 1517 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4302 ms. Remains : 275/275 places, 3877/3877 transitions.
Treatment of property BugTracking-PT-q8m128-LTLCardinality-09 finished in 64241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
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 275 transition count 3877
Applied a total of 4 rules in 65 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2023-03-12 16:08:40] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:08:40] [INFO ] Invariant cache hit.
[2023-03-12 16:08:40] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-12 16:08:40] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:08:40] [INFO ] Invariant cache hit.
[2023-03-12 16:08:41] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 16:08:42] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2192 ms to find 0 implicit places.
[2023-03-12 16:08:42] [INFO ] Redundant transitions in 117 ms returned []
[2023-03-12 16:08:42] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2023-03-12 16:08:42] [INFO ] Invariant cache hit.
[2023-03-12 16:08:43] [INFO ] Dead Transitions using invariants and state equation in 1206 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3877/3871 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3590 ms. Remains : 275/277 places, 3877/3871 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m128-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s259 s148)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 2386 steps with 0 reset in 15 ms.
FORMULA BugTracking-PT-q8m128-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m128-LTLCardinality-14 finished in 3705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2023-03-12 16:08:44] [INFO ] Flatten gal took : 323 ms
[2023-03-12 16:08:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-12 16:08:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 3871 transitions and 19025 arcs took 50 ms.
Total runtime 220148 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1036/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1036/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BugTracking-PT-q8m128-LTLCardinality-04
Could not compute solution for formula : BugTracking-PT-q8m128-LTLCardinality-09

BK_STOP 1678637327641

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-q8m128-LTLCardinality-04
ltl formula formula --ltl=/tmp/1036/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 277 places, 3871 transitions and 19025 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1036/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1036/ltl_0_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.900 real 0.190 user 0.150 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1036/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1036/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 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-q8m128-LTLCardinality-09
ltl formula formula --ltl=/tmp/1036/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 277 places, 3871 transitions and 19025 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.940 real 0.150 user 0.270 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1036/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1036/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1036/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1036/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
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-q8m128"
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-q8m128, 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-167813694700435"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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