Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r464-smll-171620117900134.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ASLink-PT-08b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117900134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 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-08b-ReachabilityCardinality-2024-00
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2023-01
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-02
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-03
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-04
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-05
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-06
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-07
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-08
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-09
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-10
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-11
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-12
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-13
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-14
FORMULA_NAME ASLink-PT-08b-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717229351904

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:09:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:09:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:09:14] [INFO ] Load time of PNML (sax parser for PT used): 638 ms
[2024-06-01 08:09:15] [INFO ] Transformed 3618 places.
[2024-06-01 08:09:15] [INFO ] Transformed 4459 transitions.
[2024-06-01 08:09:15] [INFO ] Found NUPN structural information;
[2024-06-01 08:09:15] [INFO ] Parsed PT model containing 3618 places and 4459 transitions and 13543 arcs in 1025 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 42 ms.
Working with output stream class java.io.PrintStream
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (51 resets) in 2536 ms. (15 steps per ms) remains 6/13 properties
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 624 ms. (64 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 128 ms. (310 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 226 ms. (176 steps per ms) remains 6/6 properties
// Phase 1: matrix 4459 rows 3618 cols
[2024-06-01 08:09:17] [INFO ] Computed 355 invariants in 355 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 596/636 variables, 58/98 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/636 variables, 596/694 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/636 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 256/892 variables, 25/719 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/892 variables, 256/975 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/892 variables, 0/975 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 2637/3529 variables, 258/1233 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3529 variables, 2637/3870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3529 variables, 0/3870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 89/3618 variables, 14/3884 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3618 variables, 89/3973 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3618 variables, 0/3973 constraints. Problems are: Problem set: 0 solved, 6 unsolved
SMT process timed out in 5612ms, After SMT, problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 3618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3618/3618 places, 4459/4459 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 828 transitions
Trivial Post-agglo rules discarded 828 transitions
Performed 828 trivial Post agglomeration. Transition count delta: 828
Iterating post reduction 0 with 828 rules applied. Total rules applied 828 place count 3618 transition count 3631
Reduce places removed 828 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 866 rules applied. Total rules applied 1694 place count 2790 transition count 3593
Reduce places removed 10 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 16 rules applied. Total rules applied 1710 place count 2780 transition count 3587
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 1716 place count 2774 transition count 3587
Performed 823 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 823 Pre rules applied. Total rules applied 1716 place count 2774 transition count 2764
Deduced a syphon composed of 823 places in 18 ms
Ensure Unique test removed 78 places
Reduce places removed 901 places and 0 transitions.
Iterating global reduction 4 with 1724 rules applied. Total rules applied 3440 place count 1873 transition count 2764
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 4 with 55 rules applied. Total rules applied 3495 place count 1862 transition count 2720
Reduce places removed 44 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 5 with 51 rules applied. Total rules applied 3546 place count 1818 transition count 2713
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 3553 place count 1811 transition count 2713
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 30 Pre rules applied. Total rules applied 3553 place count 1811 transition count 2683
Deduced a syphon composed of 30 places in 32 ms
Ensure Unique test removed 29 places
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 7 with 89 rules applied. Total rules applied 3642 place count 1752 transition count 2683
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 29 Pre rules applied. Total rules applied 3642 place count 1752 transition count 2654
Deduced a syphon composed of 29 places in 39 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 7 with 58 rules applied. Total rules applied 3700 place count 1723 transition count 2654
Discarding 112 places :
Symmetric choice reduction at 7 with 112 rule applications. Total rules 3812 place count 1611 transition count 2542
Iterating global reduction 7 with 112 rules applied. Total rules applied 3924 place count 1611 transition count 2542
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 3925 place count 1611 transition count 2541
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 34 Pre rules applied. Total rules applied 3925 place count 1611 transition count 2507
Deduced a syphon composed of 34 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 8 with 69 rules applied. Total rules applied 3994 place count 1576 transition count 2507
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 3994 place count 1576 transition count 2506
Deduced a syphon composed of 1 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 8 with 3 rules applied. Total rules applied 3997 place count 1574 transition count 2506
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 4006 place count 1565 transition count 2449
Iterating global reduction 8 with 9 rules applied. Total rules applied 4015 place count 1565 transition count 2449
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 6 Pre rules applied. Total rules applied 4015 place count 1565 transition count 2443
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 8 with 12 rules applied. Total rules applied 4027 place count 1559 transition count 2443
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4028 place count 1558 transition count 2435
Iterating global reduction 8 with 1 rules applied. Total rules applied 4029 place count 1558 transition count 2435
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4030 place count 1557 transition count 2427
Iterating global reduction 8 with 1 rules applied. Total rules applied 4031 place count 1557 transition count 2427
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4032 place count 1556 transition count 2419
Iterating global reduction 8 with 1 rules applied. Total rules applied 4033 place count 1556 transition count 2419
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4034 place count 1555 transition count 2411
Iterating global reduction 8 with 1 rules applied. Total rules applied 4035 place count 1555 transition count 2411
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4036 place count 1554 transition count 2403
Iterating global reduction 8 with 1 rules applied. Total rules applied 4037 place count 1554 transition count 2403
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4038 place count 1553 transition count 2395
Iterating global reduction 8 with 1 rules applied. Total rules applied 4039 place count 1553 transition count 2395
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4040 place count 1552 transition count 2387
Iterating global reduction 8 with 1 rules applied. Total rules applied 4041 place count 1552 transition count 2387
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4042 place count 1551 transition count 2379
Iterating global reduction 8 with 1 rules applied. Total rules applied 4043 place count 1551 transition count 2379
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4044 place count 1550 transition count 2371
Iterating global reduction 8 with 1 rules applied. Total rules applied 4045 place count 1550 transition count 2371
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4046 place count 1549 transition count 2363
Iterating global reduction 8 with 1 rules applied. Total rules applied 4047 place count 1549 transition count 2363
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4048 place count 1548 transition count 2355
Iterating global reduction 8 with 1 rules applied. Total rules applied 4049 place count 1548 transition count 2355
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4050 place count 1547 transition count 2347
Iterating global reduction 8 with 1 rules applied. Total rules applied 4051 place count 1547 transition count 2347
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4052 place count 1546 transition count 2339
Iterating global reduction 8 with 1 rules applied. Total rules applied 4053 place count 1546 transition count 2339
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4054 place count 1545 transition count 2331
Iterating global reduction 8 with 1 rules applied. Total rules applied 4055 place count 1545 transition count 2331
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4056 place count 1544 transition count 2323
Iterating global reduction 8 with 1 rules applied. Total rules applied 4057 place count 1544 transition count 2323
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4058 place count 1543 transition count 2315
Iterating global reduction 8 with 1 rules applied. Total rules applied 4059 place count 1543 transition count 2315
Performed 215 Post agglomeration using F-continuation condition.Transition count delta: 215
Deduced a syphon composed of 215 places in 4 ms
Ensure Unique test removed 2 places
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 8 with 432 rules applied. Total rules applied 4491 place count 1326 transition count 2100
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 4492 place count 1325 transition count 2099
Ensure Unique test removed 1 places
Iterating global reduction 8 with 2 rules applied. Total rules applied 4494 place count 1324 transition count 2099
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4496 place count 1323 transition count 2098
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 4498 place count 1322 transition count 2107
Free-agglomeration rule applied 10 times.
Iterating global reduction 8 with 10 rules applied. Total rules applied 4508 place count 1322 transition count 2097
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 8 with 10 rules applied. Total rules applied 4518 place count 1312 transition count 2097
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 9 with 8 rules applied. Total rules applied 4526 place count 1312 transition count 2089
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 9 with 8 rules applied. Total rules applied 4534 place count 1304 transition count 2089
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 4535 place count 1304 transition count 2089
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 4536 place count 1303 transition count 2088
Reduce places removed 4 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 6 rules applied. Total rules applied 4542 place count 1299 transition count 2086
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 4544 place count 1297 transition count 2086
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 6 Pre rules applied. Total rules applied 4544 place count 1297 transition count 2080
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 12 rules applied. Total rules applied 4556 place count 1291 transition count 2080
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 12 with 2 rules applied. Total rules applied 4558 place count 1289 transition count 2080
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 13 with 8 rules applied. Total rules applied 4566 place count 1285 transition count 2076
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 4568 place count 1283 transition count 2074
Iterating global reduction 13 with 2 rules applied. Total rules applied 4570 place count 1283 transition count 2074
Free-agglomeration rule applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 4572 place count 1283 transition count 2072
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 4574 place count 1281 transition count 2072
Applied a total of 4574 rules in 3947 ms. Remains 1281 /3618 variables (removed 2337) and now considering 2072/4459 (removed 2387) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3964 ms. Remains : 1281/3618 places, 2072/4459 transitions.
RANDOM walk for 40000 steps (351 resets) in 886 ms. (45 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (48 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (48 resets) in 313 ms. (127 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 260 ms. (153 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (46 resets) in 156 ms. (254 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 249 ms. (160 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 130916 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 6
Probabilistic random walk after 130916 steps, saw 36058 distinct states, run finished after 3007 ms. (steps per millisecond=43 ) properties seen :0
// Phase 1: matrix 2072 rows 1281 cols
[2024-06-01 08:09:30] [INFO ] Computed 226 invariants in 114 ms
[2024-06-01 08:09:30] [INFO ] State equation strengthened by 41 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 366/406 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 60/466 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/467 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 763/1230 variables, 154/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1230 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 3/1233 variables, 3/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1233 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 48/1281 variables, 10/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1281 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 2072/3353 variables, 1281/1507 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3353 variables, 41/1548 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3353 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/3353 variables, 0/1548 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3353/3353 variables, and 1548 constraints, problems are : Problem set: 0 solved, 6 unsolved in 4473 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 164/164 constraints, State Equation: 1281/1281 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 366/406 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/406 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 60/466 variables, 14/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/467 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 763/1230 variables, 154/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 08:09:36] [INFO ] Deduced a trap composed of 12 places in 670 ms of which 70 ms to minimize.
[2024-06-01 08:09:36] [INFO ] Deduced a trap composed of 20 places in 210 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/1230 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1230 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 3/1233 variables, 3/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1233 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 48/1281 variables, 10/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1281 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 2072/3353 variables, 1281/1509 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3353 variables, 41/1550 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3353 variables, 6/1556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3353 variables, 0/1556 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3353/3353 variables, and 1556 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45013 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 164/164 constraints, State Equation: 1281/1281 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 2/2 constraints]
After SMT, in 49664ms problems are : Problem set: 0 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 40 out of 1281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1281/1281 places, 2072/2072 transitions.
Applied a total of 0 rules in 62 ms. Remains 1281 /1281 variables (removed 0) and now considering 2072/2072 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 1281/1281 places, 2072/2072 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1281/1281 places, 2072/2072 transitions.
Applied a total of 0 rules in 59 ms. Remains 1281 /1281 variables (removed 0) and now considering 2072/2072 (removed 0) transitions.
[2024-06-01 08:10:19] [INFO ] Invariant cache hit.
[2024-06-01 08:10:22] [INFO ] Implicit Places using invariants in 2427 ms returned [3, 20, 21, 23, 35, 53, 71, 137, 157, 171, 172, 173, 174, 176, 193, 211, 295, 308, 309, 310, 311, 313, 330, 348, 420, 435, 450, 451, 452, 453, 455, 472, 490, 572, 585, 586, 587, 588, 591, 608, 627, 726, 731, 734, 751, 769, 850, 867, 868, 870, 887, 905, 975, 979, 980, 991, 993, 995, 1012, 1030, 1102, 1104, 1108, 1109, 1112, 1123, 1124, 1125, 1143, 1145, 1149, 1167, 1168, 1169, 1170, 1182, 1189, 1196, 1203, 1209, 1215, 1221, 1227, 1233, 1239, 1245]
[2024-06-01 08:10:22] [INFO ] Actually due to overlaps returned [1143, 1125, 53, 176, 193, 313, 330, 455, 472, 591, 608, 734, 751, 887, 1012, 1149, 35, 870, 995, 172, 173, 309, 310, 451, 452, 586, 587, 867, 991, 1123, 1167, 20, 174, 311, 453, 588, 731, 868, 993, 1124, 1145, 1168, 3, 295, 435, 572, 850, 979, 980, 1108, 1109, 71, 171, 211, 308, 348, 450, 490, 585, 627, 726, 769, 905, 1030, 1169, 1215, 1233, 1245, 21, 23, 157, 1112, 1170, 1182, 1189, 1196, 1203, 1209, 1221, 1227, 1239]
Discarding 81 places :
Implicit Place search using SMT only with invariants took 2444 ms to find 81 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1200/1281 places, 2072/2072 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 133 transitions
Trivial Post-agglo rules discarded 133 transitions
Performed 133 trivial Post agglomeration. Transition count delta: 133
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1195 transition count 1939
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Iterating post reduction 1 with 146 rules applied. Total rules applied 284 place count 1062 transition count 1926
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 296 place count 1050 transition count 1926
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 47 Pre rules applied. Total rules applied 296 place count 1050 transition count 1879
Deduced a syphon composed of 47 places in 5 ms
Ensure Unique test removed 1 places
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 95 rules applied. Total rules applied 391 place count 1002 transition count 1879
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 3 with 28 rules applied. Total rules applied 419 place count 988 transition count 1865
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 433 place count 974 transition count 1865
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 447 place count 960 transition count 1851
Iterating global reduction 5 with 14 rules applied. Total rules applied 461 place count 960 transition count 1851
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 464 place count 960 transition count 1848
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 466 place count 958 transition count 1845
Iterating global reduction 6 with 2 rules applied. Total rules applied 468 place count 958 transition count 1845
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 469 place count 958 transition count 1844
Performed 71 Post agglomeration using F-continuation condition.Transition count delta: 71
Deduced a syphon composed of 71 places in 5 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 7 with 142 rules applied. Total rules applied 611 place count 887 transition count 1773
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 614 place count 884 transition count 1770
Iterating global reduction 7 with 3 rules applied. Total rules applied 617 place count 884 transition count 1770
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 620 place count 884 transition count 1767
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 622 place count 883 transition count 1767
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 623 place count 883 transition count 1766
Free-agglomeration rule applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 628 place count 883 transition count 1761
Reduce places removed 5 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 7 rules applied. Total rules applied 635 place count 878 transition count 1759
Free-agglomeration rule (complex) applied 28 times.
Iterating global reduction 9 with 28 rules applied. Total rules applied 663 place count 878 transition count 1731
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 692 place count 849 transition count 1731
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 693 place count 849 transition count 1730
Partial Free-agglomeration rule applied 24 times.
Drop transitions (Partial Free agglomeration) removed 24 transitions
Iterating global reduction 10 with 24 rules applied. Total rules applied 717 place count 849 transition count 1730
Applied a total of 717 rules in 954 ms. Remains 849 /1200 variables (removed 351) and now considering 1730/2072 (removed 342) transitions.
// Phase 1: matrix 1730 rows 849 cols
[2024-06-01 08:10:23] [INFO ] Computed 124 invariants in 26 ms
[2024-06-01 08:10:24] [INFO ] Implicit Places using invariants in 1066 ms returned [96, 108, 110, 119, 173, 190, 196, 199, 201, 204, 209, 210, 280, 287, 290, 298, 303, 304, 357, 374, 380, 383, 385, 387, 484, 491, 499, 500, 575, 581, 584, 586, 593, 600, 601, 658, 675, 681, 684, 686, 691, 692, 745, 763, 770, 773]
[2024-06-01 08:10:24] [INFO ] Actually due to overlaps returned [204, 387, 209, 499, 600, 691, 210, 500, 601, 692, 96, 110, 190, 196, 201, 280, 287, 374, 380, 385, 575, 581, 586, 675, 681, 686, 763, 770, 173, 290, 298, 357, 484, 491, 593, 658, 745, 773]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 1072 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 811/1281 places, 1730/2072 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 787 transition count 1706
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 787 transition count 1706
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 781 transition count 1700
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 781 transition count 1700
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 80 place count 771 transition count 1690
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 81 place count 771 transition count 1689
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 99 place count 771 transition count 1671
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 117 place count 753 transition count 1671
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 121 place count 753 transition count 1667
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 125 place count 749 transition count 1667
Applied a total of 125 rules in 427 ms. Remains 749 /811 variables (removed 62) and now considering 1667/1730 (removed 63) transitions.
// Phase 1: matrix 1667 rows 749 cols
[2024-06-01 08:10:24] [INFO ] Computed 86 invariants in 30 ms
[2024-06-01 08:10:25] [INFO ] Implicit Places using invariants in 902 ms returned [112, 269, 270]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 904 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 746/1281 places, 1667/2072 transitions.
Applied a total of 0 rules in 34 ms. Remains 746 /746 variables (removed 0) and now considering 1667/1667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 5896 ms. Remains : 746/1281 places, 1667/2072 transitions.
RANDOM walk for 40000 steps (484 resets) in 394 ms. (101 steps per ms) remains 5/6 properties
FORMULA ASLink-PT-08b-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (91 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (85 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (89 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 81 ms. (487 steps per ms) remains 5/5 properties
// Phase 1: matrix 1667 rows 746 cols
[2024-06-01 08:10:26] [INFO ] Computed 83 invariants in 24 ms
[2024-06-01 08:10:26] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 147/177 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/181 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/194 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 501/695 variables, 54/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/695 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 51/746 variables, 10/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/746 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1667/2413 variables, 746/829 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2413 variables, 11/840 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2413 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/2413 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2413/2413 variables, and 840 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2658 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 746/746 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 147/177 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:10:29] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/181 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/181 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 13/194 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 501/695 variables, 54/74 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:10:29] [INFO ] Deduced a trap composed of 12 places in 304 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/695 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/695 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 51/746 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/746 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1667/2413 variables, 746/831 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2413 variables, 11/842 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2413 variables, 5/847 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2413 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/2413 variables, 0/847 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2413/2413 variables, and 847 constraints, problems are : Problem set: 0 solved, 5 unsolved in 18679 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 64/64 constraints, State Equation: 746/746 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 21411ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 4872 ms.
Support contains 30 out of 746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 746/746 places, 1667/1667 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 746 transition count 1662
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 741 transition count 1662
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 741 transition count 1656
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 735 transition count 1656
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 2 with 2 rules applied. Total rules applied 24 place count 734 transition count 1655
Applied a total of 24 rules in 76 ms. Remains 734 /746 variables (removed 12) and now considering 1655/1667 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 734/746 places, 1655/1667 transitions.
RANDOM walk for 40000 steps (494 resets) in 249 ms. (160 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (93 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (87 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 107 ms. (370 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (93 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 178024 steps, run timeout after 3001 ms. (steps per millisecond=59 ) properties seen :0 out of 5
Probabilistic random walk after 178024 steps, saw 58353 distinct states, run finished after 3001 ms. (steps per millisecond=59 ) properties seen :0
// Phase 1: matrix 1655 rows 734 cols
[2024-06-01 08:10:55] [INFO ] Computed 83 invariants in 19 ms
[2024-06-01 08:10:55] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 147/177 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/181 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/181 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/194 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 487/681 variables, 52/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/681 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 53/734 variables, 11/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/734 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1655/2389 variables, 734/817 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2389 variables, 11/828 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2389 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/2389 variables, 0/828 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2389/2389 variables, and 828 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2179 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 734/734 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 147/177 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:10:58] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-06-01 08:10:58] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/177 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:10:58] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/177 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/177 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/181 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/181 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 13/194 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/194 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 487/681 variables, 52/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:10:59] [INFO ] Deduced a trap composed of 15 places in 306 ms of which 5 ms to minimize.
[2024-06-01 08:10:59] [INFO ] Deduced a trap composed of 7 places in 348 ms of which 7 ms to minimize.
[2024-06-01 08:10:59] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/681 variables, 3/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/681 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 53/734 variables, 11/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/734 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 1655/2389 variables, 734/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2389 variables, 11/834 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2389 variables, 5/839 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2389 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2389 variables, 0/839 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2389/2389 variables, and 839 constraints, problems are : Problem set: 0 solved, 5 unsolved in 20104 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 734/734 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
After SMT, in 22334ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9542 ms.
Support contains 30 out of 734 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 734/734 places, 1655/1655 transitions.
Applied a total of 0 rules in 33 ms. Remains 734 /734 variables (removed 0) and now considering 1655/1655 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 734/734 places, 1655/1655 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 734/734 places, 1655/1655 transitions.
Applied a total of 0 rules in 31 ms. Remains 734 /734 variables (removed 0) and now considering 1655/1655 (removed 0) transitions.
[2024-06-01 08:11:27] [INFO ] Invariant cache hit.
[2024-06-01 08:11:29] [INFO ] Implicit Places using invariants in 1228 ms returned [97, 104]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 1233 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 732/734 places, 1655/1655 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 731 transition count 1654
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 731 transition count 1654
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 730 transition count 1653
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 730 transition count 1653
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 729 transition count 1652
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 729 transition count 1651
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 728 transition count 1651
Applied a total of 8 rules in 228 ms. Remains 728 /732 variables (removed 4) and now considering 1651/1655 (removed 4) transitions.
// Phase 1: matrix 1651 rows 728 cols
[2024-06-01 08:11:29] [INFO ] Computed 81 invariants in 30 ms
[2024-06-01 08:11:30] [INFO ] Implicit Places using invariants in 1408 ms returned []
[2024-06-01 08:11:30] [INFO ] Invariant cache hit.
[2024-06-01 08:11:31] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 08:11:33] [INFO ] Implicit Places using invariants and state equation in 3207 ms returned []
Implicit Place search using SMT with State Equation took 4622 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 728/734 places, 1651/1655 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 6115 ms. Remains : 728/734 places, 1651/1655 transitions.
RANDOM walk for 40000 steps (508 resets) in 336 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (92 resets) in 89 ms. (444 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (96 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (97 resets) in 131 ms. (303 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (92 resets) in 98 ms. (404 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (93 resets) in 87 ms. (454 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 149967 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 5
Probabilistic random walk after 149967 steps, saw 52629 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 08:11:37] [INFO ] Invariant cache hit.
[2024-06-01 08:11:37] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 126/156 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/160 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 13/173 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 472/645 variables, 49/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/645 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 83/728 variables, 14/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/728 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1651/2379 variables, 728/809 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2379 variables, 11/820 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2379 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/2379 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2379/2379 variables, and 820 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1925 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 728/728 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 126/156 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 4/160 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 13/173 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 472/645 variables, 49/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 3 ms to minimize.
[2024-06-01 08:11:39] [INFO ] Deduced a trap composed of 18 places in 98 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/645 variables, 2/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/645 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 83/728 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/728 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1651/2379 variables, 728/812 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2379 variables, 11/823 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2379 variables, 5/828 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-01 08:11:50] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-06-01 08:11:50] [INFO ] Deduced a trap composed of 28 places in 186 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2379 variables, 2/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2379 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/2379 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2379/2379 variables, and 830 constraints, problems are : Problem set: 0 solved, 5 unsolved in 19242 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, Generalized P Invariants (flows): 63/63 constraints, State Equation: 728/728 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 21201ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5200 ms.
Support contains 30 out of 728 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 728/728 places, 1651/1651 transitions.
Applied a total of 0 rules in 47 ms. Remains 728 /728 variables (removed 0) and now considering 1651/1651 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 728/728 places, 1651/1651 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 728/728 places, 1651/1651 transitions.
Applied a total of 0 rules in 33 ms. Remains 728 /728 variables (removed 0) and now considering 1651/1651 (removed 0) transitions.
[2024-06-01 08:12:03] [INFO ] Invariant cache hit.
[2024-06-01 08:12:04] [INFO ] Implicit Places using invariants in 1204 ms returned []
[2024-06-01 08:12:04] [INFO ] Invariant cache hit.
[2024-06-01 08:12:05] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-06-01 08:12:08] [INFO ] Implicit Places using invariants and state equation in 3927 ms returned []
Implicit Place search using SMT with State Equation took 5137 ms to find 0 implicit places.
[2024-06-01 08:12:09] [INFO ] Redundant transitions in 212 ms returned []
Running 1633 sub problems to find dead transitions.
[2024-06-01 08:12:09] [INFO ] Invariant cache hit.
[2024-06-01 08:12:09] [INFO ] State equation strengthened by 11 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/726 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1633 unsolved
SMT process timed out in 31575ms, After SMT, problems are : Problem set: 0 solved, 1633 unsolved
Search for dead transitions found 0 dead transitions in 31614ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37024 ms. Remains : 728/728 places, 1651/1651 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 4060 edges and 728 vertex of which 727 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 1 place count 727 transition count 1645
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 13 place count 721 transition count 1645
Applied a total of 13 rules in 63 ms. Remains 721 /728 variables (removed 7) and now considering 1645/1651 (removed 6) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 1645 rows 721 cols
[2024-06-01 08:12:40] [INFO ] Computed 80 invariants in 28 ms
[2024-06-01 08:12:41] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2024-06-01 08:12:41] [INFO ] [Real]Absence check using 19 positive and 61 generalized place invariants in 53 ms returned sat
[2024-06-01 08:12:41] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-01 08:12:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 11 ms returned sat
[2024-06-01 08:12:41] [INFO ] [Nat]Absence check using 19 positive and 61 generalized place invariants in 28 ms returned sat
[2024-06-01 08:12:57] [INFO ] After 15877ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-01 08:13:00] [INFO ] Deduced a trap composed of 16 places in 192 ms of which 3 ms to minimize.
[2024-06-01 08:13:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 345 ms
TRAPS : Iteration 1
[2024-06-01 08:13:09] [INFO ] After 27477ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-01 08:13:20] [INFO ] After 39720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 40372 ms.
[2024-06-01 08:13:21] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2024-06-01 08:13:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 728 places, 1651 transitions and 6663 arcs took 28 ms.
[2024-06-01 08:13:21] [INFO ] Flatten gal took : 412 ms
Total runtime 247829 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ASLink-PT-08b-ReachabilityCardinality-2023-01
Could not compute solution for formula : ASLink-PT-08b-ReachabilityCardinality-2024-04
Could not compute solution for formula : ASLink-PT-08b-ReachabilityCardinality-2024-11
Could not compute solution for formula : ASLink-PT-08b-ReachabilityCardinality-2024-13
Could not compute solution for formula : ASLink-PT-08b-ReachabilityCardinality-2024-14

BK_STOP 1717229602380

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
mcc2024
rfs formula name ASLink-PT-08b-ReachabilityCardinality-2023-01
rfs formula type EF
rfs formula formula --invariant=/tmp/638/inv_0_
rfs formula name ASLink-PT-08b-ReachabilityCardinality-2024-04
rfs formula type EF
rfs formula formula --invariant=/tmp/638/inv_1_
rfs formula name ASLink-PT-08b-ReachabilityCardinality-2024-11
rfs formula type AG
rfs formula formula --invariant=/tmp/638/inv_2_
rfs formula name ASLink-PT-08b-ReachabilityCardinality-2024-13
rfs formula type AG
rfs formula formula --invariant=/tmp/638/inv_3_
rfs formula name ASLink-PT-08b-ReachabilityCardinality-2024-14
rfs formula type AG
rfs formula formula --invariant=/tmp/638/inv_4_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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-08b"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ASLink-PT-08b, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r464-smll-171620117900134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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