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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.2K Feb 26 07:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 07:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 07:11 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 15:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 08:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 08:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 07:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 26 07:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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-q3m256-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q3m256-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678632196752

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-q3m256
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 14:43:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 14:43:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 14:43:19] [INFO ] Load time of PNML (sax parser for PT used): 673 ms
[2023-03-12 14:43:19] [INFO ] Transformed 754 places.
[2023-03-12 14:43:19] [INFO ] Transformed 27370 transitions.
[2023-03-12 14:43:19] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 842 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 514 places in 104 ms
Reduce places removed 514 places and 24601 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q3m256-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q3m256-LTLCardinality-12 TRUE 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 89 ms. Remains 237 /240 variables (removed 3) and now considering 2750/2769 (removed 19) transitions.
[2023-03-12 14:43:19] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:43:19] [INFO ] Computed 8 place invariants in 42 ms
[2023-03-12 14:43:20] [INFO ] Implicit Places using invariants in 521 ms returned []
[2023-03-12 14:43:20] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:43:20] [INFO ] Invariant cache hit.
[2023-03-12 14:43:20] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:43:21] [INFO ] Implicit Places using invariants and state equation in 1549 ms returned []
Implicit Place search using SMT with State Equation took 2098 ms to find 0 implicit places.
[2023-03-12 14:43:21] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:43:21] [INFO ] Invariant cache hit.
[2023-03-12 14:43:22] [INFO ] Dead Transitions using invariants and state equation in 823 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 3014 ms. Remains : 237/240 places, 2750/2769 transitions.
Support contains 5 out of 237 places after structural reductions.
[2023-03-12 14:43:23] [INFO ] Flatten gal took : 283 ms
[2023-03-12 14:43:23] [INFO ] Flatten gal took : 150 ms
[2023-03-12 14:43:23] [INFO ] Input system was already deterministic with 2750 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 121259 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 121259 steps, saw 58628 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-12 14:43:27] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:43:27] [INFO ] Invariant cache hit.
[2023-03-12 14:43:27] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:43:27] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-12 14:43:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:43:28] [INFO ] After 658ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-12 14:43:28] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:43:28] [INFO ] After 412ms SMT Verify possible using 240 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-12 14:43:28] [INFO ] Deduced a trap composed of 42 places in 267 ms of which 7 ms to minimize.
[2023-03-12 14:43:29] [INFO ] Deduced a trap composed of 12 places in 256 ms of which 1 ms to minimize.
[2023-03-12 14:43:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 611 ms
[2023-03-12 14:43:29] [INFO ] Deduced a trap composed of 9 places in 323 ms of which 2 ms to minimize.
[2023-03-12 14:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 423 ms
[2023-03-12 14:43:29] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2023-03-12 14:43:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 172 ms
[2023-03-12 14:43:30] [INFO ] After 1935ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 242 ms.
[2023-03-12 14:43:30] [INFO ] After 2923ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 105 ms.
Support contains 4 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 161 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 161 ms. Remains : 229/237 places, 2747/2750 transitions.
Incomplete random walk after 10080 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1260 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) 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 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 133445 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133445 steps, saw 61975 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-12 14:43:33] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:43:33] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-12 14:43:33] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:43:33] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:43:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:43:34] [INFO ] After 584ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:43:34] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:43:34] [INFO ] After 408ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-12 14:43:35] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 0 ms to minimize.
[2023-03-12 14:43:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 200 ms
[2023-03-12 14:43:35] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 1 ms to minimize.
[2023-03-12 14:43:35] [INFO ] Deduced a trap composed of 36 places in 161 ms of which 0 ms to minimize.
[2023-03-12 14:43:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 466 ms
[2023-03-12 14:43:35] [INFO ] Deduced a trap composed of 22 places in 187 ms of which 1 ms to minimize.
[2023-03-12 14:43:36] [INFO ] Deduced a trap composed of 20 places in 255 ms of which 1 ms to minimize.
[2023-03-12 14:43:36] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2023-03-12 14:43:36] [INFO ] Deduced a trap composed of 12 places in 123 ms of which 2 ms to minimize.
[2023-03-12 14:43:36] [INFO ] Deduced a trap composed of 11 places in 103 ms of which 1 ms to minimize.
[2023-03-12 14:43:37] [INFO ] Deduced a trap composed of 74 places in 248 ms of which 0 ms to minimize.
[2023-03-12 14:43:37] [INFO ] Deduced a trap composed of 17 places in 237 ms of which 0 ms to minimize.
[2023-03-12 14:43:37] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1814 ms
[2023-03-12 14:43:37] [INFO ] After 3155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 291 ms.
[2023-03-12 14:43:37] [INFO ] After 4134ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 8 ms.
Support contains 4 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 69 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 69 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 53 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:43:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:43:38] [INFO ] Invariant cache hit.
[2023-03-12 14:43:38] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-12 14:43:38] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:43:38] [INFO ] Invariant cache hit.
[2023-03-12 14:43:39] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:43:40] [INFO ] Implicit Places using invariants and state equation in 1515 ms returned []
Implicit Place search using SMT with State Equation took 2021 ms to find 0 implicit places.
[2023-03-12 14:43:40] [INFO ] Redundant transitions in 197 ms returned []
[2023-03-12 14:43:40] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:43:40] [INFO ] Invariant cache hit.
[2023-03-12 14:43:41] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3202 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 459 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:43:41] [INFO ] Computed 9 place invariants in 32 ms
[2023-03-12 14:43:41] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:43:41] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-12 14:43:41] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:43:42] [INFO ] After 591ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-12 14:43:42] [INFO ] After 920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 217 ms.
[2023-03-12 14:43:42] [INFO ] After 1198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
FORMULA BugTracking-PT-q3m256-LTLCardinality-02 TRUE 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(F(p0)))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 16 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-12 14:43:43] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:43:43] [INFO ] Computed 8 place invariants in 10 ms
[2023-03-12 14:43:43] [INFO ] Implicit Places using invariants in 310 ms returned []
[2023-03-12 14:43:43] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:43:43] [INFO ] Invariant cache hit.
[2023-03-12 14:43:43] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:43:45] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 1952 ms to find 0 implicit places.
[2023-03-12 14:43:45] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:43:45] [INFO ] Invariant cache hit.
[2023-03-12 14:43:45] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2716 ms. Remains : 237/237 places, 2750/2750 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT 1 s91)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1283 ms.
Product exploration explored 100000 steps with 50000 reset in 1131 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BugTracking-PT-q3m256-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BugTracking-PT-q3m256-LTLCardinality-05 finished in 5630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 178 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 14:43:48] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:43:48] [INFO ] Computed 8 place invariants in 13 ms
[2023-03-12 14:43:49] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-12 14:43:49] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:43:49] [INFO ] Invariant cache hit.
[2023-03-12 14:43:49] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:43:51] [INFO ] Implicit Places using invariants and state equation in 1802 ms returned []
Implicit Place search using SMT with State Equation took 2352 ms to find 0 implicit places.
[2023-03-12 14:43:51] [INFO ] Redundant transitions in 156 ms returned []
[2023-03-12 14:43:51] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:43:51] [INFO ] Invariant cache hit.
[2023-03-12 14:43:52] [INFO ] Dead Transitions using invariants and state equation in 954 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3669 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4324 steps with 0 reset in 121 ms.
FORMULA BugTracking-PT-q3m256-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q3m256-LTLCardinality-07 finished in 3839 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Applied a total of 0 rules in 11 ms. Remains 237 /237 variables (removed 0) and now considering 2750/2750 (removed 0) transitions.
[2023-03-12 14:43:52] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
// Phase 1: matrix 2626 rows 237 cols
[2023-03-12 14:43:52] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 14:43:52] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-12 14:43:52] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:43:52] [INFO ] Invariant cache hit.
[2023-03-12 14:43:53] [INFO ] State equation strengthened by 240 read => feed constraints.
[2023-03-12 14:43:54] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
[2023-03-12 14:43:54] [INFO ] Flow matrix only has 2626 transitions (discarded 124 similar events)
[2023-03-12 14:43:54] [INFO ] Invariant cache hit.
[2023-03-12 14:43:55] [INFO ] Dead Transitions using invariants and state equation in 840 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2943 ms. Remains : 237/237 places, 2750/2750 transitions.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s166 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 952 ms.
Product exploration explored 100000 steps with 50000 reset in 927 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BugTracking-PT-q3m256-LTLCardinality-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BugTracking-PT-q3m256-LTLCardinality-08 finished in 5007 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 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 2750/2750 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 235 transition count 2753
Applied a total of 4 rules in 122 ms. Remains 235 /237 variables (removed 2) and now considering 2753/2750 (removed -3) transitions.
[2023-03-12 14:43:57] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:43:57] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-12 14:43:58] [INFO ] Implicit Places using invariants in 394 ms returned []
[2023-03-12 14:43:58] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:43:58] [INFO ] Invariant cache hit.
[2023-03-12 14:43:58] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:43:59] [INFO ] Implicit Places using invariants and state equation in 1717 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2023-03-12 14:43:59] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-12 14:43:59] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:43:59] [INFO ] Invariant cache hit.
[2023-03-12 14:44:00] [INFO ] Dead Transitions using invariants and state equation in 894 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 235/237 places, 2753/2750 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3235 ms. Remains : 235/237 places, 2753/2750 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q3m256-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s37 0)], 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 23 reset in 714 ms.
Product exploration explored 100000 steps with 22 reset in 678 ms.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 193927 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193927 steps, saw 92565 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:44:05] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:44:05] [INFO ] Invariant cache hit.
[2023-03-12 14:44:05] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:44:05] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:44:06] [INFO ] After 581ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:06] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:44:06] [INFO ] After 284ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:06] [INFO ] Deduced a trap composed of 12 places in 260 ms of which 1 ms to minimize.
[2023-03-12 14:44:07] [INFO ] Deduced a trap composed of 12 places in 224 ms of which 0 ms to minimize.
[2023-03-12 14:44:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 669 ms
[2023-03-12 14:44:07] [INFO ] After 1000ms 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 14:44:07] [INFO ] After 1754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 53 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 97 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 98 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10111 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1444 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 192250 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192250 steps, saw 101341 distinct states, run finished after 3003 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:44:10] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:44:10] [INFO ] Computed 8 place invariants in 14 ms
[2023-03-12 14:44:10] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:44:10] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-12 14:44:11] [INFO ] After 432ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:11] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:44:11] [INFO ] After 205ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:11] [INFO ] Deduced a trap composed of 10 places in 287 ms of which 0 ms to minimize.
[2023-03-12 14:44:11] [INFO ] Deduced a trap composed of 14 places in 279 ms of which 1 ms to minimize.
[2023-03-12 14:44:12] [INFO ] Deduced a trap composed of 36 places in 269 ms of which 1 ms to minimize.
[2023-03-12 14:44:12] [INFO ] Deduced a trap composed of 31 places in 292 ms of which 1 ms to minimize.
[2023-03-12 14:44:12] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1389 ms
[2023-03-12 14:44:12] [INFO ] After 1634ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 60 ms.
[2023-03-12 14:44:12] [INFO ] After 2182ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 79 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 79 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 51 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:44:12] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:44:12] [INFO ] Invariant cache hit.
[2023-03-12 14:44:13] [INFO ] Implicit Places using invariants in 309 ms returned []
[2023-03-12 14:44:13] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:44:13] [INFO ] Invariant cache hit.
[2023-03-12 14:44:13] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:44:14] [INFO ] Implicit Places using invariants and state equation in 1468 ms returned []
Implicit Place search using SMT with State Equation took 1779 ms to find 0 implicit places.
[2023-03-12 14:44:14] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-12 14:44:14] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:44:14] [INFO ] Invariant cache hit.
[2023-03-12 14:44:15] [INFO ] Dead Transitions using invariants and state equation in 697 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2594 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 270 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:44:15] [INFO ] Computed 9 place invariants in 12 ms
[2023-03-12 14:44:15] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:44:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2023-03-12 14:44:16] [INFO ] After 352ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:16] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-12 14:44:16] [INFO ] After 516ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 39 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:44:16] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:44:16] [INFO ] Computed 8 place invariants in 8 ms
[2023-03-12 14:44:16] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-12 14:44:16] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:44:16] [INFO ] Invariant cache hit.
[2023-03-12 14:44:17] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:44:18] [INFO ] Implicit Places using invariants and state equation in 1598 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2023-03-12 14:44:18] [INFO ] Redundant transitions in 59 ms returned []
[2023-03-12 14:44:18] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:44:18] [INFO ] Invariant cache hit.
[2023-03-12 14:44:19] [INFO ] Dead Transitions using invariants and state equation in 889 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2900 ms. Remains : 235/235 places, 2753/2753 transitions.
Computed a total of 6 stabilizing places and 111 stable transitions
Computed a total of 6 stabilizing places and 111 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 22 ms :[(NOT p0)]
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 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 207335 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 207335 steps, saw 99196 distinct states, run finished after 3002 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:44:22] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:44:22] [INFO ] Invariant cache hit.
[2023-03-12 14:44:22] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:44:22] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 14:44:23] [INFO ] After 469ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:23] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:44:23] [INFO ] After 247ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:23] [INFO ] Deduced a trap composed of 12 places in 226 ms of which 0 ms to minimize.
[2023-03-12 14:44:23] [INFO ] Deduced a trap composed of 12 places in 197 ms of which 0 ms to minimize.
[2023-03-12 14:44:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
[2023-03-12 14:44:23] [INFO ] After 869ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-12 14:44:24] [INFO ] After 1473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 235 transition count 2747
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 12 place count 229 transition count 2747
Applied a total of 12 rules in 108 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 108 ms. Remains : 229/235 places, 2747/2753 transitions.
Incomplete random walk after 10103 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2020 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 171677 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 171677 steps, saw 87599 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 14:44:27] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
// Phase 1: matrix 2618 rows 229 cols
[2023-03-12 14:44:27] [INFO ] Computed 8 place invariants in 21 ms
[2023-03-12 14:44:27] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:44:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 14:44:27] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:27] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:44:28] [INFO ] After 281ms SMT Verify possible using 241 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:28] [INFO ] Deduced a trap composed of 10 places in 306 ms of which 0 ms to minimize.
[2023-03-12 14:44:28] [INFO ] Deduced a trap composed of 14 places in 298 ms of which 1 ms to minimize.
[2023-03-12 14:44:29] [INFO ] Deduced a trap composed of 36 places in 281 ms of which 0 ms to minimize.
[2023-03-12 14:44:29] [INFO ] Deduced a trap composed of 31 places in 295 ms of which 0 ms to minimize.
[2023-03-12 14:44:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1485 ms
[2023-03-12 14:44:29] [INFO ] After 1831ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-12 14:44:29] [INFO ] After 2495ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 51 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 51 ms. Remains : 229/229 places, 2747/2747 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2747/2747 transitions.
Applied a total of 0 rules in 45 ms. Remains 229 /229 variables (removed 0) and now considering 2747/2747 (removed 0) transitions.
[2023-03-12 14:44:29] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:44:29] [INFO ] Invariant cache hit.
[2023-03-12 14:44:30] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-12 14:44:30] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:44:30] [INFO ] Invariant cache hit.
[2023-03-12 14:44:30] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:44:31] [INFO ] Implicit Places using invariants and state equation in 1655 ms returned []
Implicit Place search using SMT with State Equation took 2045 ms to find 0 implicit places.
[2023-03-12 14:44:32] [INFO ] Redundant transitions in 76 ms returned []
[2023-03-12 14:44:32] [INFO ] Flow matrix only has 2618 transitions (discarded 129 similar events)
[2023-03-12 14:44:32] [INFO ] Invariant cache hit.
[2023-03-12 14:44:32] [INFO ] Dead Transitions using invariants and state equation in 853 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3028 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 298 ms. Remains 223 /229 variables (removed 6) and now considering 2610/2747 (removed 137) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2610 rows 223 cols
[2023-03-12 14:44:33] [INFO ] Computed 9 place invariants in 45 ms
[2023-03-12 14:44:33] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 14:44:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 14:44:33] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 14:44:33] [INFO ] After 568ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 91 ms.
[2023-03-12 14:44:34] [INFO ] After 708ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23 reset in 772 ms.
Product exploration explored 100000 steps with 23 reset in 882 ms.
Support contains 1 out of 235 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 235/235 places, 2753/2753 transitions.
Applied a total of 0 rules in 37 ms. Remains 235 /235 variables (removed 0) and now considering 2753/2753 (removed 0) transitions.
[2023-03-12 14:44:35] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
// Phase 1: matrix 2624 rows 235 cols
[2023-03-12 14:44:35] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-12 14:44:36] [INFO ] Implicit Places using invariants in 345 ms returned []
[2023-03-12 14:44:36] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:44:36] [INFO ] Invariant cache hit.
[2023-03-12 14:44:36] [INFO ] State equation strengthened by 241 read => feed constraints.
[2023-03-12 14:44:37] [INFO ] Implicit Places using invariants and state equation in 1461 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2023-03-12 14:44:37] [INFO ] Redundant transitions in 104 ms returned []
[2023-03-12 14:44:37] [INFO ] Flow matrix only has 2624 transitions (discarded 129 similar events)
[2023-03-12 14:44:37] [INFO ] Invariant cache hit.
[2023-03-12 14:44:38] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2867 ms. Remains : 235/235 places, 2753/2753 transitions.
Treatment of property BugTracking-PT-q3m256-LTLCardinality-10 finished in 41552 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)))'
[2023-03-12 14:44:39] [INFO ] Flatten gal took : 151 ms
[2023-03-12 14:44:39] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-12 14:44:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 237 places, 2750 transitions and 13477 arcs took 12 ms.
Total runtime 81072 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/866/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : BugTracking-PT-q3m256-LTLCardinality-10

BK_STOP 1678632280538

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2023
ltl formula name BugTracking-PT-q3m256-LTLCardinality-10
ltl formula formula --ltl=/tmp/866/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.530 real 0.120 user 0.140 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/866/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/866/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/866/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/866/ltl_0_
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-q3m256"
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-q3m256, 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-167813694600379"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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