About the Execution of GreatSPN+red for Peterson-COL-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3110.212 | 119484.00 | 159042.00 | 491.60 | FTTFTTTTFFFTFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r267-smll-171654405900223.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 Peterson-COL-4, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405900223
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 9.1K Apr 12 02:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 97K Apr 12 02:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 12 02:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 02:27 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 3.5K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 03:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 44K 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 Peterson-COL-4-ReachabilityFireability-2024-00
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-01
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-02
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-03
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-04
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-05
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-06
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-07
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-08
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-09
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-10
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-11
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-12
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-13
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-14
FORMULA_NAME Peterson-COL-4-ReachabilityFireability-2024-15
=== Now, execution of the tool begins
BK_START 1716733751317
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-COL-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 14:29:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 14:29:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 14:29:14] [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-26 14:29:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-26 14:29:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1029 ms
[2024-05-26 14:29:15] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 26 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Reduction of identical properties reduced properties to check from 16 to 15
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-26 14:29:15] [INFO ] Built PT skeleton of HLPN with 11 places and 14 transitions 42 arcs in 6 ms.
[2024-05-26 14:29:15] [INFO ] Skeletonized 13 HLPN properties in 0 ms.
Remains 1 properties that can be checked using skeleton over-approximation.
Reduce places removed 2 places and 0 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 262 steps (0 resets) in 9 ms. (26 steps per ms) remains 0/1 properties
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2024-05-26 14:29:15] [INFO ] Flatten gal took : 37 ms
[2024-05-26 14:29:15] [INFO ] Flatten gal took : 4 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 )
Domain [Process(5), Tour(4), Process(5)] of place BeginLoop breaks symmetries in sort Process
Arc [2:1*[$i, (MOD (ADD $j 1) 4)]] contains successor/predecessor on variables of sort Tour
Symmetric sort wr.t. initial and guards and successors and join/free detected :Bool
Arc [1:1*[$i, 0]] contains constants of sort Bool
Transition Ask : constants on arcs in [[1:1*[$i, 0]]] introduces in Bool(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-05-26 14:29:15] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions 2280 arcs in 79 ms.
[2024-05-26 14:29:15] [INFO ] Unfolded 13 HLPN properties in 2 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 20 places in 7 ms
Reduce places removed 20 places and 40 transitions.
FORMULA Peterson-COL-4-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 3300 ms. (12 steps per ms) remains 4/10 properties
FORMULA Peterson-COL-4-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 1447 ms. (27 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 5012 ms. (7 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1757 ms. (22 steps per ms) remains 4/4 properties
[2024-05-26 14:29:18] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-26 14:29:18] [INFO ] Computed 19 invariants in 26 ms
[2024-05-26 14:29:19] [INFO ] State equation strengthened by 116 read => feed constraints.
Problem Peterson-COL-4-ReachabilityFireability-2024-02 is UNSAT
FORMULA Peterson-COL-4-ReachabilityFireability-2024-02 TRUE TECHNIQUES SMT_REFINEMENT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/480 variables, 14/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/480 variables, 0/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 630/1110 variables, 480/499 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1110 variables, 116/615 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 1 solved, 3 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 4/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 40/480 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-05-26 14:29:23] [INFO ] Deduced a trap composed of 13 places in 445 ms of which 74 ms to minimize.
[2024-05-26 14:29:23] [INFO ] Deduced a trap composed of 44 places in 307 ms of which 6 ms to minimize.
[2024-05-26 14:29:24] [INFO ] Deduced a trap composed of 28 places in 275 ms of which 5 ms to minimize.
[2024-05-26 14:29:24] [INFO ] Deduced a trap composed of 92 places in 315 ms of which 5 ms to minimize.
[2024-05-26 14:29:25] [INFO ] Deduced a trap composed of 21 places in 366 ms of which 6 ms to minimize.
[2024-05-26 14:29:25] [INFO ] Deduced a trap composed of 18 places in 365 ms of which 7 ms to minimize.
[2024-05-26 14:29:25] [INFO ] Deduced a trap composed of 21 places in 295 ms of which 5 ms to minimize.
[2024-05-26 14:29:26] [INFO ] Deduced a trap composed of 22 places in 272 ms of which 5 ms to minimize.
[2024-05-26 14:29:26] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 4 ms to minimize.
[2024-05-26 14:29:26] [INFO ] Deduced a trap composed of 114 places in 257 ms of which 4 ms to minimize.
[2024-05-26 14:29:26] [INFO ] Deduced a trap composed of 35 places in 339 ms of which 5 ms to minimize.
[2024-05-26 14:29:27] [INFO ] Deduced a trap composed of 88 places in 303 ms of which 5 ms to minimize.
[2024-05-26 14:29:27] [INFO ] Deduced a trap composed of 34 places in 291 ms of which 5 ms to minimize.
[2024-05-26 14:29:27] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 4 ms to minimize.
SMT process timed out in 8988ms, After SMT, problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 440 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 40 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 480/480 places, 690/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 1229 ms. (32 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1276 ms. (31 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 175 ms. (227 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1982 ms. (20 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 269328 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :1 out of 3
Probabilistic random walk after 269328 steps, saw 63643 distinct states, run finished after 3007 ms. (steps per millisecond=89 ) properties seen :1
FORMULA Peterson-COL-4-ReachabilityFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-05-26 14:29:32] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 14:29:32] [INFO ] Invariant cache hit.
[2024-05-26 14:29:32] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 40/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 630/1110 variables, 480/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 116/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 0 solved, 2 unsolved in 932 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/440 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/440 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 40/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:29:34] [INFO ] Deduced a trap composed of 35 places in 247 ms of which 4 ms to minimize.
[2024-05-26 14:29:34] [INFO ] Deduced a trap composed of 60 places in 253 ms of which 5 ms to minimize.
[2024-05-26 14:29:35] [INFO ] Deduced a trap composed of 14 places in 232 ms of which 5 ms to minimize.
[2024-05-26 14:29:35] [INFO ] Deduced a trap composed of 13 places in 425 ms of which 4 ms to minimize.
[2024-05-26 14:29:35] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 4 ms to minimize.
[2024-05-26 14:29:36] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 5 ms to minimize.
[2024-05-26 14:29:36] [INFO ] Deduced a trap composed of 26 places in 261 ms of which 4 ms to minimize.
[2024-05-26 14:29:36] [INFO ] Deduced a trap composed of 14 places in 263 ms of which 4 ms to minimize.
[2024-05-26 14:29:37] [INFO ] Deduced a trap composed of 10 places in 307 ms of which 5 ms to minimize.
[2024-05-26 14:29:37] [INFO ] Deduced a trap composed of 65 places in 340 ms of which 4 ms to minimize.
[2024-05-26 14:29:37] [INFO ] Deduced a trap composed of 32 places in 306 ms of which 5 ms to minimize.
[2024-05-26 14:29:38] [INFO ] Deduced a trap composed of 47 places in 263 ms of which 4 ms to minimize.
[2024-05-26 14:29:38] [INFO ] Deduced a trap composed of 43 places in 209 ms of which 4 ms to minimize.
[2024-05-26 14:29:38] [INFO ] Deduced a trap composed of 22 places in 264 ms of which 4 ms to minimize.
[2024-05-26 14:29:38] [INFO ] Deduced a trap composed of 18 places in 309 ms of which 4 ms to minimize.
[2024-05-26 14:29:39] [INFO ] Deduced a trap composed of 10 places in 230 ms of which 4 ms to minimize.
[2024-05-26 14:29:39] [INFO ] Deduced a trap composed of 10 places in 271 ms of which 4 ms to minimize.
[2024-05-26 14:29:39] [INFO ] Deduced a trap composed of 41 places in 179 ms of which 4 ms to minimize.
[2024-05-26 14:29:40] [INFO ] Deduced a trap composed of 48 places in 222 ms of which 4 ms to minimize.
[2024-05-26 14:29:40] [INFO ] Deduced a trap composed of 47 places in 223 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:29:40] [INFO ] Deduced a trap composed of 39 places in 267 ms of which 4 ms to minimize.
[2024-05-26 14:29:41] [INFO ] Deduced a trap composed of 69 places in 261 ms of which 5 ms to minimize.
[2024-05-26 14:29:41] [INFO ] Deduced a trap composed of 69 places in 263 ms of which 4 ms to minimize.
[2024-05-26 14:29:41] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 5 ms to minimize.
[2024-05-26 14:29:41] [INFO ] Deduced a trap composed of 69 places in 274 ms of which 5 ms to minimize.
[2024-05-26 14:29:42] [INFO ] Deduced a trap composed of 45 places in 248 ms of which 4 ms to minimize.
[2024-05-26 14:29:42] [INFO ] Deduced a trap composed of 40 places in 220 ms of which 4 ms to minimize.
[2024-05-26 14:29:43] [INFO ] Deduced a trap composed of 65 places in 223 ms of which 4 ms to minimize.
[2024-05-26 14:29:43] [INFO ] Deduced a trap composed of 61 places in 216 ms of which 5 ms to minimize.
[2024-05-26 14:29:43] [INFO ] Deduced a trap composed of 40 places in 257 ms of which 5 ms to minimize.
[2024-05-26 14:29:43] [INFO ] Deduced a trap composed of 83 places in 244 ms of which 4 ms to minimize.
[2024-05-26 14:29:44] [INFO ] Deduced a trap composed of 88 places in 236 ms of which 6 ms to minimize.
[2024-05-26 14:29:44] [INFO ] Deduced a trap composed of 50 places in 264 ms of which 5 ms to minimize.
[2024-05-26 14:29:44] [INFO ] Deduced a trap composed of 121 places in 305 ms of which 4 ms to minimize.
[2024-05-26 14:29:45] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 4 ms to minimize.
[2024-05-26 14:29:45] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 4 ms to minimize.
[2024-05-26 14:29:45] [INFO ] Deduced a trap composed of 68 places in 268 ms of which 5 ms to minimize.
[2024-05-26 14:29:46] [INFO ] Deduced a trap composed of 66 places in 240 ms of which 4 ms to minimize.
[2024-05-26 14:29:46] [INFO ] Deduced a trap composed of 103 places in 243 ms of which 4 ms to minimize.
[2024-05-26 14:29:46] [INFO ] Deduced a trap composed of 43 places in 247 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:29:47] [INFO ] Deduced a trap composed of 152 places in 253 ms of which 4 ms to minimize.
[2024-05-26 14:29:47] [INFO ] Deduced a trap composed of 84 places in 249 ms of which 4 ms to minimize.
[2024-05-26 14:29:47] [INFO ] Deduced a trap composed of 18 places in 321 ms of which 4 ms to minimize.
[2024-05-26 14:29:48] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 4 ms to minimize.
[2024-05-26 14:29:49] [INFO ] Deduced a trap composed of 39 places in 203 ms of which 4 ms to minimize.
[2024-05-26 14:29:49] [INFO ] Deduced a trap composed of 47 places in 190 ms of which 4 ms to minimize.
[2024-05-26 14:29:49] [INFO ] Deduced a trap composed of 55 places in 220 ms of which 4 ms to minimize.
[2024-05-26 14:29:49] [INFO ] Deduced a trap composed of 63 places in 197 ms of which 3 ms to minimize.
[2024-05-26 14:29:50] [INFO ] Deduced a trap composed of 36 places in 216 ms of which 7 ms to minimize.
[2024-05-26 14:29:50] [INFO ] Deduced a trap composed of 47 places in 234 ms of which 4 ms to minimize.
[2024-05-26 14:29:50] [INFO ] Deduced a trap composed of 36 places in 200 ms of which 4 ms to minimize.
[2024-05-26 14:29:51] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 4 ms to minimize.
[2024-05-26 14:29:51] [INFO ] Deduced a trap composed of 58 places in 197 ms of which 4 ms to minimize.
[2024-05-26 14:29:51] [INFO ] Deduced a trap composed of 43 places in 195 ms of which 3 ms to minimize.
[2024-05-26 14:29:51] [INFO ] Deduced a trap composed of 35 places in 199 ms of which 5 ms to minimize.
[2024-05-26 14:29:52] [INFO ] Deduced a trap composed of 58 places in 201 ms of which 4 ms to minimize.
[2024-05-26 14:29:52] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 4 ms to minimize.
[2024-05-26 14:29:52] [INFO ] Deduced a trap composed of 84 places in 190 ms of which 4 ms to minimize.
[2024-05-26 14:29:52] [INFO ] Deduced a trap composed of 62 places in 233 ms of which 4 ms to minimize.
[2024-05-26 14:29:53] [INFO ] Deduced a trap composed of 104 places in 205 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 14:29:53] [INFO ] Deduced a trap composed of 54 places in 201 ms of which 4 ms to minimize.
[2024-05-26 14:29:53] [INFO ] Deduced a trap composed of 78 places in 216 ms of which 4 ms to minimize.
[2024-05-26 14:29:54] [INFO ] Deduced a trap composed of 43 places in 232 ms of which 4 ms to minimize.
[2024-05-26 14:29:57] [INFO ] Deduced a trap composed of 84 places in 181 ms of which 4 ms to minimize.
[2024-05-26 14:29:57] [INFO ] Deduced a trap composed of 94 places in 211 ms of which 4 ms to minimize.
[2024-05-26 14:29:57] [INFO ] Deduced a trap composed of 98 places in 228 ms of which 4 ms to minimize.
[2024-05-26 14:29:57] [INFO ] Deduced a trap composed of 84 places in 228 ms of which 4 ms to minimize.
[2024-05-26 14:29:58] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 4 ms to minimize.
[2024-05-26 14:29:58] [INFO ] Deduced a trap composed of 39 places in 177 ms of which 4 ms to minimize.
[2024-05-26 14:30:00] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 4 ms to minimize.
[2024-05-26 14:30:00] [INFO ] Deduced a trap composed of 85 places in 282 ms of which 4 ms to minimize.
[2024-05-26 14:30:00] [INFO ] Deduced a trap composed of 58 places in 264 ms of which 4 ms to minimize.
[2024-05-26 14:30:01] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 4 ms to minimize.
Problem Peterson-COL-4-ReachabilityFireability-2024-00 is UNSAT
FORMULA Peterson-COL-4-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-26 14:30:04] [INFO ] Deduced a trap composed of 81 places in 129 ms of which 3 ms to minimize.
[2024-05-26 14:30:05] [INFO ] Deduced a trap composed of 32 places in 300 ms of which 5 ms to minimize.
[2024-05-26 14:30:05] [INFO ] Deduced a trap composed of 96 places in 242 ms of which 4 ms to minimize.
[2024-05-26 14:30:05] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 17/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 14:30:06] [INFO ] Deduced a trap composed of 54 places in 173 ms of which 4 ms to minimize.
[2024-05-26 14:30:06] [INFO ] Deduced a trap composed of 83 places in 167 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 2/98 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 14:30:06] [INFO ] Deduced a trap composed of 26 places in 207 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/480 variables, 1/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-26 14:30:06] [INFO ] Deduced a trap composed of 80 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/480 variables, 1/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 0/100 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 630/1110 variables, 480/580 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 116/696 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 1/697 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1110 variables, 0/697 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/1110 variables, 0/697 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 697 constraints, problems are : Problem set: 1 solved, 1 unsolved in 40157 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 81/81 constraints]
After SMT, in 41837ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 1388 ms.
Support contains 435 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Applied a total of 0 rules in 20 ms. Remains 480 /480 variables (removed 0) and now considering 690/690 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 480/480 places, 690/690 transitions.
RANDOM walk for 40000 steps (8 resets) in 363 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1749 ms. (22 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 536244 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 536244 steps, saw 108981 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
[2024-05-26 14:30:19] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
[2024-05-26 14:30:19] [INFO ] Invariant cache hit.
[2024-05-26 14:30:19] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/435 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 630/1110 variables, 480/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1110 variables, 116/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1110 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1110/1110 variables, and 615 constraints, problems are : Problem set: 0 solved, 1 unsolved in 710 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 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/435 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/435 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 45/480 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/480 variables, 5/19 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 14:30:20] [INFO ] Deduced a trap composed of 18 places in 254 ms of which 4 ms to minimize.
[2024-05-26 14:30:21] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 4 ms to minimize.
[2024-05-26 14:30:21] [INFO ] Deduced a trap composed of 13 places in 282 ms of which 4 ms to minimize.
[2024-05-26 14:30:21] [INFO ] Deduced a trap composed of 71 places in 264 ms of which 4 ms to minimize.
[2024-05-26 14:30:22] [INFO ] Deduced a trap composed of 27 places in 308 ms of which 4 ms to minimize.
[2024-05-26 14:30:22] [INFO ] Deduced a trap composed of 47 places in 278 ms of which 5 ms to minimize.
[2024-05-26 14:30:22] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 5 ms to minimize.
[2024-05-26 14:30:23] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 5 ms to minimize.
[2024-05-26 14:30:23] [INFO ] Deduced a trap composed of 36 places in 299 ms of which 5 ms to minimize.
[2024-05-26 14:30:23] [INFO ] Deduced a trap composed of 59 places in 296 ms of which 5 ms to minimize.
[2024-05-26 14:30:23] [INFO ] Deduced a trap composed of 36 places in 313 ms of which 5 ms to minimize.
[2024-05-26 14:30:24] [INFO ] Deduced a trap composed of 93 places in 317 ms of which 5 ms to minimize.
[2024-05-26 14:30:24] [INFO ] Deduced a trap composed of 48 places in 213 ms of which 4 ms to minimize.
[2024-05-26 14:30:24] [INFO ] Deduced a trap composed of 80 places in 251 ms of which 4 ms to minimize.
[2024-05-26 14:30:25] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 4 ms to minimize.
[2024-05-26 14:30:25] [INFO ] Deduced a trap composed of 35 places in 154 ms of which 3 ms to minimize.
[2024-05-26 14:30:25] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
[2024-05-26 14:30:25] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2024-05-26 14:30:25] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 3 ms to minimize.
[2024-05-26 14:30:25] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/480 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 14:30:26] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 3 ms to minimize.
[2024-05-26 14:30:26] [INFO ] Deduced a trap composed of 93 places in 201 ms of which 3 ms to minimize.
[2024-05-26 14:30:26] [INFO ] Deduced a trap composed of 38 places in 251 ms of which 4 ms to minimize.
[2024-05-26 14:30:26] [INFO ] Deduced a trap composed of 60 places in 251 ms of which 4 ms to minimize.
[2024-05-26 14:30:27] [INFO ] Deduced a trap composed of 40 places in 215 ms of which 4 ms to minimize.
[2024-05-26 14:30:27] [INFO ] Deduced a trap composed of 96 places in 209 ms of which 4 ms to minimize.
[2024-05-26 14:30:27] [INFO ] Deduced a trap composed of 32 places in 222 ms of which 4 ms to minimize.
[2024-05-26 14:30:27] [INFO ] Deduced a trap composed of 18 places in 203 ms of which 4 ms to minimize.
[2024-05-26 14:30:28] [INFO ] Deduced a trap composed of 39 places in 220 ms of which 3 ms to minimize.
[2024-05-26 14:30:28] [INFO ] Deduced a trap composed of 21 places in 264 ms of which 5 ms to minimize.
[2024-05-26 14:30:28] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 5 ms to minimize.
[2024-05-26 14:30:28] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 4 ms to minimize.
[2024-05-26 14:30:29] [INFO ] Deduced a trap composed of 110 places in 190 ms of which 3 ms to minimize.
[2024-05-26 14:30:29] [INFO ] Deduced a trap composed of 102 places in 192 ms of which 4 ms to minimize.
[2024-05-26 14:30:29] [INFO ] Deduced a trap composed of 63 places in 240 ms of which 4 ms to minimize.
[2024-05-26 14:30:29] [INFO ] Deduced a trap composed of 143 places in 236 ms of which 4 ms to minimize.
[2024-05-26 14:30:30] [INFO ] Deduced a trap composed of 43 places in 233 ms of which 4 ms to minimize.
[2024-05-26 14:30:30] [INFO ] Deduced a trap composed of 49 places in 206 ms of which 5 ms to minimize.
[2024-05-26 14:30:30] [INFO ] Deduced a trap composed of 43 places in 225 ms of which 4 ms to minimize.
[2024-05-26 14:30:31] [INFO ] Deduced a trap composed of 136 places in 198 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 14:30:31] [INFO ] Deduced a trap composed of 92 places in 150 ms of which 3 ms to minimize.
[2024-05-26 14:30:31] [INFO ] Deduced a trap composed of 50 places in 239 ms of which 4 ms to minimize.
[2024-05-26 14:30:31] [INFO ] Deduced a trap composed of 79 places in 117 ms of which 3 ms to minimize.
[2024-05-26 14:30:31] [INFO ] Deduced a trap composed of 80 places in 187 ms of which 4 ms to minimize.
[2024-05-26 14:30:32] [INFO ] Deduced a trap composed of 44 places in 120 ms of which 3 ms to minimize.
[2024-05-26 14:30:32] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 3 ms to minimize.
[2024-05-26 14:30:32] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 2 ms to minimize.
[2024-05-26 14:30:32] [INFO ] Deduced a trap composed of 56 places in 253 ms of which 5 ms to minimize.
[2024-05-26 14:30:33] [INFO ] Deduced a trap composed of 114 places in 271 ms of which 4 ms to minimize.
[2024-05-26 14:30:33] [INFO ] Deduced a trap composed of 49 places in 253 ms of which 4 ms to minimize.
[2024-05-26 14:30:33] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/480 variables, 11/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 14:30:33] [INFO ] Deduced a trap composed of 39 places in 164 ms of which 3 ms to minimize.
[2024-05-26 14:30:34] [INFO ] Deduced a trap composed of 63 places in 265 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/480 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/480 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 630/1110 variables, 480/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1110 variables, 116/668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1110 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 14:30:39] [INFO ] Deduced a trap composed of 70 places in 248 ms of which 4 ms to minimize.
[2024-05-26 14:30:40] [INFO ] Deduced a trap composed of 35 places in 190 ms of which 4 ms to minimize.
[2024-05-26 14:30:41] [INFO ] Deduced a trap composed of 33 places in 269 ms of which 4 ms to minimize.
[2024-05-26 14:30:42] [INFO ] Deduced a trap composed of 76 places in 236 ms of which 4 ms to minimize.
[2024-05-26 14:30:43] [INFO ] Deduced a trap composed of 69 places in 146 ms of which 3 ms to minimize.
[2024-05-26 14:30:43] [INFO ] Deduced a trap composed of 122 places in 171 ms of which 4 ms to minimize.
[2024-05-26 14:30:44] [INFO ] Deduced a trap composed of 87 places in 171 ms of which 4 ms to minimize.
[2024-05-26 14:30:45] [INFO ] Deduced a trap composed of 76 places in 248 ms of which 4 ms to minimize.
[2024-05-26 14:30:46] [INFO ] Deduced a trap composed of 99 places in 148 ms of which 3 ms to minimize.
[2024-05-26 14:30:47] [INFO ] Deduced a trap composed of 83 places in 216 ms of which 4 ms to minimize.
[2024-05-26 14:30:48] [INFO ] Deduced a trap composed of 130 places in 214 ms of which 3 ms to minimize.
[2024-05-26 14:30:49] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 3 ms to minimize.
[2024-05-26 14:30:50] [INFO ] Deduced a trap composed of 43 places in 129 ms of which 3 ms to minimize.
[2024-05-26 14:30:50] [INFO ] Deduced a trap composed of 58 places in 195 ms of which 4 ms to minimize.
[2024-05-26 14:30:51] [INFO ] Deduced a trap composed of 50 places in 165 ms of which 4 ms to minimize.
[2024-05-26 14:30:52] [INFO ] Deduced a trap composed of 80 places in 141 ms of which 4 ms to minimize.
[2024-05-26 14:30:53] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 3 ms to minimize.
[2024-05-26 14:30:54] [INFO ] Deduced a trap composed of 41 places in 191 ms of which 4 ms to minimize.
[2024-05-26 14:30:54] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 3 ms to minimize.
[2024-05-26 14:30:55] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1110 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-26 14:30:57] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 3 ms to minimize.
[2024-05-26 14:30:58] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 2 ms to minimize.
[2024-05-26 14:30:59] [INFO ] Deduced a trap composed of 67 places in 109 ms of which 3 ms to minimize.
[2024-05-26 14:31:00] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-26 14:31:00] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2024-05-26 14:31:01] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2024-05-26 14:31:02] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 2 ms to minimize.
[2024-05-26 14:31:03] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 2 ms to minimize.
[2024-05-26 14:31:04] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/1110 variables, 9/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1110 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/1110 variables, 0/698 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1110/1110 variables, and 698 constraints, problems are : Problem set: 0 solved, 1 unsolved in 49942 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 480/480 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 82/82 constraints]
After SMT, in 51040ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 51295 steps, including 925 resets, run visited all 1 properties in 402 ms. (steps per millisecond=127 )
FORMULA Peterson-COL-4-ReachabilityFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 415 ms.
All properties solved without resorting to model-checking.
Total runtime 116816 ms.
ITS solved all properties within timeout
BK_STOP 1716733870801
--------------------
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="Peterson-COL-4"
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 Peterson-COL-4, 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 r267-smll-171654405900223"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-COL-4.tgz
mv Peterson-COL-4 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 ;