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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.2K Feb 26 06:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 06:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 26 06:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 26 06:05 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 07:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 07:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 06:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 06:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678635311203

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m032
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-12 15:35:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 15:35:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 15:35:13] [INFO ] Load time of PNML (sax parser for PT used): 716 ms
[2023-03-12 15:35:13] [INFO ] Transformed 754 places.
[2023-03-12 15:35:13] [INFO ] Transformed 27370 transitions.
[2023-03-12 15:35:13] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 878 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 474 places in 116 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m032-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-CTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 84 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-12 15:35:14] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:35:14] [INFO ] Computed 8 place invariants in 48 ms
[2023-03-12 15:35:14] [INFO ] Implicit Places using invariants in 633 ms returned []
[2023-03-12 15:35:14] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:35:14] [INFO ] Invariant cache hit.
[2023-03-12 15:35:15] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:35:16] [INFO ] Implicit Places using invariants and state equation in 1769 ms returned []
Implicit Place search using SMT with State Equation took 2433 ms to find 0 implicit places.
[2023-03-12 15:35:16] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:35:16] [INFO ] Invariant cache hit.
[2023-03-12 15:35:17] [INFO ] Dead Transitions using invariants and state equation in 1364 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3897 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 19 out of 277 places after structural reductions.
[2023-03-12 15:35:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 15:35:18] [INFO ] Flatten gal took : 445 ms
[2023-03-12 15:35:18] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m032-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 15:35:19] [INFO ] Flatten gal took : 234 ms
[2023-03-12 15:35:19] [INFO ] Input system was already deterministic with 3871 transitions.
Support contains 13 out of 277 places (down from 19) after GAL structural reductions.
FORMULA BugTracking-PT-q8m032-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10020 steps, including 16 resets, run finished after 287 ms. (steps per millisecond=34 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 108917 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108917 steps, saw 55300 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 12 properties.
[2023-03-12 15:35:23] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-12 15:35:23] [INFO ] Invariant cache hit.
[2023-03-12 15:35:23] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:35:23] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:11
[2023-03-12 15:35:24] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:35:25] [INFO ] After 1089ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :8
[2023-03-12 15:35:25] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:35:26] [INFO ] After 1499ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :4 sat :8
[2023-03-12 15:35:27] [INFO ] Deduced a trap composed of 48 places in 360 ms of which 20 ms to minimize.
[2023-03-12 15:35:27] [INFO ] Deduced a trap composed of 26 places in 242 ms of which 1 ms to minimize.
[2023-03-12 15:35:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 783 ms
[2023-03-12 15:35:28] [INFO ] Deduced a trap composed of 77 places in 705 ms of which 3 ms to minimize.
[2023-03-12 15:35:29] [INFO ] Deduced a trap composed of 12 places in 323 ms of which 1 ms to minimize.
[2023-03-12 15:35:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1293 ms
[2023-03-12 15:35:29] [INFO ] Deduced a trap composed of 19 places in 372 ms of which 1 ms to minimize.
[2023-03-12 15:35:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 437 ms
[2023-03-12 15:35:29] [INFO ] After 4630ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :3
Attempting to minimize the solution found.
Minimization took 271 ms.
[2023-03-12 15:35:30] [INFO ] After 6410ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :3
Fused 12 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 154 ms.
Support contains 4 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 269 transition count 3871
Applied a total of 16 rules in 234 ms. Remains 269 /277 variables (removed 8) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 235 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10023 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 126815 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :{}
Probabilistic random walk after 126815 steps, saw 47413 distinct states, run finished after 3002 ms. (steps per millisecond=42 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-12 15:35:33] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:35:33] [INFO ] Computed 8 place invariants in 17 ms
[2023-03-12 15:35:33] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 15:35:33] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:35:34] [INFO ] After 635ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 15:35:34] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:35:35] [INFO ] After 660ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-12 15:35:35] [INFO ] Deduced a trap composed of 35 places in 211 ms of which 0 ms to minimize.
[2023-03-12 15:35:35] [INFO ] Deduced a trap composed of 10 places in 237 ms of which 1 ms to minimize.
[2023-03-12 15:35:36] [INFO ] Deduced a trap composed of 66 places in 386 ms of which 0 ms to minimize.
[2023-03-12 15:35:36] [INFO ] Deduced a trap composed of 65 places in 452 ms of which 0 ms to minimize.
[2023-03-12 15:35:37] [INFO ] Deduced a trap composed of 13 places in 305 ms of which 2 ms to minimize.
[2023-03-12 15:35:37] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2031 ms
[2023-03-12 15:35:37] [INFO ] After 3068ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 285 ms.
[2023-03-12 15:35:37] [INFO ] After 4069ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 10 ms.
Support contains 4 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 62 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 59 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:35:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:35:38] [INFO ] Invariant cache hit.
[2023-03-12 15:35:38] [INFO ] Implicit Places using invariants in 531 ms returned []
[2023-03-12 15:35:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:35:38] [INFO ] Invariant cache hit.
[2023-03-12 15:35:39] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:35:40] [INFO ] Implicit Places using invariants and state equation in 2246 ms returned []
Implicit Place search using SMT with State Equation took 2783 ms to find 0 implicit places.
[2023-03-12 15:35:41] [INFO ] Redundant transitions in 382 ms returned []
[2023-03-12 15:35:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:35:41] [INFO ] Invariant cache hit.
[2023-03-12 15:35:42] [INFO ] Dead Transitions using invariants and state equation in 1196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4431 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 369 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 15:35:42] [INFO ] Computed 9 place invariants in 29 ms
[2023-03-12 15:35:42] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-12 15:35:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:35:43] [INFO ] After 678ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-12 15:35:44] [INFO ] After 1164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 201 ms.
[2023-03-12 15:35:44] [INFO ] After 1427ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 9 atomic propositions for a total of 8 simplifications.
FORMULA BugTracking-PT-q8m032-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 15:35:44] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-12 15:35:44] [INFO ] Flatten gal took : 136 ms
FORMULA BugTracking-PT-q8m032-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 15:35:44] [INFO ] Flatten gal took : 141 ms
[2023-03-12 15:35:45] [INFO ] Input system was already deterministic with 3871 transitions.
Support contains 1 out of 277 places (down from 3) after GAL structural reductions.
Computed a total of 6 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 14 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:35:45] [INFO ] Flatten gal took : 147 ms
[2023-03-12 15:35:45] [INFO ] Flatten gal took : 167 ms
[2023-03-12 15:35:45] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 15 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:35:45] [INFO ] Flatten gal took : 142 ms
[2023-03-12 15:35:46] [INFO ] Flatten gal took : 151 ms
[2023-03-12 15:35:46] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 19 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:35:46] [INFO ] Flatten gal took : 143 ms
[2023-03-12 15:35:46] [INFO ] Flatten gal took : 168 ms
[2023-03-12 15:35:47] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 19 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:35:47] [INFO ] Flatten gal took : 144 ms
[2023-03-12 15:35:47] [INFO ] Flatten gal took : 150 ms
[2023-03-12 15:35:47] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 106 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 107 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-12 15:35:48] [INFO ] Flatten gal took : 138 ms
[2023-03-12 15:35:48] [INFO ] Flatten gal took : 147 ms
[2023-03-12 15:35:48] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 160079 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160079 steps, saw 81456 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:35:51] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-12 15:35:51] [INFO ] Computed 8 place invariants in 19 ms
[2023-03-12 15:35:51] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:35:52] [INFO ] After 786ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:35:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:35:53] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:35:53] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-12 15:35:53] [INFO ] After 286ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:35:53] [INFO ] Deduced a trap composed of 24 places in 257 ms of which 1 ms to minimize.
[2023-03-12 15:35:54] [INFO ] Deduced a trap composed of 49 places in 296 ms of which 0 ms to minimize.
[2023-03-12 15:35:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 822 ms
[2023-03-12 15:35:54] [INFO ] After 1179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 120 ms.
[2023-03-12 15:35:54] [INFO ] After 2068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 229 ms.
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 275 transition count 3871
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 269 transition count 3871
Applied a total of 16 rules in 218 ms. Remains 269 /277 variables (removed 8) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 1000020 steps, including 2 resets, run finished after 1768 ms. (steps per millisecond=565 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1911 ms. (steps per millisecond=523 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 451612 steps, run timeout after 9001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 451612 steps, saw 257154 distinct states, run finished after 9001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:36:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-12 15:36:07] [INFO ] Computed 8 place invariants in 25 ms
[2023-03-12 15:36:07] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:36:08] [INFO ] After 681ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-12 15:36:08] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:36:09] [INFO ] After 242ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:09] [INFO ] Deduced a trap composed of 52 places in 344 ms of which 0 ms to minimize.
[2023-03-12 15:36:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 504 ms
[2023-03-12 15:36:09] [INFO ] After 801ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-03-12 15:36:09] [INFO ] After 1535ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:36:09] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:09] [INFO ] Invariant cache hit.
[2023-03-12 15:36:10] [INFO ] Implicit Places using invariants in 393 ms returned []
[2023-03-12 15:36:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:10] [INFO ] Invariant cache hit.
[2023-03-12 15:36:10] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:36:11] [INFO ] Implicit Places using invariants and state equation in 1685 ms returned []
Implicit Place search using SMT with State Equation took 2080 ms to find 0 implicit places.
[2023-03-12 15:36:12] [INFO ] Redundant transitions in 289 ms returned []
[2023-03-12 15:36:12] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:12] [INFO ] Invariant cache hit.
[2023-03-12 15:36:13] [INFO ] Dead Transitions using invariants and state equation in 1312 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3755 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100026 steps, including 2 resets, run finished after 229 ms. (steps per millisecond=436 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:36:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:13] [INFO ] Invariant cache hit.
[2023-03-12 15:36:13] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:36:14] [INFO ] After 527ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:36:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:36:14] [INFO ] After 248ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-12 15:36:14] [INFO ] After 419ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:14] [INFO ] After 1028ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:36:15] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:15] [INFO ] After 247ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:16] [INFO ] Deduced a trap composed of 52 places in 370 ms of which 0 ms to minimize.
[2023-03-12 15:36:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 572 ms
[2023-03-12 15:36:16] [INFO ] After 891ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-12 15:36:16] [INFO ] After 1655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000030 steps, including 2 resets, run finished after 1731 ms. (steps per millisecond=577 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2130 ms. (steps per millisecond=469 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 460892 steps, run timeout after 9001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 460892 steps, saw 263202 distinct states, run finished after 9001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:36:29] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:29] [INFO ] Invariant cache hit.
[2023-03-12 15:36:29] [INFO ] [Real]Absence check using 8 positive place invariants in 5 ms returned sat
[2023-03-12 15:36:30] [INFO ] After 676ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:36:30] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:36:30] [INFO ] After 286ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:30] [INFO ] After 1045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:30] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:36:31] [INFO ] After 696ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:31] [INFO ] After 328ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:32] [INFO ] Deduced a trap composed of 52 places in 356 ms of which 0 ms to minimize.
[2023-03-12 15:36:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 569 ms
[2023-03-12 15:36:32] [INFO ] After 977ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-12 15:36:32] [INFO ] After 1833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 85 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:36:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:32] [INFO ] Invariant cache hit.
[2023-03-12 15:36:32] [INFO ] Implicit Places using invariants in 489 ms returned []
[2023-03-12 15:36:32] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:32] [INFO ] Invariant cache hit.
[2023-03-12 15:36:33] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:36:34] [INFO ] Implicit Places using invariants and state equation in 1877 ms returned []
Implicit Place search using SMT with State Equation took 2368 ms to find 0 implicit places.
[2023-03-12 15:36:35] [INFO ] Redundant transitions in 201 ms returned []
[2023-03-12 15:36:35] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:35] [INFO ] Invariant cache hit.
[2023-03-12 15:36:36] [INFO ] Dead Transitions using invariants and state equation in 1152 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3796 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100002 steps, including 2 resets, run finished after 148 ms. (steps per millisecond=675 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:36:36] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:36] [INFO ] Invariant cache hit.
[2023-03-12 15:36:36] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:36:36] [INFO ] After 497ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:36:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:36:37] [INFO ] After 255ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-12 15:36:37] [INFO ] After 441ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:37] [INFO ] After 1029ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:37] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:36:38] [INFO ] After 706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:38] [INFO ] After 247ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:38] [INFO ] Deduced a trap composed of 52 places in 411 ms of which 1 ms to minimize.
[2023-03-12 15:36:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 611 ms
[2023-03-12 15:36:39] [INFO ] After 930ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-12 15:36:39] [INFO ] After 1760ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10018 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 142795 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 142795 steps, saw 58123 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:36:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:42] [INFO ] Invariant cache hit.
[2023-03-12 15:36:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:36:43] [INFO ] After 776ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:36:43] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:36:43] [INFO ] After 305ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:43] [INFO ] After 1168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:36:44] [INFO ] After 659ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:44] [INFO ] After 256ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:44] [INFO ] Deduced a trap composed of 52 places in 313 ms of which 1 ms to minimize.
[2023-03-12 15:36:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 442 ms
[2023-03-12 15:36:44] [INFO ] After 766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 92 ms.
[2023-03-12 15:36:44] [INFO ] After 1597ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 79 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 10012 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 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 152277 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152277 steps, saw 64480 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-12 15:36:48] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:48] [INFO ] Invariant cache hit.
[2023-03-12 15:36:48] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-12 15:36:48] [INFO ] After 678ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:36:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:36:49] [INFO ] After 341ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:49] [INFO ] After 1096ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-12 15:36:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-12 15:36:49] [INFO ] After 689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:50] [INFO ] After 316ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-12 15:36:50] [INFO ] Deduced a trap composed of 52 places in 368 ms of which 1 ms to minimize.
[2023-03-12 15:36:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 541 ms
[2023-03-12 15:36:50] [INFO ] After 932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-12 15:36:51] [INFO ] After 1811ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 63 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 269/269 places, 3871/3871 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 58 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-12 15:36:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:51] [INFO ] Invariant cache hit.
[2023-03-12 15:36:51] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-12 15:36:51] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:51] [INFO ] Invariant cache hit.
[2023-03-12 15:36:52] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-12 15:36:53] [INFO ] Implicit Places using invariants and state equation in 1861 ms returned []
Implicit Place search using SMT with State Equation took 2329 ms to find 0 implicit places.
[2023-03-12 15:36:53] [INFO ] Redundant transitions in 159 ms returned []
[2023-03-12 15:36:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-12 15:36:53] [INFO ] Invariant cache hit.
[2023-03-12 15:36:54] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3914 ms. Remains : 269/269 places, 3871/3871 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 263 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-12 15:36:55] [INFO ] Computed 9 place invariants in 12 ms
[2023-03-12 15:36:55] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:36:55] [INFO ] After 575ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:36:56] [INFO ] After 698ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 71 ms.
[2023-03-12 15:36:56] [INFO ] After 851ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Drop transitions removed 6 transitions
Ensure Unique test removed 167 transitions
Reduce isomorphic transitions removed 173 transitions.
Iterating post reduction 0 with 173 rules applied. Total rules applied 173 place count 269 transition count 3698
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 177 place count 267 transition count 3696
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 178 place count 267 transition count 3695
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 267 transition count 3691
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 236 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
[2023-03-12 15:36:56] [INFO ] Invariant cache hit.
[2023-03-12 15:36:56] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-12 15:36:57] [INFO ] After 575ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-12 15:36:57] [INFO ] After 691ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-12 15:36:57] [INFO ] After 829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2023-03-12 15:36:57] [INFO ] Flatten gal took : 149 ms
[2023-03-12 15:36:57] [INFO ] Flatten gal took : 148 ms
[2023-03-12 15:36:57] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-12 15:36:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 3871 transitions and 19025 arcs took 30 ms.
Total runtime 104709 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/683/ctl_0_ --ctl=/tmp/683/ctl_1_ --ctl=/tmp/683/ctl_2_ --ctl=/tmp/683/ctl_3_ --ctl=/tmp/683/ctl_4_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 1249048 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16080176 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
mcc2023

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-q8m032"
export BK_EXAMINATION="CTLCardinality"
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-q8m032, examination is CTLCardinality"
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-167813694700417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m032.tgz
mv BugTracking-PT-q8m032 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;