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.r042-tajo-167813695800433.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 marciexred
Input is BugTracking-PT-q8m128, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-tajo-167813695800433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K Feb 26 06:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 06:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 26 06:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Feb 26 06:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 15:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:38 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 07:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:38 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:38 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678724116007

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=marciexred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m128
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 16:15:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 16:15:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:15:18] [INFO ] Load time of PNML (sax parser for PT used): 624 ms
[2023-03-13 16:15:18] [INFO ] Transformed 754 places.
[2023-03-13 16:15:18] [INFO ] Transformed 27370 transitions.
[2023-03-13 16:15:18] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 795 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 474 places in 155 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 4 formulas.
FORMULA BugTracking-PT-q8m128-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 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
Applied a total of 2 rules in 97 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2023-03-13 16:15:18] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2023-03-13 16:15:18] [INFO ] Computed 8 place invariants in 81 ms
[2023-03-13 16:15:19] [INFO ] Implicit Places using invariants in 940 ms returned []
[2023-03-13 16:15:19] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-13 16:15:19] [INFO ] Invariant cache hit.
[2023-03-13 16:15:20] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-13 16:15:21] [INFO ] Implicit Places using invariants and state equation in 2090 ms returned []
Implicit Place search using SMT with State Equation took 3063 ms to find 0 implicit places.
[2023-03-13 16:15:21] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-13 16:15:21] [INFO ] Invariant cache hit.
[2023-03-13 16:15:23] [INFO ] Dead Transitions using invariants and state equation in 1241 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3904/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4406 ms. Remains : 278/280 places, 3904/3904 transitions.
Support contains 24 out of 278 places after structural reductions.
[2023-03-13 16:15:23] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 16:15:23] [INFO ] Flatten gal took : 358 ms
FORMULA BugTracking-PT-q8m128-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 16:15:23] [INFO ] Flatten gal took : 160 ms
[2023-03-13 16:15:24] [INFO ] Input system was already deterministic with 3904 transitions.
Support contains 21 out of 278 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 333 ms. (steps per millisecond=30 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-13 16:15:24] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2023-03-13 16:15:24] [INFO ] Invariant cache hit.
[2023-03-13 16:15:25] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 16:15:25] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:15
[2023-03-13 16:15:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:15:26] [INFO ] After 1382ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :9
[2023-03-13 16:15:26] [INFO ] State equation strengthened by 303 read => feed constraints.
[2023-03-13 16:15:28] [INFO ] After 1658ms SMT Verify possible using 303 Read/Feed constraints in natural domain returned unsat :9 sat :9
[2023-03-13 16:15:28] [INFO ] Deduced a trap composed of 38 places in 551 ms of which 7 ms to minimize.
[2023-03-13 16:15:29] [INFO ] Deduced a trap composed of 12 places in 651 ms of which 3 ms to minimize.
[2023-03-13 16:15:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 1406 ms
[2023-03-13 16:15:30] [INFO ] Deduced a trap composed of 62 places in 525 ms of which 1 ms to minimize.
[2023-03-13 16:15:30] [INFO ] Deduced a trap composed of 21 places in 419 ms of which 2 ms to minimize.
[2023-03-13 16:15:31] [INFO ] Deduced a trap composed of 24 places in 263 ms of which 1 ms to minimize.
[2023-03-13 16:15:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1598 ms
[2023-03-13 16:15:31] [INFO ] Deduced a trap composed of 19 places in 243 ms of which 1 ms to minimize.
[2023-03-13 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 464 ms
[2023-03-13 16:15:32] [INFO ] Deduced a trap composed of 17 places in 347 ms of which 0 ms to minimize.
[2023-03-13 16:15:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 575 ms
[2023-03-13 16:15:33] [INFO ] After 6459ms SMT Verify possible using trap constraints in natural domain returned unsat :13 sat :5
Attempting to minimize the solution found.
Minimization took 648 ms.
[2023-03-13 16:15:33] [INFO ] After 8651ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :5
Fused 18 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 361 ms.
Support contains 5 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 6 place count 275 transition count 3877
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 275 transition count 3872
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 16 place count 270 transition count 3872
Applied a total of 16 rules in 492 ms. Remains 270 /278 variables (removed 8) and now considering 3872/3904 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 505 ms. Remains : 270/278 places, 3872/3904 transitions.
Incomplete random walk after 10020 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 16:15:34] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
// Phase 1: matrix 3700 rows 270 cols
[2023-03-13 16:15:34] [INFO ] Computed 8 place invariants in 20 ms
[2023-03-13 16:15:35] [INFO ] [Real]Absence check using 8 positive place invariants in 53 ms returned sat
[2023-03-13 16:15:35] [INFO ] After 213ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:15:35] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:15:36] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:15:36] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:15:36] [INFO ] After 733ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 16:15:37] [INFO ] Deduced a trap composed of 9 places in 468 ms of which 1 ms to minimize.
[2023-03-13 16:15:37] [INFO ] Deduced a trap composed of 57 places in 292 ms of which 0 ms to minimize.
[2023-03-13 16:15:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 993 ms
[2023-03-13 16:15:38] [INFO ] After 2485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 644 ms.
[2023-03-13 16:15:39] [INFO ] After 4048ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 172 ms.
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 94 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 270/270 places, 3872/3872 transitions.
Incomplete random walk after 10113 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=594 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 98560 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98560 steps, saw 56246 distinct states, run finished after 3005 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 16:15:42] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 16:15:42] [INFO ] Invariant cache hit.
[2023-03-13 16:15:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:15:42] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:15:42] [INFO ] [Nat]Absence check using 8 positive place invariants in 6 ms returned sat
[2023-03-13 16:15:44] [INFO ] After 1006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:15:44] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:15:44] [INFO ] After 732ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 16:15:45] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 1 ms to minimize.
[2023-03-13 16:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 479 ms
[2023-03-13 16:15:46] [INFO ] Deduced a trap composed of 12 places in 510 ms of which 1 ms to minimize.
[2023-03-13 16:15:46] [INFO ] Deduced a trap composed of 70 places in 473 ms of which 0 ms to minimize.
[2023-03-13 16:15:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1295 ms
[2023-03-13 16:15:47] [INFO ] Deduced a trap composed of 23 places in 211 ms of which 0 ms to minimize.
[2023-03-13 16:15:47] [INFO ] Deduced a trap composed of 35 places in 214 ms of which 0 ms to minimize.
[2023-03-13 16:15:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 616 ms
[2023-03-13 16:15:47] [INFO ] After 3668ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-13 16:15:48] [INFO ] After 5108ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 213 ms.
Support contains 4 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 68 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 270/270 places, 3872/3872 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 3872/3872 transitions.
Applied a total of 0 rules in 65 ms. Remains 270 /270 variables (removed 0) and now considering 3872/3872 (removed 0) transitions.
[2023-03-13 16:15:48] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 16:15:48] [INFO ] Invariant cache hit.
[2023-03-13 16:15:48] [INFO ] Implicit Places using invariants in 498 ms returned []
[2023-03-13 16:15:48] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 16:15:48] [INFO ] Invariant cache hit.
[2023-03-13 16:15:49] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:15:50] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2136 ms to find 0 implicit places.
[2023-03-13 16:15:50] [INFO ] Redundant transitions in 294 ms returned []
[2023-03-13 16:15:50] [INFO ] Flow matrix only has 3700 transitions (discarded 172 similar events)
[2023-03-13 16:15:50] [INFO ] Invariant cache hit.
[2023-03-13 16:15:51] [INFO ] Dead Transitions using invariants and state equation in 1172 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3683 ms. Remains : 270/270 places, 3872/3872 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 270 transition count 3699
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 268 transition count 3697
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 268 transition count 3696
Free-agglomeration rule applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 182 place count 268 transition count 3692
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 186 place count 264 transition count 3692
Applied a total of 186 rules in 248 ms. Remains 264 /270 variables (removed 6) and now considering 3692/3872 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3692 rows 264 cols
[2023-03-13 16:15:52] [INFO ] Computed 9 place invariants in 41 ms
[2023-03-13 16:15:52] [INFO ] [Real]Absence check using 9 positive place invariants in 78 ms returned sat
[2023-03-13 16:15:52] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:15:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 6 ms returned sat
[2023-03-13 16:15:53] [INFO ] After 965ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:15:54] [INFO ] After 1555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-13 16:15:54] [INFO ] After 1944ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 13 atomic propositions for a total of 7 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m128-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 16:15:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 16:15:54] [INFO ] Flatten gal took : 188 ms
FORMULA BugTracking-PT-q8m128-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 16:15:55] [INFO ] Flatten gal took : 215 ms
[2023-03-13 16:15:55] [INFO ] Input system was already deterministic with 3904 transitions.
Support contains 3 out of 278 places (down from 5) after GAL structural reductions.
FORMULA BugTracking-PT-q8m128-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 131 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 30 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-13 16:15:55] [INFO ] Flatten gal took : 125 ms
[2023-03-13 16:15:55] [INFO ] Flatten gal took : 117 ms
[2023-03-13 16:15:56] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 23 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-13 16:15:56] [INFO ] Flatten gal took : 110 ms
[2023-03-13 16:15:56] [INFO ] Flatten gal took : 117 ms
[2023-03-13 16:15:56] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in LTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 57 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-13 16:15:56] [INFO ] Flatten gal took : 237 ms
[2023-03-13 16:15:57] [INFO ] Flatten gal took : 195 ms
[2023-03-13 16:15:57] [INFO ] Input system was already deterministic with 3871 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 278/278 places, 3904/3904 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 277 transition count 3871
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 277 transition count 3871
Applied a total of 2 rules in 170 ms. Remains 277 /278 variables (removed 1) and now considering 3871/3904 (removed 33) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 171 ms. Remains : 277/278 places, 3871/3904 transitions.
[2023-03-13 16:15:57] [INFO ] Flatten gal took : 150 ms
[2023-03-13 16:15:58] [INFO ] Flatten gal took : 162 ms
[2023-03-13 16:15:58] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10001 steps, including 8 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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 157234 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157234 steps, saw 75861 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:16:01] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-13 16:16:01] [INFO ] Computed 8 place invariants in 32 ms
[2023-03-13 16:16:01] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:16:02] [INFO ] After 637ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:16:02] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 16:16:02] [INFO ] After 358ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:02] [INFO ] After 1079ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:02] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:16:03] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:03] [INFO ] After 499ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:04] [INFO ] Deduced a trap composed of 50 places in 432 ms of which 1 ms to minimize.
[2023-03-13 16:16:05] [INFO ] Deduced a trap composed of 26 places in 519 ms of which 1 ms to minimize.
[2023-03-13 16:16:05] [INFO ] Deduced a trap composed of 17 places in 252 ms of which 0 ms to minimize.
[2023-03-13 16:16:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1625 ms
[2023-03-13 16:16:05] [INFO ] After 2274ms 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-13 16:16:05] [INFO ] After 3249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1951 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 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 127 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 127 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 1000014 steps, including 2 resets, run finished after 517 ms. (steps per millisecond=1934 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 2040 ms. (steps per millisecond=490 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 280901 steps, run timeout after 6001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 280901 steps, saw 152681 distinct states, run finished after 6003 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:16:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:16:16] [INFO ] Computed 8 place invariants in 31 ms
[2023-03-13 16:16:16] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:16:17] [INFO ] After 663ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:16:17] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:16:17] [INFO ] After 581ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:17] [INFO ] After 1326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:17] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:16:18] [INFO ] After 823ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:19] [INFO ] After 394ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:19] [INFO ] Deduced a trap composed of 17 places in 393 ms of which 1 ms to minimize.
[2023-03-13 16:16:20] [INFO ] Deduced a trap composed of 35 places in 248 ms of which 0 ms to minimize.
[2023-03-13 16:16:20] [INFO ] Deduced a trap composed of 35 places in 225 ms of which 1 ms to minimize.
[2023-03-13 16:16:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1364 ms
[2023-03-13 16:16:20] [INFO ] After 1868ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 119 ms.
[2023-03-13 16:16:20] [INFO ] After 2901ms 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 86 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 79 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:16:20] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:20] [INFO ] Invariant cache hit.
[2023-03-13 16:16:21] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-13 16:16:21] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:21] [INFO ] Invariant cache hit.
[2023-03-13 16:16:21] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:16:23] [INFO ] Implicit Places using invariants and state equation in 1808 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
[2023-03-13 16:16:23] [INFO ] Redundant transitions in 207 ms returned []
[2023-03-13 16:16:23] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:23] [INFO ] Invariant cache hit.
[2023-03-13 16:16:24] [INFO ] Dead Transitions using invariants and state equation in 1156 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3723 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100018 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=971 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:16:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:24] [INFO ] Invariant cache hit.
[2023-03-13 16:16:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:16:25] [INFO ] After 645ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:16:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:16:25] [INFO ] After 259ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-13 16:16:26] [INFO ] Deduced a trap composed of 26 places in 312 ms of which 1 ms to minimize.
[2023-03-13 16:16:26] [INFO ] Deduced a trap composed of 23 places in 264 ms of which 1 ms to minimize.
[2023-03-13 16:16:26] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 1 ms to minimize.
[2023-03-13 16:16:27] [INFO ] Deduced a trap composed of 35 places in 312 ms of which 0 ms to minimize.
[2023-03-13 16:16:27] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1481 ms
[2023-03-13 16:16:27] [INFO ] After 1816ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:27] [INFO ] After 2557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:27] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:16:27] [INFO ] After 567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:27] [INFO ] After 141ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:28] [INFO ] Deduced a trap composed of 17 places in 434 ms of which 1 ms to minimize.
[2023-03-13 16:16:28] [INFO ] Deduced a trap composed of 21 places in 266 ms of which 1 ms to minimize.
[2023-03-13 16:16:29] [INFO ] Deduced a trap composed of 47 places in 208 ms of which 1 ms to minimize.
[2023-03-13 16:16:29] [INFO ] Deduced a trap composed of 47 places in 206 ms of which 1 ms to minimize.
[2023-03-13 16:16:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1633 ms
[2023-03-13 16:16:29] [INFO ] After 1885ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-13 16:16:29] [INFO ] After 2538ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 1000042 steps, including 2 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1634 ms. (steps per millisecond=611 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 311693 steps, run timeout after 6001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 311693 steps, saw 172212 distinct states, run finished after 6001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:16:38] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:38] [INFO ] Invariant cache hit.
[2023-03-13 16:16:38] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:16:38] [INFO ] After 478ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:16:38] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:16:39] [INFO ] After 443ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:39] [INFO ] After 1005ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:39] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-13 16:16:39] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:40] [INFO ] After 211ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:40] [INFO ] Deduced a trap composed of 10 places in 476 ms of which 1 ms to minimize.
[2023-03-13 16:16:40] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 1 ms to minimize.
[2023-03-13 16:16:41] [INFO ] Deduced a trap composed of 47 places in 135 ms of which 1 ms to minimize.
[2023-03-13 16:16:41] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1108 ms
[2023-03-13 16:16:41] [INFO ] After 1390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 124 ms.
[2023-03-13 16:16:41] [INFO ] After 2141ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 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 71 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 71 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-13 16:16:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:41] [INFO ] Invariant cache hit.
[2023-03-13 16:16:41] [INFO ] Implicit Places using invariants in 301 ms returned []
[2023-03-13 16:16:41] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:41] [INFO ] Invariant cache hit.
[2023-03-13 16:16:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:16:43] [INFO ] Implicit Places using invariants and state equation in 2096 ms returned []
Implicit Place search using SMT with State Equation took 2417 ms to find 0 implicit places.
[2023-03-13 16:16:44] [INFO ] Redundant transitions in 144 ms returned []
[2023-03-13 16:16:44] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:44] [INFO ] Invariant cache hit.
[2023-03-13 16:16:45] [INFO ] Dead Transitions using invariants and state equation in 1195 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3826 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100013 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=1852 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:16:45] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:45] [INFO ] Invariant cache hit.
[2023-03-13 16:16:45] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:16:45] [INFO ] After 477ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:16:45] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:16:46] [INFO ] After 365ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-13 16:16:46] [INFO ] Deduced a trap composed of 26 places in 321 ms of which 3 ms to minimize.
[2023-03-13 16:16:46] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 1 ms to minimize.
[2023-03-13 16:16:47] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 0 ms to minimize.
[2023-03-13 16:16:47] [INFO ] Deduced a trap composed of 35 places in 317 ms of which 0 ms to minimize.
[2023-03-13 16:16:47] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1548 ms
[2023-03-13 16:16:47] [INFO ] After 1995ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:47] [INFO ] After 2557ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:47] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:16:48] [INFO ] After 633ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:48] [INFO ] After 175ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:49] [INFO ] Deduced a trap composed of 17 places in 318 ms of which 0 ms to minimize.
[2023-03-13 16:16:49] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 0 ms to minimize.
[2023-03-13 16:16:49] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 0 ms to minimize.
[2023-03-13 16:16:50] [INFO ] Deduced a trap composed of 47 places in 164 ms of which 0 ms to minimize.
[2023-03-13 16:16:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1422 ms
[2023-03-13 16:16:50] [INFO ] After 1719ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-13 16:16:50] [INFO ] After 2470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10023 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=668 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 125877 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125877 steps, saw 52013 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:16:53] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:16:53] [INFO ] Invariant cache hit.
[2023-03-13 16:16:53] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:16:54] [INFO ] After 576ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:16:54] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:16:54] [INFO ] After 459ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:54] [INFO ] After 1104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:16:54] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:16:55] [INFO ] After 570ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:55] [INFO ] After 214ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:16:55] [INFO ] Deduced a trap composed of 10 places in 477 ms of which 1 ms to minimize.
[2023-03-13 16:16:56] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 1 ms to minimize.
[2023-03-13 16:16:56] [INFO ] Deduced a trap composed of 47 places in 247 ms of which 1 ms to minimize.
[2023-03-13 16:16:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1299 ms
[2023-03-13 16:16:56] [INFO ] After 1595ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-13 16:16:56] [INFO ] After 2399ms 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 71 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 72 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 10032 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1114 ) 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 122220 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 122220 steps, saw 49560 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:17:00] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:17:00] [INFO ] Invariant cache hit.
[2023-03-13 16:17:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:17:00] [INFO ] After 707ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:17:00] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:17:01] [INFO ] After 656ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:17:01] [INFO ] After 1433ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:17:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:17:02] [INFO ] After 803ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:17:02] [INFO ] After 270ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:17:03] [INFO ] Deduced a trap composed of 10 places in 515 ms of which 1 ms to minimize.
[2023-03-13 16:17:03] [INFO ] Deduced a trap composed of 17 places in 349 ms of which 0 ms to minimize.
[2023-03-13 16:17:04] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 0 ms to minimize.
[2023-03-13 16:17:04] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1529 ms
[2023-03-13 16:17:04] [INFO ] After 1923ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-13 16:17:04] [INFO ] After 2982ms 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 96 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 97 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 77 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:17:04] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:17:04] [INFO ] Invariant cache hit.
[2023-03-13 16:17:05] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-13 16:17:05] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:17:05] [INFO ] Invariant cache hit.
[2023-03-13 16:17:05] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:17:07] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2512 ms to find 0 implicit places.
[2023-03-13 16:17:07] [INFO ] Redundant transitions in 107 ms returned []
[2023-03-13 16:17:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:17:07] [INFO ] Invariant cache hit.
[2023-03-13 16:17:08] [INFO ] Dead Transitions using invariants and state equation in 1154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3859 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 242 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-13 16:17:08] [INFO ] Computed 9 place invariants in 32 ms
[2023-03-13 16:17:08] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2023-03-13 16:17:09] [INFO ] After 669ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:17:09] [INFO ] After 765ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:17:09] [INFO ] After 868ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:17:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 16:17:10] [INFO ] After 604ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:17:10] [INFO ] After 730ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 85 ms.
[2023-03-13 16:17:10] [INFO ] After 887ms SMT Verify possible using all constraints in natural 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 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 242 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 1 properties.
[2023-03-13 16:17:10] [INFO ] Invariant cache hit.
[2023-03-13 16:17:10] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 16:17:11] [INFO ] After 738ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:17:11] [INFO ] After 907ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:17:11] [INFO ] After 984ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:17:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 16:17:12] [INFO ] After 775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:17:12] [INFO ] After 933ms 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-13 16:17:12] [INFO ] After 1126ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:17:13] [INFO ] Flatten gal took : 230 ms
[2023-03-13 16:17:13] [INFO ] Flatten gal took : 202 ms
[2023-03-13 16:17:13] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 16:17:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 278 places, 3904 transitions and 19190 arcs took 32 ms.
Total runtime 115841 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 278 NrTr: 3904 NrArc: 19190)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.125sec

net check time: 0m 0.004sec

init dd package: 0m 3.092sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10499224 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16080136 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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.070sec

17341 36779 54379 63079 110908 129053 142184 128887 205036

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m128"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is BugTracking-PT-q8m128, 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 r042-tajo-167813695800433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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