Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r178-tajo-158987882900799.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is DoubleExponent-PT-100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-tajo-158987882900799
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 3.9K Mar 31 07:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Mar 31 07:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Mar 30 00:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 30 00:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.0K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 13K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 27 07:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 24 05:37 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 DoubleExponent-PT-100-ReachabilityFireability-00
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-01
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-02
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-03
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-04
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-05
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-06
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-07
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-08
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-09
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-10
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-11
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-12
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-13
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-14
FORMULA_NAME DoubleExponent-PT-100-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591242909923

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 03:55:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-04 03:55:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 03:55:13] [INFO ] Load time of PNML (sax parser for PT used): 410 ms
[2020-06-04 03:55:13] [INFO ] Transformed 5304 places.
[2020-06-04 03:55:13] [INFO ] Transformed 4998 transitions.
[2020-06-04 03:55:13] [INFO ] Parsed PT model containing 5304 places and 4998 transitions in 650 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 1352 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 324 resets, run finished after 245 ms. (steps per millisecond=40 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 279 resets, run finished after 83 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 117 ms. (steps per millisecond=85 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 274 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 93 ms. (steps per millisecond=107 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 59 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 84 ms. (steps per millisecond=119 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 268 resets, run finished after 55 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 281 resets, run finished after 86 ms. (steps per millisecond=116 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 81 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 278 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 82 ms. (steps per millisecond=121 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 115 ms. (steps per millisecond=86 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 846174 steps, run timeout after 30001 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 846174 steps, saw 423004 distinct states, run finished after 30001 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 4998 rows 5304 cols
[2020-06-04 03:55:47] [INFO ] Invariants computation overflowed in 322 ms
[2020-06-04 03:55:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:55:52] [INFO ] [Real]Absence check using state equation in 3922 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 03:55:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:55:57] [INFO ] [Real]Absence check using state equation in 4404 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 03:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:02] [INFO ] [Real]Absence check using state equation in 4414 ms returned (error "Failed to check-sat")
[2020-06-04 03:56:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:07] [INFO ] [Real]Absence check using state equation in 4484 ms returned (error "Failed to check-sat")
[2020-06-04 03:56:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= s478 (- t383 (+ t384 t385)))") while checking expression at index 4
[2020-06-04 03:56:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:17] [INFO ] [Real]Absence check using state equation in 4286 ms returned (error "Failed to check-sat")
[2020-06-04 03:56:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:22] [INFO ] [Real]Absence check using state equation in 4542 ms returned (error "Failed to check-sat")
[2020-06-04 03:56:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:27] [INFO ] [Real]Absence check using state equation in 4497 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 03:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:32] [INFO ] [Real]Absence check using state equation in 4588 ms returned (error "Failed to check-sat")
[2020-06-04 03:56:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:37] [INFO ] [Real]Absence check using state equation in 4520 ms returned (error "Failed to check-sat")
[2020-06-04 03:56:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:42] [INFO ] [Real]Absence check using state equation in 4441 ms returned unknown
[2020-06-04 03:56:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:47] [INFO ] [Real]Absence check using state equation in 4277 ms returned unknown
[2020-06-04 03:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:52] [INFO ] [Real]Absence check using state equation in 4286 ms returned (error "Failed to check-sat")
[2020-06-04 03:56:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:56:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:56:57] [INFO ] [Real]Absence check using state equation in 4489 ms returned (error "Failed to check-sat")
[2020-06-04 03:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:57:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:57:02] [INFO ] [Real]Absence check using state equation in 4549 ms returned unknown
[2020-06-04 03:57:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:57:07] [INFO ] [Real]Absence check using state equation in 4189 ms returned (error "Solver has unexpectedly terminated")
Support contains 108 out of 5304 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 9096 edges and 5304 vertex of which 5298 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.64 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1128 Post agglomeration using F-continuation condition.Transition count delta: 1128
Iterating post reduction 0 with 1131 rules applied. Total rules applied 1132 place count 5297 transition count 3868
Reduce places removed 1128 places and 0 transitions.
Iterating post reduction 1 with 1128 rules applied. Total rules applied 2260 place count 4169 transition count 3868
Performed 204 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 204 Pre rules applied. Total rules applied 2260 place count 4169 transition count 3664
Deduced a syphon composed of 204 places in 317 ms
Reduce places removed 204 places and 0 transitions.
Iterating global reduction 2 with 408 rules applied. Total rules applied 2668 place count 3965 transition count 3664
Performed 853 Post agglomeration using F-continuation condition.Transition count delta: 853
Deduced a syphon composed of 853 places in 184 ms
Reduce places removed 853 places and 0 transitions.
Iterating global reduction 2 with 1706 rules applied. Total rules applied 4374 place count 3112 transition count 2811
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 101 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4576 place count 3011 transition count 2811
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 172 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 4736 place count 2931 transition count 2811
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4738 place count 2931 transition count 2809
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 4740 place count 2929 transition count 2809
Free-agglomeration rule (complex) applied 405 times.
Iterating global reduction 3 with 405 rules applied. Total rules applied 5145 place count 2929 transition count 2404
Reduce places removed 405 places and 0 transitions.
Iterating post reduction 3 with 405 rules applied. Total rules applied 5550 place count 2524 transition count 2404
Partial Free-agglomeration rule applied 408 times.
Drop transitions removed 408 transitions
Iterating global reduction 4 with 408 rules applied. Total rules applied 5958 place count 2524 transition count 2404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 5959 place count 2523 transition count 2403
Applied a total of 5959 rules in 5493 ms. Remains 2523 /5304 variables (removed 2781) and now considering 2403/4998 (removed 2595) transitions.
Finished structural reductions, in 1 iterations. Remains : 2523/5304 places, 2403/4998 transitions.
Incomplete random walk after 1000000 steps, including 127178 resets, run finished after 8114 ms. (steps per millisecond=123 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 849829 steps, including 71488 resets, run timeout after 5001 ms. (steps per millisecond=169 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84066 resets, run finished after 4784 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 941932 steps, including 79371 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 961396 steps, including 80936 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84225 resets, run finished after 4964 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84213 resets, run finished after 4989 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 83933 resets, run finished after 4953 ms. (steps per millisecond=201 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84048 resets, run finished after 4625 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 948850 steps, including 80181 resets, run timeout after 5001 ms. (steps per millisecond=189 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84143 resets, run finished after 4596 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 958047 steps, including 80827 resets, run timeout after 5001 ms. (steps per millisecond=191 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 928903 steps, including 78424 resets, run timeout after 5001 ms. (steps per millisecond=185 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 942240 steps, including 79695 resets, run timeout after 5001 ms. (steps per millisecond=188 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 83781 resets, run finished after 4559 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 906819 steps, including 76414 resets, run timeout after 5001 ms. (steps per millisecond=181 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 993194 steps, including 83695 resets, run timeout after 5001 ms. (steps per millisecond=198 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 1421556 steps, run timeout after 30001 ms. (steps per millisecond=47 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 1421556 steps, saw 710186 distinct states, run finished after 30001 ms. (steps per millisecond=47 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2403 rows 2523 cols
[2020-06-04 03:59:10] [INFO ] Invariants computation overflowed in 92 ms
[2020-06-04 03:59:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 03:59:34] [INFO ] [Real]Absence check using state equation in 23982 ms returned sat
[2020-06-04 03:59:34] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 03:59:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 03:59:56] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 03:59:56] [INFO ] [Nat]Absence check using state equation in 21512 ms returned sat
[2020-06-04 03:59:56] [INFO ] State equation strengthened by 370 read => feed constraints.
[2020-06-04 03:59:59] [INFO ] [Nat]Added 370 Read/Feed constraints in 2500 ms returned sat
[2020-06-04 04:00:05] [INFO ] Deduced a trap composed of 2 places in 6465 ms
[2020-06-04 04:00:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 6790 ms
[2020-06-04 04:00:06] [INFO ] Computed and/alt/rep : 2402/25958/2402 causal constraints in 351 ms.
[2020-06-04 04:00:19] [INFO ] Added : 310 causal constraints over 62 iterations in 13869 ms. Result :(error "Failed to check-sat")
[2020-06-04 04:00:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:00:42] [INFO ] [Real]Absence check using state equation in 22936 ms returned sat
[2020-06-04 04:00:43] [INFO ] [Real]Added 370 Read/Feed constraints in 525 ms returned sat
[2020-06-04 04:00:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:00:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:00:59] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:01:02] [INFO ] [Nat]Absence check using state equation in 18650 ms returned unknown
[2020-06-04 04:01:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:01:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:01:47] [INFO ] [Real]Absence check using state equation in 44523 ms returned (error "Failed to check-sat")
[2020-06-04 04:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:02:19] [INFO ] [Real]Absence check using state equation in 31381 ms returned sat
[2020-06-04 04:02:19] [INFO ] [Real]Added 370 Read/Feed constraints in 148 ms returned sat
[2020-06-04 04:02:23] [INFO ] Deduced a trap composed of 9 places in 3281 ms
[2020-06-04 04:02:27] [INFO ] Deduced a trap composed of 2 places in 3555 ms
[2020-06-04 04:02:29] [INFO ] Deduced a trap composed of 4 places in 1975 ms
[2020-06-04 04:02:29] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 9267 ms
[2020-06-04 04:02:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:02:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:02:55] [INFO ] [Nat]Absence check using state equation in 25563 ms returned sat
[2020-06-04 04:02:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:02:59] [INFO ] [Nat]Added 370 Read/Feed constraints in 4326 ms returned sat
[2020-06-04 04:03:03] [INFO ] Deduced a trap composed of 9 places in 4098 ms
[2020-06-04 04:03:05] [INFO ] Deduced a trap composed of 2 places in 1634 ms
[2020-06-04 04:03:07] [INFO ] Deduced a trap composed of 9 places in 1480 ms
[2020-06-04 04:03:08] [INFO ] Deduced a trap composed of 11 places in 1479 ms
[2020-06-04 04:03:10] [INFO ] Deduced a trap composed of 15 places in 1505 ms
[2020-06-04 04:03:11] [INFO ] Deduced a trap composed of 8 places in 1443 ms
[2020-06-04 04:03:13] [INFO ] Deduced a trap composed of 9 places in 1512 ms
[2020-06-04 04:03:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 14124 ms
[2020-06-04 04:03:14] [INFO ] Computed and/alt/rep : 2402/25958/2402 causal constraints in 337 ms.
[2020-06-04 04:03:14] [INFO ] Added : 5 causal constraints over 1 iterations in 602 ms. Result :unknown
[2020-06-04 04:03:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:03:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:03:51] [INFO ] [Real]Absence check using state equation in 36541 ms returned sat
[2020-06-04 04:03:51] [INFO ] [Real]Added 370 Read/Feed constraints in 720 ms returned sat
[2020-06-04 04:03:57] [INFO ] Deduced a trap composed of 12 places in 5076 ms
[2020-06-04 04:04:01] [INFO ] Deduced a trap composed of 662 places in 3946 ms
[2020-06-04 04:04:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s2 s4 s9 s11 s15 s22 s31 s32 s33 s39 s40 s45 s49 s50 s51 s59 s61 s64 s67 s71 s74 s78 s89 s94 s95 s96 s102 s103 s114 s116 s119 s123 s125 s127 s132 s134 s135 s137 s139 s148 s149 s150 s155 s159 s162 s174 s175 s177 s178 s180 s185 s186 s187 s190 s205 s206 s207 s209 s212 s218 s219 s233 s237 s240 s241 s242 s243 s247 s248 s249 s250 s252 s259 s262 s264 s269 s270 s271 s272 s283 s285 s286 s293 s298 s311 s312 s313 s314 s315 s316 s318 s319 s320 s325 s328 s331 s343 s345 s349 s362 s365 s378 s384 s387 s388 s390 s395 s396 s401 s403 s404 s405 s407 s408 s411 s412 s414 s415 s419 s420 s421 s426 s432 s434 s435 s438 s442 s446 s451 s464 s466 s470 s475 s477 s480 s484 s492 s497 s505 s507 s521 s525 s527 s528 s532 s535 s545 s547 s548 s549 s552 s553 s557 s558 s559 s562 s569 s576 s578 s579 s580 s581 s582 s583 s587 s595 s608 s612 s613 s616 s632 s634 s643 s649 s651 s652 s654 s655 s659 s669 s675 s676 s678 s681 s692 s693 s694 s696 s697 s702 s707 s708 s717 s718 s723 s727 s734 s745 s747 s751 s752 s755 s759 s768 s771 s778 s782 s787 s797 s800 s807 s810 s812 s821 s822 s823 s824 s826 s831 s832 s835 s847 s848 s850 s854 s858 s859 s862 s868 s875 s885 s887 s890 s903 s905 s915 s916 s919 s932 s934 s939 s943 s946 s951 s968 s975 s977 s978 s994 s995 s998 s1005 s1020 s1021 s1022 s1023 s1024 s1027 s1040 s1041 s1044 s1047 s1053 s1054 s1055 s1058 s1071 s1072 s1074 s1086 s1087 s1089 s1092 s1098 s1103 s1114 s1116 s1120 s1121 s1126 s1127 s1129 s1138 s1143 s1146 s1157 s1158 s1159 s1160 s1162 s1163 s1166 s1167 s1168 s1171 s1176 s1200 s1206 s1207 s1216 s1218 s1220 s1223 s1224 s1227 s1239 s1241 s1248 s1256 s1258 s1259 s1280 s1282 s1283 s1285 s1286 s1292 s1294 s1295 s1296 s1297 s1298 s1300 s1302 s1303 s1306 s1310 s1311 s1313 s1317 s1330 s1332 s1334 s1337 s1342 s1360 s1364 s1367 s1370 s1382 s1384 s1385 s1391 s1392 s1395 s1398 s1408 s1409 s1411 s1418 s1419 s1421 s1427 s1429 s1435 s1445 s1448 s1450 s1451 s1452 s1463 s1464 s1465 s1470 s1471 s1472 s1473 s1474 s1475 s1478 s1484 s1485 s1504 s1508 s1510 s1511 s1517 s1519 s1521 s1525 s1529 s1532 s1534 s1539 s1541 s1543 s1549 s1551 s1552 s1559 s1561 s1563 s1566 s1567 s1568 s1572 s1573 s1574 s1580 s1582 s1587 s1588 s1589 s1592 s1607 s1610 s1613 s1619 s1625 s1627 s1629 s1632 s1635 s1636 s1641 s1642 s1643 s1653 s1654 s1655 s1660 s1662 s1667 s1669 s1673 s1681 s1687 s1689 s1692 s1694 s1696 s1697 s1698 s1708 s1710 s1711 s1712 s1715 s1720 s1721 s1722 s1726 s1728 s1735 s1737 s1738 s1739 s1740 s1741 s1743 s1748 s1758 s1761 s1762 s1771 s1772 s1773 s1777 s1778 s1780 s1782 s1785 s1788 s1790 s1804 s1808 s1810 s1813 s1815 s1817 s1818 s1835 s1839 s1845 s1856 s1858 s1859 s1862 s1865 s1866 s1868 s1872 s1884 s1888 s1895 s1896 s1904 s1905 s1906 s1907 s1908 s1911 s1917 s1924 s1926 s1939 s1940 s1942 s1944 s1948 s1950 s1958 s1960 s1963 s1966 s1967 s1968 s1969 s1970 s1971 s1976 s1978 s1985 s1986 s1987 s1989 s1990 s1995 s2004 s2005 s2006 s2009 s2026 s2028 s2029 s2030 s2032 s2035 s2041 s2042 s2054 s2059 s2064 s2066 s2073 s2074 s2075 s2076 s2077 s2078 s2079 s2084 s2092 s2093 s2094 s2095 s2107 s2114 s2128 s2129 s2130 s2132 s2133 s2135 s2136 s2137 s2138 s2139 s2142 s2154 s2157 s2168 s2171 s2174 s2184 s2187 s2196 s2199 s2210 s2211 s2212 s2213 s2214 s2216 s2221 s2222 s2226 s2240 s2241 s2242 s2243 s2244 s2245 s2252 s2254 s2255 s2257 s2258 s2265 s2266 s2272 s2281 s2282 s2283 s2292 s2293 s2294 s2296 s2298 s2303 s2308 s2310 s2311 s2312 s2315 s2319 s2329 s2330 s2331 s2332 s2338 s2340 s2342 s2346 s2353 s2354 s2357 s2358 s2362 s2363 s2368 s2369 s2370 s2371 s2372 s2373 s2378 s2380 s2381 s2385 s2389 s2391 s2393 s2396 s2414 s2419 s2431 s2433 s2434 s2435 s2437 s2441 s2445 s2448 s2451 s2461 s2463 s2477 s2478 s2480 s2481 s2482 s2483 s2484 s2486 s2497 s2501 s2503 s2516 s2518 s2519) 0)") while checking expression at index 4
[2020-06-04 04:04:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:04:46] [INFO ] [Real]Absence check using state equation in 44814 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 04:04:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:05:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:05:31] [INFO ] [Real]Absence check using state equation in 44738 ms returned unknown
[2020-06-04 04:05:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:06:05] [INFO ] [Real]Absence check using state equation in 33559 ms returned sat
[2020-06-04 04:06:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:06:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:06:34] [INFO ] [Nat]Absence check using state equation in 29080 ms returned sat
[2020-06-04 04:06:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:06:40] [INFO ] [Nat]Added 370 Read/Feed constraints in 6056 ms returned unknown
[2020-06-04 04:06:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:06:58] [INFO ] [Real]Absence check using state equation in 17318 ms returned sat
[2020-06-04 04:06:58] [INFO ] [Real]Added 370 Read/Feed constraints in 102 ms returned sat
[2020-06-04 04:07:11] [INFO ] Deduced a trap composed of 29 places in 13209 ms
[2020-06-04 04:07:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 13535 ms
[2020-06-04 04:07:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:07:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:07:27] [INFO ] [Nat]Absence check using state equation in 15578 ms returned sat
[2020-06-04 04:07:31] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:07:34] [INFO ] [Nat]Added 370 Read/Feed constraints in 6187 ms returned unknown
[2020-06-04 04:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:07:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:07:53] [INFO ] [Real]Absence check using state equation in 18731 ms returned unknown
[2020-06-04 04:07:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:08:23] [INFO ] [Real]Absence check using state equation in 29891 ms returned sat
[2020-06-04 04:08:23] [INFO ] [Real]Added 370 Read/Feed constraints in 110 ms returned sat
[2020-06-04 04:08:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:08:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:08:38] [INFO ] [Nat]Absence check using state equation in 15013 ms returned sat
[2020-06-04 04:08:40] [INFO ] [Nat]Added 370 Read/Feed constraints in 1179 ms returned sat
[2020-06-04 04:08:42] [INFO ] Deduced a trap composed of 8 places in 2306 ms
[2020-06-04 04:08:44] [INFO ] Deduced a trap composed of 4 places in 2124 ms
[2020-06-04 04:08:47] [INFO ] Deduced a trap composed of 2 places in 2801 ms
[2020-06-04 04:08:50] [INFO ] Deduced a trap composed of 14 places in 2858 ms
[2020-06-04 04:08:56] [INFO ] Deduced a trap composed of 7 places in 6112 ms
[2020-06-04 04:09:05] [INFO ] Deduced a trap composed of 8 places in 8288 ms
[2020-06-04 04:09:16] [INFO ] Deduced a trap composed of 12 places in 10959 ms
[2020-06-04 04:09:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s6 s166 s331 s962 s1070 s1125 s1284 s2120 s2290 s2309 s2418 s2517) 0)") while checking expression at index 10
[2020-06-04 04:09:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:10:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:10:01] [INFO ] [Real]Absence check using state equation in 44754 ms returned (error "Failed to check-sat")
[2020-06-04 04:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:10:30] [INFO ] [Real]Absence check using state equation in 28835 ms returned sat
[2020-06-04 04:10:30] [INFO ] [Real]Added 370 Read/Feed constraints in 62 ms returned sat
[2020-06-04 04:10:35] [INFO ] Deduced a trap composed of 5 places in 4358 ms
[2020-06-04 04:10:41] [INFO ] Deduced a trap composed of 9 places in 6798 ms
[2020-06-04 04:10:46] [INFO ] Deduced a trap composed of 12 places in 4717 ms
[2020-06-04 04:10:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s6 s331 s659 s962 s1070 s1125 s1284 s1388 s1595 s1759 s2418 s2517) 0)") while checking expression at index 12
[2020-06-04 04:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:11:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:11:04] [INFO ] [Real]Absence check using state equation in 17268 ms returned unknown
[2020-06-04 04:11:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:11:21] [INFO ] [Real]Absence check using state equation in 17012 ms returned sat
[2020-06-04 04:11:22] [INFO ] [Real]Added 370 Read/Feed constraints in 487 ms returned sat
[2020-06-04 04:11:28] [INFO ] Deduced a trap composed of 10 places in 6210 ms
[2020-06-04 04:11:37] [INFO ] Deduced a trap composed of 12 places in 9016 ms
[2020-06-04 04:11:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 15622 ms
[2020-06-04 04:11:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:11:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:11:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:11:53] [INFO ] [Nat]Absence check using state equation in 15312 ms returned unknown
[2020-06-04 04:11:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:12:33] [INFO ] [Real]Absence check using state equation in 39183 ms returned sat
[2020-06-04 04:12:33] [INFO ] [Real]Added 370 Read/Feed constraints in 165 ms returned sat
[2020-06-04 04:12:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:12:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:13:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:13:18] [INFO ] [Nat]Absence check using state equation in 44808 ms returned (error "Failed to check-sat")
This parikh vector is obviously unfeasible : no match in initial state.
Support contains 108 out of 2523 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2523/2523 places, 2403/2403 transitions.
Applied a total of 0 rules in 280 ms. Remains 2523 /2523 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2523/2523 places, 2403/2403 transitions.
Starting structural reductions, iteration 0 : 2523/2523 places, 2403/2403 transitions.
Applied a total of 0 rules in 194 ms. Remains 2523 /2523 variables (removed 0) and now considering 2403/2403 (removed 0) transitions.
// Phase 1: matrix 2403 rows 2523 cols
[2020-06-04 04:13:18] [INFO ] Invariants computation overflowed in 64 ms
[2020-06-04 04:13:36] [INFO ] Implicit Places using invariants in 18026 ms returned []
// Phase 1: matrix 2403 rows 2523 cols
[2020-06-04 04:13:37] [INFO ] Invariants computation overflowed in 70 ms
[2020-06-04 04:13:56] [INFO ] Implicit Places using invariants and state equation in 19897 ms returned []
Implicit Place search using SMT with State Equation took 37930 ms to find 0 implicit places.
[2020-06-04 04:13:57] [INFO ] Redundant transitions in 215 ms returned []
// Phase 1: matrix 2403 rows 2523 cols
[2020-06-04 04:13:57] [INFO ] Invariants computation overflowed in 68 ms
[2020-06-04 04:14:05] [INFO ] Dead Transitions using invariants and state equation in 8033 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2523/2523 places, 2403/2403 transitions.
Incomplete random walk after 100000 steps, including 12734 resets, run finished after 1135 ms. (steps per millisecond=88 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2403 rows 2523 cols
[2020-06-04 04:14:06] [INFO ] Invariants computation overflowed in 45 ms
[2020-06-04 04:14:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:14:26] [INFO ] [Real]Absence check using state equation in 19734 ms returned sat
[2020-06-04 04:14:26] [INFO ] State equation strengthened by 370 read => feed constraints.
[2020-06-04 04:14:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t207 0) (or (> t622 0) (> t1027 0) (> t2213 0)))") while checking expression at index 0
[2020-06-04 04:14:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:14:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:14:46] [INFO ] [Real]Absence check using state equation in 19754 ms returned (error "Failed to check-sat")
[2020-06-04 04:14:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:15:06] [INFO ] [Real]Absence check using state equation in 19435 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 04:15:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:15:26] [INFO ] [Real]Absence check using state equation in 19782 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 04:15:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:15:46] [INFO ] [Real]Absence check using state equation in 19743 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 04:15:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:16:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:16:06] [INFO ] [Real]Absence check using state equation in 19899 ms returned (error "Failed to check-sat")
[2020-06-04 04:16:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:16:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:16:26] [INFO ] [Real]Absence check using state equation in 19652 ms returned (error "Failed to check-sat")
[2020-06-04 04:16:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:16:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:16:46] [INFO ] [Real]Absence check using state equation in 19665 ms returned (error "Failed to check-sat")
[2020-06-04 04:16:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:17:05] [INFO ] [Real]Absence check using state equation in 18850 ms returned sat
[2020-06-04 04:17:05] [INFO ] [Real]Added 370 Read/Feed constraints in 91 ms returned sat
[2020-06-04 04:17:10] [INFO ] Deduced a trap composed of 29 places in 4491 ms
[2020-06-04 04:17:10] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s92 s108 s124 s136 s219 s331 s378 s408 s421 s659 s669 s698 s708 s759 s939 s968 s978 s1220 s1249 s1259 s1500 s1736 s1842 s1855 s2252 s2319 s2330 s2358 s2369) 0)") while checking expression at index 8
[2020-06-04 04:17:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:17:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:17:30] [INFO ] [Real]Absence check using state equation in 19796 ms returned unknown
[2020-06-04 04:17:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:17:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:17:50] [INFO ] [Real]Absence check using state equation in 19799 ms returned (error "Failed to check-sat")
[2020-06-04 04:17:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:18:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:18:10] [INFO ] [Real]Absence check using state equation in 19725 ms returned (error "Failed to check-sat")
[2020-06-04 04:18:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:18:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:18:30] [INFO ] [Real]Absence check using state equation in 19711 ms returned (error "Failed to check-sat")
[2020-06-04 04:18:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:18:46] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:18:49] [INFO ] [Real]Absence check using state equation in 18601 ms returned unknown
[2020-06-04 04:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:19:00] [INFO ] [Real]Absence check using state equation in 11103 ms returned sat
[2020-06-04 04:19:01] [INFO ] [Real]Added 370 Read/Feed constraints in 423 ms returned sat
[2020-06-04 04:19:06] [INFO ] Deduced a trap composed of 10 places in 4864 ms
[2020-06-04 04:19:17] [INFO ] Deduced a trap composed of 12 places in 11397 ms
[2020-06-04 04:19:17] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s219 s284 s295 s310 s331 s2285 s2330 s2358 s2392 s2401 s2452 s2469) 0)") while checking expression at index 14
[2020-06-04 04:19:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:19:37] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:19:37] [INFO ] [Real]Absence check using state equation in 19795 ms returned (error "Failed to check-sat")
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 2523 transition count 2393
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 2513 transition count 2393
Performed 167 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 167 Pre rules applied. Total rules applied 20 place count 2513 transition count 2226
Deduced a syphon composed of 167 places in 51 ms
Reduce places removed 167 places and 0 transitions.
Iterating global reduction 2 with 334 rules applied. Total rules applied 354 place count 2346 transition count 2226
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 356 place count 2346 transition count 2224
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 358 place count 2344 transition count 2224
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 359 place count 2344 transition count 2223
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 360 place count 2343 transition count 2223
Applied a total of 360 rules in 662 ms. Remains 2343 /2523 variables (removed 180) and now considering 2223/2403 (removed 180) transitions.
// Phase 1: matrix 2223 rows 2343 cols
[2020-06-04 04:19:38] [INFO ] Invariants computation overflowed in 37 ms
[2020-06-04 04:19:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:19:54] [INFO ] [Real]Absence check using state equation in 15374 ms returned sat
[2020-06-04 04:19:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:19:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:20:08] [INFO ] [Nat]Absence check using state equation in 14507 ms returned sat
[2020-06-04 04:20:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-04 04:20:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 102 ms returned sat
[2020-06-04 04:20:10] [INFO ] Deduced a trap composed of 4 places in 1511 ms
[2020-06-04 04:20:12] [INFO ] Deduced a trap composed of 4 places in 1472 ms
[2020-06-04 04:20:13] [INFO ] Deduced a trap composed of 2 places in 1408 ms
[2020-06-04 04:20:15] [INFO ] Deduced a trap composed of 7 places in 1962 ms
[2020-06-04 04:20:17] [INFO ] Deduced a trap composed of 9 places in 1415 ms
[2020-06-04 04:20:18] [INFO ] Deduced a trap composed of 8 places in 1495 ms
[2020-06-04 04:20:20] [INFO ] Deduced a trap composed of 10 places in 1484 ms
[2020-06-04 04:20:21] [INFO ] Deduced a trap composed of 14 places in 1433 ms
[2020-06-04 04:20:23] [INFO ] Deduced a trap composed of 15 places in 1413 ms
[2020-06-04 04:20:24] [INFO ] Deduced a trap composed of 5 places in 1275 ms
[2020-06-04 04:20:26] [INFO ] Deduced a trap composed of 9 places in 1311 ms
[2020-06-04 04:20:26] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 17293 ms
[2020-06-04 04:20:26] [INFO ] Computed and/alt/rep : 2222/25043/2222 causal constraints in 260 ms.
[2020-06-04 04:20:39] [INFO ] Added : 205 causal constraints over 41 iterations in 12858 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 04:20:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:21:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:21:08] [INFO ] [Real]Absence check using state equation in 28615 ms returned unknown
[2020-06-04 04:21:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:21:53] [INFO ] [Real]Absence check using state equation in 44788 ms returned (error "Solver has unexpectedly terminated")
[2020-06-04 04:21:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:22:23] [INFO ] [Real]Absence check using state equation in 29886 ms returned sat
[2020-06-04 04:22:23] [INFO ] [Real]Added 1 Read/Feed constraints in 72 ms returned sat
[2020-06-04 04:22:26] [INFO ] Deduced a trap composed of 2 places in 2312 ms
[2020-06-04 04:22:28] [INFO ] Deduced a trap composed of 9 places in 2292 ms
[2020-06-04 04:22:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 4961 ms
[2020-06-04 04:22:28] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:22:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:23:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:23:09] [INFO ] [Nat]Absence check using state equation in 39983 ms returned sat
[2020-06-04 04:23:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:23:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 4774 ms returned unknown
[2020-06-04 04:23:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:23:27] [INFO ] [Real]Absence check using state equation in 13458 ms returned sat
[2020-06-04 04:23:27] [INFO ] [Real]Added 1 Read/Feed constraints in 31 ms returned sat
[2020-06-04 04:23:32] [INFO ] Deduced a trap composed of 21 places in 4572 ms
[2020-06-04 04:23:37] [INFO ] Deduced a trap composed of 16 places in 5034 ms
[2020-06-04 04:23:41] [INFO ] Deduced a trap composed of 56 places in 4282 ms
[2020-06-04 04:23:46] [INFO ] Deduced a trap composed of 72 places in 4336 ms
[2020-06-04 04:23:50] [INFO ] Deduced a trap composed of 670 places in 4323 ms
[2020-06-04 04:24:04] [INFO ] Deduced a trap composed of 664 places in 13101 ms
[2020-06-04 04:24:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s2 s3 s11 s12 s13 s15 s16 s17 s21 s28 s29 s30 s31 s33 s37 s38 s39 s51 s52 s58 s59 s61 s63 s67 s70 s73 s79 s80 s83 s86 s88 s96 s97 s100 s102 s112 s118 s120 s122 s124 s125 s128 s129 s130 s131 s134 s135 s139 s140 s141 s142 s147 s148 s149 s150 s151 s159 s160 s161 s166 s169 s175 s183 s185 s189 s190 s197 s199 s200 s201 s204 s205 s215 s216 s217 s221 s222 s225 s227 s236 s237 s241 s245 s250 s253 s254 s256 s257 s265 s270 s275 s281 s283 s298 s299 s300 s301 s302 s303 s304 s305 s306 s307 s308 s310 s311 s314 s326 s327 s328 s331 s333 s336 s339 s342 s353 s356 s357 s360 s365 s370 s376 s377 s380 s382 s388 s389 s390 s391 s393 s399 s400 s401 s403 s410 s417 s418 s419 s422 s423 s428 s437 s438 s439 s440 s442 s445 s449 s451 s462 s463 s464 s465 s466 s467 s468 s471 s481 s482 s484 s490 s491 s495 s497 s501 s505 s513 s515 s517 s520 s524 s526 s533 s535 s539 s544 s545 s547 s549 s551 s552 s553 s554 s564 s565 s568 s572 s573 s574 s577 s580 s585 s599 s604 s607 s611 s615 s618 s625 s627 s630 s635 s636 s637 s644 s645 s650 s651 s652 s653 s661 s663 s674 s678 s681 s684 s693 s694 s695 s699 s700 s701 s702 s706 s708 s710 s711 s713 s725 s726 s729 s732 s734 s736 s737 s750 s751 s752 s755 s760 s764 s771 s775 s777 s780 s782 s783 s785 s791 s799 s801 s803 s805 s806 s807 s811 s812 s813 s817 s818 s821 s822 s826 s830 s832 s835 s848 s851 s861 s863 s864 s875 s878 s880 s882 s883 s884 s892 s893 s898 s899 s900 s901 s902 s904 s907 s909 s912 s917 s918 s919 s920 s922 s933 s934 s943 s944 s945 s946 s948 s949 s953 s956 s963 s968 s974 s976 s977 s978 s979 s981 s982 s983 s986 s988 s992 s993 s996 s997 s999 s1007 s1012 s1013 s1014 s1022 s1023 s1027 s1033 s1036 s1038 s1042 s1043 s1050 s1055 s1060 s1066 s1067 s1068 s1077 s1078 s1079 s1080 s1082 s1086 s1090 s1092 s1095 s1109 s1110 s1112 s1116 s1117 s1120 s1128 s1129 s1130 s1132 s1135 s1138 s1139 s1142 s1153 s1154 s1162 s1163 s1166 s1171 s1180 s1190 s1191 s1194 s1198 s1205 s1206 s1215 s1216 s1220 s1226 s1237 s1242 s1245 s1247 s1249 s1250 s1251 s1252 s1263 s1264 s1268 s1270 s1271 s1280 s1282 s1283 s1286 s1288 s1291 s1293 s1294 s1297 s1300 s1304 s1310 s1319 s1320 s1321 s1324 s1335 s1336 s1343 s1344 s1347 s1348 s1350 s1353 s1365 s1368 s1371 s1374 s1376 s1380 s1386 s1387 s1388 s1389 s1397 s1398 s1401 s1404 s1407 s1423 s1426 s1437 s1438 s1445 s1446 s1449 s1461 s1462 s1471 s1474 s1480 s1496 s1499 s1505 s1510 s1511 s1518 s1519 s1520 s1523 s1535 s1536 s1548 s1550 s1554 s1562 s1568 s1569 s1571 s1572 s1575 s1581 s1586 s1587 s1598 s1599 s1602 s1614 s1615 s1616 s1617 s1619 s1626 s1629 s1630 s1633 s1640 s1646 s1647 s1662 s1664 s1681 s1684 s1689 s1696 s1703 s1704 s1705 s1706 s1709 s1711 s1712 s1714 s1717 s1718 s1721 s1722 s1726 s1730 s1734 s1736 s1745 s1747 s1751 s1761 s1763 s1764 s1779 s1782 s1785 s1787 s1789 s1800 s1801 s1803 s1804 s1811 s1812 s1814 s1815 s1821 s1826 s1829 s1837 s1839 s1847 s1854 s1855 s1856 s1858 s1861 s1862 s1864 s1868 s1876 s1881 s1883 s1884 s1885 s1888 s1889 s1892 s1904 s1905 s1914 s1915 s1918 s1929 s1930 s1939 s1942 s1947 s1948 s1964 s1966 s1967 s1969 s1977 s1978 s1982 s1986 s1991 s1992 s1993 s1996 s2007 s2009 s2011 s2014 s2017 s2020 s2032 s2036 s2037 s2040 s2043 s2051 s2053 s2054 s2058 s2061 s2063 s2064 s2065 s2068 s2081 s2083 s2091 s2095 s2115 s2117 s2122 s2136 s2138 s2139 s2147 s2148 s2149 s2151 s2154 s2165 s2168 s2173 s2174 s2175 s2182 s2183 s2187 s2188 s2189 s2190 s2196 s2197 s2198 s2201 s2202 s2212 s2214 s2215 s2223 s2224 s2225 s2226 s2227 s2236 s2240 s2243 s2251 s2252 s2253 s2254 s2260 s2265 s2266 s2267 s2268 s2275 s2276 s2277 s2284 s2285 s2286 s2287 s2289 s2290 s2291 s2294 s2301 s2302 s2303 s2310 s2311 s2312 s2313 s2315 s2316 s2318 s2326 s2327 s2328 s2330 s2331) 0)") while checking expression at index 4
[2020-06-04 04:24:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:24:49] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:24:49] [INFO ] [Real]Absence check using state equation in 44689 ms returned (error "Failed to check-sat")
[2020-06-04 04:24:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:25:00] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:25:03] [INFO ] [Real]Absence check using state equation in 13388 ms returned unknown
[2020-06-04 04:25:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:25:33] [INFO ] [Real]Absence check using state equation in 29601 ms returned sat
[2020-06-04 04:25:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:25:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:26:03] [INFO ] [Nat]Absence check using state equation in 30053 ms returned sat
[2020-06-04 04:26:07] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:26:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 7343 ms returned unknown
[2020-06-04 04:26:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:26:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:26:35] [INFO ] [Real]Absence check using state equation in 24645 ms returned sat
[2020-06-04 04:26:35] [INFO ] [Real]Added 1 Read/Feed constraints in 30 ms returned sat
[2020-06-04 04:26:39] [INFO ] Deduced a trap composed of 30 places in 3781 ms
[2020-06-04 04:26:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 4080 ms
[2020-06-04 04:26:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:26:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:27:08] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:27:08] [INFO ] [Nat]Absence check using state equation in 28271 ms returned sat
[2020-06-04 04:27:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:27:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 6334 ms returned unknown
[2020-06-04 04:27:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:27:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:27:38] [INFO ] [Real]Absence check using state equation in 22727 ms returned unknown
[2020-06-04 04:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:28:03] [INFO ] [Real]Absence check using state equation in 24800 ms returned sat
[2020-06-04 04:28:03] [INFO ] [Real]Added 1 Read/Feed constraints in 25 ms returned sat
[2020-06-04 04:28:06] [INFO ] Deduced a trap composed of 2 places in 3278 ms
[2020-06-04 04:28:09] [INFO ] Deduced a trap composed of 13 places in 2387 ms
[2020-06-04 04:28:11] [INFO ] Deduced a trap composed of 7 places in 2505 ms
[2020-06-04 04:28:14] [INFO ] Deduced a trap composed of 7 places in 2894 ms
[2020-06-04 04:28:17] [INFO ] Deduced a trap composed of 17 places in 2359 ms
[2020-06-04 04:28:19] [INFO ] Deduced a trap composed of 11 places in 2709 ms
[2020-06-04 04:28:26] [INFO ] Deduced a trap composed of 5 places in 6188 ms
[2020-06-04 04:28:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s6 s310 s896 s1046) 0)") while checking expression at index 10
[2020-06-04 04:28:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:28:49] [INFO ] [Real]Absence check using state equation in 23147 ms returned sat
[2020-06-04 04:28:49] [INFO ] [Real]Added 1 Read/Feed constraints in 88 ms returned sat
[2020-06-04 04:29:02] [INFO ] Deduced a trap composed of 2 places in 12375 ms
[2020-06-04 04:29:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 12588 ms
[2020-06-04 04:29:02] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:29:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:29:26] [INFO ] [Nat]Absence check using state equation in 24265 ms returned unknown
[2020-06-04 04:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:29:44] [INFO ] [Real]Absence check using state equation in 17388 ms returned unsat
[2020-06-04 04:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:30:09] [INFO ] [Real]Absence check using state equation in 24476 ms returned sat
[2020-06-04 04:30:09] [INFO ] [Real]Added 1 Read/Feed constraints in 28 ms returned sat
[2020-06-04 04:30:11] [INFO ] Deduced a trap composed of 2 places in 1567 ms
[2020-06-04 04:30:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1729 ms
[2020-06-04 04:30:11] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:30:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:30:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:30:30] [INFO ] [Nat]Absence check using state equation in 18597 ms returned unknown
[2020-06-04 04:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:30:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:30:55] [INFO ] [Real]Absence check using state equation in 24774 ms returned sat
[2020-06-04 04:30:55] [INFO ] [Real]Added 1 Read/Feed constraints in 33 ms returned sat
[2020-06-04 04:30:55] [INFO ] Computed and/alt/rep : 2222/25043/2222 causal constraints in 193 ms.
[2020-06-04 04:30:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:30:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:31:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:31:08] [INFO ] [Nat]Absence check using state equation in 12098 ms returned unknown
[2020-06-04 04:31:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 04:31:36] [INFO ] [Real]Absence check using state equation in 27740 ms returned sat
[2020-06-04 04:31:36] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 04:31:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 04:31:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-04 04:31:54] [INFO ] [Nat]Absence check using state equation in 17633 ms returned unknown
FORMULA DoubleExponent-PT-100-ReachabilityFireability-12 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT OVER_APPROXIMATION
[2020-06-04 04:31:54] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2020-06-04 04:31:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 27 ms.
[2020-06-04 04:31:55] [INFO ] Flatten gal took : 652 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ DoubleExponent-PT-100 @ 3570 seconds
spx_run: Lost feasibility 10 times - iter 3858 and 2 nodes.
spx_run: Lost feasibility 10 times - iter 5288 and 4 nodes.
spx_run: Lost feasibility 10 times - iter 6706 and 7 nodes.
spx_run: Lost feasibility 10 times - iter 8254 and 12 nodes.
spx_run: Lost feasibility 10 times - iter 9613 and 16 nodes.
spx_run: Lost feasibility 10 times - iter 10635 and 19 nodes.
spx_run: Lost feasibility 10 times - iter 11688 and 20 nodes.
spx_run: Lost feasibility 10 times - iter 2280 and 1 nodes.
spx_run: Lost feasibility 10 times - iter 2500 and 2 nodes.
spx_run: Lost feasibility 10 times - iter 4651 and 155 nodes.
spx_run: Lost feasibility 10 times - iter 9180 and 1122 nodes.
spx_run: Lost feasibility 10 times - iter 3522 and 3 nodes.
spx_run: Lost feasibility 10 times - iter 3741 and 6 nodes.
spx_run: Lost feasibility 10 times - iter 3845 and 7 nodes.
spx_run: Lost feasibility 10 times - iter 4670 and 8 nodes.
spx_run: Lost feasibility 10 times - iter 2918 and 8 nodes.
spx_run: Lost feasibility 10 times - iter 4336 and 10 nodes.
spx_run: Lost feasibility 10 times - iter 5759 and 12 nodes.
spx_run: Lost feasibility 10 times - iter 7072 and 14 nodes.
spx_run: Lost feasibility 10 times - iter 10843 and 194 nodes.
spx_run: Lost feasibility 10 times - iter 11610 and 257 nodes.
spx_run: Lost feasibility 10 times - iter 12399 and 342 nodes.
spx_run: Lost feasibility 10 times - iter 12902 and 347 nodes.
spx_run: Lost feasibility 10 times - iter 12937 and 352 nodes.
spx_run: Lost feasibility 10 times - iter 13265 and 357 nodes.
spx_run: Lost feasibility 10 times - iter 13371 and 365 nodes.
spx_run: Lost feasibility 10 times - iter 13605 and 375 nodes.
spx_run: Lost feasibility 10 times - iter 14144 and 442 nodes.
spx_run: Lost feasibility 10 times - iter 14166 and 444 nodes.
spx_run: Lost feasibility 10 times - iter 14213 and 449 nodes.
spx_run: Lost feasibility 10 times - iter 3471 and 2 nodes.
spx_run: Lost feasibility 10 times - iter 4933 and 4 nodes.
spx_run: Lost feasibility 10 times - iter 6426 and 7 nodes.
spx_run: Lost feasibility 10 times - iter 7737 and 9 nodes.
spx_run: Lost feasibility 10 times - iter 9076 and 11 nodes.
spx_run: Lost feasibility 10 times - iter 9283 and 13 nodes.
spx_run: Lost feasibility 10 times - iter 9482 and 15 nodes.
spx_run: Lost feasibility 10 times - iter 3473 and 2 nodes.
spx_run: Lost feasibility 10 times - iter 3752 and 4 nodes.
spx_run: Lost feasibility 10 times - iter 5301 and 9 nodes.
spx_run: Lost feasibility 10 times - iter 5694 and 11 nodes.
spx_run: Lost feasibility 10 times - iter 6687 and 13 nodes.
spx_run: Lost feasibility 10 times - iter 7629 and 14 nodes.
spx_run: Lost feasibility 10 times - iter 7681 and 15 nodes.
spx_run: Lost feasibility 10 times - iter 8997 and 16 nodes.
spx_run: Lost feasibility 10 times - iter 9213 and 17 nodes.
spx_run: Lost feasibility 10 times - iter 10655 and 24 nodes.
spx_run: Lost feasibility 10 times - iter 11469 and 26 nodes.
spx_run: Lost feasibility 10 times - iter 5696 and 771 nodes.
spx_run: Lost feasibility 10 times - iter 9826 and 792 nodes.
spx_run: Lost feasibility 10 times - iter 10123 and 804 nodes.
spx_run: Lost feasibility 10 times - iter 10272 and 812 nodes.
spx_run: Lost feasibility 10 times - iter 10396 and 817 nodes.
spx_run: Lost feasibility 10 times - iter 2238 and 2 nodes.
spx_run: Lost feasibility 10 times - iter 2592 and 5 nodes.
spx_run: Lost feasibility 10 times - iter 3899 and 7 nodes.
spx_run: Lost feasibility 10 times - iter 4086 and 10 nodes.
spx_run: Lost feasibility 10 times - iter 5294 and 12 nodes.
spx_run: Lost feasibility 10 times - iter 5595 and 13 nodes.
spx_run: Lost feasibility 10 times - iter 5684 and 15 nodes.
spx_run: Lost feasibility 10 times - iter 6744 and 17 nodes.
spx_run: Lost feasibility 10 times - iter 7938 and 20 nodes.
spx_run: Lost feasibility 10 times - iter 9437 and 73 nodes.
spx_run: Lost feasibility 10 times - iter 11597 and 260 nodes.
spx_run: Lost feasibility 10 times - iter 12850 and 268 nodes.
spx_run: Lost feasibility 10 times - iter 14093 and 276 nodes.
spx_run: Lost feasibility 10 times - iter 15155 and 278 nodes.
spx_run: Lost feasibility 10 times - iter 16125 and 280 nodes.
spx_run: Lost feasibility 10 times - iter 17159 and 283 nodes.
spx_run: Lost feasibility 10 times - iter 18443 and 298 nodes.
spx_run: Lost feasibility 10 times - iter 19914 and 306 nodes.
spx_run: Lost feasibility 10 times - iter 3597 and 3 nodes.
spx_run: Lost feasibility 10 times - iter 4042 and 5 nodes.
spx_run: Lost feasibility 10 times - iter 4463 and 7 nodes.
spx_run: Lost feasibility 10 times - iter 4925 and 9 nodes.
spx_run: Lost feasibility 10 times - iter 4987 and 11 nodes.
spx_run: Lost feasibility 10 times - iter 5312 and 13 nodes.
spx_run: Lost feasibility 10 times - iter 5969 and 32 nodes.
spx_run: Lost feasibility 10 times - iter 6417 and 64 nodes.
spx_run: Lost feasibility 10 times - iter 6504 and 65 nodes.
spx_run: Lost feasibility 10 times - iter 6820 and 69 nodes.
spx_run: Lost feasibility 10 times - iter 7117 and 71 nodes.
spx_run: Lost feasibility 10 times - iter 7567 and 72 nodes.
spx_run: Lost feasibility 10 times - iter 7619 and 73 nodes.
spx_run: Lost feasibility 10 times - iter 7850 and 75 nodes.
spx_run: Lost feasibility 10 times - iter 8050 and 76 nodes.
spx_run: Lost feasibility 10 times - iter 8381 and 78 nodes.
spx_run: Lost feasibility 10 times - iter 8704 and 82 nodes.
spx_run: Lost feasibility 10 times - iter 9244 and 85 nodes.
spx_run: Lost feasibility 10 times - iter 9840 and 104 nodes.
spx_run: Lost feasibility 10 times - iter 9911 and 106 nodes.
spx_run: Lost feasibility 10 times - iter 10224 and 108 nodes.
spx_run: Lost feasibility 10 times - iter 10543 and 110 nodes.
spx_run: Lost feasibility 10 times - iter 11080 and 156 nodes.
spx_run: Lost feasibility 10 times - iter 12252 and 297 nodes.
spx_run: Lost feasibility 10 times - iter 12652 and 307 nodes.
spx_run: Lost feasibility 10 times - iter 13153 and 309 nodes.
spx_run: Lost feasibility 10 times - iter 13299 and 317 nodes.
spx_run: Lost feasibility 10 times - iter 13569 and 318 nodes.
spx_run: Lost feasibility 10 times - iter 14064 and 320 nodes.
spx_run: Lost feasibility 10 times - iter 3731 and 1 nodes.
spx_run: Lost feasibility 10 times - iter 3942 and 2 nodes.
spx_run: Lost feasibility 10 times - iter 5204 and 114 nodes.
spx_run: Lost feasibility 10 times - iter 5289 and 116 nodes.
spx_run: Lost feasibility 10 times - iter 5497 and 121 nodes.
spx_run: Lost feasibility 10 times - iter 5538 and 123 nodes.
spx_run: Lost feasibility 10 times - iter 6662 and 243 nodes.

FORMULA DoubleExponent-PT-100-ReachabilityFireability-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-100-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-100-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-100-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DoubleExponent-PT-100-ReachabilityFireability-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 14497568 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16312788 kB

--------------------
content from stderr:

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="DoubleExponent-PT-100"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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-4028"
echo " Executing tool itslola"
echo " Input is DoubleExponent-PT-100, 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 r178-tajo-158987882900799"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-100.tgz
mv DoubleExponent-PT-100 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;