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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 6.2K Feb 26 07:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 26 07:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 06:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 06:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 15:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 19K Feb 25 15:38 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 07:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 07:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 26 07:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 07:27 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-q8m064-CTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678723309344

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-q8m064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 16:01:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 16:01:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 16:01:51] [INFO ] Load time of PNML (sax parser for PT used): 640 ms
[2023-03-13 16:01:51] [INFO ] Transformed 754 places.
[2023-03-13 16:01:51] [INFO ] Transformed 27370 transitions.
[2023-03-13 16:01:51] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 809 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Deduced a syphon composed of 474 places in 101 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m064-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 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 74 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2023-03-13 16:01:52] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-13 16:01:52] [INFO ] Computed 8 place invariants in 53 ms
[2023-03-13 16:01:52] [INFO ] Implicit Places using invariants in 648 ms returned []
[2023-03-13 16:01:52] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-13 16:01:52] [INFO ] Invariant cache hit.
[2023-03-13 16:01:53] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 16:01:55] [INFO ] Implicit Places using invariants and state equation in 2159 ms returned []
Implicit Place search using SMT with State Equation took 2834 ms to find 0 implicit places.
[2023-03-13 16:01:55] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-13 16:01:55] [INFO ] Invariant cache hit.
[2023-03-13 16:01:56] [INFO ] Dead Transitions using invariants and state equation in 1396 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 4307 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 23 out of 277 places after structural reductions.
[2023-03-13 16:01:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2023-03-13 16:01:56] [INFO ] Flatten gal took : 325 ms
[2023-03-13 16:01:56] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BugTracking-PT-q8m064-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 16:01:57] [INFO ] Flatten gal took : 193 ms
[2023-03-13 16:01:57] [INFO ] Input system was already deterministic with 3871 transitions.
Support contains 12 out of 277 places (down from 23) after GAL structural reductions.
FORMULA BugTracking-PT-q8m064-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 15 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-13 16:01:58] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2023-03-13 16:01:58] [INFO ] Invariant cache hit.
[2023-03-13 16:01:58] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-13 16:01:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:01:59] [INFO ] After 913ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :4
[2023-03-13 16:01:59] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 16:02:00] [INFO ] After 1024ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :4 sat :4
[2023-03-13 16:02:01] [INFO ] Deduced a trap composed of 59 places in 413 ms of which 5 ms to minimize.
[2023-03-13 16:02:02] [INFO ] Deduced a trap composed of 17 places in 517 ms of which 1 ms to minimize.
[2023-03-13 16:02:02] [INFO ] Deduced a trap composed of 19 places in 270 ms of which 1 ms to minimize.
[2023-03-13 16:02:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1645 ms
[2023-03-13 16:02:03] [INFO ] Deduced a trap composed of 56 places in 530 ms of which 1 ms to minimize.
[2023-03-13 16:02:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 718 ms
[2023-03-13 16:02:03] [INFO ] After 4049ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :4
Attempting to minimize the solution found.
Minimization took 422 ms.
[2023-03-13 16:02:04] [INFO ] After 5527ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :4
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 400 ms.
Support contains 6 out of 277 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
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 456 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 457 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 110990 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110990 steps, saw 38941 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-13 16:02:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:02:08] [INFO ] Computed 8 place invariants in 65 ms
[2023-03-13 16:02:08] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:02:08] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:02:09] [INFO ] After 1029ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:02:09] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:02:10] [INFO ] After 876ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-13 16:02:11] [INFO ] Deduced a trap composed of 5 places in 188 ms of which 1 ms to minimize.
[2023-03-13 16:02:11] [INFO ] Deduced a trap composed of 25 places in 169 ms of which 1 ms to minimize.
[2023-03-13 16:02:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 688 ms
[2023-03-13 16:02:12] [INFO ] Deduced a trap composed of 26 places in 208 ms of which 2 ms to minimize.
[2023-03-13 16:02:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 474 ms
[2023-03-13 16:02:12] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-13 16:02:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 350 ms
[2023-03-13 16:02:12] [INFO ] After 2900ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 457 ms.
[2023-03-13 16:02:13] [INFO ] After 4481ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 3871/3871 transitions.
Applied a total of 0 rules in 117 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 117 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:02:13] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:02:13] [INFO ] Invariant cache hit.
[2023-03-13 16:02:14] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-13 16:02:14] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:02:14] [INFO ] Invariant cache hit.
[2023-03-13 16:02:14] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:02:16] [INFO ] Implicit Places using invariants and state equation in 2061 ms returned []
Implicit Place search using SMT with State Equation took 2566 ms to find 0 implicit places.
[2023-03-13 16:02:16] [INFO ] Redundant transitions in 377 ms returned []
[2023-03-13 16:02:16] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:02:16] [INFO ] Invariant cache hit.
[2023-03-13 16:02:17] [INFO ] Dead Transitions using invariants and state equation in 1284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4317 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 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 175 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 176 place count 268 transition count 3696
Free-agglomeration rule applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 181 place count 268 transition count 3691
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 186 place count 263 transition count 3691
Applied a total of 186 rules in 366 ms. Remains 263 /269 variables (removed 6) and now considering 3691/3871 (removed 180) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 3691 rows 263 cols
[2023-03-13 16:02:18] [INFO ] Computed 9 place invariants in 18 ms
[2023-03-13 16:02:18] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-13 16:02:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2023-03-13 16:02:19] [INFO ] After 781ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-13 16:02:19] [INFO ] After 1483ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 431 ms.
[2023-03-13 16:02:20] [INFO ] After 1988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 4 atomic propositions for a total of 4 simplifications.
[2023-03-13 16:02:20] [INFO ] Flatten gal took : 225 ms
[2023-03-13 16:02:20] [INFO ] Flatten gal took : 232 ms
[2023-03-13 16:02:21] [INFO ] Input system was already deterministic with 3871 transitions.
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 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 17 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 16:02:21] [INFO ] Flatten gal took : 159 ms
[2023-03-13 16:02:21] [INFO ] Flatten gal took : 164 ms
[2023-03-13 16:02:21] [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 10 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 12 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 16:02:22] [INFO ] Flatten gal took : 114 ms
[2023-03-13 16:02:22] [INFO ] Flatten gal took : 129 ms
[2023-03-13 16:02:22] [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 10 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 11 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 16:02:22] [INFO ] Flatten gal took : 107 ms
[2023-03-13 16:02:22] [INFO ] Flatten gal took : 120 ms
[2023-03-13 16:02:23] [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 12 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 12 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 16:02:23] [INFO ] Flatten gal took : 130 ms
[2023-03-13 16:02:23] [INFO ] Flatten gal took : 147 ms
[2023-03-13 16:02:23] [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 10 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 11 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 16:02:23] [INFO ] Flatten gal took : 109 ms
[2023-03-13 16:02:23] [INFO ] Flatten gal took : 126 ms
[2023-03-13 16:02:24] [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 17 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 16:02:24] [INFO ] Flatten gal took : 177 ms
[2023-03-13 16:02:24] [INFO ] Flatten gal took : 176 ms
[2023-03-13 16:02:25] [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 85 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 85 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 16:02:25] [INFO ] Flatten gal took : 148 ms
[2023-03-13 16:02:25] [INFO ] Flatten gal took : 147 ms
[2023-03-13 16:02:25] [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 12 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 13 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 16:02:25] [INFO ] Flatten gal took : 145 ms
[2023-03-13 16:02:26] [INFO ] Flatten gal took : 169 ms
[2023-03-13 16:02:26] [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 57 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 57 ms. Remains : 277/277 places, 3871/3871 transitions.
[2023-03-13 16:02:26] [INFO ] Flatten gal took : 146 ms
[2023-03-13 16:02:26] [INFO ] Flatten gal took : 167 ms
[2023-03-13 16:02:27] [INFO ] Input system was already deterministic with 3871 transitions.
Incomplete random walk after 10000 steps, including 19 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 160051 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160051 steps, saw 79611 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:02:30] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2023-03-13 16:02:30] [INFO ] Computed 8 place invariants in 27 ms
[2023-03-13 16:02:30] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:02:31] [INFO ] After 736ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:02:31] [INFO ] State equation strengthened by 282 read => feed constraints.
[2023-03-13 16:02:31] [INFO ] After 264ms SMT Verify possible using 282 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:02:31] [INFO ] After 1102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:02:31] [INFO ] [Nat]Absence check using 8 positive place invariants in 7 ms returned sat
[2023-03-13 16:02:31] [INFO ] After 596ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:02:32] [INFO ] After 263ms SMT Verify possible using 282 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:02:32] [INFO ] Deduced a trap composed of 12 places in 152 ms of which 0 ms to minimize.
[2023-03-13 16:02:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2023-03-13 16:02:32] [INFO ] After 716ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 116 ms.
[2023-03-13 16:02:32] [INFO ] After 1515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 201 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 4 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 188 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 189 ms. Remains : 269/277 places, 3871/3871 transitions.
Incomplete random walk after 1000049 steps, including 2 resets, run finished after 1069 ms. (steps per millisecond=935 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 1875 ms. (steps per millisecond=533 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 322158 steps, run timeout after 6001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 322158 steps, saw 176791 distinct states, run finished after 6001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:02:42] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
// Phase 1: matrix 3699 rows 269 cols
[2023-03-13 16:02:42] [INFO ] Computed 8 place invariants in 24 ms
[2023-03-13 16:02:42] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:02:42] [INFO ] After 629ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:02:42] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:02:43] [INFO ] After 214ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:02:43] [INFO ] After 929ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:02:43] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:02:43] [INFO ] After 780ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:02:44] [INFO ] After 486ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:02:45] [INFO ] Deduced a trap composed of 10 places in 634 ms of which 1 ms to minimize.
[2023-03-13 16:02:45] [INFO ] Deduced a trap composed of 11 places in 351 ms of which 1 ms to minimize.
[2023-03-13 16:02:46] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 1 ms to minimize.
[2023-03-13 16:02:46] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1723 ms
[2023-03-13 16:02:46] [INFO ] After 2292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 137 ms.
[2023-03-13 16:02:46] [INFO ] After 3291ms 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 92 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 93 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 64 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:02:46] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:02:46] [INFO ] Invariant cache hit.
[2023-03-13 16:02:47] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-13 16:02:47] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:02:47] [INFO ] Invariant cache hit.
[2023-03-13 16:02:47] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:02:48] [INFO ] Implicit Places using invariants and state equation in 1864 ms returned []
Implicit Place search using SMT with State Equation took 2363 ms to find 0 implicit places.
[2023-03-13 16:02:49] [INFO ] Redundant transitions in 230 ms returned []
[2023-03-13 16:02:49] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:02:49] [INFO ] Invariant cache hit.
[2023-03-13 16:02:50] [INFO ] Dead Transitions using invariants and state equation in 1144 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3814 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100049 steps, including 2 resets, run finished after 199 ms. (steps per millisecond=502 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:02:50] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:02:50] [INFO ] Invariant cache hit.
[2023-03-13 16:02:50] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:02:51] [INFO ] After 661ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:02:51] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:02:51] [INFO ] After 99ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-13 16:02:51] [INFO ] After 260ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:02:51] [INFO ] After 1012ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:02:51] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:02:52] [INFO ] After 534ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:02:52] [INFO ] After 388ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:02:53] [INFO ] Deduced a trap composed of 14 places in 403 ms of which 1 ms to minimize.
[2023-03-13 16:02:53] [INFO ] Deduced a trap composed of 46 places in 395 ms of which 1 ms to minimize.
[2023-03-13 16:02:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1282 ms
[2023-03-13 16:02:53] [INFO ] After 1747ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 36 ms.
[2023-03-13 16:02:53] [INFO ] After 2385ms 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 1026 ms. (steps per millisecond=974 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1648 ms. (steps per millisecond=606 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 323516 steps, run timeout after 6001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 323516 steps, saw 177674 distinct states, run finished after 6002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:03:02] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:02] [INFO ] Invariant cache hit.
[2023-03-13 16:03:02] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:03:03] [INFO ] After 772ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:03:03] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:03:03] [INFO ] After 219ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:03:03] [INFO ] After 1081ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:03:03] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:03:04] [INFO ] After 785ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:03:05] [INFO ] After 474ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:03:05] [INFO ] Deduced a trap composed of 19 places in 400 ms of which 0 ms to minimize.
[2023-03-13 16:03:06] [INFO ] Deduced a trap composed of 14 places in 420 ms of which 1 ms to minimize.
[2023-03-13 16:03:06] [INFO ] Deduced a trap composed of 58 places in 414 ms of which 1 ms to minimize.
[2023-03-13 16:03:07] [INFO ] Deduced a trap composed of 23 places in 403 ms of which 0 ms to minimize.
[2023-03-13 16:03:07] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 2170 ms
[2023-03-13 16:03:07] [INFO ] After 2734ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-13 16:03:07] [INFO ] After 3716ms 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 100 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 100 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 72 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:03:07] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:07] [INFO ] Invariant cache hit.
[2023-03-13 16:03:08] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-13 16:03:08] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:08] [INFO ] Invariant cache hit.
[2023-03-13 16:03:08] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:03:09] [INFO ] Implicit Places using invariants and state equation in 1733 ms returned []
Implicit Place search using SMT with State Equation took 2249 ms to find 0 implicit places.
[2023-03-13 16:03:10] [INFO ] Redundant transitions in 154 ms returned []
[2023-03-13 16:03:10] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:10] [INFO ] Invariant cache hit.
[2023-03-13 16:03:11] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3583 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 100059 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=617 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:03:11] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:11] [INFO ] Invariant cache hit.
[2023-03-13 16:03:11] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:03:11] [INFO ] After 503ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:03:11] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:03:11] [INFO ] After 72ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-13 16:03:12] [INFO ] After 223ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:03:12] [INFO ] After 787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:03:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:03:12] [INFO ] After 666ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:03:13] [INFO ] After 394ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:03:13] [INFO ] Deduced a trap composed of 14 places in 409 ms of which 0 ms to minimize.
[2023-03-13 16:03:14] [INFO ] Deduced a trap composed of 46 places in 402 ms of which 1 ms to minimize.
[2023-03-13 16:03:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1340 ms
[2023-03-13 16:03:14] [INFO ] After 1818ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-13 16:03:14] [INFO ] After 2572ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10036 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=669 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 132734 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132734 steps, saw 53516 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:03:17] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:17] [INFO ] Invariant cache hit.
[2023-03-13 16:03:17] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:03:18] [INFO ] After 781ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:03:18] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:03:18] [INFO ] After 189ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:03:18] [INFO ] After 1065ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:03:18] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 16:03:19] [INFO ] After 664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:03:20] [INFO ] After 511ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:03:20] [INFO ] Deduced a trap composed of 10 places in 354 ms of which 0 ms to minimize.
[2023-03-13 16:03:20] [INFO ] Deduced a trap composed of 14 places in 217 ms of which 1 ms to minimize.
[2023-03-13 16:03:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1096 ms
[2023-03-13 16:03:21] [INFO ] After 1690ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 138 ms.
[2023-03-13 16:03:21] [INFO ] After 2556ms 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 75 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 75 ms. Remains : 269/269 places, 3871/3871 transitions.
Incomplete random walk after 10046 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=837 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 134494 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 134494 steps, saw 54694 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-13 16:03:24] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:24] [INFO ] Invariant cache hit.
[2023-03-13 16:03:24] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:03:25] [INFO ] After 676ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:03:25] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:03:25] [INFO ] After 229ms SMT Verify possible using 283 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:03:25] [INFO ] After 990ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 16:03:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 16:03:26] [INFO ] After 811ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 16:03:26] [INFO ] After 538ms SMT Verify possible using 283 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 16:03:27] [INFO ] Deduced a trap composed of 10 places in 343 ms of which 1 ms to minimize.
[2023-03-13 16:03:27] [INFO ] Deduced a trap composed of 14 places in 258 ms of which 0 ms to minimize.
[2023-03-13 16:03:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1120 ms
[2023-03-13 16:03:28] [INFO ] After 1742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 145 ms.
[2023-03-13 16:03:28] [INFO ] After 2787ms 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 70 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 70 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 68 ms. Remains 269 /269 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2023-03-13 16:03:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:28] [INFO ] Invariant cache hit.
[2023-03-13 16:03:28] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-13 16:03:28] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:28] [INFO ] Invariant cache hit.
[2023-03-13 16:03:29] [INFO ] State equation strengthened by 283 read => feed constraints.
[2023-03-13 16:03:30] [INFO ] Implicit Places using invariants and state equation in 1905 ms returned []
Implicit Place search using SMT with State Equation took 2409 ms to find 0 implicit places.
[2023-03-13 16:03:31] [INFO ] Redundant transitions in 200 ms returned []
[2023-03-13 16:03:31] [INFO ] Flow matrix only has 3699 transitions (discarded 172 similar events)
[2023-03-13 16:03:31] [INFO ] Invariant cache hit.
[2023-03-13 16:03:32] [INFO ] Dead Transitions using invariants and state equation in 1158 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3852 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 250 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:03:32] [INFO ] Computed 9 place invariants in 20 ms
[2023-03-13 16:03:32] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 16:03:33] [INFO ] After 737ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:03:33] [INFO ] After 914ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2023-03-13 16:03:33] [INFO ] After 1146ms 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 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 375 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:03:34] [INFO ] Invariant cache hit.
[2023-03-13 16:03:34] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 16:03:34] [INFO ] After 824ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-13 16:03:35] [INFO ] After 1020ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-13 16:03:35] [INFO ] After 1278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2023-03-13 16:03:35] [INFO ] Flatten gal took : 233 ms
[2023-03-13 16:03:35] [INFO ] Flatten gal took : 203 ms
[2023-03-13 16:03:35] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 16:03:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 277 places, 3871 transitions and 19025 arcs took 41 ms.
Total runtime 104864 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: 277 NrTr: 3871 NrArc: 19025)

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

net check time: 0m 0.005sec

init dd package: 0m 3.330sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10533496 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16081712 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.062sec

8494 37253 56421 73551 82487 90535 152244 171301 183777

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-q8m064"
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-q8m064, 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-167813695700425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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