fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r003-smll-171620117100143
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for ASLink-PT-09a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15987.027 1870148.00 5120781.00 3213.40 F?FFTFFFFFTTF??? normal

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.r003-smll-171620117100143.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 greatspnxred
Input is ASLink-PT-09a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r003-smll-171620117100143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K 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.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:25 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:23 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 839K 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-09a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2023-08
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2023-10
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2023-13
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-09a-ReachabilityFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716376837667

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-09a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:20:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 11:20:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:20:40] [INFO ] Load time of PNML (sax parser for PT used): 685 ms
[2024-05-22 11:20:40] [INFO ] Transformed 1991 places.
[2024-05-22 11:20:40] [INFO ] Transformed 2919 transitions.
[2024-05-22 11:20:40] [INFO ] Found NUPN structural information;
[2024-05-22 11:20:40] [INFO ] Parsed PT model containing 1991 places and 2919 transitions and 10953 arcs in 997 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 26 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 31 transitions
Reduce redundant transitions removed 31 transitions.
RANDOM walk for 40000 steps (183 resets) in 3455 ms. (11 steps per ms) remains 13/16 properties
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (15 resets) in 614 ms. (65 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (16 resets) in 226 ms. (176 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (17 resets) in 228 ms. (174 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (13 resets) in 341 ms. (116 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (12 resets) in 489 ms. (81 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (16 resets) in 248 ms. (160 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (15 resets) in 214 ms. (186 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (13 resets) in 313 ms. (127 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (15 resets) in 1644 ms. (24 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (15 resets) in 244 ms. (163 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (15 resets) in 492 ms. (81 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (13 resets) in 238 ms. (167 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (17 resets) in 225 ms. (177 steps per ms) remains 13/13 properties
// Phase 1: matrix 2888 rows 1991 cols
[2024-05-22 11:20:44] [INFO ] Computed 384 invariants in 328 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/275 variables, 275/275 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/275 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 226/501 variables, 49/324 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 226/550 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 120/621 variables, 44/594 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/621 variables, 120/714 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/621 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-07 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1328/1949 variables, 279/993 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1949 variables, 1328/2321 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1949 variables, 0/2321 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 42/1991 variables, 12/2333 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1991 variables, 42/2375 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 (/ 1.0 14.0))
(s21 (/ 13.0 14.0))
(s22 0.0)
(s23 0.0)
(s24 (/ 13.0 14.0))
(s25 0.0)
(s26 (/ 1.0 14.0))
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 (/ 6.0 7.0))
(s36 (/ 1.0 14.0))
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 (/ 1.0 14.0))
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 (/ 13.0 14.0))
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 (/ 1.0 14.0))
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 (/ 1.0 14.0))
(s73 (/ 6.0 7.0))
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 (/ 1.0 14.0))
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 (/ 1.0 14.0))
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 (/ 1.0 14.0))
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 (/ 1.0 14.0))
(s143 0.0)
(s144 0.0)
(s145 (/ 1.0 14.0))
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1991/4879 variables, and 2375 constraints, problems are : Problem set: 1 solved, 12 unsolved in 5069 ms.
Refiners :[Domain max(s): 1991/1991 constraints, Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 291/291 constraints, State Equation: 0/1991 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/239 variables, 239/239 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/239 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 2 (OVERLAPS) 219/458 variables, 46/285 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 219/504 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 0/504 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 132/590 variables, 47/551 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/590 variables, 132/683 constraints. Problems are: Problem set: 1 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/590 variables, 0/683 constraints. Problems are: Problem set: 1 solved, 12 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1359/1949 variables, 279/962 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1949 variables, 1359/2321 constraints. Problems are: Problem set: 2 solved, 11 unsolved
[2024-05-22 11:20:52] [INFO ] Deduced a trap composed of 39 places in 700 ms of which 109 ms to minimize.
[2024-05-22 11:20:52] [INFO ] Deduced a trap composed of 26 places in 551 ms of which 7 ms to minimize.
[2024-05-22 11:20:53] [INFO ] Deduced a trap composed of 35 places in 324 ms of which 5 ms to minimize.
[2024-05-22 11:20:53] [INFO ] Deduced a trap composed of 30 places in 168 ms of which 2 ms to minimize.
[2024-05-22 11:20:55] [INFO ] Deduced a trap composed of 83 places in 1307 ms of which 15 ms to minimize.
SMT process timed out in 11847ms, After SMT, problems are : Problem set: 2 solved, 11 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 169 out of 1991 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1991/1991 places, 2888/2888 transitions.
Ensure Unique test removed 35 places
Discarding 18 places :
Implicit places reduction removed 18 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 162 transitions
Trivial Post-agglo rules discarded 162 transitions
Performed 162 trivial Post agglomeration. Transition count delta: 162
Iterating post reduction 0 with 215 rules applied. Total rules applied 215 place count 1938 transition count 2726
Reduce places removed 162 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 167 rules applied. Total rules applied 382 place count 1776 transition count 2721
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 387 place count 1771 transition count 2721
Performed 172 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 172 Pre rules applied. Total rules applied 387 place count 1771 transition count 2549
Deduced a syphon composed of 172 places in 9 ms
Ensure Unique test removed 62 places
Reduce places removed 234 places and 0 transitions.
Iterating global reduction 3 with 406 rules applied. Total rules applied 793 place count 1537 transition count 2549
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 794 place count 1537 transition count 2548
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 795 place count 1536 transition count 2548
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 803 place count 1528 transition count 2505
Ensure Unique test removed 1 places
Iterating global reduction 5 with 9 rules applied. Total rules applied 812 place count 1527 transition count 2505
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 814 place count 1527 transition count 2503
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 815 place count 1526 transition count 2503
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 4 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 915 place count 1476 transition count 2453
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 917 place count 1475 transition count 2456
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 919 place count 1475 transition count 2454
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 921 place count 1473 transition count 2454
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 8 with 5 rules applied. Total rules applied 926 place count 1473 transition count 2449
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 931 place count 1468 transition count 2449
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 9 with 9 rules applied. Total rules applied 940 place count 1468 transition count 2449
Applied a total of 940 rules in 1407 ms. Remains 1468 /1991 variables (removed 523) and now considering 2449/2888 (removed 439) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1425 ms. Remains : 1468/1991 places, 2449/2888 transitions.
RANDOM walk for 40000 steps (266 resets) in 725 ms. (55 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (34 resets) in 424 ms. (94 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 245 ms. (162 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (35 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (30 resets) in 258 ms. (154 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 194 ms. (205 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (31 resets) in 149 ms. (266 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (35 resets) in 163 ms. (243 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (32 resets) in 191 ms. (208 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (30 resets) in 436 ms. (91 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (33 resets) in 260 ms. (153 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (32 resets) in 202 ms. (197 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 65892 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :0 out of 11
Probabilistic random walk after 65892 steps, saw 38229 distinct states, run finished after 3010 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 2449 rows 1468 cols
[2024-05-22 11:21:01] [INFO ] Computed 268 invariants in 97 ms
[2024-05-22 11:21:01] [INFO ] State equation strengthened by 52 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 172/341 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 108/449 variables, 40/73 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 973/1422 variables, 185/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1422 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 46/1468 variables, 10/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1468 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (OVERLAPS) 2449/3917 variables, 1468/1736 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3917 variables, 52/1788 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3917 variables, 0/1788 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/3917 variables, 0/1788 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3917/3917 variables, and 1788 constraints, problems are : Problem set: 0 solved, 11 unsolved in 7639 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 195/195 constraints, State Equation: 1468/1468 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/169 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 172/341 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/341 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 108/449 variables, 40/73 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 973/1422 variables, 185/258 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 11:21:10] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 3 ms to minimize.
[2024-05-22 11:21:12] [INFO ] Deduced a trap composed of 73 places in 1195 ms of which 15 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1422 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1422 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 46/1468 variables, 10/270 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-22 11:21:14] [INFO ] Deduced a trap composed of 104 places in 472 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1468 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1468 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-03 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2023-10 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2023-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-09a-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 11 (OVERLAPS) 2449/3917 variables, 1468/1739 constraints. Problems are: Problem set: 6 solved, 5 unsolved
Problem ASLink-PT-09a-ReachabilityFireability-2023-08 is UNSAT
FORMULA ASLink-PT-09a-ReachabilityFireability-2023-08 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 12 (INCLUDED_ONLY) 0/3917 variables, 52/1791 constraints. Problems are: Problem set: 7 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3917 variables, 4/1795 constraints. Problems are: Problem set: 7 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3917/3917 variables, and 1795 constraints, problems are : Problem set: 7 solved, 4 unsolved in 45020 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 195/195 constraints, State Equation: 1468/1468 constraints, ReadFeed: 52/52 constraints, PredecessorRefiner: 4/11 constraints, Known Traps: 3/3 constraints]
After SMT, in 53085ms problems are : Problem set: 7 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 1468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1468/1468 places, 2449/2449 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 1468 transition count 2445
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 1464 transition count 2445
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 8 place count 1464 transition count 2433
Deduced a syphon composed of 12 places in 6 ms
Ensure Unique test removed 7 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 31 rules applied. Total rules applied 39 place count 1445 transition count 2433
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 1444 transition count 2427
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 1444 transition count 2427
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 2 with 2 rules applied. Total rules applied 43 place count 1443 transition count 2426
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 1443 transition count 2425
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 51 place count 1441 transition count 2420
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 53 place count 1440 transition count 2419
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 1440 transition count 2419
Applied a total of 55 rules in 759 ms. Remains 1440 /1468 variables (removed 28) and now considering 2419/2449 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 759 ms. Remains : 1440/1468 places, 2419/2449 transitions.
RANDOM walk for 40000 steps (291 resets) in 452 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (33 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (36 resets) in 452 ms. (88 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (34 resets) in 280 ms. (142 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (34 resets) in 193 ms. (206 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 121140 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :0 out of 4
Probabilistic random walk after 121140 steps, saw 36034 distinct states, run finished after 3002 ms. (steps per millisecond=40 ) properties seen :0
// Phase 1: matrix 2419 rows 1440 cols
[2024-05-22 11:21:58] [INFO ] Computed 260 invariants in 126 ms
[2024-05-22 11:21:58] [INFO ] State equation strengthened by 54 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 111/219 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 175/394 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 996/1390 variables, 177/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1390 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 50/1440 variables, 13/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1440 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 2419/3859 variables, 1440/1700 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3859 variables, 54/1754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3859 variables, 0/1754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 0/3859 variables, 0/1754 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3859/3859 variables, and 1754 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5715 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 190/190 constraints, State Equation: 1440/1440 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 111/219 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 175/394 variables, 54/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/394 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 996/1390 variables, 177/247 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:22:05] [INFO ] Deduced a trap composed of 107 places in 214 ms of which 3 ms to minimize.
[2024-05-22 11:22:06] [INFO ] Deduced a trap composed of 134 places in 827 ms of which 9 ms to minimize.
[2024-05-22 11:22:07] [INFO ] Deduced a trap composed of 75 places in 907 ms of which 10 ms to minimize.
[2024-05-22 11:22:07] [INFO ] Deduced a trap composed of 71 places in 426 ms of which 6 ms to minimize.
[2024-05-22 11:22:08] [INFO ] Deduced a trap composed of 69 places in 453 ms of which 5 ms to minimize.
[2024-05-22 11:22:08] [INFO ] Deduced a trap composed of 76 places in 795 ms of which 13 ms to minimize.
[2024-05-22 11:22:09] [INFO ] Deduced a trap composed of 25 places in 895 ms of which 8 ms to minimize.
[2024-05-22 11:22:10] [INFO ] Deduced a trap composed of 30 places in 181 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1390 variables, 8/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1390 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 50/1440 variables, 13/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1440 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2419/3859 variables, 1440/1708 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3859 variables, 54/1762 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3859 variables, 4/1766 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:22:40] [INFO ] Deduced a trap composed of 96 places in 330 ms of which 4 ms to minimize.
[2024-05-22 11:22:40] [INFO ] Deduced a trap composed of 114 places in 319 ms of which 3 ms to minimize.
[2024-05-22 11:22:41] [INFO ] Deduced a trap composed of 92 places in 329 ms of which 4 ms to minimize.
[2024-05-22 11:22:41] [INFO ] Deduced a trap composed of 110 places in 326 ms of which 4 ms to minimize.
[2024-05-22 11:22:41] [INFO ] Deduced a trap composed of 97 places in 330 ms of which 4 ms to minimize.
[2024-05-22 11:22:42] [INFO ] Deduced a trap composed of 92 places in 306 ms of which 4 ms to minimize.
[2024-05-22 11:22:42] [INFO ] Deduced a trap composed of 108 places in 324 ms of which 4 ms to minimize.
[2024-05-22 11:22:43] [INFO ] Deduced a trap composed of 73 places in 335 ms of which 4 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/3859 variables, 8/1774 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3859/3859 variables, and 1774 constraints, problems are : Problem set: 0 solved, 4 unsolved in 75014 ms.
Refiners :[Positive P Invariants (semi-flows): 70/70 constraints, Generalized P Invariants (flows): 190/190 constraints, State Equation: 1440/1440 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 16/16 constraints]
After SMT, in 80950ms problems are : Problem set: 0 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 108 out of 1440 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1440/1440 places, 2419/2419 transitions.
Applied a total of 0 rules in 68 ms. Remains 1440 /1440 variables (removed 0) and now considering 2419/2419 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 1440/1440 places, 2419/2419 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1440/1440 places, 2419/2419 transitions.
Applied a total of 0 rules in 81 ms. Remains 1440 /1440 variables (removed 0) and now considering 2419/2419 (removed 0) transitions.
[2024-05-22 11:23:19] [INFO ] Invariant cache hit.
[2024-05-22 11:23:21] [INFO ] Implicit Places using invariants in 1821 ms returned [1, 19, 20, 22, 32, 50, 68, 106, 122, 153, 168, 169, 170, 171, 172, 190, 208, 288, 303, 304, 305, 306, 326, 344, 412, 428, 441, 444, 445, 446, 464, 482, 538, 568, 583, 584, 585, 586, 587, 623, 704, 717, 718, 719, 720, 721, 739, 757, 839, 854, 855, 856, 857, 858, 876, 894, 968, 981, 996, 997, 998, 1000, 1018, 1036, 1117, 1130, 1131, 1132, 1133, 1134, 1170, 1251, 1256, 1267, 1268, 1269, 1270, 1271, 1306, 1308, 1329, 1330, 1331, 1332, 1344, 1350, 1356, 1362, 1368, 1374, 1380, 1386, 1392, 1398, 1404]
[2024-05-22 11:23:21] [INFO ] Actually due to overlaps returned [1306, 1271, 32, 50, 172, 190, 326, 446, 464, 587, 721, 739, 858, 876, 1000, 1018, 1134, 171, 306, 445, 586, 720, 857, 1133, 1270, 1330, 170, 305, 444, 585, 719, 856, 998, 1132, 1269, 1308, 1329, 1, 169, 288, 304, 428, 568, 584, 704, 718, 839, 855, 981, 997, 1117, 1131, 1251, 1268, 19, 20, 68, 168, 208, 303, 344, 441, 482, 583, 623, 717, 757, 854, 894, 996, 1036, 1130, 1170, 1267, 1332, 1374, 1392, 1404, 22, 153, 1256, 1331, 1344, 1350, 1356, 1362, 1368, 1380, 1386, 1398]
Discarding 90 places :
Implicit Place search using SMT only with invariants took 1839 ms to find 90 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1350/1440 places, 2419/2419 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 114 rules applied. Total rules applied 114 place count 1346 transition count 2309
Reduce places removed 110 places and 0 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Iterating post reduction 1 with 130 rules applied. Total rules applied 244 place count 1236 transition count 2289
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 264 place count 1216 transition count 2289
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 264 place count 1216 transition count 2228
Deduced a syphon composed of 61 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 123 rules applied. Total rules applied 387 place count 1154 transition count 2228
Discarding 16 places :
Implicit places reduction removed 16 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 3 with 28 rules applied. Total rules applied 415 place count 1138 transition count 2216
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 4 with 13 rules applied. Total rules applied 428 place count 1126 transition count 2215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 429 place count 1125 transition count 2215
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 429 place count 1125 transition count 2214
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 431 place count 1124 transition count 2214
Discarding 11 places :
Symmetric choice reduction at 6 with 11 rule applications. Total rules 442 place count 1113 transition count 2203
Iterating global reduction 6 with 11 rules applied. Total rules applied 453 place count 1113 transition count 2203
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 453 place count 1113 transition count 2202
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 455 place count 1112 transition count 2202
Discarding 8 places :
Symmetric choice reduction at 6 with 8 rule applications. Total rules 463 place count 1104 transition count 2194
Iterating global reduction 6 with 8 rules applied. Total rules applied 471 place count 1104 transition count 2194
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 472 place count 1104 transition count 2193
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 473 place count 1103 transition count 2192
Iterating global reduction 7 with 1 rules applied. Total rules applied 474 place count 1103 transition count 2192
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 475 place count 1102 transition count 2191
Iterating global reduction 7 with 1 rules applied. Total rules applied 476 place count 1102 transition count 2191
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 2 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 7 with 134 rules applied. Total rules applied 610 place count 1035 transition count 2124
Discarding 6 places :
Symmetric choice reduction at 7 with 6 rule applications. Total rules 616 place count 1029 transition count 2118
Iterating global reduction 7 with 6 rules applied. Total rules applied 622 place count 1029 transition count 2118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 627 place count 1029 transition count 2113
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 628 place count 1029 transition count 2112
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 8 with 2 rules applied. Total rules applied 630 place count 1028 transition count 2111
Free-agglomeration rule applied 8 times.
Iterating global reduction 8 with 8 rules applied. Total rules applied 638 place count 1028 transition count 2103
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 652 place count 1020 transition count 2097
Free-agglomeration rule (complex) applied 29 times.
Iterating global reduction 9 with 29 rules applied. Total rules applied 681 place count 1020 transition count 2068
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 9 with 29 rules applied. Total rules applied 710 place count 991 transition count 2068
Partial Free-agglomeration rule applied 28 times.
Drop transitions (Partial Free agglomeration) removed 28 transitions
Iterating global reduction 10 with 28 rules applied. Total rules applied 738 place count 991 transition count 2068
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 739 place count 991 transition count 2068
Applied a total of 739 rules in 1227 ms. Remains 991 /1350 variables (removed 359) and now considering 2068/2419 (removed 351) transitions.
// Phase 1: matrix 2068 rows 991 cols
[2024-05-22 11:23:22] [INFO ] Computed 149 invariants in 30 ms
[2024-05-22 11:23:23] [INFO ] Implicit Places using invariants in 1164 ms returned [101, 104, 106, 112, 164, 182, 189, 192, 195, 196, 201, 202, 279, 285, 288, 294, 301, 308, 309, 363, 386, 392, 395, 397, 398, 405, 458, 479, 488, 494, 495, 500, 501, 554, 583, 586, 588, 595, 600, 601, 653, 687, 696, 701, 702, 755, 773, 779, 782, 784, 785, 790, 791, 844, 865, 874, 880, 881, 975, 979, 982, 985, 988]
[2024-05-22 11:23:23] [INFO ] Actually due to overlaps returned [398, 696, 595, 785, 881, 196, 495, 201, 202, 106, 182, 189, 195, 279, 285, 386, 392, 397, 488, 583, 588, 773, 779, 784, 979, 982, 985, 988, 101, 164, 288, 294, 301, 363, 458, 479, 494, 554, 653, 687, 755, 844, 865, 874, 880, 975]
Discarding 46 places :
Implicit Place search using SMT only with invariants took 1181 ms to find 46 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 945/1440 places, 2068/2419 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 945 transition count 2063
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 940 transition count 2063
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 33 place count 917 transition count 2038
Iterating global reduction 2 with 23 rules applied. Total rules applied 56 place count 917 transition count 2038
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 917 transition count 2036
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 63 place count 912 transition count 2031
Iterating global reduction 3 with 5 rules applied. Total rules applied 68 place count 912 transition count 2031
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 70 place count 910 transition count 2029
Iterating global reduction 3 with 2 rules applied. Total rules applied 72 place count 910 transition count 2029
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 102 place count 895 transition count 2014
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 103 place count 894 transition count 2012
Iterating global reduction 3 with 1 rules applied. Total rules applied 104 place count 894 transition count 2012
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 126 place count 894 transition count 1990
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 3 with 22 rules applied. Total rules applied 148 place count 872 transition count 1990
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 153 place count 872 transition count 1985
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 158 place count 867 transition count 1985
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 159 place count 867 transition count 1985
Applied a total of 159 rules in 339 ms. Remains 867 /945 variables (removed 78) and now considering 1985/2068 (removed 83) transitions.
// Phase 1: matrix 1985 rows 867 cols
[2024-05-22 11:23:24] [INFO ] Computed 103 invariants in 31 ms
[2024-05-22 11:23:25] [INFO ] Implicit Places using invariants in 1247 ms returned [106, 269, 270, 355, 435, 436, 525, 526, 621, 622, 694, 695]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 1250 ms to find 12 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 855/1440 places, 1985/2419 transitions.
Applied a total of 0 rules in 32 ms. Remains 855 /855 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 5950 ms. Remains : 855/1440 places, 1985/2419 transitions.
RANDOM walk for 40000 steps (555 resets) in 559 ms. (71 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (77 resets) in 79 ms. (500 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (79 resets) in 275 ms. (144 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (79 resets) in 200 ms. (199 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (79 resets) in 89 ms. (444 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 108527 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :0 out of 4
Probabilistic random walk after 108527 steps, saw 58333 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
// Phase 1: matrix 1985 rows 855 cols
[2024-05-22 11:23:29] [INFO ] Computed 91 invariants in 22 ms
[2024-05-22 11:23:29] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 190/298 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 26/324 variables, 4/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/324 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 525/849 variables, 63/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/849 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 6/855 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/855 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1985/2840 variables, 855/946 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2840 variables, 11/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2840 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/2840 variables, 0/957 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2840/2840 variables, and 957 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2397 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 855/855 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 190/298 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/298 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:23:31] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/298 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 26/324 variables, 4/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 525/849 variables, 63/89 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:23:32] [INFO ] Deduced a trap composed of 52 places in 105 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/849 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/849 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 6/855 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 11:23:32] [INFO ] Deduced a trap composed of 32 places in 213 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/855 variables, 1/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/855 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1985/2840 variables, 855/949 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2840 variables, 11/960 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2840 variables, 4/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2840 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2840 variables, 0/964 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2840/2840 variables, and 964 constraints, problems are : Problem set: 0 solved, 4 unsolved in 38664 ms.
Refiners :[Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 67/67 constraints, State Equation: 855/855 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 41169ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 30007 ms.
Support contains 108 out of 855 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 855/855 places, 1985/1985 transitions.
Applied a total of 0 rules in 45 ms. Remains 855 /855 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 855/855 places, 1985/1985 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 855/855 places, 1985/1985 transitions.
Applied a total of 0 rules in 30 ms. Remains 855 /855 variables (removed 0) and now considering 1985/1985 (removed 0) transitions.
[2024-05-22 11:24:40] [INFO ] Invariant cache hit.
[2024-05-22 11:24:41] [INFO ] Implicit Places using invariants in 902 ms returned []
[2024-05-22 11:24:41] [INFO ] Invariant cache hit.
[2024-05-22 11:24:42] [INFO ] State equation strengthened by 11 read => feed constraints.
[2024-05-22 11:24:44] [INFO ] Implicit Places using invariants and state equation in 2931 ms returned []
Implicit Place search using SMT with State Equation took 3835 ms to find 0 implicit places.
[2024-05-22 11:24:44] [INFO ] Redundant transitions in 168 ms returned []
Running 1984 sub problems to find dead transitions.
[2024-05-22 11:24:44] [INFO ] Invariant cache hit.
[2024-05-22 11:24:44] [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 0.0)
(s41 1.0)
(s42 0.0)
(s43 1.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 0.0)
(s51 1.0)
(s52 0.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 16.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 0.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 5.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 5.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 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 1.0)
(s132 0.0)
(s133 1.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.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 3.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 4.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 2.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 3.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 0.0)
(s199 1.0)
(s200 0.0)
(s201 1.0)
(s202 0.0)
(s203 1.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 0.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 0.0)
(s241 0.0)
(s242 0.0)
(s243 1.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 0.0)
(s255 0.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 4.0)
(s263 1.0)
(s264 3.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 18.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 0.0)
(s289 1.0)
(s290 0.0)
(s291 1.0)
(s292 0.0)
(s293 1.0)
(s294 0.0)
(s295 1.0)
(s296 0.0)
(s297 1.0)
(s298 0.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 3.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 5.0)
(s339 1.0)
(s340 5.0)
(s341 1.0)
(s342 1.0)
(s343 6.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 2.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 3.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 12.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 4.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 7.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 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 7.0)
(s504 1.0)
(s505 12.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 11.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 11.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 0.0)
(s538 1.0)
(s539 0.0)
(s540 1.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 1.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 1.0)
(s549 0.0)
(s550 1.0)
(s551 0.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 5.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 6.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 4.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 0.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 11.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 6.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/854 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 1984 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 854/2840 variables, and 51 constraints, problems are : Problem set: 0 solved, 1984 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 51/67 constraints, State Equation: 0/855 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 1984/1984 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1984 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/854 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 1984 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 854/2840 variables, and 51 constraints, problems are : Problem set: 0 solved, 1984 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/24 constraints, Generalized P Invariants (flows): 51/67 constraints, State Equation: 0/855 constraints, ReadFeed: 0/11 constraints, PredecessorRefiner: 0/1984 constraints, Known Traps: 0/0 constraints]
After SMT, in 61884ms problems are : Problem set: 0 solved, 1984 unsolved
Search for dead transitions found 0 dead transitions in 61915ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65967 ms. Remains : 855/855 places, 1985/1985 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 855 transition count 1984
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 854 transition count 1984
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 853 transition count 1983
Applied a total of 4 rules in 60 ms. Remains 853 /855 variables (removed 2) and now considering 1983/1985 (removed 2) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1983 rows 853 cols
[2024-05-22 11:25:46] [INFO ] Computed 91 invariants in 27 ms
[2024-05-22 11:25:46] [INFO ] [Real]Absence check using 24 positive place invariants in 16 ms returned sat
[2024-05-22 11:25:46] [INFO ] [Real]Absence check using 24 positive and 67 generalized place invariants in 48 ms returned sat
[2024-05-22 11:25:46] [INFO ] After 370ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 11:25:47] [INFO ] [Nat]Absence check using 24 positive place invariants in 13 ms returned sat
[2024-05-22 11:25:47] [INFO ] [Nat]Absence check using 24 positive and 67 generalized place invariants in 44 ms returned sat
[2024-05-22 11:25:56] [INFO ] After 9138ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-05-22 11:26:28] [INFO ] Deduced a trap composed of 42 places in 446 ms of which 5 ms to minimize.
[2024-05-22 11:26:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 634 ms
TRAPS : Iteration 1
[2024-05-22 11:26:40] [INFO ] After 53646ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-05-22 11:27:00] [INFO ] After 73921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 74465 ms.
[2024-05-22 11:27:00] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 7 ms.
[2024-05-22 11:27:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 855 places, 1985 transitions and 7991 arcs took 23 ms.
[2024-05-22 11:27:01] [INFO ] Flatten gal took : 395 ms
Total runtime 381801 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ASLink-PT-09a

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 855
TRANSITIONS: 1985
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.048s, Sys 0.014s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.010s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 709
MODEL NAME: /home/mcc/execution/413/model
855 places, 1985 transitions.

No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-01 CANNOT_COMPUTE
FORMULA ASLink-PT-09a-ReachabilityFireability-2023-13 CANNOT_COMPUTE
FORMULA ASLink-PT-09a-ReachabilityFireability-2024-14 CANNOT_COMPUTE
FORMULA ASLink-PT-09a-ReachabilityFireability-2023-15 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716378707815

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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-09a"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ASLink-PT-09a, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r003-smll-171620117100143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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