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

About the Execution of LTSMin+red for ShieldIIPt-PT-020B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
944.584 107421.00 273640.00 44.00 [undef] Cannot compute

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.r393-oct2-167903716800282.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldIIPt-PT-020B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903716800282
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 724K
-rw-r--r-- 1 mcc users 7.9K Feb 25 17:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 25 17:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 17:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 17:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.3K Feb 25 17:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 17:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 17:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 17:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 338K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679436375143

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-020B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-21 22:06:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:06:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:06:18] [INFO ] Load time of PNML (sax parser for PT used): 127 ms
[2023-03-21 22:06:18] [INFO ] Transformed 1403 places.
[2023-03-21 22:06:18] [INFO ] Transformed 1303 transitions.
[2023-03-21 22:06:18] [INFO ] Found NUPN structural information;
[2023-03-21 22:06:18] [INFO ] Parsed PT model containing 1403 places and 1303 transitions and 3246 arcs in 334 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 137 out of 1403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1403/1403 places, 1303/1303 transitions.
Discarding 186 places :
Symmetric choice reduction at 0 with 186 rule applications. Total rules 186 place count 1217 transition count 1117
Iterating global reduction 0 with 186 rules applied. Total rules applied 372 place count 1217 transition count 1117
Applied a total of 372 rules in 249 ms. Remains 1217 /1403 variables (removed 186) and now considering 1117/1303 (removed 186) transitions.
// Phase 1: matrix 1117 rows 1217 cols
[2023-03-21 22:06:19] [INFO ] Computed 181 place invariants in 20 ms
[2023-03-21 22:06:20] [INFO ] Implicit Places using invariants in 1483 ms returned []
[2023-03-21 22:06:20] [INFO ] Invariant cache hit.
[2023-03-21 22:06:21] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 2648 ms to find 0 implicit places.
[2023-03-21 22:06:21] [INFO ] Invariant cache hit.
[2023-03-21 22:06:23] [INFO ] Dead Transitions using invariants and state equation in 2260 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1217/1403 places, 1117/1303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5160 ms. Remains : 1217/1403 places, 1117/1303 transitions.
Support contains 137 out of 1217 places after structural reductions.
[2023-03-21 22:06:24] [INFO ] Flatten gal took : 103 ms
[2023-03-21 22:06:24] [INFO ] Flatten gal took : 49 ms
[2023-03-21 22:06:24] [INFO ] Input system was already deterministic with 1117 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 532 ms. (steps per millisecond=18 ) properties (out of 84) seen :51
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 33) seen :0
Running SMT prover for 33 properties.
[2023-03-21 22:06:25] [INFO ] Invariant cache hit.
[2023-03-21 22:06:26] [INFO ] [Real]Absence check using 181 positive place invariants in 311 ms returned sat
[2023-03-21 22:06:27] [INFO ] After 1959ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:33
[2023-03-21 22:06:28] [INFO ] [Nat]Absence check using 181 positive place invariants in 85 ms returned sat
[2023-03-21 22:06:32] [INFO ] After 2826ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :33
[2023-03-21 22:06:32] [INFO ] Deduced a trap composed of 16 places in 242 ms of which 7 ms to minimize.
[2023-03-21 22:06:32] [INFO ] Deduced a trap composed of 17 places in 204 ms of which 1 ms to minimize.
[2023-03-21 22:06:33] [INFO ] Deduced a trap composed of 24 places in 255 ms of which 2 ms to minimize.
[2023-03-21 22:06:33] [INFO ] Deduced a trap composed of 29 places in 214 ms of which 15 ms to minimize.
[2023-03-21 22:06:33] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 1 ms to minimize.
[2023-03-21 22:06:33] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 0 ms to minimize.
[2023-03-21 22:06:33] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 0 ms to minimize.
[2023-03-21 22:06:34] [INFO ] Deduced a trap composed of 30 places in 265 ms of which 1 ms to minimize.
[2023-03-21 22:06:34] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 0 ms to minimize.
[2023-03-21 22:06:34] [INFO ] Deduced a trap composed of 32 places in 147 ms of which 0 ms to minimize.
[2023-03-21 22:06:34] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 1 ms to minimize.
[2023-03-21 22:06:35] [INFO ] Deduced a trap composed of 33 places in 244 ms of which 1 ms to minimize.
[2023-03-21 22:06:35] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 0 ms to minimize.
[2023-03-21 22:06:35] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 0 ms to minimize.
[2023-03-21 22:06:35] [INFO ] Deduced a trap composed of 37 places in 153 ms of which 0 ms to minimize.
[2023-03-21 22:06:35] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 3399 ms
[2023-03-21 22:06:35] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 1 ms to minimize.
[2023-03-21 22:06:36] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 0 ms to minimize.
[2023-03-21 22:06:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2023-03-21 22:06:36] [INFO ] Deduced a trap composed of 33 places in 118 ms of which 0 ms to minimize.
[2023-03-21 22:06:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 216 ms
[2023-03-21 22:06:36] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 0 ms to minimize.
[2023-03-21 22:06:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 167 ms
[2023-03-21 22:06:37] [INFO ] Deduced a trap composed of 35 places in 122 ms of which 0 ms to minimize.
[2023-03-21 22:06:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2023-03-21 22:06:37] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2023-03-21 22:06:38] [INFO ] Deduced a trap composed of 21 places in 122 ms of which 0 ms to minimize.
[2023-03-21 22:06:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2023-03-21 22:06:38] [INFO ] Deduced a trap composed of 30 places in 138 ms of which 1 ms to minimize.
[2023-03-21 22:06:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-21 22:06:39] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 1 ms to minimize.
[2023-03-21 22:06:39] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2023-03-21 22:06:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2023-03-21 22:06:39] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2023-03-21 22:06:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 246 ms
[2023-03-21 22:06:40] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 0 ms to minimize.
[2023-03-21 22:06:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 238 ms
[2023-03-21 22:06:40] [INFO ] After 11331ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :33
Attempting to minimize the solution found.
Minimization took 2009 ms.
[2023-03-21 22:06:42] [INFO ] After 15563ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :33
Fused 33 Parikh solutions to 32 different solutions.
Parikh walk visited 0 properties in 1427 ms.
Support contains 54 out of 1217 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Drop transitions removed 217 transitions
Trivial Post-agglo rules discarded 217 transitions
Performed 217 trivial Post agglomeration. Transition count delta: 217
Iterating post reduction 0 with 217 rules applied. Total rules applied 217 place count 1217 transition count 900
Reduce places removed 217 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 219 rules applied. Total rules applied 436 place count 1000 transition count 898
Reduce places removed 1 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 11 rules applied. Total rules applied 447 place count 999 transition count 888
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 457 place count 989 transition count 888
Performed 139 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 139 Pre rules applied. Total rules applied 457 place count 989 transition count 749
Deduced a syphon composed of 139 places in 2 ms
Reduce places removed 139 places and 0 transitions.
Iterating global reduction 4 with 278 rules applied. Total rules applied 735 place count 850 transition count 749
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 753 place count 832 transition count 731
Iterating global reduction 4 with 18 rules applied. Total rules applied 771 place count 832 transition count 731
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 771 place count 832 transition count 718
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 797 place count 819 transition count 718
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Deduced a syphon composed of 316 places in 1 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 4 with 632 rules applied. Total rules applied 1429 place count 503 transition count 402
Renaming transitions due to excessive name length > 1024 char.
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: -29
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 1529 place count 453 transition count 431
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1530 place count 453 transition count 430
Free-agglomeration rule applied 4 times.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1534 place count 453 transition count 426
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 1538 place count 449 transition count 426
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 6 with 18 rules applied. Total rules applied 1556 place count 449 transition count 426
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1557 place count 448 transition count 425
Applied a total of 1557 rules in 183 ms. Remains 448 /1217 variables (removed 769) and now considering 425/1117 (removed 692) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 448/1217 places, 425/1117 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 375 ms. (steps per millisecond=26 ) properties (out of 33) seen :8
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Running SMT prover for 25 properties.
// Phase 1: matrix 425 rows 448 cols
[2023-03-21 22:06:44] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-21 22:06:45] [INFO ] [Real]Absence check using 181 positive place invariants in 23 ms returned sat
[2023-03-21 22:06:45] [INFO ] After 526ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:24
[2023-03-21 22:06:45] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-21 22:06:45] [INFO ] After 17ms SMT Verify possible using 33 Read/Feed constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-21 22:06:45] [INFO ] After 844ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:25
[2023-03-21 22:06:46] [INFO ] [Nat]Absence check using 181 positive place invariants in 100 ms returned sat
[2023-03-21 22:06:47] [INFO ] After 871ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :25
[2023-03-21 22:06:47] [INFO ] After 566ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :25
[2023-03-21 22:06:47] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 13 ms to minimize.
[2023-03-21 22:06:48] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-21 22:06:48] [INFO ] Deduced a trap composed of 8 places in 123 ms of which 0 ms to minimize.
[2023-03-21 22:06:48] [INFO ] Deduced a trap composed of 6 places in 120 ms of which 1 ms to minimize.
[2023-03-21 22:06:48] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 0 ms to minimize.
[2023-03-21 22:06:48] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 14 ms to minimize.
[2023-03-21 22:06:48] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 712 ms
[2023-03-21 22:06:49] [INFO ] Deduced a trap composed of 8 places in 87 ms of which 3 ms to minimize.
[2023-03-21 22:06:49] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2023-03-21 22:06:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 226 ms
[2023-03-21 22:06:49] [INFO ] After 2487ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :25
Attempting to minimize the solution found.
Minimization took 580 ms.
[2023-03-21 22:06:50] [INFO ] After 4628ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :25
Parikh walk visited 0 properties in 194 ms.
Support contains 43 out of 448 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 448/448 places, 425/425 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 448 transition count 420
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 443 transition count 420
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 10 place count 443 transition count 418
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 14 place count 441 transition count 418
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 18 place count 439 transition count 416
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 437 transition count 418
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 437 transition count 416
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 435 transition count 416
Applied a total of 26 rules in 82 ms. Remains 435 /448 variables (removed 13) and now considering 416/425 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 435/448 places, 416/425 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 358 ms. (steps per millisecond=27 ) properties (out of 25) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
// Phase 1: matrix 416 rows 435 cols
[2023-03-21 22:06:51] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-21 22:06:51] [INFO ] [Real]Absence check using 181 positive place invariants in 63 ms returned sat
[2023-03-21 22:06:51] [INFO ] After 270ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-21 22:06:51] [INFO ] [Nat]Absence check using 181 positive place invariants in 43 ms returned sat
[2023-03-21 22:06:52] [INFO ] After 739ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-21 22:06:52] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-21 22:06:53] [INFO ] After 547ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :19
[2023-03-21 22:06:53] [INFO ] Deduced a trap composed of 6 places in 316 ms of which 1 ms to minimize.
[2023-03-21 22:06:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 361 ms
[2023-03-21 22:06:54] [INFO ] After 1789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 573 ms.
[2023-03-21 22:06:55] [INFO ] After 3632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 106 ms.
Support contains 34 out of 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 416/416 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 435 transition count 414
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 433 transition count 414
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 16 place count 427 transition count 408
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 426 transition count 407
Applied a total of 17 rules in 28 ms. Remains 426 /435 variables (removed 9) and now considering 407/416 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 426/435 places, 407/416 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 201 ms. (steps per millisecond=49 ) properties (out of 19) seen :8
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 407 rows 426 cols
[2023-03-21 22:06:56] [INFO ] Computed 181 place invariants in 2 ms
[2023-03-21 22:06:56] [INFO ] [Real]Absence check using 181 positive place invariants in 29 ms returned sat
[2023-03-21 22:06:56] [INFO ] After 413ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:7
[2023-03-21 22:06:56] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-21 22:06:56] [INFO ] After 95ms SMT Verify possible using 33 Read/Feed constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 22:06:56] [INFO ] After 776ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-21 22:06:57] [INFO ] [Nat]Absence check using 181 positive place invariants in 19 ms returned sat
[2023-03-21 22:06:57] [INFO ] After 337ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-21 22:06:57] [INFO ] After 225ms SMT Verify possible using 33 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-21 22:06:58] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 1 ms to minimize.
[2023-03-21 22:06:58] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
[2023-03-21 22:06:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 358 ms
[2023-03-21 22:06:58] [INFO ] After 990ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 334 ms.
[2023-03-21 22:06:58] [INFO ] After 1990ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 134 ms.
Support contains 23 out of 426 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 426/426 places, 407/407 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 426 transition count 404
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 423 transition count 404
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 6 place count 423 transition count 401
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 12 place count 420 transition count 401
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 414 transition count 395
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 412 transition count 396
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 31 place count 409 transition count 393
Applied a total of 31 rules in 41 ms. Remains 409 /426 variables (removed 17) and now considering 393/407 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 409/426 places, 393/407 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 318 ms. (steps per millisecond=31 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 393 rows 409 cols
[2023-03-21 22:06:59] [INFO ] Computed 181 place invariants in 1 ms
[2023-03-21 22:07:00] [INFO ] [Real]Absence check using 181 positive place invariants in 37 ms returned sat
[2023-03-21 22:07:00] [INFO ] After 628ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:07:00] [INFO ] [Nat]Absence check using 181 positive place invariants in 24 ms returned sat
[2023-03-21 22:07:01] [INFO ] After 319ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:07:01] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-21 22:07:01] [INFO ] After 209ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:07:01] [INFO ] After 657ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 257 ms.
[2023-03-21 22:07:02] [INFO ] After 1598ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 77 ms.
Support contains 19 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 393/393 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 409 transition count 391
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 407 transition count 391
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 404 transition count 388
Applied a total of 10 rules in 20 ms. Remains 404 /409 variables (removed 5) and now considering 388/393 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 404/409 places, 388/393 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 133747 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133747 steps, saw 89250 distinct states, run finished after 3004 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 388 rows 404 cols
[2023-03-21 22:07:05] [INFO ] Computed 181 place invariants in 14 ms
[2023-03-21 22:07:05] [INFO ] [Real]Absence check using 181 positive place invariants in 21 ms returned sat
[2023-03-21 22:07:06] [INFO ] After 431ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:7
[2023-03-21 22:07:06] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-21 22:07:06] [INFO ] After 103ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:07:06] [INFO ] After 787ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:07:06] [INFO ] [Nat]Absence check using 181 positive place invariants in 29 ms returned sat
[2023-03-21 22:07:07] [INFO ] After 327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:07:07] [INFO ] After 247ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:07:07] [INFO ] Deduced a trap composed of 5 places in 127 ms of which 1 ms to minimize.
[2023-03-21 22:07:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2023-03-21 22:07:08] [INFO ] After 754ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 274 ms.
[2023-03-21 22:07:08] [INFO ] After 1804ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 91 ms.
Support contains 19 out of 404 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 388/388 transitions.
Applied a total of 0 rules in 8 ms. Remains 404 /404 variables (removed 0) and now considering 388/388 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 404/404 places, 388/388 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 404/404 places, 388/388 transitions.
Applied a total of 0 rules in 7 ms. Remains 404 /404 variables (removed 0) and now considering 388/388 (removed 0) transitions.
[2023-03-21 22:07:08] [INFO ] Invariant cache hit.
[2023-03-21 22:07:08] [INFO ] Implicit Places using invariants in 273 ms returned [397]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 275 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 403/404 places, 388/388 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 403 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 402 transition count 387
Applied a total of 2 rules in 9 ms. Remains 402 /403 variables (removed 1) and now considering 387/388 (removed 1) transitions.
// Phase 1: matrix 387 rows 402 cols
[2023-03-21 22:07:08] [INFO ] Computed 180 place invariants in 1 ms
[2023-03-21 22:07:09] [INFO ] Implicit Places using invariants in 217 ms returned [390]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 218 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 401/404 places, 387/388 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 400 transition count 386
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 400 transition count 386
Applied a total of 2 rules in 10 ms. Remains 400 /401 variables (removed 1) and now considering 386/387 (removed 1) transitions.
// Phase 1: matrix 386 rows 400 cols
[2023-03-21 22:07:09] [INFO ] Computed 179 place invariants in 2 ms
[2023-03-21 22:07:09] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-21 22:07:09] [INFO ] Invariant cache hit.
[2023-03-21 22:07:09] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-21 22:07:10] [INFO ] Implicit Places using invariants and state equation in 727 ms returned []
Implicit Place search using SMT with State Equation took 1020 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 400/404 places, 386/388 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1540 ms. Remains : 400/404 places, 386/388 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 188 ms. (steps per millisecond=53 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Interrupted probabilistic random walk after 172805 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172805 steps, saw 115068 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 9 properties.
[2023-03-21 22:07:13] [INFO ] Invariant cache hit.
[2023-03-21 22:07:13] [INFO ] [Real]Absence check using 179 positive place invariants in 24 ms returned sat
[2023-03-21 22:07:14] [INFO ] After 418ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:07:14] [INFO ] [Nat]Absence check using 179 positive place invariants in 33 ms returned sat
[2023-03-21 22:07:14] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:07:14] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-21 22:07:14] [INFO ] After 148ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:07:15] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 0 ms to minimize.
[2023-03-21 22:07:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
[2023-03-21 22:07:15] [INFO ] After 503ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 241 ms.
[2023-03-21 22:07:15] [INFO ] After 1445ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 51 ms.
Support contains 19 out of 400 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 386/386 transitions.
Applied a total of 0 rules in 8 ms. Remains 400 /400 variables (removed 0) and now considering 386/386 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 400/400 places, 386/386 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 400/400 places, 386/386 transitions.
Applied a total of 0 rules in 21 ms. Remains 400 /400 variables (removed 0) and now considering 386/386 (removed 0) transitions.
[2023-03-21 22:07:15] [INFO ] Invariant cache hit.
[2023-03-21 22:07:15] [INFO ] Implicit Places using invariants in 343 ms returned []
[2023-03-21 22:07:15] [INFO ] Invariant cache hit.
[2023-03-21 22:07:16] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-21 22:07:16] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 1026 ms to find 0 implicit places.
[2023-03-21 22:07:16] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-21 22:07:16] [INFO ] Invariant cache hit.
[2023-03-21 22:07:16] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1275 ms. Remains : 400/400 places, 386/386 transitions.
Graph (complete) has 1028 edges and 400 vertex of which 399 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 43 place count 399 transition count 386
Applied a total of 43 rules in 32 ms. Remains 399 /400 variables (removed 1) and now considering 386/386 (removed 0) transitions.
Running SMT prover for 9 properties.
// Phase 1: matrix 386 rows 399 cols
[2023-03-21 22:07:16] [INFO ] Computed 178 place invariants in 2 ms
[2023-03-21 22:07:17] [INFO ] [Real]Absence check using 178 positive place invariants in 27 ms returned sat
[2023-03-21 22:07:17] [INFO ] After 508ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:07:17] [INFO ] [Nat]Absence check using 178 positive place invariants in 23 ms returned sat
[2023-03-21 22:07:17] [INFO ] After 315ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:07:17] [INFO ] State equation strengthened by 34 read => feed constraints.
[2023-03-21 22:07:18] [INFO ] After 182ms SMT Verify possible using 34 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:07:18] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 0 ms to minimize.
[2023-03-21 22:07:18] [INFO ] Deduced a trap composed of 5 places in 88 ms of which 0 ms to minimize.
[2023-03-21 22:07:18] [INFO ] Deduced a trap composed of 6 places in 68 ms of which 0 ms to minimize.
[2023-03-21 22:07:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 349 ms
[2023-03-21 22:07:18] [INFO ] After 994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 331 ms.
[2023-03-21 22:07:19] [INFO ] After 1901ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:07:19] [INFO ] Flatten gal took : 67 ms
[2023-03-21 22:07:19] [INFO ] Flatten gal took : 58 ms
[2023-03-21 22:07:19] [INFO ] Input system was already deterministic with 1117 transitions.
Computed a total of 330 stabilizing places and 330 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 248 transitions
Trivial Post-agglo rules discarded 248 transitions
Performed 248 trivial Post agglomeration. Transition count delta: 248
Iterating post reduction 0 with 248 rules applied. Total rules applied 248 place count 1216 transition count 868
Reduce places removed 248 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 250 rules applied. Total rules applied 498 place count 968 transition count 866
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 500 place count 967 transition count 865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 501 place count 966 transition count 865
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 144 Pre rules applied. Total rules applied 501 place count 966 transition count 721
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 4 with 288 rules applied. Total rules applied 789 place count 822 transition count 721
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 817 place count 794 transition count 693
Iterating global reduction 4 with 28 rules applied. Total rules applied 845 place count 794 transition count 693
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 845 place count 794 transition count 674
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 883 place count 775 transition count 674
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 0 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 4 with 624 rules applied. Total rules applied 1507 place count 463 transition count 362
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1509 place count 461 transition count 360
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1511 place count 459 transition count 360
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1511 place count 459 transition count 359
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1513 place count 458 transition count 359
Applied a total of 1513 rules in 189 ms. Remains 458 /1217 variables (removed 759) and now considering 359/1117 (removed 758) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 189 ms. Remains : 458/1217 places, 359/1117 transitions.
[2023-03-21 22:07:19] [INFO ] Flatten gal took : 14 ms
[2023-03-21 22:07:19] [INFO ] Flatten gal took : 14 ms
[2023-03-21 22:07:19] [INFO ] Input system was already deterministic with 359 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1183 transition count 1083
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1182 transition count 1082
Applied a total of 70 rules in 113 ms. Remains 1182 /1217 variables (removed 35) and now considering 1082/1117 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 115 ms. Remains : 1182/1217 places, 1082/1117 transitions.
[2023-03-21 22:07:19] [INFO ] Flatten gal took : 54 ms
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 29 ms
[2023-03-21 22:07:20] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1183 transition count 1083
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1182 transition count 1082
Applied a total of 70 rules in 103 ms. Remains 1182 /1217 variables (removed 35) and now considering 1082/1117 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 116 ms. Remains : 1182/1217 places, 1082/1117 transitions.
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 25 ms
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 25 ms
[2023-03-21 22:07:20] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1186 transition count 1086
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1186 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1185 transition count 1085
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1185 transition count 1085
Applied a total of 64 rules in 82 ms. Remains 1185 /1217 variables (removed 32) and now considering 1085/1117 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 82 ms. Remains : 1185/1217 places, 1085/1117 transitions.
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 37 ms
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 38 ms
[2023-03-21 22:07:20] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1185 transition count 1085
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1185 transition count 1085
Applied a total of 64 rules in 68 ms. Remains 1185 /1217 variables (removed 32) and now considering 1085/1117 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68 ms. Remains : 1185/1217 places, 1085/1117 transitions.
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 23 ms
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 23 ms
[2023-03-21 22:07:20] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 236 transitions
Trivial Post-agglo rules discarded 236 transitions
Performed 236 trivial Post agglomeration. Transition count delta: 236
Iterating post reduction 0 with 236 rules applied. Total rules applied 236 place count 1216 transition count 880
Reduce places removed 236 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 238 rules applied. Total rules applied 474 place count 980 transition count 878
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 480 place count 979 transition count 873
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 485 place count 974 transition count 873
Performed 145 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 145 Pre rules applied. Total rules applied 485 place count 974 transition count 728
Deduced a syphon composed of 145 places in 1 ms
Reduce places removed 145 places and 0 transitions.
Iterating global reduction 4 with 290 rules applied. Total rules applied 775 place count 829 transition count 728
Discarding 24 places :
Symmetric choice reduction at 4 with 24 rule applications. Total rules 799 place count 805 transition count 704
Iterating global reduction 4 with 24 rules applied. Total rules applied 823 place count 805 transition count 704
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 16 Pre rules applied. Total rules applied 823 place count 805 transition count 688
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 855 place count 789 transition count 688
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 0 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 4 with 626 rules applied. Total rules applied 1481 place count 476 transition count 375
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1483 place count 474 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1485 place count 472 transition count 373
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1485 place count 472 transition count 372
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1487 place count 471 transition count 372
Applied a total of 1487 rules in 106 ms. Remains 471 /1217 variables (removed 746) and now considering 372/1117 (removed 745) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 106 ms. Remains : 471/1217 places, 372/1117 transitions.
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 10 ms
[2023-03-21 22:07:20] [INFO ] Flatten gal took : 10 ms
[2023-03-21 22:07:20] [INFO ] Input system was already deterministic with 372 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1190 transition count 1090
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1190 transition count 1090
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 1189 transition count 1089
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 1189 transition count 1089
Applied a total of 56 rules in 80 ms. Remains 1189 /1217 variables (removed 28) and now considering 1089/1117 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 80 ms. Remains : 1189/1217 places, 1089/1117 transitions.
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 23 ms
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 24 ms
[2023-03-21 22:07:21] [INFO ] Input system was already deterministic with 1089 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1182 transition count 1082
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1181 transition count 1081
Applied a total of 72 rules in 81 ms. Remains 1181 /1217 variables (removed 36) and now considering 1081/1117 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 81 ms. Remains : 1181/1217 places, 1081/1117 transitions.
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 22 ms
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 23 ms
[2023-03-21 22:07:21] [INFO ] Input system was already deterministic with 1081 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 1186 transition count 1086
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 1186 transition count 1086
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 1185 transition count 1085
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 1185 transition count 1085
Applied a total of 64 rules in 94 ms. Remains 1185 /1217 variables (removed 32) and now considering 1085/1117 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 95 ms. Remains : 1185/1217 places, 1085/1117 transitions.
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 23 ms
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 23 ms
[2023-03-21 22:07:21] [INFO ] Input system was already deterministic with 1085 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1182 transition count 1082
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1181 transition count 1081
Applied a total of 72 rules in 155 ms. Remains 1181 /1217 variables (removed 36) and now considering 1081/1117 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 1181/1217 places, 1081/1117 transitions.
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 25 ms
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 26 ms
[2023-03-21 22:07:21] [INFO ] Input system was already deterministic with 1081 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1184 transition count 1084
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1184 transition count 1084
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1183 transition count 1083
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1183 transition count 1083
Applied a total of 68 rules in 98 ms. Remains 1183 /1217 variables (removed 34) and now considering 1083/1117 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 1183/1217 places, 1083/1117 transitions.
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 28 ms
[2023-03-21 22:07:21] [INFO ] Flatten gal took : 21 ms
[2023-03-21 22:07:22] [INFO ] Input system was already deterministic with 1083 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 239 transitions
Trivial Post-agglo rules discarded 239 transitions
Performed 239 trivial Post agglomeration. Transition count delta: 239
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 1216 transition count 877
Reduce places removed 239 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 241 rules applied. Total rules applied 480 place count 977 transition count 875
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 483 place count 976 transition count 873
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 485 place count 974 transition count 873
Performed 144 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 144 Pre rules applied. Total rules applied 485 place count 974 transition count 729
Deduced a syphon composed of 144 places in 1 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 4 with 288 rules applied. Total rules applied 773 place count 830 transition count 729
Discarding 26 places :
Symmetric choice reduction at 4 with 26 rule applications. Total rules 799 place count 804 transition count 703
Iterating global reduction 4 with 26 rules applied. Total rules applied 825 place count 804 transition count 703
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 19 Pre rules applied. Total rules applied 825 place count 804 transition count 684
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 4 with 38 rules applied. Total rules applied 863 place count 785 transition count 684
Performed 314 Post agglomeration using F-continuation condition.Transition count delta: 314
Deduced a syphon composed of 314 places in 0 ms
Reduce places removed 314 places and 0 transitions.
Iterating global reduction 4 with 628 rules applied. Total rules applied 1491 place count 471 transition count 370
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1493 place count 469 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1495 place count 467 transition count 368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1495 place count 467 transition count 367
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1497 place count 466 transition count 367
Applied a total of 1497 rules in 114 ms. Remains 466 /1217 variables (removed 751) and now considering 367/1117 (removed 750) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 114 ms. Remains : 466/1217 places, 367/1117 transitions.
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 9 ms
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 10 ms
[2023-03-21 22:07:22] [INFO ] Input system was already deterministic with 367 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 244 place count 1216 transition count 872
Reduce places removed 244 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 246 rules applied. Total rules applied 490 place count 972 transition count 870
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 493 place count 971 transition count 868
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 495 place count 969 transition count 868
Performed 143 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 143 Pre rules applied. Total rules applied 495 place count 969 transition count 725
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 4 with 286 rules applied. Total rules applied 781 place count 826 transition count 725
Discarding 25 places :
Symmetric choice reduction at 4 with 25 rule applications. Total rules 806 place count 801 transition count 700
Iterating global reduction 4 with 25 rules applied. Total rules applied 831 place count 801 transition count 700
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 18 Pre rules applied. Total rules applied 831 place count 801 transition count 682
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 867 place count 783 transition count 682
Performed 312 Post agglomeration using F-continuation condition.Transition count delta: 312
Deduced a syphon composed of 312 places in 1 ms
Reduce places removed 312 places and 0 transitions.
Iterating global reduction 4 with 624 rules applied. Total rules applied 1491 place count 471 transition count 370
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1493 place count 469 transition count 368
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1495 place count 467 transition count 368
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1495 place count 467 transition count 367
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1497 place count 466 transition count 367
Applied a total of 1497 rules in 94 ms. Remains 466 /1217 variables (removed 751) and now considering 367/1117 (removed 750) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 95 ms. Remains : 466/1217 places, 367/1117 transitions.
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 10 ms
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 10 ms
[2023-03-21 22:07:22] [INFO ] Input system was already deterministic with 367 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1183 transition count 1083
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1183 transition count 1083
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1182 transition count 1082
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1182 transition count 1082
Applied a total of 70 rules in 103 ms. Remains 1182 /1217 variables (removed 35) and now considering 1082/1117 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 1182/1217 places, 1082/1117 transitions.
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 21 ms
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 21 ms
[2023-03-21 22:07:22] [INFO ] Input system was already deterministic with 1082 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1185 transition count 1085
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1185 transition count 1085
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1184 transition count 1084
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1184 transition count 1084
Applied a total of 66 rules in 83 ms. Remains 1184 /1217 variables (removed 33) and now considering 1084/1117 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 83 ms. Remains : 1184/1217 places, 1084/1117 transitions.
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 21 ms
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 21 ms
[2023-03-21 22:07:22] [INFO ] Input system was already deterministic with 1084 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1217/1217 places, 1117/1117 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1182 transition count 1082
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1182 transition count 1082
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 1181 transition count 1081
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 1181 transition count 1081
Applied a total of 72 rules in 97 ms. Remains 1181 /1217 variables (removed 36) and now considering 1081/1117 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 98 ms. Remains : 1181/1217 places, 1081/1117 transitions.
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 21 ms
[2023-03-21 22:07:22] [INFO ] Flatten gal took : 21 ms
[2023-03-21 22:07:23] [INFO ] Input system was already deterministic with 1081 transitions.
[2023-03-21 22:07:23] [INFO ] Flatten gal took : 23 ms
[2023-03-21 22:07:23] [INFO ] Flatten gal took : 36 ms
[2023-03-21 22:07:23] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-21 22:07:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1217 places, 1117 transitions and 2874 arcs took 5 ms.
Total runtime 64835 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/699/ctl_0_ --ctl=/tmp/699/ctl_1_ --ctl=/tmp/699/ctl_2_ --ctl=/tmp/699/ctl_3_ --ctl=/tmp/699/ctl_4_ --ctl=/tmp/699/ctl_5_ --ctl=/tmp/699/ctl_6_ --ctl=/tmp/699/ctl_7_ --ctl=/tmp/699/ctl_8_ --ctl=/tmp/699/ctl_9_ --ctl=/tmp/699/ctl_10_ --ctl=/tmp/699/ctl_11_ --ctl=/tmp/699/ctl_12_ --ctl=/tmp/699/ctl_13_ --ctl=/tmp/699/ctl_14_ --ctl=/tmp/699/ctl_15_ --mu-par --mu-opt
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-00
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-01
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-02
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-03
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-04
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-05
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-06
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-07
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-08
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-09
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-10
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-11
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-12
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-13
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-14
Could not compute solution for formula : ShieldIIPt-PT-020B-CTLFireability-15

