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.r010-oct2-167813598700154.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 marciexred
Input is ASLink-PT-10a, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813598700154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 9.9K Feb 26 13:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 116K Feb 26 13:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 13:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 920K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678673254176

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-10a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 02:07:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 02:07:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 02:07:38] [INFO ] Load time of PNML (sax parser for PT used): 220 ms
[2023-03-13 02:07:38] [INFO ] Transformed 2186 places.
[2023-03-13 02:07:38] [INFO ] Transformed 3192 transitions.
[2023-03-13 02:07:38] [INFO ] Found NUPN structural information;
[2023-03-13 02:07:38] [INFO ] Parsed PT model containing 2186 places and 3192 transitions and 11972 arcs in 363 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Ensure Unique test removed 34 transitions
Reduce redundant transitions removed 34 transitions.
Support contains 199 out of 2186 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2186/2186 places, 3158/3158 transitions.
Ensure Unique test removed 40 places
Discarding 19 places :
Implicit places reduction removed 19 places
Iterating post reduction 0 with 59 rules applied. Total rules applied 59 place count 2127 transition count 3158
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 69 place count 2117 transition count 3115
Ensure Unique test removed 1 places
Iterating global reduction 1 with 11 rules applied. Total rules applied 80 place count 2116 transition count 3115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 82 place count 2116 transition count 3113
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 2115 transition count 3105
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 2115 transition count 3105
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 2114 transition count 3097
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 2114 transition count 3097
Applied a total of 86 rules in 737 ms. Remains 2114 /2186 variables (removed 72) and now considering 3097/3158 (removed 61) transitions.
// Phase 1: matrix 3097 rows 2114 cols
[2023-03-13 02:07:39] [INFO ] Computed 362 place invariants in 232 ms
[2023-03-13 02:07:42] [INFO ] Implicit Places using invariants in 3766 ms returned [1, 19, 20, 23, 33, 51, 69, 198, 214, 219, 220, 221, 239, 257, 386, 402, 407, 408, 428, 446, 575, 591, 596, 617, 764, 780, 785, 786, 953, 969, 974, 975, 976, 994, 1012, 1141, 1157, 1162, 1163, 1164, 1182, 1200, 1329, 1345, 1350, 1351, 1352, 1370, 1534, 1560, 1578, 1707, 1723, 1728, 1729, 1767, 1896, 1901, 1913, 1918, 1919, 1920, 1952, 1954, 1957, 1975, 1976, 1995, 2003, 2011, 2017, 2023, 2029, 2035, 2043, 2049, 2055, 2063]
Discarding 78 places :
Implicit Place search using SMT only with invariants took 3861 ms to find 78 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2036/2186 places, 3097/3158 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2023 transition count 3084
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2023 transition count 3084
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 2013 transition count 3074
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 2013 transition count 3074
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 2008 transition count 3069
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 2008 transition count 3069
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 2006 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 2006 transition count 3067
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 2004 transition count 3065
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 2004 transition count 3065
Applied a total of 64 rules in 490 ms. Remains 2004 /2036 variables (removed 32) and now considering 3065/3097 (removed 32) transitions.
// Phase 1: matrix 3065 rows 2004 cols
[2023-03-13 02:07:43] [INFO ] Computed 284 place invariants in 122 ms
[2023-03-13 02:07:45] [INFO ] Implicit Places using invariants in 2610 ms returned []
[2023-03-13 02:07:45] [INFO ] Invariant cache hit.
[2023-03-13 02:07:51] [INFO ] Implicit Places using invariants and state equation in 5813 ms returned []
Implicit Place search using SMT with State Equation took 8461 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2004/2186 places, 3065/3158 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13552 ms. Remains : 2004/2186 places, 3065/3158 transitions.
Support contains 199 out of 2004 places after structural reductions.
[2023-03-13 02:07:52] [INFO ] Flatten gal took : 244 ms
[2023-03-13 02:07:52] [INFO ] Flatten gal took : 161 ms
[2023-03-13 02:07:52] [INFO ] Input system was already deterministic with 3065 transitions.
Incomplete random walk after 10000 steps, including 38 resets, run finished after 561 ms. (steps per millisecond=17 ) properties (out of 94) seen :26
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) 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 68) seen :0
Running SMT prover for 68 properties.
[2023-03-13 02:07:53] [INFO ] Invariant cache hit.
[2023-03-13 02:07:57] [INFO ] [Real]Absence check using 54 positive place invariants in 78 ms returned sat
[2023-03-13 02:07:57] [INFO ] [Real]Absence check using 54 positive and 230 generalized place invariants in 171 ms returned sat
[2023-03-13 02:07:57] [INFO ] After 4144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:68
[2023-03-13 02:08:00] [INFO ] [Nat]Absence check using 54 positive place invariants in 37 ms returned sat
[2023-03-13 02:08:01] [INFO ] [Nat]Absence check using 54 positive and 230 generalized place invariants in 186 ms returned sat
[2023-03-13 02:08:22] [INFO ] After 18554ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :58
[2023-03-13 02:08:22] [INFO ] After 18578ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :58
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-13 02:08:22] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :58
Fused 68 Parikh solutions to 6 different solutions.
Parikh walk visited 1 properties in 759 ms.
Support contains 132 out of 2004 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 311 transitions
Trivial Post-agglo rules discarded 311 transitions
Performed 311 trivial Post agglomeration. Transition count delta: 311
Iterating post reduction 0 with 312 rules applied. Total rules applied 312 place count 2003 transition count 2754
Reduce places removed 311 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 319 rules applied. Total rules applied 631 place count 1692 transition count 2746
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 639 place count 1684 transition count 2746
Performed 258 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 258 Pre rules applied. Total rules applied 639 place count 1684 transition count 2488
Deduced a syphon composed of 258 places in 4 ms
Ensure Unique test removed 82 places
Reduce places removed 340 places and 0 transitions.
Iterating global reduction 3 with 598 rules applied. Total rules applied 1237 place count 1344 transition count 2488
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 3 with 12 rules applied. Total rules applied 1249 place count 1336 transition count 2484
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 1253 place count 1332 transition count 2484
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 31 Pre rules applied. Total rules applied 1253 place count 1332 transition count 2453
Deduced a syphon composed of 31 places in 8 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 5 with 62 rules applied. Total rules applied 1315 place count 1301 transition count 2453
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 1321 place count 1295 transition count 2442
Iterating global reduction 5 with 6 rules applied. Total rules applied 1327 place count 1295 transition count 2442
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 1329 place count 1294 transition count 2441
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1330 place count 1293 transition count 2441
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1330 place count 1293 transition count 2440
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1332 place count 1292 transition count 2440
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 1335 place count 1289 transition count 2437
Iterating global reduction 7 with 3 rules applied. Total rules applied 1338 place count 1289 transition count 2437
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 1340 place count 1289 transition count 2435
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 8 with 168 rules applied. Total rules applied 1508 place count 1205 transition count 2351
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1510 place count 1203 transition count 2349
Iterating global reduction 8 with 2 rules applied. Total rules applied 1512 place count 1203 transition count 2349
Free-agglomeration rule applied 6 times.
Iterating global reduction 8 with 6 rules applied. Total rules applied 1518 place count 1203 transition count 2343
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1524 place count 1197 transition count 2343
Free-agglomeration rule (complex) applied 38 times.
Iterating global reduction 9 with 38 rules applied. Total rules applied 1562 place count 1197 transition count 2305
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 9 with 38 rules applied. Total rules applied 1600 place count 1159 transition count 2305
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 1602 place count 1159 transition count 2303
Partial Free-agglomeration rule applied 29 times.
Drop transitions removed 29 transitions
Iterating global reduction 10 with 29 rules applied. Total rules applied 1631 place count 1159 transition count 2303
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 1632 place count 1159 transition count 2303
Applied a total of 1632 rules in 794 ms. Remains 1159 /2004 variables (removed 845) and now considering 2303/3065 (removed 762) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 795 ms. Remains : 1159/2004 places, 2303/3065 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 472 ms. (steps per millisecond=21 ) properties (out of 58) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) 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 57) seen :0
Interrupted probabilistic random walk after 116213 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :{}
Probabilistic random walk after 116213 steps, saw 35331 distinct states, run finished after 3003 ms. (steps per millisecond=38 ) properties seen :0
Running SMT prover for 57 properties.
// Phase 1: matrix 2303 rows 1159 cols
[2023-03-13 02:08:28] [INFO ] Computed 192 place invariants in 48 ms
[2023-03-13 02:08:30] [INFO ] After 2080ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:57
[2023-03-13 02:08:32] [INFO ] [Nat]Absence check using 45 positive place invariants in 15 ms returned sat
[2023-03-13 02:08:33] [INFO ] [Nat]Absence check using 45 positive and 147 generalized place invariants in 907 ms returned sat
[2023-03-13 02:08:55] [INFO ] After 20476ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :51
[2023-03-13 02:08:55] [INFO ] State equation strengthened by 43 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 02:08:55] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 02:08:55] [INFO ] After 25063ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:57
Fused 57 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1099 ms.
Support contains 119 out of 1159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1159/1159 places, 2303/2303 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 1159 transition count 2302
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1158 transition count 2302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 1157 transition count 2296
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 1157 transition count 2296
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 1156 transition count 2296
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 1155 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 1154 transition count 2294
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 1154 transition count 2294
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 1154 transition count 2293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 1153 transition count 2293
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 1153 transition count 2293
Applied a total of 13 rules in 269 ms. Remains 1153 /1159 variables (removed 6) and now considering 2293/2303 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 269 ms. Remains : 1153/1159 places, 2293/2303 transitions.
Incomplete random walk after 10000 steps, including 107 resets, run finished after 471 ms. (steps per millisecond=21 ) properties (out of 52) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) 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 50) seen :0
Interrupted probabilistic random walk after 122733 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{47=1}
Probabilistic random walk after 122733 steps, saw 39654 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :1
Running SMT prover for 49 properties.
// Phase 1: matrix 2293 rows 1153 cols
[2023-03-13 02:09:00] [INFO ] Computed 191 place invariants in 21 ms
[2023-03-13 02:09:02] [INFO ] After 1674ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:49
[2023-03-13 02:09:03] [INFO ] [Nat]Absence check using 46 positive place invariants in 19 ms returned sat
[2023-03-13 02:09:03] [INFO ] [Nat]Absence check using 46 positive and 145 generalized place invariants in 65 ms returned sat
[2023-03-13 02:09:27] [INFO ] After 22048ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :44
[2023-03-13 02:09:27] [INFO ] State equation strengthened by 43 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 02:09:27] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 02:09:27] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:49
Fused 49 Parikh solutions to 10 different solutions.
Parikh walk visited 0 properties in 371 ms.
Support contains 108 out of 1153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1153/1153 places, 2293/2293 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 1152 transition count 2287
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 1152 transition count 2287
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 1151 transition count 2287
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 1148 transition count 2284
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 1147 transition count 2283
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 1147 transition count 2283
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 1147 transition count 2283
Applied a total of 13 rules in 175 ms. Remains 1147 /1153 variables (removed 6) and now considering 2283/2293 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 1147/1153 places, 2283/2293 transitions.
Incomplete random walk after 10000 steps, including 117 resets, run finished after 513 ms. (steps per millisecond=19 ) properties (out of 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) 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 47) seen :0
Interrupted probabilistic random walk after 110648 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110648 steps, saw 31117 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 47 properties.
// Phase 1: matrix 2283 rows 1147 cols
[2023-03-13 02:09:31] [INFO ] Computed 190 place invariants in 47 ms
[2023-03-13 02:09:32] [INFO ] After 1294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:47
[2023-03-13 02:09:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 27 ms returned sat
[2023-03-13 02:09:34] [INFO ] [Nat]Absence check using 50 positive and 140 generalized place invariants in 107 ms returned sat
[2023-03-13 02:09:57] [INFO ] After 22058ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :45
[2023-03-13 02:09:57] [INFO ] State equation strengthened by 43 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:626)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-13 02:09:57] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-13 02:09:57] [INFO ] After 25065ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:47
Fused 47 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 645 ms.
Support contains 104 out of 1147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1147/1147 places, 2283/2283 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1147 transition count 2282
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 1146 transition count 2282
Applied a total of 2 rules in 79 ms. Remains 1146 /1147 variables (removed 1) and now considering 2282/2283 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 1146/1147 places, 2282/2283 transitions.
Successfully simplified 16 atomic propositions for a total of 16 simplifications.
FORMULA ASLink-PT-10a-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 02:09:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 02:09:58] [INFO ] Flatten gal took : 114 ms
[2023-03-13 02:09:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA ASLink-PT-10a-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-10a-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 02:09:58] [INFO ] Flatten gal took : 127 ms
[2023-03-13 02:09:59] [INFO ] Input system was already deterministic with 3065 transitions.
Support contains 142 out of 2004 places (down from 150) after GAL structural reductions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2003 transition count 3065
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 1996 transition count 3026
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 1996 transition count 3026
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1994 transition count 3017
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1994 transition count 3017
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1992 transition count 3008
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1992 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1991 transition count 3000
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1991 transition count 3000
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1990 transition count 2992
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1990 transition count 2992
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1989 transition count 2984
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1989 transition count 2984
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1988 transition count 2976
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1988 transition count 2976
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1987 transition count 2968
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1987 transition count 2968
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1986 transition count 2960
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1986 transition count 2960
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1985 transition count 2952
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1985 transition count 2952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1984 transition count 2944
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1984 transition count 2944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1983 transition count 2936
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1983 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1982 transition count 2928
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1982 transition count 2928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1981 transition count 2920
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1981 transition count 2920
Applied a total of 45 rules in 1130 ms. Remains 1981 /2004 variables (removed 23) and now considering 2920/3065 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1131 ms. Remains : 1981/2004 places, 2920/3065 transitions.
[2023-03-13 02:10:00] [INFO ] Flatten gal took : 138 ms
[2023-03-13 02:10:00] [INFO ] Flatten gal took : 95 ms
[2023-03-13 02:10:00] [INFO ] Input system was already deterministic with 2920 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2003 transition count 3065
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 1996 transition count 3026
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 1996 transition count 3026
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1994 transition count 3017
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1994 transition count 3017
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1992 transition count 3008
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1992 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1991 transition count 3000
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1991 transition count 3000
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1990 transition count 2992
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1990 transition count 2992
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1989 transition count 2984
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1989 transition count 2984
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1988 transition count 2976
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1988 transition count 2976
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1987 transition count 2968
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1987 transition count 2968
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1986 transition count 2960
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1986 transition count 2960
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1985 transition count 2952
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1985 transition count 2952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1984 transition count 2944
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1984 transition count 2944
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1983 transition count 2936
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1983 transition count 2936
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1982 transition count 2928
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1982 transition count 2928
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 1981 transition count 2920
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 1981 transition count 2920
Applied a total of 45 rules in 1030 ms. Remains 1981 /2004 variables (removed 23) and now considering 2920/3065 (removed 145) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1030 ms. Remains : 1981/2004 places, 2920/3065 transitions.
[2023-03-13 02:10:02] [INFO ] Flatten gal took : 104 ms
[2023-03-13 02:10:02] [INFO ] Flatten gal took : 113 ms
[2023-03-13 02:10:02] [INFO ] Input system was already deterministic with 2920 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2003 transition count 3065
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1997 transition count 3032
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1997 transition count 3032
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1995 transition count 3023
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1995 transition count 3023
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 1993 transition count 3014
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 1993 transition count 3014
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1992 transition count 3006
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1992 transition count 3006
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1991 transition count 2998
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1991 transition count 2998
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1990 transition count 2990
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1990 transition count 2990
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1989 transition count 2982
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1989 transition count 2982
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1988 transition count 2974
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1988 transition count 2974
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1987 transition count 2966
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1987 transition count 2966
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1986 transition count 2958
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1986 transition count 2958
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1985 transition count 2950
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1985 transition count 2950
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1984 transition count 2942
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1984 transition count 2942
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1983 transition count 2934
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1983 transition count 2934
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 1982 transition count 2926
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 1982 transition count 2926
Applied a total of 43 rules in 1002 ms. Remains 1982 /2004 variables (removed 22) and now considering 2926/3065 (removed 139) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1002 ms. Remains : 1982/2004 places, 2926/3065 transitions.
[2023-03-13 02:10:03] [INFO ] Flatten gal took : 92 ms
[2023-03-13 02:10:03] [INFO ] Flatten gal took : 86 ms
[2023-03-13 02:10:03] [INFO ] Input system was already deterministic with 2926 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2003 transition count 3065
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 1996 transition count 3026
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 1996 transition count 3026
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1994 transition count 3017
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1994 transition count 3017
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 1993 transition count 3009
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 1993 transition count 3009
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1992 transition count 3001
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1992 transition count 3001
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1991 transition count 2993
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1991 transition count 2993
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1990 transition count 2985
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1990 transition count 2985
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1989 transition count 2977
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1989 transition count 2977
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1988 transition count 2969
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1988 transition count 2969
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1987 transition count 2961
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1987 transition count 2961
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1986 transition count 2953
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1986 transition count 2953
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1985 transition count 2945
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1985 transition count 2945
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1984 transition count 2937
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1984 transition count 2937
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 1983 transition count 2929
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 1983 transition count 2929
Applied a total of 41 rules in 978 ms. Remains 1983 /2004 variables (removed 21) and now considering 2929/3065 (removed 136) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 978 ms. Remains : 1983/2004 places, 2929/3065 transitions.
[2023-03-13 02:10:04] [INFO ] Flatten gal took : 76 ms
[2023-03-13 02:10:04] [INFO ] Flatten gal took : 83 ms
[2023-03-13 02:10:05] [INFO ] Input system was already deterministic with 2929 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 1998 transition count 3027
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 1998 transition count 3027
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 1997 transition count 3019
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 1997 transition count 3019
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 1996 transition count 3011
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 1996 transition count 3011
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 1995 transition count 3003
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 1995 transition count 3003
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 1994 transition count 2995
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 1994 transition count 2995
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1993 transition count 2987
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1993 transition count 2987
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1992 transition count 2979
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1992 transition count 2979
Applied a total of 24 rules in 595 ms. Remains 1992 /2004 variables (removed 12) and now considering 2979/3065 (removed 86) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 596 ms. Remains : 1992/2004 places, 2979/3065 transitions.
[2023-03-13 02:10:05] [INFO ] Flatten gal took : 89 ms
[2023-03-13 02:10:05] [INFO ] Flatten gal took : 92 ms
[2023-03-13 02:10:06] [INFO ] Input system was already deterministic with 2979 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2003 transition count 3065
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 1996 transition count 3026
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 1996 transition count 3026
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1994 transition count 3017
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1994 transition count 3017
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1992 transition count 3008
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1992 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1991 transition count 3000
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1991 transition count 3000
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1990 transition count 2992
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1990 transition count 2992
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1989 transition count 2984
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1989 transition count 2984
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1988 transition count 2976
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1988 transition count 2976
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1987 transition count 2968
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1987 transition count 2968
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 1986 transition count 2960
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 1986 transition count 2960
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 1985 transition count 2952
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 1985 transition count 2952
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 1984 transition count 2944
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 1984 transition count 2944
Applied a total of 39 rules in 971 ms. Remains 1984 /2004 variables (removed 20) and now considering 2944/3065 (removed 121) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 971 ms. Remains : 1984/2004 places, 2944/3065 transitions.
[2023-03-13 02:10:07] [INFO ] Flatten gal took : 97 ms
[2023-03-13 02:10:07] [INFO ] Flatten gal took : 119 ms
[2023-03-13 02:10:07] [INFO ] Input system was already deterministic with 2944 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2003 transition count 3065
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 1996 transition count 3026
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 1996 transition count 3026
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 17 place count 1994 transition count 3017
Iterating global reduction 1 with 2 rules applied. Total rules applied 19 place count 1994 transition count 3017
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 21 place count 1992 transition count 3008
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 1992 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1991 transition count 3000
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1991 transition count 3000
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1990 transition count 2992
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1990 transition count 2992
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1989 transition count 2984
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1989 transition count 2984
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 1988 transition count 2976
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 1988 transition count 2976
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1987 transition count 2968
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1987 transition count 2968
Applied a total of 33 rules in 696 ms. Remains 1987 /2004 variables (removed 17) and now considering 2968/3065 (removed 97) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 696 ms. Remains : 1987/2004 places, 2968/3065 transitions.
[2023-03-13 02:10:08] [INFO ] Flatten gal took : 95 ms
[2023-03-13 02:10:08] [INFO ] Flatten gal took : 107 ms
[2023-03-13 02:10:08] [INFO ] Input system was already deterministic with 2968 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 335 transitions
Trivial Post-agglo rules discarded 335 transitions
Performed 335 trivial Post agglomeration. Transition count delta: 335
Iterating post reduction 0 with 336 rules applied. Total rules applied 336 place count 2003 transition count 2730
Reduce places removed 335 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 336 rules applied. Total rules applied 672 place count 1668 transition count 2729
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 673 place count 1667 transition count 2729
Performed 260 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 260 Pre rules applied. Total rules applied 673 place count 1667 transition count 2469
Deduced a syphon composed of 260 places in 5 ms
Ensure Unique test removed 84 places
Reduce places removed 344 places and 0 transitions.
Iterating global reduction 3 with 604 rules applied. Total rules applied 1277 place count 1323 transition count 2469
Discarding 8 places :
Implicit places reduction removed 8 places
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 3 with 19 rules applied. Total rules applied 1296 place count 1315 transition count 2458
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 1307 place count 1304 transition count 2458
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 32 Pre rules applied. Total rules applied 1307 place count 1304 transition count 2426
Deduced a syphon composed of 32 places in 4 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 5 with 64 rules applied. Total rules applied 1371 place count 1272 transition count 2426
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 1382 place count 1261 transition count 2383
Iterating global reduction 5 with 11 rules applied. Total rules applied 1393 place count 1261 transition count 2383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 8 rules applied. Total rules applied 1401 place count 1256 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1402 place count 1255 transition count 2380
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 1402 place count 1255 transition count 2379
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1404 place count 1254 transition count 2379
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 1406 place count 1252 transition count 2370
Iterating global reduction 7 with 2 rules applied. Total rules applied 1408 place count 1252 transition count 2370
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1409 place count 1251 transition count 2362
Iterating global reduction 7 with 1 rules applied. Total rules applied 1410 place count 1251 transition count 2362
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1411 place count 1250 transition count 2354
Iterating global reduction 7 with 1 rules applied. Total rules applied 1412 place count 1250 transition count 2354
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1413 place count 1249 transition count 2346
Iterating global reduction 7 with 1 rules applied. Total rules applied 1414 place count 1249 transition count 2346
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1415 place count 1248 transition count 2338
Iterating global reduction 7 with 1 rules applied. Total rules applied 1416 place count 1248 transition count 2338
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1417 place count 1247 transition count 2330
Iterating global reduction 7 with 1 rules applied. Total rules applied 1418 place count 1247 transition count 2330
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1419 place count 1246 transition count 2322
Iterating global reduction 7 with 1 rules applied. Total rules applied 1420 place count 1246 transition count 2322
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1421 place count 1245 transition count 2314
Iterating global reduction 7 with 1 rules applied. Total rules applied 1422 place count 1245 transition count 2314
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1423 place count 1244 transition count 2306
Iterating global reduction 7 with 1 rules applied. Total rules applied 1424 place count 1244 transition count 2306
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1425 place count 1243 transition count 2298
Iterating global reduction 7 with 1 rules applied. Total rules applied 1426 place count 1243 transition count 2298
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1427 place count 1242 transition count 2290
Iterating global reduction 7 with 1 rules applied. Total rules applied 1428 place count 1242 transition count 2290
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1429 place count 1241 transition count 2282
Iterating global reduction 7 with 1 rules applied. Total rules applied 1430 place count 1241 transition count 2282
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 1431 place count 1240 transition count 2274
Iterating global reduction 7 with 1 rules applied. Total rules applied 1432 place count 1240 transition count 2274
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 3 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 118 rules applied. Total rules applied 1550 place count 1181 transition count 2215
Discarding 5 places :
Symmetric choice reduction at 7 with 5 rule applications. Total rules 1555 place count 1176 transition count 2210
Iterating global reduction 7 with 5 rules applied. Total rules applied 1560 place count 1176 transition count 2210
Applied a total of 1560 rules in 913 ms. Remains 1176 /2004 variables (removed 828) and now considering 2210/3065 (removed 855) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 914 ms. Remains : 1176/2004 places, 2210/3065 transitions.
[2023-03-13 02:10:09] [INFO ] Flatten gal took : 89 ms
[2023-03-13 02:10:09] [INFO ] Flatten gal took : 83 ms
[2023-03-13 02:10:10] [INFO ] Input system was already deterministic with 2210 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 2002 transition count 2727
Reduce places removed 347 places and 0 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 1 with 352 rules applied. Total rules applied 690 place count 1655 transition count 2722
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 696 place count 1650 transition count 2721
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 697 place count 1649 transition count 2721
Performed 285 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 285 Pre rules applied. Total rules applied 697 place count 1649 transition count 2436
Deduced a syphon composed of 285 places in 4 ms
Ensure Unique test removed 84 places
Reduce places removed 369 places and 0 transitions.
Iterating global reduction 4 with 654 rules applied. Total rules applied 1351 place count 1280 transition count 2436
Discarding 19 places :
Implicit places reduction removed 19 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 4 with 44 rules applied. Total rules applied 1395 place count 1261 transition count 2411
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 5 with 26 rules applied. Total rules applied 1421 place count 1235 transition count 2411
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 38 Pre rules applied. Total rules applied 1421 place count 1235 transition count 2373
Deduced a syphon composed of 38 places in 4 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 6 with 76 rules applied. Total rules applied 1497 place count 1197 transition count 2373
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1515 place count 1179 transition count 2323
Iterating global reduction 6 with 18 rules applied. Total rules applied 1533 place count 1179 transition count 2323
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 15 rules applied. Total rules applied 1548 place count 1174 transition count 2313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1549 place count 1173 transition count 2313
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 1549 place count 1173 transition count 2312
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1551 place count 1172 transition count 2312
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 1553 place count 1170 transition count 2303
Iterating global reduction 8 with 2 rules applied. Total rules applied 1555 place count 1170 transition count 2303
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1556 place count 1169 transition count 2295
Iterating global reduction 8 with 1 rules applied. Total rules applied 1557 place count 1169 transition count 2295
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1558 place count 1168 transition count 2287
Iterating global reduction 8 with 1 rules applied. Total rules applied 1559 place count 1168 transition count 2287
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1560 place count 1167 transition count 2279
Iterating global reduction 8 with 1 rules applied. Total rules applied 1561 place count 1167 transition count 2279
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1562 place count 1166 transition count 2271
Iterating global reduction 8 with 1 rules applied. Total rules applied 1563 place count 1166 transition count 2271
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1564 place count 1165 transition count 2263
Iterating global reduction 8 with 1 rules applied. Total rules applied 1565 place count 1165 transition count 2263
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1566 place count 1164 transition count 2255
Iterating global reduction 8 with 1 rules applied. Total rules applied 1567 place count 1164 transition count 2255
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1568 place count 1163 transition count 2247
Iterating global reduction 8 with 1 rules applied. Total rules applied 1569 place count 1163 transition count 2247
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1570 place count 1162 transition count 2239
Iterating global reduction 8 with 1 rules applied. Total rules applied 1571 place count 1162 transition count 2239
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1572 place count 1161 transition count 2231
Iterating global reduction 8 with 1 rules applied. Total rules applied 1573 place count 1161 transition count 2231
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1574 place count 1160 transition count 2223
Iterating global reduction 8 with 1 rules applied. Total rules applied 1575 place count 1160 transition count 2223
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1576 place count 1159 transition count 2215
Iterating global reduction 8 with 1 rules applied. Total rules applied 1577 place count 1159 transition count 2215
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 1578 place count 1158 transition count 2207
Iterating global reduction 8 with 1 rules applied. Total rules applied 1579 place count 1158 transition count 2207
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 3 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 8 with 112 rules applied. Total rules applied 1691 place count 1102 transition count 2151
Discarding 8 places :
Symmetric choice reduction at 8 with 8 rule applications. Total rules 1699 place count 1094 transition count 2143
Iterating global reduction 8 with 8 rules applied. Total rules applied 1707 place count 1094 transition count 2143
Applied a total of 1707 rules in 795 ms. Remains 1094 /2004 variables (removed 910) and now considering 2143/3065 (removed 922) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 795 ms. Remains : 1094/2004 places, 2143/3065 transitions.
[2023-03-13 02:10:10] [INFO ] Flatten gal took : 59 ms
[2023-03-13 02:10:11] [INFO ] Flatten gal took : 78 ms
[2023-03-13 02:10:11] [INFO ] Input system was already deterministic with 2143 transitions.
Incomplete random walk after 10000 steps, including 109 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 279830 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279830 steps, saw 58765 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2143 rows 1094 cols
[2023-03-13 02:10:14] [INFO ] Computed 164 place invariants in 17 ms
[2023-03-13 02:10:14] [INFO ] After 253ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 02:10:14] [INFO ] [Nat]Absence check using 47 positive place invariants in 19 ms returned sat
[2023-03-13 02:10:14] [INFO ] [Nat]Absence check using 47 positive and 117 generalized place invariants in 145 ms returned sat
[2023-03-13 02:10:16] [INFO ] After 1954ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 02:10:17] [INFO ] After 2220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 467 ms.
[2023-03-13 02:10:17] [INFO ] After 3152ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 1244 steps, including 44 resets, run visited all 1 properties in 13 ms. (steps per millisecond=95 )
FORMULA ASLink-PT-10a-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Parikh walk visited 1 properties in 13 ms.
Starting structural reductions in LTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2003 transition count 3065
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 1997 transition count 3032
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 1997 transition count 3032
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 1995 transition count 3023
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 1995 transition count 3023
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 1993 transition count 3014
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 1993 transition count 3014
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 1992 transition count 3006
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 1992 transition count 3006
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 1991 transition count 2998
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 1991 transition count 2998
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 1990 transition count 2990
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 1990 transition count 2990
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 1989 transition count 2982
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 1989 transition count 2982
Applied a total of 29 rules in 632 ms. Remains 1989 /2004 variables (removed 15) and now considering 2982/3065 (removed 83) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 633 ms. Remains : 1989/2004 places, 2982/3065 transitions.
[2023-03-13 02:10:18] [INFO ] Flatten gal took : 115 ms
[2023-03-13 02:10:18] [INFO ] Flatten gal took : 99 ms
[2023-03-13 02:10:18] [INFO ] Input system was already deterministic with 2982 transitions.
Starting structural reductions in LTL mode, iteration 0 : 2004/2004 places, 3065/3065 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2003 transition count 3065
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 6 place count 1998 transition count 3040
Iterating global reduction 1 with 5 rules applied. Total rules applied 11 place count 1998 transition count 3040
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 1997 transition count 3039
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 1997 transition count 3039
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 1996 transition count 3038
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 1996 transition count 3038
Applied a total of 15 rules in 231 ms. Remains 1996 /2004 variables (removed 8) and now considering 3038/3065 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 1996/2004 places, 3038/3065 transitions.
[2023-03-13 02:10:19] [INFO ] Flatten gal took : 90 ms
[2023-03-13 02:10:19] [INFO ] Flatten gal took : 114 ms
[2023-03-13 02:10:19] [INFO ] Input system was already deterministic with 3038 transitions.
[2023-03-13 02:10:19] [INFO ] Flatten gal took : 93 ms
[2023-03-13 02:10:19] [INFO ] Flatten gal took : 87 ms
[2023-03-13 02:10:19] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 02:10:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2004 places, 3065 transitions and 10858 arcs took 18 ms.
Total runtime 162106 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

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

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

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

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

parse successfull
net created successfully

Net: Petri
(NrP: 2004 NrTr: 3065 NrArc: 10858)

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

net check time: 0m 0.015sec

init dd package: 0m 3.245sec

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 9566440 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16096784 kB

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.037sec

23544 30317 43238

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="ASLink-PT-10a"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marciexred"
echo " Input is ASLink-PT-10a, 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 r010-oct2-167813598700154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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