fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r089-smll-167814408700268
Last Updated
May 14, 2023

About the Execution of Smart+red for CloudDeployment-PT-6a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7586.140 1800000.00 2236536.00 5140.50 [undef] Time out reached

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r089-smll-167814408700268.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is CloudDeployment-PT-6a, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r089-smll-167814408700268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.8K Feb 25 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 15:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 15:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 158K Feb 25 15:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 317K 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

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1678270991410

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=smartxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=CloudDeployment-PT-6a
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-08 10:23:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2023-03-08 10:23:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 10:23:14] [INFO ] Load time of PNML (sax parser for PT used): 157 ms
[2023-03-08 10:23:14] [INFO ] Transformed 221 places.
[2023-03-08 10:23:14] [INFO ] Transformed 908 transitions.
[2023-03-08 10:23:14] [INFO ] Found NUPN structural information;
[2023-03-08 10:23:14] [INFO ] Parsed PT model containing 221 places and 908 transitions and 5517 arcs in 277 ms.
Graph (trivial) has 265 edges and 221 vertex of which 60 / 221 are part of one of the 18 SCC in 5 ms
Free SCC test removed 42 places
Structural test allowed to assert that 69 places are NOT stable. Took 19 ms.
Ensure Unique test removed 234 transitions
Reduce redundant transitions removed 234 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 761 ms. (steps per millisecond=13 ) properties (out of 152) seen :139
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 15 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-08 10:23:16] [INFO ] Flow matrix only has 258 transitions (discarded 416 similar events)
// Phase 1: matrix 258 rows 179 cols
[2023-03-08 10:23:16] [INFO ] Computed 36 place invariants in 14 ms
[2023-03-08 10:23:16] [INFO ] After 374ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 10:23:16] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 17 ms returned sat
[2023-03-08 10:23:17] [INFO ] After 299ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-08 10:23:17] [INFO ] State equation strengthened by 140 read => feed constraints.
[2023-03-08 10:23:17] [INFO ] After 271ms SMT Verify possible using 140 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-08 10:23:17] [INFO ] After 616ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 236 ms.
[2023-03-08 10:23:18] [INFO ] After 1461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 416 ms.
Support contains 13 out of 179 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 179/179 places, 674/674 transitions.
Drop transitions removed 129 transitions
Reduce isomorphic transitions removed 129 transitions.
Iterating post reduction 0 with 129 rules applied. Total rules applied 129 place count 179 transition count 545
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 139 place count 169 transition count 499
Iterating global reduction 1 with 10 rules applied. Total rules applied 149 place count 169 transition count 499
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 152 place count 166 transition count 496
Iterating global reduction 1 with 3 rules applied. Total rules applied 155 place count 166 transition count 496
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 157 place count 164 transition count 494
Iterating global reduction 1 with 2 rules applied. Total rules applied 159 place count 164 transition count 494
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 160 place count 163 transition count 493
Iterating global reduction 1 with 1 rules applied. Total rules applied 161 place count 163 transition count 493
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: -66
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 1 with 36 rules applied. Total rules applied 197 place count 145 transition count 559
Drop transitions removed 108 transitions
Redundant transition composition rules discarded 108 transitions
Iterating global reduction 1 with 108 rules applied. Total rules applied 305 place count 145 transition count 451
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 311 place count 145 transition count 508
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 317 place count 139 transition count 508
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 318 place count 139 transition count 508
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 319 place count 138 transition count 507
Applied a total of 319 rules in 219 ms. Remains 138 /179 variables (removed 41) and now considering 507/674 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 138/179 places, 507/674 transitions.
Incomplete random walk after 1000000 steps, including 15251 resets, run finished after 25220 ms. (steps per millisecond=39 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1969 resets, run finished after 3980 ms. (steps per millisecond=251 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1976 resets, run finished after 3943 ms. (steps per millisecond=253 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1986 resets, run finished after 3193 ms. (steps per millisecond=313 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1961 resets, run finished after 3017 ms. (steps per millisecond=331 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1973 resets, run finished after 3784 ms. (steps per millisecond=264 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1986 resets, run finished after 4293 ms. (steps per millisecond=232 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1974 resets, run finished after 4126 ms. (steps per millisecond=242 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1975 resets, run finished after 4023 ms. (steps per millisecond=248 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1969 resets, run finished after 4076 ms. (steps per millisecond=245 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1973 resets, run finished after 4742 ms. (steps per millisecond=210 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1967 resets, run finished after 3922 ms. (steps per millisecond=254 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1980 resets, run finished after 3953 ms. (steps per millisecond=252 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1985 resets, run finished after 3935 ms. (steps per millisecond=254 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 32803841 steps, run timeout after 228001 ms. (steps per millisecond=143 ) properties seen :{}
Probabilistic random walk after 32803841 steps, saw 4430392 distinct states, run finished after 228006 ms. (steps per millisecond=143 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-08 10:28:22] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:28:22] [INFO ] Computed 36 place invariants in 11 ms
[2023-03-08 10:28:23] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 10:28:23] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 17 ms returned sat
[2023-03-08 10:28:23] [INFO ] After 362ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-08 10:28:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:28:24] [INFO ] After 317ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-08 10:28:24] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-08 10:28:24] [INFO ] After 1654ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 13 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Applied a total of 0 rules in 32 ms. Remains 138 /138 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 138/138 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Applied a total of 0 rules in 31 ms. Remains 138 /138 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:28:24] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:28:24] [INFO ] Invariant cache hit.
[2023-03-08 10:28:25] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-08 10:28:25] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:28:25] [INFO ] Invariant cache hit.
[2023-03-08 10:28:25] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:28:25] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 770 ms to find 0 implicit places.
[2023-03-08 10:28:25] [INFO ] Redundant transitions in 51 ms returned []
[2023-03-08 10:28:25] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:28:25] [INFO ] Invariant cache hit.
[2023-03-08 10:28:26] [INFO ] Dead Transitions using invariants and state equation in 416 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1283 ms. Remains : 138/138 places, 507/507 transitions.
Incomplete random walk after 100000 steps, including 1502 resets, run finished after 3182 ms. (steps per millisecond=31 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-08 10:28:29] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:28:29] [INFO ] Invariant cache hit.
[2023-03-08 10:28:29] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 13 ms returned sat
[2023-03-08 10:28:29] [INFO ] After 172ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13
[2023-03-08 10:28:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:28:29] [INFO ] After 139ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :13
[2023-03-08 10:28:30] [INFO ] After 587ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 122 ms.
[2023-03-08 10:28:30] [INFO ] After 971ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :13
Incomplete random walk after 1000000 steps, including 15227 resets, run finished after 26856 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1969 resets, run finished after 4103 ms. (steps per millisecond=243 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1986 resets, run finished after 4324 ms. (steps per millisecond=231 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1966 resets, run finished after 3949 ms. (steps per millisecond=253 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1978 resets, run finished after 3910 ms. (steps per millisecond=255 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1977 resets, run finished after 3895 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1969 resets, run finished after 3898 ms. (steps per millisecond=256 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1983 resets, run finished after 3918 ms. (steps per millisecond=255 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1966 resets, run finished after 3941 ms. (steps per millisecond=253 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1961 resets, run finished after 3947 ms. (steps per millisecond=253 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000000 steps, including 1984 resets, run finished after 3913 ms. (steps per millisecond=255 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1965 resets, run finished after 3918 ms. (steps per millisecond=255 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1972 resets, run finished after 3959 ms. (steps per millisecond=252 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1972 resets, run finished after 3992 ms. (steps per millisecond=250 ) properties (out of 13) seen :0
Interrupted probabilistic random walk after 34016299 steps, run timeout after 234001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 34016299 steps, saw 4579532 distinct states, run finished after 234003 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 13 properties.
[2023-03-08 10:33:42] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:33:42] [INFO ] Invariant cache hit.
[2023-03-08 10:33:43] [INFO ] After 137ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 10:33:43] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 18 ms returned sat
[2023-03-08 10:33:43] [INFO ] After 405ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-08 10:33:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:33:43] [INFO ] After 311ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :13
[2023-03-08 10:33:44] [INFO ] After 738ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 303 ms.
[2023-03-08 10:33:44] [INFO ] After 1688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Fused 13 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Applied a total of 0 rules in 25 ms. Remains 138 /138 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 138/138 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Applied a total of 0 rules in 23 ms. Remains 138 /138 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:33:44] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:33:44] [INFO ] Invariant cache hit.
[2023-03-08 10:33:44] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-08 10:33:44] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:33:44] [INFO ] Invariant cache hit.
[2023-03-08 10:33:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:33:45] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 537 ms to find 0 implicit places.
[2023-03-08 10:33:45] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 10:33:45] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:33:45] [INFO ] Invariant cache hit.
[2023-03-08 10:33:45] [INFO ] Dead Transitions using invariants and state equation in 400 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 978 ms. Remains : 138/138 places, 507/507 transitions.
Incomplete random walk after 100000 steps, including 1511 resets, run finished after 2697 ms. (steps per millisecond=37 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-08 10:33:48] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:33:48] [INFO ] Invariant cache hit.
[2023-03-08 10:33:48] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 15 ms returned sat
[2023-03-08 10:33:48] [INFO ] After 168ms SMT Verify possible using state equation in real domain returned unsat :0 sat :13
[2023-03-08 10:33:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:33:48] [INFO ] After 94ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :13
[2023-03-08 10:33:49] [INFO ] After 428ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 90 ms.
[2023-03-08 10:33:49] [INFO ] After 762ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :13
Incomplete random walk after 10000 steps, including 153 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 684560 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 684560 steps, saw 124246 distinct states, run finished after 3001 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:33:52] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:33:52] [INFO ] Invariant cache hit.
[2023-03-08 10:33:52] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:33:52] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 12 ms returned sat
[2023-03-08 10:33:52] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:33:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:33:52] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:33:52] [INFO ] After 62ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-08 10:33:52] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 24 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 589867 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 589867 steps, saw 108610 distinct states, run finished after 3002 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:33:55] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:33:55] [INFO ] Computed 24 place invariants in 4 ms
[2023-03-08 10:33:55] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:33:55] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 10:33:55] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:33:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:33:55] [INFO ] After 18ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:33:55] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 10:33:55] [INFO ] After 211ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 11 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:33:55] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:33:55] [INFO ] Invariant cache hit.
[2023-03-08 10:33:56] [INFO ] Implicit Places using invariants in 195 ms returned []
[2023-03-08 10:33:56] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:33:56] [INFO ] Invariant cache hit.
[2023-03-08 10:33:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:33:56] [INFO ] Implicit Places using invariants and state equation in 458 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2023-03-08 10:33:56] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 10:33:56] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:33:56] [INFO ] Invariant cache hit.
[2023-03-08 10:33:57] [INFO ] Dead Transitions using invariants and state equation in 459 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1151 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
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 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 48 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:33:57] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:33:57] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:33:57] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-08 10:33:57] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:33:57] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-08 10:33:57] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 151 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 660966 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 660966 steps, saw 120011 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:00] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:34:00] [INFO ] Computed 36 place invariants in 5 ms
[2023-03-08 10:34:00] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:00] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 10 ms returned sat
[2023-03-08 10:34:00] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:00] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:00] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-08 10:34:00] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 25 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 150 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 507189 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :{}
Probabilistic random walk after 507189 steps, saw 93742 distinct states, run finished after 3001 ms. (steps per millisecond=169 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:03] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:34:03] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-08 10:34:03] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:03] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 10:34:03] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:03] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:03] [INFO ] After 19ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:03] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 10:34:03] [INFO ] After 193ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:34:03] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:03] [INFO ] Invariant cache hit.
[2023-03-08 10:34:04] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-08 10:34:04] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:04] [INFO ] Invariant cache hit.
[2023-03-08 10:34:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:04] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-08 10:34:04] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-08 10:34:04] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:04] [INFO ] Invariant cache hit.
[2023-03-08 10:34:04] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 910 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 21 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:34:04] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:34:04] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:04] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-08 10:34:04] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:04] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 10:34:04] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 150 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 21 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 680099 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :{}
Probabilistic random walk after 680099 steps, saw 123453 distinct states, run finished after 3003 ms. (steps per millisecond=226 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:08] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:34:08] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-08 10:34:08] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:08] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 12 ms returned sat
[2023-03-08 10:34:08] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:08] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:08] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 10:34:08] [INFO ] After 244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 12 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 149 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645079 steps, run timeout after 3001 ms. (steps per millisecond=214 ) properties seen :{}
Probabilistic random walk after 645079 steps, saw 117017 distinct states, run finished after 3001 ms. (steps per millisecond=214 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:11] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:34:11] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-08 10:34:11] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:11] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 10:34:11] [INFO ] After 91ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:11] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:11] [INFO ] After 30ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:11] [INFO ] After 66ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 10:34:11] [INFO ] After 235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 19 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:34:11] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:11] [INFO ] Invariant cache hit.
[2023-03-08 10:34:11] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-08 10:34:11] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:11] [INFO ] Invariant cache hit.
[2023-03-08 10:34:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:12] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
[2023-03-08 10:34:12] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 10:34:12] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:12] [INFO ] Invariant cache hit.
[2023-03-08 10:34:12] [INFO ] Dead Transitions using invariants and state equation in 411 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1142 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 18 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:34:12] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:34:12] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:12] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-08 10:34:12] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:12] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 10:34:12] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 154 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 662995 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662995 steps, saw 120383 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:15] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:34:15] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-08 10:34:15] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:16] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-08 10:34:16] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:16] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:16] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-08 10:34:16] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 18 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 634947 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :{}
Probabilistic random walk after 634947 steps, saw 115394 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:19] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:34:19] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-08 10:34:19] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:19] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 10:34:19] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:19] [INFO ] After 32ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:19] [INFO ] After 64ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 10:34:19] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:34:19] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:19] [INFO ] Invariant cache hit.
[2023-03-08 10:34:19] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 10:34:19] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:19] [INFO ] Invariant cache hit.
[2023-03-08 10:34:20] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:20] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2023-03-08 10:34:20] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:34:20] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:20] [INFO ] Invariant cache hit.
[2023-03-08 10:34:20] [INFO ] Dead Transitions using invariants and state equation in 456 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1033 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 26 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:34:20] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:34:20] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:20] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-08 10:34:20] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:20] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 10:34:20] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 148 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 593837 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :{}
Probabilistic random walk after 593837 steps, saw 109225 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:23] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:34:23] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-08 10:34:23] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:23] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-08 10:34:24] [INFO ] After 105ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:24] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:24] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 10:34:24] [INFO ] After 236ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 12 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 155 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 654401 steps, run timeout after 3001 ms. (steps per millisecond=218 ) properties seen :{}
Probabilistic random walk after 654401 steps, saw 118807 distinct states, run finished after 3001 ms. (steps per millisecond=218 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:27] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:34:27] [INFO ] Computed 24 place invariants in 5 ms
[2023-03-08 10:34:27] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:27] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 10:34:27] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:27] [INFO ] After 34ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:27] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-08 10:34:27] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 10 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:34:27] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:27] [INFO ] Invariant cache hit.
[2023-03-08 10:34:27] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-08 10:34:27] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:27] [INFO ] Invariant cache hit.
[2023-03-08 10:34:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:28] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 608 ms to find 0 implicit places.
[2023-03-08 10:34:28] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:34:28] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:28] [INFO ] Invariant cache hit.
[2023-03-08 10:34:28] [INFO ] Dead Transitions using invariants and state equation in 445 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1079 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 25 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:34:28] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:34:28] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:28] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-08 10:34:28] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:28] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 10:34:28] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 154 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 590783 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :{}
Probabilistic random walk after 590783 steps, saw 108746 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:31] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:34:31] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-08 10:34:31] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:31] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-08 10:34:32] [INFO ] After 119ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:32] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:32] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-08 10:34:32] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 18 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 158 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618056 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 618056 steps, saw 112919 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:35] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:34:35] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-08 10:34:35] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:35] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 10:34:35] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:35] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:35] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 10:34:35] [INFO ] After 207ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 14 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 14 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:34:35] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:35] [INFO ] Invariant cache hit.
[2023-03-08 10:34:35] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-08 10:34:35] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:35] [INFO ] Invariant cache hit.
[2023-03-08 10:34:35] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:36] [INFO ] Implicit Places using invariants and state equation in 457 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2023-03-08 10:34:36] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:34:36] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:36] [INFO ] Invariant cache hit.
[2023-03-08 10:34:36] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1281 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 4 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 29 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:34:36] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 10:34:36] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:36] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-08 10:34:36] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:36] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-08 10:34:36] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 154 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 609166 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 609166 steps, saw 111557 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:40] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:34:40] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-08 10:34:40] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:40] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 17 ms returned sat
[2023-03-08 10:34:40] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:40] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:40] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-08 10:34:40] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 17 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 498466 steps, run timeout after 3001 ms. (steps per millisecond=166 ) properties seen :{}
Probabilistic random walk after 498466 steps, saw 92167 distinct states, run finished after 3001 ms. (steps per millisecond=166 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:43] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:34:43] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-08 10:34:43] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:43] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 10:34:43] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:43] [INFO ] After 27ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:43] [INFO ] After 51ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 10:34:43] [INFO ] After 210ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:34:43] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:43] [INFO ] Invariant cache hit.
[2023-03-08 10:34:44] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 10:34:44] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:44] [INFO ] Invariant cache hit.
[2023-03-08 10:34:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:44] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 621 ms to find 0 implicit places.
[2023-03-08 10:34:44] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 10:34:44] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:44] [INFO ] Invariant cache hit.
[2023-03-08 10:34:45] [INFO ] Dead Transitions using invariants and state equation in 585 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1231 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 15 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:34:45] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:34:45] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:45] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 3 ms returned sat
[2023-03-08 10:34:45] [INFO ] After 17ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:45] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-08 10:34:45] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 149 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 662637 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :{}
Probabilistic random walk after 662637 steps, saw 120323 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:48] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:34:48] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-08 10:34:48] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:48] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-08 10:34:48] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:48] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:48] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:48] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 10:34:48] [INFO ] After 225ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 10 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 153 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 538406 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :{}
Probabilistic random walk after 538406 steps, saw 99383 distinct states, run finished after 3001 ms. (steps per millisecond=179 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:51] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:34:51] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-08 10:34:51] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:51] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 10:34:51] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:51] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:51] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:51] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 10:34:51] [INFO ] After 203ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:34:51] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:51] [INFO ] Invariant cache hit.
[2023-03-08 10:34:51] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-08 10:34:51] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:51] [INFO ] Invariant cache hit.
[2023-03-08 10:34:52] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:52] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2023-03-08 10:34:52] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:34:52] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:52] [INFO ] Invariant cache hit.
[2023-03-08 10:34:53] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1226 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 21 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:34:53] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:34:53] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:53] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 4 ms returned sat
[2023-03-08 10:34:53] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:53] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-08 10:34:53] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 153 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 619917 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :{}
Probabilistic random walk after 619917 steps, saw 113192 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:56] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:34:56] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-08 10:34:56] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:56] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-08 10:34:56] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:56] [INFO ] After 20ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:56] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 10:34:56] [INFO ] After 221ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 11 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 645728 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 645728 steps, saw 117123 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:34:59] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:34:59] [INFO ] Computed 24 place invariants in 3 ms
[2023-03-08 10:34:59] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:34:59] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 10:34:59] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:34:59] [INFO ] After 33ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:34:59] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 10:34:59] [INFO ] After 287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 12 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:34:59] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:34:59] [INFO ] Invariant cache hit.
[2023-03-08 10:35:00] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-03-08 10:35:00] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:00] [INFO ] Invariant cache hit.
[2023-03-08 10:35:00] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:00] [INFO ] Implicit Places using invariants and state equation in 478 ms returned []
Implicit Place search using SMT with State Equation took 707 ms to find 0 implicit places.
[2023-03-08 10:35:00] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:35:00] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:00] [INFO ] Invariant cache hit.
[2023-03-08 10:35:01] [INFO ] Dead Transitions using invariants and state equation in 560 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1294 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 24 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:35:01] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:35:01] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:01] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-08 10:35:01] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:01] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 10:35:01] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 144 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 588114 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :{}
Probabilistic random walk after 588114 steps, saw 108343 distinct states, run finished after 3001 ms. (steps per millisecond=195 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:35:04] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:35:04] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-08 10:35:04] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:04] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 12 ms returned sat
[2023-03-08 10:35:04] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:04] [INFO ] After 23ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:04] [INFO ] After 69ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 38 ms.
[2023-03-08 10:35:04] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 19 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 151 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 608428 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :{}
Probabilistic random walk after 608428 steps, saw 111458 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:35:07] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:35:07] [INFO ] Computed 24 place invariants in 8 ms
[2023-03-08 10:35:07] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:07] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 10:35:07] [INFO ] After 85ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:07] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:07] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 10:35:07] [INFO ] After 197ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 9 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:35:07] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:07] [INFO ] Invariant cache hit.
[2023-03-08 10:35:08] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-08 10:35:08] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:08] [INFO ] Invariant cache hit.
[2023-03-08 10:35:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:08] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2023-03-08 10:35:08] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 10:35:08] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:08] [INFO ] Invariant cache hit.
[2023-03-08 10:35:09] [INFO ] Dead Transitions using invariants and state equation in 604 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1269 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 25 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:35:09] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:35:09] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:09] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-08 10:35:09] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:09] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 10:35:09] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 156 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 609442 steps, run timeout after 3001 ms. (steps per millisecond=203 ) properties seen :{}
Probabilistic random walk after 609442 steps, saw 111611 distinct states, run finished after 3002 ms. (steps per millisecond=203 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:35:12] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:35:12] [INFO ] Computed 36 place invariants in 3 ms
[2023-03-08 10:35:12] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:12] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 18 ms returned sat
[2023-03-08 10:35:12] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:12] [INFO ] After 35ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:12] [INFO ] After 82ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-08 10:35:12] [INFO ] After 370ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 16 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 637132 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :{}
Probabilistic random walk after 637132 steps, saw 115737 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:35:15] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:35:15] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-08 10:35:16] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:16] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 10:35:16] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:16] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:16] [INFO ] After 73ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-03-08 10:35:16] [INFO ] After 291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 17 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:35:16] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:16] [INFO ] Invariant cache hit.
[2023-03-08 10:35:16] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-08 10:35:16] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:16] [INFO ] Invariant cache hit.
[2023-03-08 10:35:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:17] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 698 ms to find 0 implicit places.
[2023-03-08 10:35:17] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 10:35:17] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:17] [INFO ] Invariant cache hit.
[2023-03-08 10:35:17] [INFO ] Dead Transitions using invariants and state equation in 616 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1343 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 19 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:35:17] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 10:35:17] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:17] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-08 10:35:17] [INFO ] After 28ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:17] [INFO ] After 36ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 10:35:17] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 154 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 647239 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 647239 steps, saw 117359 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:35:20] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:35:20] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-08 10:35:20] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:20] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 11 ms returned sat
[2023-03-08 10:35:21] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:21] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:21] [INFO ] After 83ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-08 10:35:21] [INFO ] After 297ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 18 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 154 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 468801 steps, run timeout after 3001 ms. (steps per millisecond=156 ) properties seen :{}
Probabilistic random walk after 468801 steps, saw 86914 distinct states, run finished after 3001 ms. (steps per millisecond=156 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:35:24] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:35:24] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-08 10:35:24] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:24] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 8 ms returned sat
[2023-03-08 10:35:24] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:24] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:24] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 10:35:24] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 13 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:35:24] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:24] [INFO ] Invariant cache hit.
[2023-03-08 10:35:24] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-03-08 10:35:24] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:24] [INFO ] Invariant cache hit.
[2023-03-08 10:35:24] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:25] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 708 ms to find 0 implicit places.
[2023-03-08 10:35:25] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:35:25] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:25] [INFO ] Invariant cache hit.
[2023-03-08 10:35:25] [INFO ] Dead Transitions using invariants and state equation in 606 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1341 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 21 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:35:25] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-08 10:35:25] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:25] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 5 ms returned sat
[2023-03-08 10:35:26] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:26] [INFO ] After 35ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 10:35:26] [INFO ] After 89ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Incomplete random walk after 10000 steps, including 151 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 618050 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :{}
Probabilistic random walk after 618050 steps, saw 112919 distinct states, run finished after 3001 ms. (steps per millisecond=205 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:35:29] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 138 cols
[2023-03-08 10:35:29] [INFO ] Computed 36 place invariants in 2 ms
[2023-03-08 10:35:29] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:29] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 12 ms returned sat
[2023-03-08 10:35:29] [INFO ] After 100ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:29] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:29] [INFO ] After 22ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:29] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 10:35:29] [INFO ] After 227ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 507/507 transitions.
Ensure Unique test removed 12 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 126 transition count 507
Applied a total of 12 rules in 10 ms. Remains 126 /138 variables (removed 12) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 126/138 places, 507/507 transitions.
Incomplete random walk after 10000 steps, including 152 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 646175 steps, run timeout after 3001 ms. (steps per millisecond=215 ) properties seen :{}
Probabilistic random walk after 646175 steps, saw 117191 distinct states, run finished after 3001 ms. (steps per millisecond=215 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 10:35:32] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
// Phase 1: matrix 255 rows 126 cols
[2023-03-08 10:35:32] [INFO ] Computed 24 place invariants in 2 ms
[2023-03-08 10:35:32] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:32] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 9 ms returned sat
[2023-03-08 10:35:32] [INFO ] After 86ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:32] [INFO ] After 24ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:32] [INFO ] After 48ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 10:35:32] [INFO ] After 198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 126/126 places, 507/507 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 507/507 transitions.
Applied a total of 0 rules in 8 ms. Remains 126 /126 variables (removed 0) and now considering 507/507 (removed 0) transitions.
[2023-03-08 10:35:32] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:32] [INFO ] Invariant cache hit.
[2023-03-08 10:35:32] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 10:35:32] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:32] [INFO ] Invariant cache hit.
[2023-03-08 10:35:32] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 10:35:33] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 526 ms to find 0 implicit places.
[2023-03-08 10:35:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 10:35:33] [INFO ] Flow matrix only has 255 transitions (discarded 252 similar events)
[2023-03-08 10:35:33] [INFO ] Invariant cache hit.
[2023-03-08 10:35:33] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1167 ms. Remains : 126/126 places, 507/507 transitions.
Graph (trivial) has 104 edges and 126 vertex of which 42 / 126 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 79 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 57 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 57 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 47 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 42 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 42 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 37 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 37 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 37 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 36 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 36 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 36 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 30 transition count 53
Applied a total of 133 rules in 19 ms. Remains 30 /126 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 53 rows 30 cols
[2023-03-08 10:35:33] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 10:35:33] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 10:35:33] [INFO ] [Nat]Absence check using 0 positive and 13 generalized place invariants in 6 ms returned sat
[2023-03-08 10:35:33] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 10:35:33] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-08 10:35:33] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Graph (trivial) has 104 edges and 138 vertex of which 42 / 138 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 48 transitions
Ensure Unique test removed 252 transitions
Reduce isomorphic transitions removed 300 transitions.
Ensure Unique test removed 11 places
Drop transitions removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 91 transition count 185
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 1 with 22 rules applied. Total rules applied 56 place count 69 transition count 185
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 56 place count 69 transition count 175
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 76 place count 59 transition count 175
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 81 place count 54 transition count 170
Iterating global reduction 2 with 5 rules applied. Total rules applied 86 place count 54 transition count 170
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 91 place count 49 transition count 140
Iterating global reduction 2 with 5 rules applied. Total rules applied 96 place count 49 transition count 140
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 101 place count 49 transition count 135
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 103 place count 48 transition count 134
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 3 with 12 rules applied. Total rules applied 115 place count 48 transition count 122
Free-agglomeration rule applied 6 times with reduction of 57 identical transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 48 transition count 59
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 12 rules applied. Total rules applied 133 place count 42 transition count 53
Applied a total of 133 rules in 23 ms. Remains 42 /138 variables (removed 96) and now considering 53/507 (removed 454) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 53 rows 42 cols
[2023-03-08 10:35:34] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-08 10:35:34] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2023-03-08 10:35:34] [INFO ] [Nat]Absence check using 0 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 10:35:34] [INFO ] After 104ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
[2023-03-08 10:35:34] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-08 10:35:34] [INFO ] After 419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Unable to solve all queries for examination StableMarking. Remains :13 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 13 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 740182 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running CloudDeployment (PT), instance 6a
Examination StableMarking
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/StableMarking.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 221 places, 908 transitions, 5517 arcs.
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 8578544 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16120700 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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -timeout 180 -rebuildPNML
Caught signal 15, terminating.

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="CloudDeployment-PT-6a"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is CloudDeployment-PT-6a, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r089-smll-167814408700268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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