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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.4K Feb 26 06:23 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:23 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 26 06:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 26 06:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 07:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 06:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 06:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678629177711

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q3m032
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 13:52:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 13:52:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 13:53:00] [INFO ] Load time of PNML (sax parser for PT used): 768 ms
[2023-03-12 13:53:00] [INFO ] Transformed 754 places.
[2023-03-12 13:53:00] [INFO ] Transformed 27370 transitions.
[2023-03-12 13:53:00] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 964 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 514 places in 107 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q3m032-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m032-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 5 out of 240 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 240/240 places, 2769/2769 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 238 transition count 2769
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 237 transition count 2750
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 237 transition count 2750
Applied a total of 4 rules in 65 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-12 13:53:00] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 13:53:01] [INFO ] Computed 8 place invariants in 44 ms
[2023-03-12 13:53:01] [INFO ] Implicit Places using invariants in 556 ms returned []
[2023-03-12 13:53:01] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:53:01] [INFO ] Invariant cache hit.
[2023-03-12 13:53:02] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 13:53:03] [INFO ] Implicit Places using invariants and state equation in 1596 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
[2023-03-12 13:53:03] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:53:03] [INFO ] Invariant cache hit.
[2023-03-12 13:53:04] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 237/240 places, 2750/2769 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3215 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 5 out of 237 places after structural reductions.
[2023-03-12 13:53:04] [INFO ] Flatten gal took : 309 ms
[2023-03-12 13:53:04] [INFO ] Flatten gal took : 201 ms
[2023-03-12 13:53:05] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 22 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) 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 2) seen :0
Interrupted probabilistic random walk after 144960 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144960 steps, saw 73687 distinct states, run finished after 3003 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-12 13:53:08] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:53:08] [INFO ] Invariant cache hit.
[2023-03-12 13:53:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:53:09] [INFO ] After 796ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-12 13:53:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:53:10] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-12 13:53:10] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 13:53:10] [INFO ] After 432ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-12 13:53:11] [INFO ] Deduced a trap composed of 12 places in 266 ms of which 7 ms to minimize.
[2023-03-12 13:53:11] [INFO ] Deduced a trap composed of 20 places in 288 ms of which 1 ms to minimize.
[2023-03-12 13:53:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 720 ms
[2023-03-12 13:53:11] [INFO ] After 1393ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 87 ms.
[2023-03-12 13:53:11] [INFO ] After 2330ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 354 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 355 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193663 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193663 steps, saw 92042 distinct states, run finished after 3002 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:53:15] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:53:15] [INFO ] Computed 8 place invariants in 31 ms
[2023-03-12 13:53:15] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:53:15] [INFO ] After 602ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:53:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:53:16] [INFO ] After 519ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:16] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:53:16] [INFO ] After 318ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:16] [INFO ] Deduced a trap composed of 12 places in 93 ms of which 2 ms to minimize.
[2023-03-12 13:53:17] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2023-03-12 13:53:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 432 ms
[2023-03-12 13:53:17] [INFO ] After 867ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 151 ms.
[2023-03-12 13:53:17] [INFO ] After 1617ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 71 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 72 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:53:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:53:17] [INFO ] Invariant cache hit.
[2023-03-12 13:53:17] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-12 13:53:17] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:53:17] [INFO ] Invariant cache hit.
[2023-03-12 13:53:18] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:53:19] [INFO ] Implicit Places using invariants and state equation in 1649 ms returned []
Implicit Place search using SMT with State Equation took 1997 ms to find 0 implicit places.
[2023-03-12 13:53:19] [INFO ] Redundant transitions in 254 ms returned []
[2023-03-12 13:53:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:53:19] [INFO ] Invariant cache hit.
[2023-03-12 13:53:20] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3311 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 323 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 13:53:21] [INFO ] Computed 9 place invariants in 30 ms
[2023-03-12 13:53:21] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 13:53:21] [INFO ] After 584ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:53:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2023-03-12 13:53:22] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:22] [INFO ] After 618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 95 ms.
[2023-03-12 13:53:22] [INFO ] After 790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 1 atomic propositions for a total of 2 simplifications.
FORMULA BugTracking-PT-q3m032-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 111 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 10 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-12 13:53:22] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 13:53:22] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 13:53:23] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-12 13:53:23] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:53:23] [INFO ] Invariant cache hit.
[2023-03-12 13:53:23] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 13:53:24] [INFO ] Implicit Places using invariants and state equation in 1454 ms returned []
Implicit Place search using SMT with State Equation took 1787 ms to find 0 implicit places.
[2023-03-12 13:53:24] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:53:24] [INFO ] Invariant cache hit.
[2023-03-12 13:53:25] [INFO ] Dead Transitions using invariants and state equation in 865 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2665 ms. Remains : 237/237 places, 2750/2750 transitions.
Stuttering acceptance computed with spot in 187 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m032-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s10 1) (LT s82 1) (LT s192 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 174 reset in 703 ms.
Product exploration explored 100000 steps with 167 reset in 592 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 11 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 188039 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 188039 steps, saw 95856 distinct states, run finished after 3002 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:53:30] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:53:30] [INFO ] Invariant cache hit.
[2023-03-12 13:53:30] [INFO ] [Real]Absence check using 8 positive place invariants in 9 ms returned sat
[2023-03-12 13:53:31] [INFO ] After 644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:53:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:53:31] [INFO ] After 508ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:31] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 13:53:31] [INFO ] After 243ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:32] [INFO ] Deduced a trap composed of 12 places in 205 ms of which 2 ms to minimize.
[2023-03-12 13:53:32] [INFO ] Deduced a trap composed of 9 places in 207 ms of which 0 ms to minimize.
[2023-03-12 13:53:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 682 ms
[2023-03-12 13:53:32] [INFO ] After 1067ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-12 13:53:32] [INFO ] After 1796ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 97 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10010 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 199761 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199761 steps, saw 95915 distinct states, run finished after 3002 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:53:35] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:53:35] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-12 13:53:36] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:53:36] [INFO ] After 680ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:53:36] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:53:37] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:37] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:53:37] [INFO ] After 403ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:38] [INFO ] Deduced a trap composed of 12 places in 89 ms of which 1 ms to minimize.
[2023-03-12 13:53:38] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 0 ms to minimize.
[2023-03-12 13:53:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 452 ms
[2023-03-12 13:53:38] [INFO ] After 1010ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 125 ms.
[2023-03-12 13:53:38] [INFO ] After 1784ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 76 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 70 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:53:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:53:38] [INFO ] Invariant cache hit.
[2023-03-12 13:53:38] [INFO ] Implicit Places using invariants in 349 ms returned []
[2023-03-12 13:53:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:53:38] [INFO ] Invariant cache hit.
[2023-03-12 13:53:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:53:40] [INFO ] Implicit Places using invariants and state equation in 1417 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
[2023-03-12 13:53:40] [INFO ] Redundant transitions in 165 ms returned []
[2023-03-12 13:53:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:53:40] [INFO ] Invariant cache hit.
[2023-03-12 13:53:41] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2851 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 316 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 13:53:41] [INFO ] Computed 9 place invariants in 12 ms
[2023-03-12 13:53:41] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 13:53:42] [INFO ] After 490ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:53:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 13:53:42] [INFO ] After 471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:42] [INFO ] After 564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-12 13:53:42] [INFO ] After 686ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 69 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 8 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-12 13:53:43] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 13:53:43] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 13:53:43] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-12 13:53:43] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:53:43] [INFO ] Invariant cache hit.
[2023-03-12 13:53:44] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 13:53:45] [INFO ] Implicit Places using invariants and state equation in 1467 ms returned []
Implicit Place search using SMT with State Equation took 1853 ms to find 0 implicit places.
[2023-03-12 13:53:45] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:53:45] [INFO ] Invariant cache hit.
[2023-03-12 13:53:46] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2812 ms. Remains : 237/237 places, 2750/2750 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 151 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10016 steps, including 11 resets, run finished after 35 ms. (steps per millisecond=286 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 191425 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191425 steps, saw 97571 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:53:49] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:53:49] [INFO ] Invariant cache hit.
[2023-03-12 13:53:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:53:50] [INFO ] After 647ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:53:50] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:53:50] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:50] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 13:53:51] [INFO ] After 282ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:51] [INFO ] Deduced a trap composed of 12 places in 170 ms of which 1 ms to minimize.
[2023-03-12 13:53:51] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-12 13:53:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 626 ms
[2023-03-12 13:53:51] [INFO ] After 1049ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-12 13:53:51] [INFO ] After 1876ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 229 transition count 2747
Applied a total of 16 rules in 117 ms. Remains 229 /237 variables (removed 8) and now considering 2747/2750 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 205722 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 205722 steps, saw 99698 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:53:55] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:53:55] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 13:53:55] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:53:55] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:53:55] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:53:56] [INFO ] After 434ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:56] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:53:56] [INFO ] After 299ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:53:56] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-12 13:53:56] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 0 ms to minimize.
[2023-03-12 13:53:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 330 ms
[2023-03-12 13:53:56] [INFO ] After 734ms 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 13:53:56] [INFO ] After 1328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 41 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:53:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:53:57] [INFO ] Invariant cache hit.
[2023-03-12 13:53:57] [INFO ] Implicit Places using invariants in 321 ms returned []
[2023-03-12 13:53:57] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:53:57] [INFO ] Invariant cache hit.
[2023-03-12 13:53:57] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:53:58] [INFO ] Implicit Places using invariants and state equation in 1305 ms returned []
Implicit Place search using SMT with State Equation took 1654 ms to find 0 implicit places.
[2023-03-12 13:53:58] [INFO ] Redundant transitions in 83 ms returned []
[2023-03-12 13:53:58] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:53:58] [INFO ] Invariant cache hit.
[2023-03-12 13:53:59] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2693 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 337 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 13:54:00] [INFO ] Computed 9 place invariants in 9 ms
[2023-03-12 13:54:00] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 13:54:00] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:54:00] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 13:54:01] [INFO ] After 468ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:01] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 62 ms.
[2023-03-12 13:54:01] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 173 reset in 702 ms.
Product exploration explored 100000 steps with 163 reset in 657 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 2 places in 2 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 237 transition count 2757
Deduced a syphon composed of 2 places in 2 ms
Applied a total of 2 rules in 165 ms. Remains 237 /237 variables (removed 0) and now considering 2757/2750 (removed -7) transitions.
[2023-03-12 13:54:03] [INFO ] Redundant transitions in 62 ms returned []
[2023-03-12 13:54:03] [INFO ] Flow matrix only has 2628 transitions (discarded 129 similar events)
// Phase 1: matrix 2628 rows 237 cols
[2023-03-12 13:54:03] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 13:54:04] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 237/237 places, 2757/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1205 ms. Remains : 237/237 places, 2757/2750 transitions.
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 9 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-12 13:54:04] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 13:54:04] [INFO ] Computed 8 place invariants in 6 ms
[2023-03-12 13:54:04] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-12 13:54:04] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:54:04] [INFO ] Invariant cache hit.
[2023-03-12 13:54:05] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 13:54:06] [INFO ] Implicit Places using invariants and state equation in 1347 ms returned []
Implicit Place search using SMT with State Equation took 1742 ms to find 0 implicit places.
[2023-03-12 13:54:06] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 13:54:06] [INFO ] Invariant cache hit.
[2023-03-12 13:54:07] [INFO ] Dead Transitions using invariants and state equation in 771 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2525 ms. Remains : 237/237 places, 2750/2750 transitions.
Treatment of property BugTracking-PT-q3m032-LTLFireability-08 finished in 44665 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Found a Lengthening insensitive property : BugTracking-PT-q3m032-LTLFireability-08
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 237 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 41 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 13:54:07] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 13:54:07] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 13:54:07] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-12 13:54:07] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:54:07] [INFO ] Invariant cache hit.
[2023-03-12 13:54:08] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:54:09] [INFO ] Implicit Places using invariants and state equation in 1294 ms returned []
Implicit Place search using SMT with State Equation took 1599 ms to find 0 implicit places.
[2023-03-12 13:54:09] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:54:09] [INFO ] Invariant cache hit.
[2023-03-12 13:54:09] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2441 ms. Remains : 235/237 places, 2753/2750 transitions.
Running random walk in product with property : BugTracking-PT-q3m032-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s10 1) (LT s80 1) (LT s190 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 169 reset in 597 ms.
Product exploration explored 100000 steps with 171 reset in 612 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 10 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 185594 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185594 steps, saw 94702 distinct states, run finished after 3002 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:54:14] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:54:14] [INFO ] Invariant cache hit.
[2023-03-12 13:54:14] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:54:15] [INFO ] After 592ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:54:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 13:54:15] [INFO ] After 491ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:15] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:54:15] [INFO ] After 265ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:16] [INFO ] Deduced a trap composed of 12 places in 117 ms of which 1 ms to minimize.
[2023-03-12 13:54:16] [INFO ] Deduced a trap composed of 10 places in 121 ms of which 0 ms to minimize.
[2023-03-12 13:54:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 403 ms
[2023-03-12 13:54:16] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-03-12 13:54:16] [INFO ] After 1375ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 75 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=556 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 204929 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204929 steps, saw 99192 distinct states, run finished after 3003 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:54:19] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:54:19] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-12 13:54:19] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:54:20] [INFO ] After 696ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:54:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:54:20] [INFO ] After 572ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:20] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:54:21] [INFO ] After 442ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:21] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 2 ms to minimize.
[2023-03-12 13:54:21] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 0 ms to minimize.
[2023-03-12 13:54:22] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 455 ms
[2023-03-12 13:54:22] [INFO ] After 1066ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 154 ms.
[2023-03-12 13:54:22] [INFO ] After 1888ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 52 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 44 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:54:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:54:22] [INFO ] Invariant cache hit.
[2023-03-12 13:54:22] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-12 13:54:22] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:54:22] [INFO ] Invariant cache hit.
[2023-03-12 13:54:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:54:24] [INFO ] Implicit Places using invariants and state equation in 1535 ms returned []
Implicit Place search using SMT with State Equation took 1911 ms to find 0 implicit places.
[2023-03-12 13:54:24] [INFO ] Redundant transitions in 81 ms returned []
[2023-03-12 13:54:24] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:54:24] [INFO ] Invariant cache hit.
[2023-03-12 13:54:25] [INFO ] Dead Transitions using invariants and state equation in 990 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3039 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 255 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 13:54:25] [INFO ] Computed 9 place invariants in 21 ms
[2023-03-12 13:54:25] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 13:54:26] [INFO ] After 494ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:54:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 13:54:26] [INFO ] After 425ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:26] [INFO ] After 510ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-12 13:54:26] [INFO ] After 614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 16 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 13:54:27] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 13:54:27] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 13:54:27] [INFO ] Implicit Places using invariants in 387 ms returned []
[2023-03-12 13:54:27] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:54:27] [INFO ] Invariant cache hit.
[2023-03-12 13:54:28] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:54:28] [INFO ] Implicit Places using invariants and state equation in 1469 ms returned []
Implicit Place search using SMT with State Equation took 1871 ms to find 0 implicit places.
[2023-03-12 13:54:28] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:54:28] [INFO ] Invariant cache hit.
[2023-03-12 13:54:29] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2734 ms. Remains : 235/235 places, 2753/2753 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 121 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 68 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 15 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 200787 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 200787 steps, saw 102570 distinct states, run finished after 3003 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:54:33] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:54:33] [INFO ] Invariant cache hit.
[2023-03-12 13:54:33] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:54:33] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:54:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:54:34] [INFO ] After 607ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:54:34] [INFO ] After 301ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:35] [INFO ] Deduced a trap composed of 12 places in 203 ms of which 1 ms to minimize.
[2023-03-12 13:54:35] [INFO ] Deduced a trap composed of 10 places in 90 ms of which 0 ms to minimize.
[2023-03-12 13:54:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 479 ms
[2023-03-12 13:54:35] [INFO ] After 885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 79 ms.
[2023-03-12 13:54:35] [INFO ] After 1675ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 71 ms. Remains 229 /235 variables (removed 6) and now considering 2747/2753 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 222661 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 222661 steps, saw 110443 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 13:54:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 13:54:38] [INFO ] Computed 8 place invariants in 7 ms
[2023-03-12 13:54:38] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:54:39] [INFO ] After 519ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:54:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 13:54:39] [INFO ] After 560ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:54:40] [INFO ] After 382ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:40] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-12 13:54:40] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 0 ms to minimize.
[2023-03-12 13:54:40] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 419 ms
[2023-03-12 13:54:40] [INFO ] After 922ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-12 13:54:40] [INFO ] After 1690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 48 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 36 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 13:54:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:54:40] [INFO ] Invariant cache hit.
[2023-03-12 13:54:41] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-12 13:54:41] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:54:41] [INFO ] Invariant cache hit.
[2023-03-12 13:54:41] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:54:42] [INFO ] Implicit Places using invariants and state equation in 1558 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
[2023-03-12 13:54:42] [INFO ] Redundant transitions in 82 ms returned []
[2023-03-12 13:54:42] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 13:54:42] [INFO ] Invariant cache hit.
[2023-03-12 13:54:43] [INFO ] Dead Transitions using invariants and state equation in 899 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2917 ms. Remains : 229/229 places, 2747/2747 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 130 transitions.
Iterating post reduction 0 with 130 rules applied. Total rules applied 130 place count 229 transition count 2617
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 227 transition count 2615
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 135 place count 227 transition count 2614
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 139 place count 227 transition count 2610
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 143 place count 223 transition count 2610
Applied a total of 143 rules in 385 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 13:54:44] [INFO ] Computed 9 place invariants in 20 ms
[2023-03-12 13:54:44] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-12 13:54:44] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 13:54:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 13:54:45] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 13:54:45] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-12 13:54:45] [INFO ] After 611ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 164 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 61 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 170 reset in 566 ms.
Product exploration explored 100000 steps with 173 reset in 594 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 43 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 13:54:47] [INFO ] Redundant transitions in 63 ms returned []
[2023-03-12 13:54:47] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 13:54:47] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 13:54:48] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1003 ms. Remains : 235/235 places, 2753/2753 transitions.
Support contains 3 out of 235 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 8 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 13:54:48] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:54:48] [INFO ] Invariant cache hit.
[2023-03-12 13:54:48] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-03-12 13:54:48] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:54:48] [INFO ] Invariant cache hit.
[2023-03-12 13:54:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 13:54:49] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 1762 ms to find 0 implicit places.
[2023-03-12 13:54:49] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 13:54:49] [INFO ] Invariant cache hit.
[2023-03-12 13:54:50] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2680 ms. Remains : 235/235 places, 2753/2753 transitions.
Treatment of property BugTracking-PT-q3m032-LTLFireability-08 finished in 43663 ms.
[2023-03-12 13:54:51] [INFO ] Flatten gal took : 144 ms
[2023-03-12 13:54:51] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-12 13:54:51] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 55 ms.
Total runtime 111703 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1089/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BugTracking-PT-q3m032-LTLFireability-08

BK_STOP 1678629292363

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name BugTracking-PT-q3m032-LTLFireability-08
ltl formula formula --ltl=/tmp/1089/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 237 places, 2750 transitions and 13477 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.520 real 0.100 user 0.090 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1089/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1089/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1089/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1089/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)

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-q3m032"
export BK_EXAMINATION="LTLFireability"
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-q3m032, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r041-tajo-167813694600356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q3m032.tgz
mv BugTracking-PT-q3m032 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;