About the Execution of GreatSPN+red for PolyORBNT-COL-S05J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 12103.199 | 3600000.00 | 13792470.00 | 209.30 | TFFT?TTTTFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445800391.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S05J60, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445800391
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 7.7K Apr 12 09:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 09:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Apr 12 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Apr 12 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 10:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Apr 12 10:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 10:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 12 10:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 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 PolyORBNT-COL-S05J60-ReachabilityFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716878066952
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 06:34:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-28 06:34:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 06:34:28] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 06:34:28] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 06:34:29] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 818 ms
[2024-05-28 06:34:29] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 30 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 06:34:29] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-05-28 06:34:29] [INFO ] Skeletonized 16 HLPN properties in 1 ms.
Remains 2 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40004 steps (3195 resets) in 959 ms. (41 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40002 steps (1570 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 06:34:29] [INFO ] Computed 13 invariants in 10 ms
[2024-05-28 06:34:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem PolyORBNT-COL-S05J60-ReachabilityFireability-2024-07 is UNSAT
After SMT solving in domain Real declared 31/86 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 1/6 constraints, Generalized P Invariants (flows): 2/7 constraints, State Equation: 0/48 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 239ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-28 06:34:30] [INFO ] Flatten gal took : 19 ms
[2024-05-28 06:34:30] [INFO ] Flatten gal took : 10 ms
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-07 TRUE TECHNIQUES CPN_APPROX
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-28 06:34:30] [INFO ] Unfolded HLPN to a Petri net with 969 places and 2030 transitions 12704 arcs in 57 ms.
[2024-05-28 06:34:30] [INFO ] Unfolded 16 HLPN properties in 2 ms.
[2024-05-28 06:34:30] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 06:34:30] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 06:34:30] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 06:34:30] [INFO ] Reduced 90 identical enabling conditions.
[2024-05-28 06:34:30] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 06:34:30] [INFO ] Reduced 10 identical enabling conditions.
[2024-05-28 06:34:30] [INFO ] Reduced 555 identical enabling conditions.
[2024-05-28 06:34:30] [INFO ] Reduced 10 identical enabling conditions.
Deduced a syphon composed of 60 places in 9 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
RANDOM walk for 40000 steps (2733 resets) in 3933 ms. (10 steps per ms) remains 8/15 properties
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (998 resets) in 2455 ms. (16 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (889 resets) in 2481 ms. (16 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (481 resets) in 211 ms. (188 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (54 resets) in 1987 ms. (20 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (561 resets) in 547 ms. (73 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1095 resets) in 1322 ms. (30 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (996 resets) in 801 ms. (49 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (488 resets) in 4117 ms. (9 steps per ms) remains 8/8 properties
[2024-05-28 06:34:36] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2024-05-28 06:34:36] [INFO ] Computed 142 invariants in 143 ms
[2024-05-28 06:34:36] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/907 variables, 132/132 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/907 variables, 5/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/907 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem PolyORBNT-COL-S05J60-ReachabilityFireability-2024-00 is UNSAT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S05J60-ReachabilityFireability-2024-02 is UNSAT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S05J60-ReachabilityFireability-2024-06 is UNSAT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S05J60-ReachabilityFireability-2024-11 is UNSAT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S05J60-ReachabilityFireability-2024-12 is UNSAT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem PolyORBNT-COL-S05J60-ReachabilityFireability-2024-14 is UNSAT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 2/909 variables, 3/140 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/909 variables, 2/142 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/909 variables, 0/142 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1311/2220 variables, 909/1051 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2220 variables, 1/1052 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2220 variables, 0/1052 constraints. Problems are: Problem set: 6 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/2220 variables, 0/1052 constraints. Problems are: Problem set: 6 solved, 2 unsolved
No progress, stopping.
Problem PolyORBNT-COL-S05J60-ReachabilityFireability-2024-05 is UNSAT
FORMULA PolyORBNT-COL-S05J60-ReachabilityFireability-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Real declared 2220/2220 variables, and 1052 constraints, problems are : Problem set: 6 solved, 2 unsolved in 3888 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/341 variables, 1/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/341 variables, 0/1 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 503/844 variables, 73/74 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/844 variables, 2/76 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 0/76 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 61/905 variables, 61/137 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/905 variables, 0/137 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 4/909 variables, 5/142 constraints. Problems are: Problem set: 7 solved, 1 unsolved
[2024-05-28 06:34:46] [INFO ] Deduced a trap composed of 507 places in 505 ms of which 47 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/909 variables, 1/143 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/909 variables, 0/143 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1311/2220 variables, 909/1052 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2220 variables, 1/1053 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2220 variables, 1/1054 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2220 variables, 0/1054 constraints. Problems are: Problem set: 7 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/2220 variables, 0/1054 constraints. Problems are: Problem set: 7 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2220/2220 variables, and 1054 constraints, problems are : Problem set: 7 solved, 1 unsolved in 2020 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 909/909 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 1/1 constraints]
After SMT, in 11256ms problems are : Problem set: 7 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 909 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 904 transition count 1249
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 137 place count 838 transition count 1249
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 137 place count 838 transition count 1184
Deduced a syphon composed of 65 places in 5 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 267 place count 773 transition count 1184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 268 place count 772 transition count 1183
Iterating global reduction 2 with 1 rules applied. Total rules applied 269 place count 772 transition count 1183
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 273 place count 770 transition count 1181
Applied a total of 273 rules in 311 ms. Remains 770 /909 variables (removed 139) and now considering 1181/1315 (removed 134) transitions.
Running 1175 sub problems to find dead transitions.
[2024-05-28 06:34:47] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
// Phase 1: matrix 1177 rows 770 cols
[2024-05-28 06:34:47] [INFO ] Computed 137 invariants in 47 ms
[2024-05-28 06:34:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.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 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.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 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.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 0.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 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1947 variables, and 132 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20037 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1175 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 06:35:24] [INFO ] Deduced a trap composed of 13 places in 456 ms of which 7 ms to minimize.
[2024-05-28 06:35:28] [INFO ] Deduced a trap composed of 285 places in 268 ms of which 5 ms to minimize.
[2024-05-28 06:35:28] [INFO ] Deduced a trap composed of 188 places in 289 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 3/135 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
[2024-05-28 06:35:30] [INFO ] Deduced a trap composed of 13 places in 171 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1947 variables, and 136 constraints, problems are : Problem set: 0 solved, 1175 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 4/4 constraints]
After SMT, in 43538ms problems are : Problem set: 0 solved, 1175 unsolved
Search for dead transitions found 0 dead transitions in 43586ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43917 ms. Remains : 770/909 places, 1181/1315 transitions.
RANDOM walk for 40000 steps (2116 resets) in 878 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (144 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 310461 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 1
Probabilistic random walk after 310461 steps, saw 94411 distinct states, run finished after 3015 ms. (steps per millisecond=102 ) properties seen :0
[2024-05-28 06:35:34] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:35:34] [INFO ] Invariant cache hit.
[2024-05-28 06:35:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1947 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1947/1947 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 797 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1177/1946 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1946 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1946 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1947 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1947 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1947 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1947/1947 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1158 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1989ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 62 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 770/770 places, 1181/1181 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1181/1181 transitions.
Applied a total of 0 rules in 80 ms. Remains 770 /770 variables (removed 0) and now considering 1181/1181 (removed 0) transitions.
[2024-05-28 06:35:36] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:35:36] [INFO ] Invariant cache hit.
[2024-05-28 06:35:37] [INFO ] Implicit Places using invariants in 1026 ms returned []
[2024-05-28 06:35:37] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:35:37] [INFO ] Invariant cache hit.
[2024-05-28 06:35:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:35:44] [INFO ] Implicit Places using invariants and state equation in 6473 ms returned []
Implicit Place search using SMT with State Equation took 7537 ms to find 0 implicit places.
[2024-05-28 06:35:44] [INFO ] Redundant transitions in 59 ms returned []
Running 1175 sub problems to find dead transitions.
[2024-05-28 06:35:44] [INFO ] Flow matrix only has 1177 transitions (discarded 4 similar events)
[2024-05-28 06:35:44] [INFO ] Invariant cache hit.
[2024-05-28 06:35:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1175 unsolved
Problem TDEAD740 is UNSAT
Problem TDEAD743 is UNSAT
Problem TDEAD746 is UNSAT
Problem TDEAD747 is UNSAT
Problem TDEAD748 is UNSAT
Problem TDEAD749 is UNSAT
Problem TDEAD750 is UNSAT
Problem TDEAD753 is UNSAT
Problem TDEAD756 is UNSAT
Problem TDEAD760 is UNSAT
Problem TDEAD761 is UNSAT
Problem TDEAD762 is UNSAT
Problem TDEAD763 is UNSAT
Problem TDEAD764 is UNSAT
Problem TDEAD765 is UNSAT
Problem TDEAD768 is UNSAT
Problem TDEAD771 is UNSAT
Problem TDEAD775 is UNSAT
Problem TDEAD780 is UNSAT
Problem TDEAD788 is UNSAT
Problem TDEAD789 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD793 is UNSAT
Problem TDEAD794 is UNSAT
Problem TDEAD795 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD797 is UNSAT
Problem TDEAD798 is UNSAT
Problem TDEAD799 is UNSAT
Problem TDEAD800 is UNSAT
Problem TDEAD803 is UNSAT
Problem TDEAD804 is UNSAT
Problem TDEAD807 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD815 is UNSAT
Problem TDEAD816 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD820 is UNSAT
Problem TDEAD823 is UNSAT
Problem TDEAD824 is UNSAT
Problem TDEAD827 is UNSAT
Problem TDEAD828 is UNSAT
Problem TDEAD829 is UNSAT
Problem TDEAD830 is UNSAT
Problem TDEAD833 is UNSAT
Problem TDEAD836 is UNSAT
Problem TDEAD837 is UNSAT
Problem TDEAD838 is UNSAT
Problem TDEAD839 is UNSAT
Problem TDEAD840 is UNSAT
Problem TDEAD841 is UNSAT
Problem TDEAD842 is UNSAT
Problem TDEAD843 is UNSAT
Problem TDEAD844 is UNSAT
Problem TDEAD845 is UNSAT
Problem TDEAD846 is UNSAT
Problem TDEAD847 is UNSAT
Problem TDEAD848 is UNSAT
Problem TDEAD849 is UNSAT
Problem TDEAD850 is UNSAT
Problem TDEAD851 is UNSAT
Problem TDEAD852 is UNSAT
Problem TDEAD853 is UNSAT
Problem TDEAD854 is UNSAT
Problem TDEAD855 is UNSAT
Problem TDEAD858 is UNSAT
Problem TDEAD859 is UNSAT
Problem TDEAD862 is UNSAT
Problem TDEAD863 is UNSAT
Problem TDEAD864 is UNSAT
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 4/769 variables, 4/136 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 769/1947 variables, and 136 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1175/1175 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 78 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
[2024-05-28 06:36:20] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 1/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 0/133 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
At refinement iteration 4 (OVERLAPS) 4/769 variables, 4/137 constraints. Problems are: Problem set: 78 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 769/1947 variables, and 137 constraints, problems are : Problem set: 78 solved, 1097 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1175 constraints, Known Traps: 1/1 constraints]
After SMT, in 63680ms problems are : Problem set: 78 solved, 1097 unsolved
Search for dead transitions found 78 dead transitions in 63704ms
Found 78 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 78 transitions
Dead transitions reduction (with SMT) removed 78 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 770/770 places, 1103/1181 transitions.
Applied a total of 0 rules in 30 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 06:36:48] [INFO ] Redundant transitions in 37 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 71502 ms. Remains : 770/770 places, 1103/1181 transitions.
RANDOM walk for 40001 steps (2103 resets) in 434 ms. (91 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (130 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 344905 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 1
Probabilistic random walk after 344905 steps, saw 104927 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) properties seen :0
[2024-05-28 06:36:51] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
// Phase 1: matrix 1099 rows 770 cols
[2024-05-28 06:36:51] [INFO ] Computed 137 invariants in 31 ms
[2024-05-28 06:36:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1869 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1869/1869 variables, and 908 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1052 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 8/9 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 192/201 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/201 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 558/759 variables, 127/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/759 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/760 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/760 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/768 variables, 5/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/769 variables, 1/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/769 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1099/1868 variables, 769/906 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1868 variables, 1/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1868 variables, 0/907 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 1/1869 variables, 1/908 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1869 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1869 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1869/1869 variables, and 909 constraints, problems are : Problem set: 0 solved, 1 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 130/130 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 770/770 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1890ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 770 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 770/770 places, 1103/1103 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 770/770 places, 1103/1103 transitions.
Applied a total of 0 rules in 32 ms. Remains 770 /770 variables (removed 0) and now considering 1103/1103 (removed 0) transitions.
[2024-05-28 06:36:53] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:36:53] [INFO ] Invariant cache hit.
[2024-05-28 06:36:54] [INFO ] Implicit Places using invariants in 872 ms returned []
[2024-05-28 06:36:54] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:36:54] [INFO ] Invariant cache hit.
[2024-05-28 06:36:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 06:37:01] [INFO ] Implicit Places using invariants and state equation in 7282 ms returned []
Implicit Place search using SMT with State Equation took 8156 ms to find 0 implicit places.
[2024-05-28 06:37:01] [INFO ] Redundant transitions in 14 ms returned []
Running 1097 sub problems to find dead transitions.
[2024-05-28 06:37:01] [INFO ] Flow matrix only has 1099 transitions (discarded 4 similar events)
[2024-05-28 06:37:01] [INFO ] Invariant cache hit.
[2024-05-28 06:37:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 245 places in 236 ms of which 5 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 196 places in 304 ms of which 5 ms to minimize.
[2024-05-28 06:37:15] [INFO ] Deduced a trap composed of 233 places in 271 ms of which 5 ms to minimize.
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 196 places in 262 ms of which 4 ms to minimize.
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 230 places in 270 ms of which 7 ms to minimize.
[2024-05-28 06:37:16] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 5 ms to minimize.
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 196 places in 231 ms of which 5 ms to minimize.
[2024-05-28 06:37:17] [INFO ] Deduced a trap composed of 245 places in 242 ms of which 4 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 196 places in 525 ms of which 4 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 196 places in 323 ms of which 5 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:37:18] [INFO ] Deduced a trap composed of 196 places in 250 ms of which 5 ms to minimize.
[2024-05-28 06:37:19] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:37:19] [INFO ] Deduced a trap composed of 254 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:37:19] [INFO ] Deduced a trap composed of 196 places in 253 ms of which 4 ms to minimize.
[2024-05-28 06:37:20] [INFO ] Deduced a trap composed of 196 places in 297 ms of which 5 ms to minimize.
[2024-05-28 06:37:20] [INFO ] Deduced a trap composed of 242 places in 284 ms of which 5 ms to minimize.
[2024-05-28 06:37:20] [INFO ] Deduced a trap composed of 196 places in 291 ms of which 4 ms to minimize.
[2024-05-28 06:37:21] [INFO ] Deduced a trap composed of 196 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:37:21] [INFO ] Deduced a trap composed of 242 places in 267 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:22] [INFO ] Deduced a trap composed of 254 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:37:22] [INFO ] Deduced a trap composed of 245 places in 263 ms of which 4 ms to minimize.
[2024-05-28 06:37:22] [INFO ] Deduced a trap composed of 248 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:37:23] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:37:23] [INFO ] Deduced a trap composed of 251 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:37:23] [INFO ] Deduced a trap composed of 196 places in 303 ms of which 5 ms to minimize.
[2024-05-28 06:37:23] [INFO ] Deduced a trap composed of 233 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:37:24] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:37:24] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 8 ms to minimize.
[2024-05-28 06:37:24] [INFO ] Deduced a trap composed of 230 places in 243 ms of which 5 ms to minimize.
[2024-05-28 06:37:25] [INFO ] Deduced a trap composed of 260 places in 257 ms of which 4 ms to minimize.
[2024-05-28 06:37:25] [INFO ] Deduced a trap composed of 236 places in 282 ms of which 5 ms to minimize.
[2024-05-28 06:37:25] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 5 ms to minimize.
[2024-05-28 06:37:25] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:37:26] [INFO ] Deduced a trap composed of 196 places in 259 ms of which 4 ms to minimize.
[2024-05-28 06:37:26] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:37:26] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 196 places in 248 ms of which 4 ms to minimize.
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 196 places in 238 ms of which 5 ms to minimize.
[2024-05-28 06:37:27] [INFO ] Deduced a trap composed of 196 places in 239 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 3.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 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.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 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.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 2.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 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.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 0.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 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.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 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 1.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 4.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 9.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 765/1869 variables, and 172 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1097/1097 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1097 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/765 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/765 variables, 6/132 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/765 variables, 40/172 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:38] [INFO ] Deduced a trap composed of 200 places in 343 ms of which 5 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 196 places in 321 ms of which 5 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 196 places in 258 ms of which 4 ms to minimize.
[2024-05-28 06:37:39] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 196 places in 261 ms of which 4 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 200 places in 236 ms of which 4 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:37:40] [INFO ] Deduced a trap composed of 200 places in 252 ms of which 4 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 196 places in 256 ms of which 4 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 200 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 6 ms to minimize.
[2024-05-28 06:37:41] [INFO ] Deduced a trap composed of 200 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 196 places in 251 ms of which 4 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 200 places in 261 ms of which 5 ms to minimize.
[2024-05-28 06:37:42] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 196 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 200 places in 245 ms of which 4 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 196 places in 278 ms of which 4 ms to minimize.
[2024-05-28 06:37:43] [INFO ] Deduced a trap composed of 200 places in 233 ms of which 4 ms to minimize.
[2024-05-28 06:37:44] [INFO ] Deduced a trap composed of 196 places in 287 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/765 variables, 20/192 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:47] [INFO ] Deduced a trap composed of 345 places in 272 ms of which 4 ms to minimize.
[2024-05-28 06:37:47] [INFO ] Deduced a trap composed of 335 places in 287 ms of which 6 ms to minimize.
[2024-05-28 06:37:47] [INFO ] Deduced a trap composed of 246 places in 276 ms of which 5 ms to minimize.
[2024-05-28 06:37:48] [INFO ] Deduced a trap composed of 239 places in 262 ms of which 5 ms to minimize.
[2024-05-28 06:37:48] [INFO ] Deduced a trap composed of 246 places in 232 ms of which 4 ms to minimize.
[2024-05-28 06:37:48] [INFO ] Deduced a trap composed of 245 places in 226 ms of which 4 ms to minimize.
[2024-05-28 06:37:48] [INFO ] Deduced a trap composed of 248 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:37:49] [INFO ] Deduced a trap composed of 258 places in 271 ms of which 4 ms to minimize.
[2024-05-28 06:37:49] [INFO ] Deduced a trap composed of 239 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:37:49] [INFO ] Deduced a trap composed of 242 places in 255 ms of which 4 ms to minimize.
[2024-05-28 06:37:50] [INFO ] Deduced a trap composed of 248 places in 254 ms of which 4 ms to minimize.
[2024-05-28 06:37:50] [INFO ] Deduced a trap composed of 306 places in 261 ms of which 5 ms to minimize.
[2024-05-28 06:37:50] [INFO ] Deduced a trap composed of 236 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:37:50] [INFO ] Deduced a trap composed of 242 places in 249 ms of which 4 ms to minimize.
[2024-05-28 06:37:51] [INFO ] Deduced a trap composed of 251 places in 260 ms of which 4 ms to minimize.
[2024-05-28 06:37:51] [INFO ] Deduced a trap composed of 248 places in 250 ms of which 4 ms to minimize.
[2024-05-28 06:37:51] [INFO ] Deduced a trap composed of 236 places in 267 ms of which 4 ms to minimize.
[2024-05-28 06:37:52] [INFO ] Deduced a trap composed of 234 places in 315 ms of which 4 ms to minimize.
[2024-05-28 06:37:52] [INFO ] Deduced a trap composed of 242 places in 264 ms of which 4 ms to minimize.
[2024-05-28 06:37:52] [INFO ] Deduced a trap composed of 251 places in 297 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/765 variables, 20/212 constraints. Problems are: Problem set: 0 solved, 1097 unsolved
[2024-05-28 06:37:58] [INFO ] Deduced a trap composed of 196 places in 362 ms of which 6 ms to minimize.
[2024-05-28 06:37:58] [INFO ] Deduced a trap composed of 196 places in 316 ms of which 5 ms to minimize.
[2024-05-28 06:37:58] [INFO ] Deduced a trap composed of 196 places in 329 ms of which 5 ms to minimize.
[2024-05-28 06:37:59] [INFO ] Deduced a trap composed of 196 places in 337 ms of which 5 ms to minimize.
[2024-05-28 06:37:59] [INFO ] Deduced a trap composed of 196 places in 336 ms of which 5 ms to minimize.
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 196 places in 342 ms of which 5 ms to minimize.
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 196 places in 293 ms of which 4 ms to minimize.
[2024-05-28 06:38:00] [INFO ] Deduced a trap composed of 196 places in 300 ms of which 5 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 196 places in 270 ms of which 4 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 196 places in 246 ms of which 3 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 196 places in 244 ms of which 4 ms to minimize.
[2024-05-28 06:38:01] [INFO ] Deduced a trap composed of 196 places in 247 ms of which 4 ms to minimize.
[2024-05-28 06:38:02] [INFO ] Deduced a trap composed of 196 places in 229 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1)
(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 0)
(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 0)
(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 1)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 1)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 1)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 1)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 1)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 4)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 9)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 1)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 0)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 0)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 0)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 0)
(s455 0)
(s456 0)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 0)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 1)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 0)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 765/1869 variables, and 225 constraints, problems are : Problem set: 0 solved, 1097 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 126/130 constraints, Generalized P Invariants (flows): 6/7 constraints, State Equation: 0/770 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 0/1097 constraints, Known Traps: 93/93 constraints]
After SMT, in 62469ms problems are : Problem set: 0 solved, 1097 unsolved
Search for dead transitions found 0 dead transitions in 62481ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70698 ms. Remains : 770/770 places, 1103/1103 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 770 transition count 1099
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 770 transition count 1098
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 769 transition count 1098
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 769 transition count 1097
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 768 transition count 1097
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 768 transition count 1093
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 16 place count 764 transition count 1093
Applied a total of 16 rules in 133 ms. Remains 764 /770 variables (removed 6) and now considering 1093/1103 (removed 10) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1093 rows 764 cols
[2024-05-28 06:38:04] [INFO ] Computed 137 invariants in 16 ms
[2024-05-28 06:38:04] [INFO ] [Real]Absence check using 130 positive place invariants in 26 ms returned sat
[2024-05-28 06:38:04] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 27 ms returned sat
[2024-05-28 06:38:04] [INFO ] After 238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-28 06:38:04] [INFO ] [Nat]Absence check using 130 positive place invariants in 21 ms returned sat
[2024-05-28 06:38:04] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 17 ms returned sat
[2024-05-28 06:38:05] [INFO ] After 444ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-28 06:38:05] [INFO ] Deduced a trap composed of 240 places in 362 ms of which 6 ms to minimize.
[2024-05-28 06:38:05] [INFO ] Deduced a trap composed of 231 places in 364 ms of which 5 ms to minimize.
[2024-05-28 06:38:06] [INFO ] Deduced a trap composed of 222 places in 296 ms of which 5 ms to minimize.
[2024-05-28 06:38:06] [INFO ] Deduced a trap composed of 255 places in 287 ms of which 6 ms to minimize.
[2024-05-28 06:38:06] [INFO ] Deduced a trap composed of 237 places in 301 ms of which 5 ms to minimize.
[2024-05-28 06:38:07] [INFO ] Deduced a trap composed of 234 places in 313 ms of which 5 ms to minimize.
[2024-05-28 06:38:07] [INFO ] Deduced a trap composed of 231 places in 231 ms of which 3 ms to minimize.
[2024-05-28 06:38:07] [INFO ] Deduced a trap composed of 222 places in 239 ms of which 3 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 231 places in 280 ms of which 4 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 4 ms to minimize.
[2024-05-28 06:38:08] [INFO ] Deduced a trap composed of 231 places in 323 ms of which 6 ms to minimize.
[2024-05-28 06:38:09] [INFO ] Deduced a trap composed of 240 places in 308 ms of which 5 ms to minimize.
[2024-05-28 06:38:09] [INFO ] Deduced a trap composed of 222 places in 320 ms of which 4 ms to minimize.
[2024-05-28 06:38:10] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5321 ms
TRAPS : Iteration 1
[2024-05-28 06:38:10] [INFO ] After 5909ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-28 06:38:10] [INFO ] After 6096ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 6506 ms.
[2024-05-28 06:38:10] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2024-05-28 06:38:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 770 places, 1103 transitions and 5634 arcs took 26 ms.
[2024-05-28 06:38:11] [INFO ] Flatten gal took : 224 ms
Total runtime 222692 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBNT-COL-S05J60
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/418/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 770
TRANSITIONS: 1103
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.048s, Sys 0.008s]
SAVING FILE /home/mcc/execution/418/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.003s]
----------------------------------------------------------------------
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: 982
MODEL NAME: /home/mcc/execution/418/model
770 places, 1103 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
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.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="PolyORBNT-COL-S05J60"
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 PolyORBNT-COL-S05J60, 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 r289-tajo-171654445800391"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J60.tgz
mv PolyORBNT-COL-S05J60 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 '
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 ;