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.r575-smll-171734919700143.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 MedleyA-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700143
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 158K Jun 2 16:33 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 MedleyA-PT-18-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-18-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717370761094

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:26:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 23:26:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:26:04] [INFO ] Load time of PNML (sax parser for PT used): 306 ms
[2024-06-02 23:26:04] [INFO ] Transformed 252 places.
[2024-06-02 23:26:04] [INFO ] Transformed 543 transitions.
[2024-06-02 23:26:04] [INFO ] Found NUPN structural information;
[2024-06-02 23:26:04] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 643 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 40 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
RANDOM walk for 40000 steps (1534 resets) in 2823 ms. (14 steps per ms) remains 15/16 properties
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (33 resets) in 78 ms. (50 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (35 resets) in 84 ms. (47 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (35 resets) in 65 ms. (60 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 236 ms. (16 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (35 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (32 resets) in 52 ms. (75 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (35 resets) in 206 ms. (19 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (33 resets) in 74 ms. (53 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 125 ms. (31 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (32 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (34 resets) in 63 ms. (62 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (33 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (34 resets) in 68 ms. (58 steps per ms) remains 15/15 properties
Interrupted probabilistic random walk after 345793 steps, run timeout after 3001 ms. (steps per millisecond=115 ) properties seen :4 out of 15
Probabilistic random walk after 345793 steps, saw 67003 distinct states, run finished after 3020 ms. (steps per millisecond=114 ) properties seen :4
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 541 rows 252 cols
[2024-06-02 23:26:08] [INFO ] Computed 7 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/145 variables, 145/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/145 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MedleyA-PT-18-ReachabilityFireability-2024-04 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 107/252 variables, 7/152 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 107/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 541/793 variables, 252/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 511 constraints, problems are : Problem set: 1 solved, 10 unsolved in 1679 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 125/125 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/125 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (OVERLAPS) 127/252 variables, 7/132 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 127/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 23:26:11] [INFO ] Deduced a trap composed of 16 places in 172 ms of which 29 ms to minimize.
[2024-06-02 23:26:11] [INFO ] Deduced a trap composed of 17 places in 187 ms of which 5 ms to minimize.
[2024-06-02 23:26:12] [INFO ] Deduced a trap composed of 20 places in 232 ms of which 3 ms to minimize.
[2024-06-02 23:26:12] [INFO ] Deduced a trap composed of 23 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:26:12] [INFO ] Deduced a trap composed of 53 places in 205 ms of which 3 ms to minimize.
[2024-06-02 23:26:12] [INFO ] Deduced a trap composed of 36 places in 156 ms of which 2 ms to minimize.
[2024-06-02 23:26:12] [INFO ] Deduced a trap composed of 34 places in 198 ms of which 3 ms to minimize.
[2024-06-02 23:26:12] [INFO ] Deduced a trap composed of 27 places in 170 ms of which 2 ms to minimize.
Problem MedleyA-PT-18-ReachabilityFireability-2024-08 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-02 23:26:13] [INFO ] Deduced a trap composed of 29 places in 199 ms of which 12 ms to minimize.
[2024-06-02 23:26:13] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 2 ms to minimize.
[2024-06-02 23:26:13] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:26:13] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 2 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 35 places in 286 ms of which 5 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 32 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 48 places in 313 ms of which 4 ms to minimize.
[2024-06-02 23:26:14] [INFO ] Deduced a trap composed of 42 places in 241 ms of which 3 ms to minimize.
[2024-06-02 23:26:15] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 2 ms to minimize.
[2024-06-02 23:26:15] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 3 ms to minimize.
[2024-06-02 23:26:15] [INFO ] Deduced a trap composed of 34 places in 189 ms of which 3 ms to minimize.
[2024-06-02 23:26:15] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 2 ms to minimize.
Problem MedleyA-PT-18-ReachabilityFireability-2024-08 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 20/279 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 23:26:16] [INFO ] Deduced a trap composed of 48 places in 250 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 1/280 constraints. Problems are: Problem set: 2 solved, 9 unsolved
(s81 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 1)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 1)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 252/793 variables, and 280 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5012 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/252 constraints, PredecessorRefiner: 0/11 constraints, Known Traps: 21/21 constraints]
After SMT, in 7428ms problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 98 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 541/541 transitions.
Graph (trivial) has 76 edges and 252 vertex of which 4 / 252 are part of one of the 1 SCC in 5 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 249 transition count 516
Reduce places removed 21 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 30 rules applied. Total rules applied 52 place count 228 transition count 507
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 11 rules applied. Total rules applied 63 place count 219 transition count 505
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 218 transition count 505
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 64 place count 218 transition count 498
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 78 place count 211 transition count 498
Discarding 19 places :
Symmetric choice reduction at 4 with 19 rule applications. Total rules 97 place count 192 transition count 466
Iterating global reduction 4 with 19 rules applied. Total rules applied 116 place count 192 transition count 466
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 116 place count 192 transition count 465
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 191 transition count 465
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 132 place count 184 transition count 458
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 138 place count 181 transition count 462
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 151 place count 181 transition count 449
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 155 place count 177 transition count 445
Iterating global reduction 4 with 4 rules applied. Total rules applied 159 place count 177 transition count 445
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 163 place count 175 transition count 443
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 167 place count 173 transition count 456
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 172 place count 173 transition count 451
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 177 place count 168 transition count 451
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 178 place count 168 transition count 451
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 179 place count 168 transition count 451
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 180 place count 167 transition count 450
Iterating global reduction 5 with 1 rules applied. Total rules applied 181 place count 167 transition count 450
Applied a total of 181 rules in 330 ms. Remains 167 /252 variables (removed 85) and now considering 450/541 (removed 91) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 350 ms. Remains : 167/252 places, 450/541 transitions.
RANDOM walk for 40000 steps (2094 resets) in 691 ms. (57 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (583 resets) in 277 ms. (143 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (542 resets) in 129 ms. (307 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (546 resets) in 194 ms. (205 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (509 resets) in 210 ms. (189 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (550 resets) in 254 ms. (156 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (565 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (545 resets) in 203 ms. (196 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (551 resets) in 83 ms. (476 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (550 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 474096 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :1 out of 9
Probabilistic random walk after 474096 steps, saw 78589 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :1
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 450 rows 167 cols
[2024-06-02 23:26:20] [INFO ] Computed 7 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 77/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 450/617 variables, 167/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/617 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 23:26:21] [INFO ] Deduced a trap composed of 13 places in 79 ms of which 2 ms to minimize.
At refinement iteration 5 (OVERLAPS) 0/617 variables, 1/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/617 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/617 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 617/617 variables, and 175 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 77/167 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 23:26:21] [INFO ] Deduced a trap composed of 36 places in 223 ms of which 3 ms to minimize.
[2024-06-02 23:26:22] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:26:22] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
[2024-06-02 23:26:22] [INFO ] Deduced a trap composed of 21 places in 217 ms of which 2 ms to minimize.
[2024-06-02 23:26:22] [INFO ] Deduced a trap composed of 21 places in 212 ms of which 3 ms to minimize.
[2024-06-02 23:26:22] [INFO ] Deduced a trap composed of 25 places in 245 ms of which 3 ms to minimize.
[2024-06-02 23:26:23] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-02 23:26:23] [INFO ] Deduced a trap composed of 72 places in 271 ms of which 4 ms to minimize.
[2024-06-02 23:26:23] [INFO ] Deduced a trap composed of 37 places in 261 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/167 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-02 23:26:23] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 2 ms to minimize.
[2024-06-02 23:26:24] [INFO ] Deduced a trap composed of 33 places in 263 ms of which 2 ms to minimize.
[2024-06-02 23:26:24] [INFO ] Deduced a trap composed of 21 places in 153 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/167 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/167 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem MedleyA-PT-18-ReachabilityFireability-2024-11 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 450/617 variables, 167/187 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/617 variables, 7/194 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 23:26:30] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/617 variables, 1/195 constraints. Problems are: Problem set: 1 solved, 7 unsolved
[2024-06-02 23:26:31] [INFO ] Deduced a trap composed of 34 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:26:32] [INFO ] Deduced a trap composed of 23 places in 293 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/617 variables, 2/197 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/617 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/617 variables, 0/197 constraints. Problems are: Problem set: 1 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 617/617 variables, and 197 constraints, problems are : Problem set: 1 solved, 7 unsolved in 12677 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 167/167 constraints, PredecessorRefiner: 7/8 constraints, Known Traps: 16/16 constraints]
After SMT, in 13807ms problems are : Problem set: 1 solved, 7 unsolved
Fused 7 Parikh solutions to 6 different solutions.
Parikh walk visited 0 properties in 29648 ms.
Support contains 89 out of 167 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 167/167 places, 450/450 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 0 with 1 rules applied. Total rules applied 1 place count 167 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 166 transition count 449
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 166 transition count 448
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 165 transition count 448
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 7 place count 162 transition count 442
Iterating global reduction 2 with 3 rules applied. Total rules applied 10 place count 162 transition count 442
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 161 transition count 444
Free-agglomeration rule applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 161 transition count 439
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 22 place count 156 transition count 439
Applied a total of 22 rules in 52 ms. Remains 156 /167 variables (removed 11) and now considering 439/450 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 156/167 places, 439/450 transitions.
RANDOM walk for 40000 steps (2093 resets) in 258 ms. (154 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (589 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (546 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (511 resets) in 105 ms. (377 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (552 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (552 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (548 resets) in 56 ms. (701 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (546 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 556127 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :1 out of 7
Probabilistic random walk after 556127 steps, saw 95905 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :1
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 439 rows 156 cols
[2024-06-02 23:27:07] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:27:07] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 439/595 variables, 156/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/595 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 165 constraints, problems are : Problem set: 0 solved, 6 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:27:08] [INFO ] Deduced a trap composed of 13 places in 90 ms of which 2 ms to minimize.
[2024-06-02 23:27:08] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
[2024-06-02 23:27:08] [INFO ] Deduced a trap composed of 36 places in 215 ms of which 3 ms to minimize.
[2024-06-02 23:27:08] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:27:09] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 439/595 variables, 156/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 2/170 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 6/176 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:27:14] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 1/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/595 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 177 constraints, problems are : Problem set: 0 solved, 6 unsolved in 8161 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints]
After SMT, in 8939ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 26495 ms.
Support contains 89 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 439/439 transitions.
Applied a total of 0 rules in 13 ms. Remains 156 /156 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 156/156 places, 439/439 transitions.
RANDOM walk for 40000 steps (2095 resets) in 224 ms. (177 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (589 resets) in 67 ms. (588 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (544 resets) in 48 ms. (816 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (508 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (553 resets) in 148 ms. (268 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (548 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (546 resets) in 185 ms. (215 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 542356 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :0 out of 6
Probabilistic random walk after 542356 steps, saw 93975 distinct states, run finished after 3001 ms. (steps per millisecond=180 ) properties seen :0
[2024-06-02 23:27:45] [INFO ] Invariant cache hit.
[2024-06-02 23:27:45] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 439/595 variables, 156/163 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/595 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 165 constraints, problems are : Problem set: 0 solved, 6 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:27:46] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 2 ms to minimize.
[2024-06-02 23:27:46] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-06-02 23:27:47] [INFO ] Deduced a trap composed of 36 places in 204 ms of which 2 ms to minimize.
[2024-06-02 23:27:47] [INFO ] Deduced a trap composed of 38 places in 233 ms of which 3 ms to minimize.
[2024-06-02 23:27:47] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:27:47] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:27:48] [INFO ] Deduced a trap composed of 23 places in 203 ms of which 3 ms to minimize.
[2024-06-02 23:27:48] [INFO ] Deduced a trap composed of 18 places in 216 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 439/595 variables, 156/171 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 2/173 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 6/179 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-02 23:27:50] [INFO ] Deduced a trap composed of 18 places in 178 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/595 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 0/595 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 180 constraints, problems are : Problem set: 0 solved, 6 unsolved in 6945 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 9/9 constraints]
After SMT, in 7607ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 33737 ms.
Support contains 89 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 439/439 transitions.
Applied a total of 0 rules in 11 ms. Remains 156 /156 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 156/156 places, 439/439 transitions.
RANDOM walk for 40000 steps (2091 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (553 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (512 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (542 resets) in 147 ms. (270 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (548 resets) in 86 ms. (459 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (549 resets) in 108 ms. (367 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 636284 steps, run timeout after 3001 ms. (steps per millisecond=212 ) properties seen :0 out of 5
Probabilistic random walk after 636284 steps, saw 106631 distinct states, run finished after 3001 ms. (steps per millisecond=212 ) properties seen :0
[2024-06-02 23:28:30] [INFO ] Invariant cache hit.
[2024-06-02 23:28:30] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 439/595 variables, 156/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/595 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/595 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 595/595 variables, and 165 constraints, problems are : Problem set: 0 solved, 5 unsolved in 499 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:28:31] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 2 ms to minimize.
[2024-06-02 23:28:31] [INFO ] Deduced a trap composed of 23 places in 165 ms of which 2 ms to minimize.
[2024-06-02 23:28:31] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 23 places in 167 ms of which 1 ms to minimize.
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 5 ms to minimize.
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 35 places in 213 ms of which 3 ms to minimize.
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 39 places in 214 ms of which 3 ms to minimize.
[2024-06-02 23:28:32] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 3 ms to minimize.
[2024-06-02 23:28:33] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-02 23:28:33] [INFO ] Deduced a trap composed of 43 places in 267 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:28:33] [INFO ] Deduced a trap composed of 35 places in 239 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 439/595 variables, 156/174 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/595 variables, 2/176 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/595 variables, 5/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/595 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/595 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 595/595 variables, and 181 constraints, problems are : Problem set: 0 solved, 5 unsolved in 7472 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 11/11 constraints]
After SMT, in 8037ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 28163 ms.
Support contains 89 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 439/439 transitions.
Applied a total of 0 rules in 13 ms. Remains 156 /156 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 156/156 places, 439/439 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 439/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 439/439 (removed 0) transitions.
[2024-06-02 23:29:06] [INFO ] Invariant cache hit.
[2024-06-02 23:29:06] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-02 23:29:06] [INFO ] Invariant cache hit.
[2024-06-02 23:29:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:29:07] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2024-06-02 23:29:07] [INFO ] Redundant transitions in 26 ms returned []
Running 438 sub problems to find dead transitions.
[2024-06-02 23:29:07] [INFO ] Invariant cache hit.
[2024-06-02 23:29:07] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:29:11] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 2 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 13 places in 231 ms of which 3 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 18 places in 238 ms of which 2 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 21 places in 247 ms of which 2 ms to minimize.
[2024-06-02 23:29:12] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 3 ms to minimize.
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 15 places in 278 ms of which 3 ms to minimize.
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 2 ms to minimize.
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 2 ms to minimize.
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 13 places in 161 ms of which 2 ms to minimize.
[2024-06-02 23:29:13] [INFO ] Deduced a trap composed of 18 places in 149 ms of which 3 ms to minimize.
[2024-06-02 23:29:14] [INFO ] Deduced a trap composed of 18 places in 218 ms of which 2 ms to minimize.
[2024-06-02 23:29:14] [INFO ] Deduced a trap composed of 34 places in 221 ms of which 3 ms to minimize.
[2024-06-02 23:29:14] [INFO ] Deduced a trap composed of 24 places in 183 ms of which 2 ms to minimize.
[2024-06-02 23:29:14] [INFO ] Deduced a trap composed of 21 places in 208 ms of which 2 ms to minimize.
[2024-06-02 23:29:15] [INFO ] Deduced a trap composed of 38 places in 171 ms of which 2 ms to minimize.
[2024-06-02 23:29:15] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:29:15] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 2 ms to minimize.
[2024-06-02 23:29:15] [INFO ] Deduced a trap composed of 25 places in 175 ms of which 3 ms to minimize.
[2024-06-02 23:29:16] [INFO ] Deduced a trap composed of 29 places in 161 ms of which 2 ms to minimize.
[2024-06-02 23:29:16] [INFO ] Deduced a trap composed of 23 places in 147 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:29:17] [INFO ] Deduced a trap composed of 28 places in 252 ms of which 3 ms to minimize.
[2024-06-02 23:29:17] [INFO ] Deduced a trap composed of 22 places in 274 ms of which 3 ms to minimize.
[2024-06-02 23:29:17] [INFO ] Deduced a trap composed of 32 places in 265 ms of which 3 ms to minimize.
[2024-06-02 23:29:17] [INFO ] Deduced a trap composed of 26 places in 251 ms of which 3 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 25 places in 240 ms of which 3 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 26 places in 237 ms of which 2 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 3 ms to minimize.
[2024-06-02 23:29:18] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 3 ms to minimize.
[2024-06-02 23:29:19] [INFO ] Deduced a trap composed of 23 places in 241 ms of which 3 ms to minimize.
[2024-06-02 23:29:19] [INFO ] Deduced a trap composed of 95 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:29:19] [INFO ] Deduced a trap composed of 18 places in 274 ms of which 3 ms to minimize.
[2024-06-02 23:29:20] [INFO ] Deduced a trap composed of 22 places in 262 ms of which 3 ms to minimize.
[2024-06-02 23:29:20] [INFO ] Deduced a trap composed of 25 places in 281 ms of which 3 ms to minimize.
[2024-06-02 23:29:20] [INFO ] Deduced a trap composed of 89 places in 258 ms of which 3 ms to minimize.
[2024-06-02 23:29:21] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 3 ms to minimize.
[2024-06-02 23:29:21] [INFO ] Deduced a trap composed of 25 places in 257 ms of which 3 ms to minimize.
[2024-06-02 23:29:21] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 3 ms to minimize.
[2024-06-02 23:29:21] [INFO ] Deduced a trap composed of 21 places in 257 ms of which 3 ms to minimize.
[2024-06-02 23:29:22] [INFO ] Deduced a trap composed of 24 places in 242 ms of which 3 ms to minimize.
[2024-06-02 23:29:22] [INFO ] Deduced a trap composed of 89 places in 274 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 3 ms to minimize.
[2024-06-02 23:29:25] [INFO ] Deduced a trap composed of 16 places in 220 ms of which 3 ms to minimize.
[2024-06-02 23:29:26] [INFO ] Deduced a trap composed of 16 places in 230 ms of which 3 ms to minimize.
[2024-06-02 23:29:26] [INFO ] Deduced a trap composed of 23 places in 238 ms of which 2 ms to minimize.
[2024-06-02 23:29:27] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 3 ms to minimize.
[2024-06-02 23:29:27] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 3 ms to minimize.
[2024-06-02 23:29:27] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 4 ms to minimize.
[2024-06-02 23:29:27] [INFO ] Deduced a trap composed of 21 places in 236 ms of which 3 ms to minimize.
[2024-06-02 23:29:28] [INFO ] Deduced a trap composed of 25 places in 249 ms of which 3 ms to minimize.
[2024-06-02 23:29:28] [INFO ] Deduced a trap composed of 91 places in 258 ms of which 3 ms to minimize.
[2024-06-02 23:29:28] [INFO ] Deduced a trap composed of 28 places in 236 ms of which 3 ms to minimize.
[2024-06-02 23:29:30] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 2 ms to minimize.
[2024-06-02 23:29:30] [INFO ] Deduced a trap composed of 39 places in 217 ms of which 3 ms to minimize.
[2024-06-02 23:29:30] [INFO ] Deduced a trap composed of 38 places in 217 ms of which 3 ms to minimize.
[2024-06-02 23:29:30] [INFO ] Deduced a trap composed of 48 places in 169 ms of which 3 ms to minimize.
[2024-06-02 23:29:31] [INFO ] Deduced a trap composed of 24 places in 148 ms of which 2 ms to minimize.
[2024-06-02 23:29:31] [INFO ] Deduced a trap composed of 22 places in 142 ms of which 2 ms to minimize.
[2024-06-02 23:29:31] [INFO ] Deduced a trap composed of 21 places in 135 ms of which 2 ms to minimize.
[2024-06-02 23:29:31] [INFO ] Deduced a trap composed of 98 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:29:32] [INFO ] Deduced a trap composed of 35 places in 236 ms of which 3 ms to minimize.
[2024-06-02 23:29:32] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 2 ms to minimize.
[2024-06-02 23:29:33] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 2 ms to minimize.
[2024-06-02 23:29:33] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:29:36] [INFO ] Deduced a trap composed of 39 places in 207 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 438 unsolved
[2024-06-02 23:29:36] [INFO ] Deduced a trap composed of 17 places in 253 ms of which 3 ms to minimize.
[2024-06-02 23:29:37] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 2 ms to minimize.
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 1.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 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.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 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 1.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.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)
(s73 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/595 variables, and 74 constraints, problems are : Problem set: 0 solved, 438 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 0/156 constraints, ReadFeed: 0/2 constraints, PredecessorRefiner: 438/438 constraints, Known Traps: 67/67 constraints]
Escalating to Integer solving :Problem set: 0 solved, 438 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 67/74 constraints. Problems are: Problem set: 0 solved, 438 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 438 unsolved
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD429 is UNSAT
At refinement iteration 4 (OVERLAPS) 439/595 variables, 156/230 constraints. Problems are: Problem set: 50 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/595 variables, 2/232 constraints. Problems are: Problem set: 50 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/595 variables, 388/620 constraints. Problems are: Problem set: 50 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 595/595 variables, and 620 constraints, problems are : Problem set: 50 solved, 388 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 388/438 constraints, Known Traps: 67/67 constraints]
After SMT, in 60670ms problems are : Problem set: 50 solved, 388 unsolved
Search for dead transitions found 50 dead transitions in 60680ms
Found 50 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 50 transitions
Dead transitions reduction (with SMT) removed 50 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/156 places, 389/439 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 389/389 (removed 0) transitions.
[2024-06-02 23:30:07] [INFO ] Redundant transitions in 7 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61042 ms. Remains : 156/156 places, 389/439 transitions.
RANDOM walk for 40000 steps (2100 resets) in 337 ms. (118 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (544 resets) in 84 ms. (470 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (507 resets) in 228 ms. (174 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (549 resets) in 224 ms. (177 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (554 resets) in 135 ms. (294 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (549 resets) in 159 ms. (250 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 478785 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :0 out of 5
Probabilistic random walk after 478785 steps, saw 83749 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
// Phase 1: matrix 389 rows 156 cols
[2024-06-02 23:30:11] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:30:11] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 389/545 variables, 156/163 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/545 variables, 2/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/545 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 545/545 variables, and 165 constraints, problems are : Problem set: 0 solved, 5 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 67/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 36 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 47 places in 134 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 21 places in 95 ms of which 2 ms to minimize.
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:30:12] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 1 ms to minimize.
[2024-06-02 23:30:13] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 4/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:30:13] [INFO ] Deduced a trap composed of 29 places in 117 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:30:13] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-06-02 23:30:13] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:30:13] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:30:13] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 1 ms to minimize.
[2024-06-02 23:30:13] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 389/545 variables, 156/179 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:30:39] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/545 variables, 1/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 23:30:40] [INFO ] Deduced a trap composed of 11 places in 117 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/545 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/545 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/545 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 545/545 variables, and 188 constraints, problems are : Problem set: 0 solved, 5 unsolved in 32203 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 18/18 constraints]
After SMT, in 32713ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 34760 ms.
Support contains 89 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 389/389 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 389/389 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 156/156 places, 389/389 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 389/389 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 389/389 (removed 0) transitions.
[2024-06-02 23:31:18] [INFO ] Invariant cache hit.
[2024-06-02 23:31:18] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-06-02 23:31:18] [INFO ] Invariant cache hit.
[2024-06-02 23:31:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 23:31:19] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-06-02 23:31:19] [INFO ] Redundant transitions in 4 ms returned []
Running 388 sub problems to find dead transitions.
[2024-06-02 23:31:19] [INFO ] Invariant cache hit.
[2024-06-02 23:31:19] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:31:22] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:31:22] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:31:22] [INFO ] Deduced a trap composed of 29 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:31:22] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:31:22] [INFO ] Deduced a trap composed of 13 places in 122 ms of which 2 ms to minimize.
[2024-06-02 23:31:23] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:31:23] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:31:23] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2024-06-02 23:31:23] [INFO ] Deduced a trap composed of 18 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:31:23] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2024-06-02 23:31:23] [INFO ] Deduced a trap composed of 13 places in 104 ms of which 1 ms to minimize.
[2024-06-02 23:31:23] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2024-06-02 23:31:23] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 1 ms to minimize.
[2024-06-02 23:31:24] [INFO ] Deduced a trap composed of 18 places in 117 ms of which 2 ms to minimize.
[2024-06-02 23:31:24] [INFO ] Deduced a trap composed of 21 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:31:24] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 1 ms to minimize.
[2024-06-02 23:31:24] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:31:24] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:31:25] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:31:25] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:31:25] [INFO ] Deduced a trap composed of 34 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:31:25] [INFO ] Deduced a trap composed of 16 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:31:25] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2024-06-02 23:31:25] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-02 23:31:25] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2024-06-02 23:31:25] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 2 ms to minimize.
[2024-06-02 23:31:26] [INFO ] Deduced a trap composed of 25 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:31:26] [INFO ] Deduced a trap composed of 25 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:31:26] [INFO ] Deduced a trap composed of 25 places in 126 ms of which 2 ms to minimize.
[2024-06-02 23:31:26] [INFO ] Deduced a trap composed of 27 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:31:26] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:31:27] [INFO ] Deduced a trap composed of 29 places in 133 ms of which 2 ms to minimize.
[2024-06-02 23:31:27] [INFO ] Deduced a trap composed of 28 places in 116 ms of which 2 ms to minimize.
[2024-06-02 23:31:27] [INFO ] Deduced a trap composed of 92 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:31:27] [INFO ] Deduced a trap composed of 21 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:31:27] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:31:27] [INFO ] Deduced a trap composed of 29 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:31:27] [INFO ] Deduced a trap composed of 38 places in 124 ms of which 2 ms to minimize.
[2024-06-02 23:31:28] [INFO ] Deduced a trap composed of 24 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:31:28] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/47 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:31:30] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2024-06-02 23:31:30] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:31:30] [INFO ] Deduced a trap composed of 100 places in 131 ms of which 1 ms to minimize.
[2024-06-02 23:31:30] [INFO ] Deduced a trap composed of 45 places in 130 ms of which 2 ms to minimize.
[2024-06-02 23:31:30] [INFO ] Deduced a trap composed of 23 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:31:30] [INFO ] Deduced a trap composed of 17 places in 140 ms of which 2 ms to minimize.
[2024-06-02 23:31:30] [INFO ] Deduced a trap composed of 18 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:31:31] [INFO ] Deduced a trap composed of 21 places in 139 ms of which 2 ms to minimize.
[2024-06-02 23:31:31] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2024-06-02 23:31:31] [INFO ] Deduced a trap composed of 35 places in 138 ms of which 2 ms to minimize.
[2024-06-02 23:31:31] [INFO ] Deduced a trap composed of 32 places in 122 ms of which 1 ms to minimize.
[2024-06-02 23:31:31] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-02 23:31:32] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 1 ms to minimize.
[2024-06-02 23:31:32] [INFO ] Deduced a trap composed of 38 places in 119 ms of which 2 ms to minimize.
[2024-06-02 23:31:32] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 1 ms to minimize.
[2024-06-02 23:31:32] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 1 ms to minimize.
[2024-06-02 23:31:32] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-06-02 23:31:33] [INFO ] Deduced a trap composed of 93 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:31:33] [INFO ] Deduced a trap composed of 65 places in 87 ms of which 1 ms to minimize.
[2024-06-02 23:31:33] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:31:34] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:31:34] [INFO ] Deduced a trap composed of 23 places in 127 ms of which 2 ms to minimize.
[2024-06-02 23:31:34] [INFO ] Deduced a trap composed of 21 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 2 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 21 places in 133 ms of which 1 ms to minimize.
[2024-06-02 23:31:35] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 1 ms to minimize.
[2024-06-02 23:31:36] [INFO ] Deduced a trap composed of 73 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 7/74 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:31:37] [INFO ] Deduced a trap composed of 98 places in 121 ms of which 2 ms to minimize.
[2024-06-02 23:31:37] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:31:41] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 1 ms to minimize.
[2024-06-02 23:31:41] [INFO ] Deduced a trap composed of 99 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:31:42] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 9 (OVERLAPS) 389/545 variables, 156/235 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 2/237 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 545/545 variables, and 237 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 156/156 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 72/72 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/155 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (OVERLAPS) 1/156 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 72/79 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:31:52] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 2 ms to minimize.
[2024-06-02 23:31:52] [INFO ] Deduced a trap composed of 91 places in 152 ms of which 2 ms to minimize.
[2024-06-02 23:31:52] [INFO ] Deduced a trap composed of 89 places in 120 ms of which 2 ms to minimize.
[2024-06-02 23:31:53] [INFO ] Deduced a trap composed of 41 places in 109 ms of which 2 ms to minimize.
[2024-06-02 23:31:54] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:31:56] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:31:59] [INFO ] Deduced a trap composed of 30 places in 123 ms of which 2 ms to minimize.
[2024-06-02 23:32:00] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2024-06-02 23:32:00] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 1 ms to minimize.
[2024-06-02 23:32:00] [INFO ] Deduced a trap composed of 101 places in 131 ms of which 2 ms to minimize.
[2024-06-02 23:32:01] [INFO ] Deduced a trap composed of 100 places in 144 ms of which 2 ms to minimize.
[2024-06-02 23:32:02] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 3 ms to minimize.
[2024-06-02 23:32:02] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 7/92 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:32:05] [INFO ] Deduced a trap composed of 70 places in 102 ms of which 1 ms to minimize.
[2024-06-02 23:32:05] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-06-02 23:32:06] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 3/95 constraints. Problems are: Problem set: 0 solved, 388 unsolved
[2024-06-02 23:32:10] [INFO ] Deduced a trap composed of 68 places in 102 ms of which 2 ms to minimize.
[2024-06-02 23:32:10] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 388 unsolved
SMT process timed out in 60233ms, After SMT, problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60533 ms. Remains : 156/156 places, 389/389 transitions.
[2024-06-02 23:32:19] [INFO ] Export to MCC of 5 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 8 ms.
[2024-06-02 23:32:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 156 places, 389 transitions and 1776 arcs took 9 ms.
[2024-06-02 23:32:19] [INFO ] Flatten gal took : 97 ms
Total runtime 376301 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-18

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/405/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 156
TRANSITIONS: 389
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.013s, Sys 0.000s]


SAVING FILE /home/mcc/execution/405/model (.net / .def) ...
EXPORT TIME: [User 0.002s, 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: 1338
MODEL NAME: /home/mcc/execution/405/model
156 places, 389 transitions.

Creating all event NSFs..
Creating all event NSFs..
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 MedleyA-PT-18-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-18-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717371338163

--------------------
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

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="MedleyA-PT-18"
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 MedleyA-PT-18, 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 r575-smll-171734919700143"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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