BK_STOP 1679436482564

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name ShieldIIPt-PT-020B-CTLFireability-00
ctl formula formula --ctl=/tmp/699/ctl_0_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-01
ctl formula formula --ctl=/tmp/699/ctl_1_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-02
ctl formula formula --ctl=/tmp/699/ctl_2_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-03
ctl formula formula --ctl=/tmp/699/ctl_3_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-04
ctl formula formula --ctl=/tmp/699/ctl_4_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-05
ctl formula formula --ctl=/tmp/699/ctl_5_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-06
ctl formula formula --ctl=/tmp/699/ctl_6_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-07
ctl formula formula --ctl=/tmp/699/ctl_7_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-08
ctl formula formula --ctl=/tmp/699/ctl_8_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-09
ctl formula formula --ctl=/tmp/699/ctl_9_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-10
ctl formula formula --ctl=/tmp/699/ctl_10_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-11
ctl formula formula --ctl=/tmp/699/ctl_11_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-12
ctl formula formula --ctl=/tmp/699/ctl_12_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-13
ctl formula formula --ctl=/tmp/699/ctl_13_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-14
ctl formula formula --ctl=/tmp/699/ctl_14_
ctl formula name ShieldIIPt-PT-020B-CTLFireability-15
ctl formula formula --ctl=/tmp/699/ctl_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 1217 places, 1117 transitions and 2874 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 1117->1117 groups
pnml2lts-sym: Regrouping took 0.340 real 0.350 user 0.000 sys
pnml2lts-sym: state vector length is 1217; there are 1117 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Exploration took 8610409 group checks and 0 next state calls
pnml2lts-sym: reachability took 38.140 real 151.220 user 1.220 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.050 real 0.200 user 0.000 sys
pnml2lts-sym: state space has 3.40617104481484e+114 states, 162540 nodes
double free or corruption (out)

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="ShieldIIPt-PT-020B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is ShieldIIPt-PT-020B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r393-oct2-167903716800282"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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