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.r066-tajo-158922814800798.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 itstools
Input is DoubleExponent-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800798
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-100-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590138869289

[2020-05-22 09:14:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -its, -ltsminpath, /home/mcc/BenchKit//lts_install_dir/, -greatspnpath, /home/mcc/BenchKit//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2020-05-22 09:14:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 09:14:32] [INFO ] Load time of PNML (sax parser for PT used): 286 ms
[2020-05-22 09:14:32] [INFO ] Transformed 5304 places.
[2020-05-22 09:14:32] [INFO ] Transformed 4998 transitions.
[2020-05-22 09:14:32] [INFO ] Parsed PT model containing 5304 places and 4998 transitions in 356 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 888 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 331 resets, run finished after 248 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 49 ms. (steps per millisecond=204 ) 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 10001 steps, including 284 resets, run finished after 52 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 10000 steps, including 283 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 289 resets, run finished after 71 ms. (steps per millisecond=140 ) 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 277 resets, run finished after 97 ms. (steps per millisecond=103 ) 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 74 ms. (steps per millisecond=135 ) 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 52 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 10000 steps, including 283 resets, run finished after 54 ms. (steps per millisecond=185 ) 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 43 ms. (steps per millisecond=232 ) 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 292 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 10001 steps, including 282 resets, run finished after 64 ms. (steps per millisecond=156 ) 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 283 resets, run finished after 62 ms. (steps per millisecond=161 ) 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 38 ms. (steps per millisecond=263 ) 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 280 resets, run finished after 52 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 10000 steps, including 275 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 769200 steps, run timeout after 30001 ms. (steps per millisecond=25 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 769200 steps, saw 384535 distinct states, run finished after 30001 ms. (steps per millisecond=25 ) 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-05-22 09:15:04] [INFO ] Invariants computation overflowed in 408 ms
[2020-05-22 09:15:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:09] [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: Broken pipe (= s320 (- t231 t232))") while checking expression at index 0
[2020-05-22 09:15:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:14] [INFO ] [Real]Absence check using state equation in 4166 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:15:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:15:20] [INFO ] [Real]Absence check using state equation in 4444 ms returned (error "Failed to check-sat")
[2020-05-22 09:15:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:15:25] [INFO ] [Real]Absence check using state equation in 4186 ms returned (error "Failed to check-sat")
[2020-05-22 09:15:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:30] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:15:30] [INFO ] [Real]Absence check using state equation in 4512 ms returned (error "Failed to check-sat")
[2020-05-22 09:15:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:35] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:15:35] [INFO ] [Real]Absence check using state equation in 4295 ms returned (error "Failed to check-sat")
[2020-05-22 09:15:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:40] [INFO ] [Real]Absence check using state equation in 4485 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:45] [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 (= s688 (- t580 t581))") while checking expression at index 7
[2020-05-22 09:15:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:50] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:15:50] [INFO ] [Real]Absence check using state equation in 4469 ms returned (error "Failed to check-sat")
[2020-05-22 09:15:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:15:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:15:55] [INFO ] [Real]Absence check using state equation in 4448 ms returned (error "Failed to check-sat")
[2020-05-22 09:15:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:16:00] [INFO ] [Real]Absence check using state equation in 4461 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:16:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:16:05] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:16:05] [INFO ] [Real]Absence check using state equation in 4450 ms returned (error "Failed to check-sat")
[2020-05-22 09:16:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:16:10] [INFO ] [Real]Absence check using state equation in 4507 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:16:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:16:15] [INFO ] [Real]Absence check using state equation in 4570 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:16:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:16:20] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:16:20] [INFO ] [Real]Absence check using state equation in 4442 ms returned (error "Failed to check-sat")
[2020-05-22 09:16:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:16:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:16:25] [INFO ] [Real]Absence check using state equation in 3935 ms returned (error "Failed to check-sat")
Support contains 50 out of 5304 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5304/5304 places, 4998/4998 transitions.
Discarding 4 places :
Also discarding 0 output transitions
Graph (complete) has 9096 edges and 5304 vertex of which 5300 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.65 ms
Performed 1165 Post agglomeration using F-continuation condition.Transition count delta: 1165
Iterating post reduction 0 with 1165 rules applied. Total rules applied 1166 place count 5300 transition count 3833
Reduce places removed 1165 places and 0 transitions.
Iterating post reduction 1 with 1165 rules applied. Total rules applied 2331 place count 4135 transition count 3833
Performed 202 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 202 Pre rules applied. Total rules applied 2331 place count 4135 transition count 3631
Deduced a syphon composed of 202 places in 273 ms
Reduce places removed 202 places and 0 transitions.
Iterating global reduction 2 with 404 rules applied. Total rules applied 2735 place count 3933 transition count 3631
Performed 877 Post agglomeration using F-continuation condition.Transition count delta: 877
Deduced a syphon composed of 877 places in 120 ms
Reduce places removed 877 places and 0 transitions.
Iterating global reduction 2 with 1754 rules applied. Total rules applied 4489 place count 3056 transition count 2754
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 101 places in 182 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 4691 place count 2955 transition count 2754
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 91 places in 101 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 4873 place count 2864 transition count 2754
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4874 place count 2864 transition count 2753
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4875 place count 2863 transition count 2753
Free-agglomeration rule (complex) applied 406 times.
Iterating global reduction 3 with 406 rules applied. Total rules applied 5281 place count 2863 transition count 2347
Reduce places removed 406 places and 0 transitions.
Iterating post reduction 3 with 406 rules applied. Total rules applied 5687 place count 2457 transition count 2347
Partial Free-agglomeration rule applied 404 times.
Drop transitions removed 404 transitions
Iterating global reduction 4 with 404 rules applied. Total rules applied 6091 place count 2457 transition count 2347
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 6092 place count 2456 transition count 2346
Applied a total of 6092 rules in 4307 ms. Remains 2456 /5304 variables (removed 2848) and now considering 2346/4998 (removed 2652) transitions.
Finished structural reductions, in 1 iterations. Remains : 2456/5304 places, 2346/4998 transitions.
Incomplete random walk after 1000000 steps, including 128392 resets, run finished after 8716 ms. (steps per millisecond=114 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 902947 steps, including 76519 resets, run timeout after 5001 ms. (steps per millisecond=180 ) 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 84519 resets, run finished after 4713 ms. (steps per millisecond=212 ) 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 84486 resets, run finished after 4842 ms. (steps per millisecond=206 ) 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 84682 resets, run finished after 4760 ms. (steps per millisecond=210 ) 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 84633 resets, run finished after 4647 ms. (steps per millisecond=215 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 888561 steps, including 74979 resets, run timeout after 5008 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 875806 steps, including 74075 resets, run timeout after 5001 ms. (steps per millisecond=175 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 886031 steps, including 75170 resets, run timeout after 5001 ms. (steps per millisecond=177 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 960591 steps, including 81539 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]
Interrupted Best-First random walk after 985511 steps, including 83485 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 904309 steps, including 76820 resets, run timeout after 5005 ms. (steps per millisecond=180 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 933716 steps, including 79254 resets, run timeout after 5001 ms. (steps per millisecond=186 ) 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 84859 resets, run finished after 4670 ms. (steps per millisecond=214 ) 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 84401 resets, run finished after 4753 ms. (steps per millisecond=210 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 987758 steps, including 83890 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Best-First random walk after 987373 steps, including 83580 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 1654655 steps, run timeout after 30001 ms. (steps per millisecond=55 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
Probabilistic random walk after 1654655 steps, saw 826839 distinct states, run finished after 30001 ms. (steps per millisecond=55 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 2346 rows 2456 cols
[2020-05-22 09:18:26] [INFO ] Invariants computation overflowed in 73 ms
[2020-05-22 09:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:18:40] [INFO ] [Real]Absence check using state equation in 13284 ms returned unsat
[2020-05-22 09:18:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:18:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:18:57] [INFO ] [Real]Absence check using state equation in 17023 ms returned unknown
[2020-05-22 09:18:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:19:05] [INFO ] [Real]Absence check using state equation in 7437 ms returned sat
[2020-05-22 09:19:05] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:19:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:19:13] [INFO ] [Nat]Absence check using state equation in 7344 ms returned sat
[2020-05-22 09:19:13] [INFO ] State equation strengthened by 385 read => feed constraints.
[2020-05-22 09:19:14] [INFO ] [Nat]Added 385 Read/Feed constraints in 805 ms returned sat
[2020-05-22 09:19:16] [INFO ] Deduced a trap composed of 4 places in 2519 ms
[2020-05-22 09:19:18] [INFO ] Deduced a trap composed of 9 places in 1838 ms
[2020-05-22 09:19:20] [INFO ] Deduced a trap composed of 2 places in 1810 ms
[2020-05-22 09:19:22] [INFO ] Deduced a trap composed of 4 places in 1786 ms
[2020-05-22 09:19:24] [INFO ] Deduced a trap composed of 10 places in 1832 ms
[2020-05-22 09:19:26] [INFO ] Deduced a trap composed of 11 places in 1748 ms
[2020-05-22 09:19:28] [INFO ] Deduced a trap composed of 4 places in 1703 ms
[2020-05-22 09:19:30] [INFO ] Deduced a trap composed of 12 places in 1748 ms
[2020-05-22 09:19:31] [INFO ] Deduced a trap composed of 8 places in 1674 ms
[2020-05-22 09:19:33] [INFO ] Deduced a trap composed of 4 places in 1797 ms
[2020-05-22 09:19:33] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 19802 ms
[2020-05-22 09:19:34] [INFO ] Computed and/alt/rep : 2345/57351/2345 causal constraints in 464 ms.
[2020-05-22 09:19:50] [INFO ] Added : 355 causal constraints over 71 iterations in 16700 ms. Result :unknown
[2020-05-22 09:19:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:20:28] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:20:28] [INFO ] [Real]Absence check using state equation in 37822 ms returned sat
[2020-05-22 09:20:28] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:20:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:21:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:21:13] [INFO ] [Nat]Absence check using state equation in 44662 ms returned unknown
[2020-05-22 09:21:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:21:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:21:58] [INFO ] [Real]Absence check using state equation in 44730 ms returned (error "Failed to check-sat")
[2020-05-22 09:21:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:22:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:22:43] [INFO ] [Real]Absence check using state equation in 44756 ms returned (error "Failed to check-sat")
[2020-05-22 09:22:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:23:26] [INFO ] [Real]Absence check using state equation in 42535 ms returned sat
[2020-05-22 09:23:26] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:23:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:24:09] [INFO ] [Nat]Absence check using state equation in 42219 ms returned sat
[2020-05-22 09:24:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:24:11] [INFO ] [Nat]Added 385 Read/Feed constraints in 2567 ms returned unknown
[2020-05-22 09:24:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:24:57] [INFO ] [Real]Absence check using state equation in 44819 ms returned (error "Failed to check-sat")
[2020-05-22 09:24:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:25:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:25:42] [INFO ] [Real]Absence check using state equation in 44754 ms returned (error "Failed to check-sat")
[2020-05-22 09:25:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:26:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:26:27] [INFO ] [Real]Absence check using state equation in 44761 ms returned (error "Failed to check-sat")
[2020-05-22 09:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:27:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:27:12] [INFO ] [Real]Absence check using state equation in 44800 ms returned (error "Failed to check-sat")
[2020-05-22 09:27:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:27:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:27:57] [INFO ] [Real]Absence check using state equation in 44756 ms returned (error "Failed to check-sat")
[2020-05-22 09:27:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:28:42] [INFO ] [Real]Absence check using state equation in 44759 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:28:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:29:27] [INFO ] [Real]Absence check using state equation in 44795 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:29:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:29:40] [INFO ] [Real]Absence check using state equation in 13587 ms returned sat
[2020-05-22 09:29:40] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:29:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:29:57] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:30:00] [INFO ] [Nat]Absence check using state equation in 19496 ms returned unknown
FORMULA DoubleExponent-PT-100-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 0 steps, including 0 resets, run finished after 1 ms. (steps per millisecond=0 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] could not realise parikh vector
Support contains 45 out of 2456 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2456/2456 places, 2346/2346 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 2456 transition count 2345
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2455 transition count 2345
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 50 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 2454 transition count 2344
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 50 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 2453 transition count 2344
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 2453 transition count 2341
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 12 place count 2450 transition count 2341
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 13 place count 2450 transition count 2341
Applied a total of 13 rules in 714 ms. Remains 2450 /2456 variables (removed 6) and now considering 2341/2346 (removed 5) transitions.
Finished structural reductions, in 1 iterations. Remains : 2450/2456 places, 2341/2346 transitions.
Incomplete random walk after 1000000 steps, including 128350 resets, run finished after 7786 ms. (steps per millisecond=128 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84630 resets, run finished after 4787 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84675 resets, run finished after 4604 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84504 resets, run finished after 4555 ms. (steps per millisecond=219 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84743 resets, run finished after 4610 ms. (steps per millisecond=216 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84689 resets, run finished after 4874 ms. (steps per millisecond=205 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84668 resets, run finished after 4578 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84929 resets, run finished after 4690 ms. (steps per millisecond=213 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84677 resets, run finished after 4928 ms. (steps per millisecond=202 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84707 resets, run finished after 4882 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84807 resets, run finished after 4850 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84960 resets, run finished after 4852 ms. (steps per millisecond=206 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84291 resets, run finished after 4577 ms. (steps per millisecond=218 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84505 resets, run finished after 4829 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84735 resets, run finished after 4824 ms. (steps per millisecond=207 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 1647818 steps, run timeout after 30001 ms. (steps per millisecond=54 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probabilistic random walk after 1647818 steps, saw 823416 distinct states, run finished after 30001 ms. (steps per millisecond=54 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2341 rows 2450 cols
[2020-05-22 09:31:45] [INFO ] Invariants computation overflowed in 54 ms
[2020-05-22 09:31:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:32:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:32:05] [INFO ] [Real]Absence check using state equation in 19779 ms returned unknown
[2020-05-22 09:32:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:32:17] [INFO ] [Real]Absence check using state equation in 12045 ms returned sat
[2020-05-22 09:32:18] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:32:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:32:30] [INFO ] [Nat]Absence check using state equation in 12230 ms returned sat
[2020-05-22 09:32:30] [INFO ] State equation strengthened by 388 read => feed constraints.
[2020-05-22 09:32:31] [INFO ] [Nat]Added 388 Read/Feed constraints in 434 ms returned sat
[2020-05-22 09:32:32] [INFO ] Deduced a trap composed of 2 places in 1651 ms
[2020-05-22 09:32:34] [INFO ] Deduced a trap composed of 7 places in 1785 ms
[2020-05-22 09:32:36] [INFO ] Deduced a trap composed of 8 places in 1497 ms
[2020-05-22 09:32:37] [INFO ] Deduced a trap composed of 10 places in 1450 ms
[2020-05-22 09:32:39] [INFO ] Deduced a trap composed of 10 places in 1419 ms
[2020-05-22 09:32:40] [INFO ] Deduced a trap composed of 11 places in 1427 ms
[2020-05-22 09:32:42] [INFO ] Deduced a trap composed of 4 places in 1661 ms
[2020-05-22 09:32:43] [INFO ] Deduced a trap composed of 4 places in 1558 ms
[2020-05-22 09:32:45] [INFO ] Deduced a trap composed of 10 places in 1781 ms
[2020-05-22 09:32:47] [INFO ] Deduced a trap composed of 4 places in 1674 ms
[2020-05-22 09:32:49] [INFO ] Deduced a trap composed of 8 places in 1631 ms
[2020-05-22 09:32:50] [INFO ] Deduced a trap composed of 4 places in 1607 ms
[2020-05-22 09:32:51] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 20012 ms
[2020-05-22 09:32:51] [INFO ] Computed and/alt/rep : 2340/57402/2340 causal constraints in 348 ms.
[2020-05-22 09:32:56] [INFO ] Added : 10 causal constraints over 2 iterations in 5251 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 43 ms.
[2020-05-22 09:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:33:32] [INFO ] [Real]Absence check using state equation in 35080 ms returned sat
[2020-05-22 09:33:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:33:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:34:15] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:34:15] [INFO ] [Nat]Absence check using state equation in 43718 ms returned sat
[2020-05-22 09:34:17] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:34:17] [INFO ] [Nat]Added 388 Read/Feed constraints in 1134 ms returned unknown
[2020-05-22 09:34:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:35:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:35:02] [INFO ] [Real]Absence check using state equation in 44801 ms returned unknown
[2020-05-22 09:35:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:35:47] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:35:47] [INFO ] [Real]Absence check using state equation in 44793 ms returned (error "Failed to check-sat")
[2020-05-22 09:35:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:36:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:36:32] [INFO ] [Real]Absence check using state equation in 44789 ms returned (error "Failed to check-sat")
[2020-05-22 09:36:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:36:41] [INFO ] [Real]Absence check using state equation in 8820 ms returned sat
[2020-05-22 09:36:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:36:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:36:51] [INFO ] [Nat]Absence check using state equation in 9801 ms returned sat
[2020-05-22 09:36:51] [INFO ] [Nat]Added 388 Read/Feed constraints in 214 ms returned sat
[2020-05-22 09:36:53] [INFO ] Deduced a trap composed of 7 places in 1620 ms
[2020-05-22 09:36:54] [INFO ] Deduced a trap composed of 4 places in 1515 ms
[2020-05-22 09:36:56] [INFO ] Deduced a trap composed of 2 places in 1632 ms
[2020-05-22 09:36:58] [INFO ] Deduced a trap composed of 8 places in 1546 ms
[2020-05-22 09:36:59] [INFO ] Deduced a trap composed of 4 places in 1568 ms
[2020-05-22 09:37:01] [INFO ] Deduced a trap composed of 10 places in 1571 ms
[2020-05-22 09:37:03] [INFO ] Deduced a trap composed of 4 places in 1532 ms
[2020-05-22 09:37:04] [INFO ] Deduced a trap composed of 6 places in 1424 ms
[2020-05-22 09:37:06] [INFO ] Deduced a trap composed of 9 places in 1478 ms
[2020-05-22 09:37:07] [INFO ] Deduced a trap composed of 4 places in 1489 ms
[2020-05-22 09:37:07] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 16138 ms
[2020-05-22 09:37:08] [INFO ] Computed and/alt/rep : 2340/57402/2340 causal constraints in 376 ms.
[2020-05-22 09:37:24] [INFO ] Added : 360 causal constraints over 72 iterations in 16839 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 67 ms.
[2020-05-22 09:37:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:38:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:38:09] [INFO ] [Real]Absence check using state equation in 44798 ms returned (error "Failed to check-sat")
[2020-05-22 09:38:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:38:54] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:38:54] [INFO ] [Real]Absence check using state equation in 44791 ms returned (error "Failed to check-sat")
[2020-05-22 09:38:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:39:33] [INFO ] [Real]Absence check using state equation in 38288 ms returned sat
[2020-05-22 09:39:33] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:39:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:40:18] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:40:18] [INFO ] [Nat]Absence check using state equation in 44801 ms returned unknown
[2020-05-22 09:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:41:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:41:03] [INFO ] [Real]Absence check using state equation in 44804 ms returned unknown
[2020-05-22 09:41:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:41:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:41:36] [INFO ] [Real]Absence check using state equation in 32679 ms returned sat
[2020-05-22 09:41:36] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:41:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:42:19] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:42:19] [INFO ] [Nat]Absence check using state equation in 42728 ms returned sat
[2020-05-22 09:42:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:42:21] [INFO ] [Nat]Added 388 Read/Feed constraints in 2116 ms returned unknown
[2020-05-22 09:42:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:43:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:43:06] [INFO ] [Real]Absence check using state equation in 44782 ms returned (error "Failed to check-sat")
[2020-05-22 09:43:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:43:21] [INFO ] [Real]Absence check using state equation in 14758 ms returned sat
[2020-05-22 09:43:21] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:43:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:43:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:43:42] [INFO ] [Nat]Absence check using state equation in 20417 ms returned unknown
Interrupted Parikh walk after 3568894 steps, including 541221 resets, run timeout after 30001 ms. (steps per millisecond=118 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Interrupted Parikh walk after 3626974 steps, including 549884 resets, run timeout after 30001 ms. (steps per millisecond=120 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 45 out of 2450 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2450/2450 places, 2341/2341 transitions.
Applied a total of 0 rules in 239 ms. Remains 2450 /2450 variables (removed 0) and now considering 2341/2341 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2450/2450 places, 2341/2341 transitions.
Starting structural reductions, iteration 0 : 2450/2450 places, 2341/2341 transitions.
Applied a total of 0 rules in 196 ms. Remains 2450 /2450 variables (removed 0) and now considering 2341/2341 (removed 0) transitions.
// Phase 1: matrix 2341 rows 2450 cols
[2020-05-22 09:44:42] [INFO ] Invariants computation overflowed in 109 ms
[2020-05-22 09:45:06] [INFO ] Implicit Places using invariants in 23499 ms returned []
// Phase 1: matrix 2341 rows 2450 cols
[2020-05-22 09:45:06] [INFO ] Invariants computation overflowed in 66 ms
[2020-05-22 09:45:36] [INFO ] Performed 2368/2450 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2020-05-22 09:45:38] [INFO ] Implicit Places using invariants and state equation in 32127 ms returned []
Implicit Place search using SMT with State Equation took 55637 ms to find 0 implicit places.
[2020-05-22 09:45:38] [INFO ] Redundant transitions in 206 ms returned []
// Phase 1: matrix 2341 rows 2450 cols
[2020-05-22 09:45:38] [INFO ] Invariants computation overflowed in 61 ms
[2020-05-22 09:45:47] [INFO ] Dead Transitions using invariants and state equation in 8961 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2450/2450 places, 2341/2341 transitions.
Incomplete random walk after 100000 steps, including 12791 resets, run finished after 683 ms. (steps per millisecond=146 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 2341 rows 2450 cols
[2020-05-22 09:45:48] [INFO ] Invariants computation overflowed in 37 ms
[2020-05-22 09:45:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:46:04] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:46:07] [INFO ] [Real]Absence check using state equation in 18914 ms returned unknown
[2020-05-22 09:46:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:46:19] [INFO ] [Real]Absence check using state equation in 11978 ms returned sat
[2020-05-22 09:46:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:46:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:46:32] [INFO ] [Nat]Absence check using state equation in 12751 ms returned sat
[2020-05-22 09:46:32] [INFO ] State equation strengthened by 388 read => feed constraints.
[2020-05-22 09:46:33] [INFO ] [Nat]Added 388 Read/Feed constraints in 473 ms returned sat
[2020-05-22 09:46:34] [INFO ] Deduced a trap composed of 2 places in 1713 ms
[2020-05-22 09:46:36] [INFO ] Deduced a trap composed of 7 places in 1530 ms
[2020-05-22 09:46:38] [INFO ] Deduced a trap composed of 8 places in 1532 ms
[2020-05-22 09:46:39] [INFO ] Deduced a trap composed of 10 places in 1444 ms
[2020-05-22 09:46:41] [INFO ] Deduced a trap composed of 10 places in 1434 ms
[2020-05-22 09:46:41] [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 (> (+ s204 s266 s277 s291 s309 s2222 s2264 s2292 s2383 s2400) 0)") while checking expression at index 1
[2020-05-22 09:46:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:47:01] [INFO ] [Real]Absence check using state equation in 19846 ms returned (error "Solver has unexpectedly terminated")
[2020-05-22 09:47:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:47:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:47:21] [INFO ] [Real]Absence check using state equation in 19795 ms returned (error "Failed to check-sat")
[2020-05-22 09:47:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:47:41] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:47:41] [INFO ] [Real]Absence check using state equation in 19801 ms returned (error "Failed to check-sat")
[2020-05-22 09:47:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:48:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:48:01] [INFO ] [Real]Absence check using state equation in 19755 ms returned unknown
[2020-05-22 09:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:48:10] [INFO ] [Real]Absence check using state equation in 9354 ms returned sat
[2020-05-22 09:48:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:48:20] [INFO ] [Nat]Absence check using state equation in 9732 ms returned sat
[2020-05-22 09:48:21] [INFO ] [Nat]Added 388 Read/Feed constraints in 266 ms returned sat
[2020-05-22 09:48:22] [INFO ] Deduced a trap composed of 7 places in 1684 ms
[2020-05-22 09:48:24] [INFO ] Deduced a trap composed of 4 places in 1536 ms
[2020-05-22 09:48:26] [INFO ] Deduced a trap composed of 2 places in 1631 ms
[2020-05-22 09:48:27] [INFO ] Deduced a trap composed of 8 places in 1498 ms
[2020-05-22 09:48:29] [INFO ] Deduced a trap composed of 4 places in 1459 ms
[2020-05-22 09:48:30] [INFO ] Deduced a trap composed of 10 places in 1446 ms
[2020-05-22 09:48:32] [INFO ] Deduced a trap composed of 4 places in 1406 ms
[2020-05-22 09:48:32] [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 (> (+ s204 s309 s2227 s2246) 0)") while checking expression at index 6
[2020-05-22 09:48:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:48:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:48:52] [INFO ] [Real]Absence check using state equation in 19865 ms returned (error "Failed to check-sat")
[2020-05-22 09:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:49:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:49:12] [INFO ] [Real]Absence check using state equation in 19779 ms returned unknown
[2020-05-22 09:49:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:49:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:49:32] [INFO ] [Real]Absence check using state equation in 19805 ms returned (error "Failed to check-sat")
[2020-05-22 09:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:49:52] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:49:52] [INFO ] [Real]Absence check using state equation in 19815 ms returned (error "Failed to check-sat")
[2020-05-22 09:49:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:50:12] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:50:12] [INFO ] [Real]Absence check using state equation in 19803 ms returned unknown
[2020-05-22 09:50:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:50:32] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:50:32] [INFO ] [Real]Absence check using state equation in 19806 ms returned (error "Failed to check-sat")
[2020-05-22 09:50:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:50:48] [INFO ] [Real]Absence check using state equation in 15850 ms returned sat
[2020-05-22 09:50:48] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:50:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:51:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:51:08] [INFO ] [Nat]Absence check using state equation in 19824 ms returned unknown
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 2450 transition count 2338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 2447 transition count 2338
Performed 191 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 191 Pre rules applied. Total rules applied 6 place count 2447 transition count 2147
Deduced a syphon composed of 191 places in 80 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 2 with 382 rules applied. Total rules applied 388 place count 2256 transition count 2147
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 389 place count 2256 transition count 2146
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 390 place count 2255 transition count 2146
Applied a total of 390 rules in 673 ms. Remains 2255 /2450 variables (removed 195) and now considering 2146/2341 (removed 195) transitions.
// Phase 1: matrix 2146 rows 2255 cols
[2020-05-22 09:51:09] [INFO ] Invariants computation overflowed in 89 ms
[2020-05-22 09:51:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:51:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:51:25] [INFO ] [Real]Absence check using state equation in 15871 ms returned unknown
[2020-05-22 09:51:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:51:32] [INFO ] [Real]Absence check using state equation in 7208 ms returned sat
[2020-05-22 09:51:32] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:51:40] [INFO ] [Nat]Absence check using state equation in 7375 ms returned sat
[2020-05-22 09:51:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-05-22 09:51:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2020-05-22 09:51:42] [INFO ] Deduced a trap composed of 2 places in 1548 ms
[2020-05-22 09:51:43] [INFO ] Deduced a trap composed of 3 places in 1385 ms
[2020-05-22 09:51:44] [INFO ] Deduced a trap composed of 13 places in 1320 ms
[2020-05-22 09:51:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 4488 ms
[2020-05-22 09:51:45] [INFO ] Computed and/alt/rep : 2145/56422/2145 causal constraints in 200 ms.
[2020-05-22 09:52:02] [INFO ] Added : 295 causal constraints over 59 iterations in 17518 ms. Result :unknown
[2020-05-22 09:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:52:27] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:52:27] [INFO ] [Real]Absence check using state equation in 24461 ms returned sat
[2020-05-22 09:52:27] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:52:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:52:53] [INFO ] [Nat]Absence check using state equation in 26069 ms returned sat
[2020-05-22 09:52:53] [INFO ] [Nat]Added 1 Read/Feed constraints in 200 ms returned sat
[2020-05-22 09:52:53] [INFO ] Computed and/alt/rep : 2145/56422/2145 causal constraints in 231 ms.
[2020-05-22 09:53:08] [INFO ] Added : 180 causal constraints over 36 iterations in 14730 ms. Result :sat
[2020-05-22 09:53:10] [INFO ] Deduced a trap composed of 5 places in 1492 ms
[2020-05-22 09:53:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1731 ms
Attempting to minimize the solution found.
Minimization took 60 ms.
[2020-05-22 09:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:53:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:53:55] [INFO ] [Real]Absence check using state equation in 44800 ms returned (error "Failed to check-sat")
[2020-05-22 09:53:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:54:40] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:54:40] [INFO ] [Real]Absence check using state equation in 44806 ms returned (error "Failed to check-sat")
[2020-05-22 09:54:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:54:57] [INFO ] [Real]Absence check using state equation in 17177 ms returned sat
[2020-05-22 09:54:57] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:54:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 09:55:16] [INFO ] [Nat]Absence check using state equation in 18945 ms returned sat
[2020-05-22 09:55:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 15 ms returned sat
[2020-05-22 09:55:18] [INFO ] Deduced a trap composed of 2 places in 1522 ms
[2020-05-22 09:55:19] [INFO ] Deduced a trap composed of 4 places in 1303 ms
[2020-05-22 09:55:21] [INFO ] Deduced a trap composed of 4 places in 1333 ms
[2020-05-22 09:55:22] [INFO ] Deduced a trap composed of 7 places in 1328 ms
[2020-05-22 09:55:24] [INFO ] Deduced a trap composed of 11 places in 1350 ms
[2020-05-22 09:55:25] [INFO ] Deduced a trap composed of 7 places in 1299 ms
[2020-05-22 09:55:26] [INFO ] Deduced a trap composed of 12 places in 1352 ms
[2020-05-22 09:55:28] [INFO ] Deduced a trap composed of 10 places in 1304 ms
[2020-05-22 09:55:29] [INFO ] Deduced a trap composed of 5 places in 1319 ms
[2020-05-22 09:55:29] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 12666 ms
[2020-05-22 09:55:29] [INFO ] Computed and/alt/rep : 2145/56422/2145 causal constraints in 232 ms.
[2020-05-22 09:55:36] [INFO ] Added : 5 causal constraints over 1 iterations in 6368 ms. Result :unknown
[2020-05-22 09:55:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:56:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:56:21] [INFO ] [Real]Absence check using state equation in 44910 ms returned (error "Failed to check-sat")
[2020-05-22 09:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:57:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:57:06] [INFO ] [Real]Absence check using state equation in 44826 ms returned (error "Failed to check-sat")
[2020-05-22 09:57:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:57:51] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:57:51] [INFO ] [Real]Absence check using state equation in 44809 ms returned (error "Failed to check-sat")
[2020-05-22 09:57:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:58:36] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:58:36] [INFO ] [Real]Absence check using state equation in 44818 ms returned (error "Failed to check-sat")
[2020-05-22 09:58:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:59:21] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:59:21] [INFO ] [Real]Absence check using state equation in 44806 ms returned (error "Failed to check-sat")
[2020-05-22 09:59:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 09:59:55] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 09:59:55] [INFO ] [Real]Absence check using state equation in 34237 ms returned sat
[2020-05-22 09:59:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 09:59:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 10:00:34] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 10:00:34] [INFO ] [Nat]Absence check using state equation in 38805 ms returned sat
[2020-05-22 10:00:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 108 ms returned sat
[2020-05-22 10:00:36] [INFO ] Deduced a trap composed of 5 places in 1589 ms
[2020-05-22 10:00:37] [INFO ] Deduced a trap composed of 32 places in 1477 ms
[2020-05-22 10:00:39] [INFO ] Deduced a trap composed of 29 places in 1419 ms
[2020-05-22 10:00:41] [INFO ] Deduced a trap composed of 35 places in 1403 ms
[2020-05-22 10:00:41] [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 (> (+ s78 s105 s115 s189 s285 s327 s356 s367 s565 s574 s600 s610 s655 s818 s831 s850 s860 s1072 s1098 s1108 s1321 s1347 s1357 s1560 s1570 s1600 s1611 s1830 s2037 s2047 s2048 s2084 s2085 s2111 s2123) 0)") while checking expression at index 11
[2020-05-22 10:00:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 10:01:26] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 10:01:26] [INFO ] [Real]Absence check using state equation in 44844 ms returned (error "Failed to check-sat")
[2020-05-22 10:01:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 10:02:11] [INFO ] SMT solver returned unknown. Retrying;
[2020-05-22 10:02:11] [INFO ] [Real]Absence check using state equation in 44819 ms returned unknown
[2020-05-22 10:02:12] [INFO ] Flatten gal took : 1089 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 10:02:14] [INFO ] Applying decomposition
[2020-05-22 10:02:14] [INFO ] Input system was already deterministic with 2341 transitions.
[2020-05-22 10:02:14] [INFO ] Too many transitions (2341) to apply POR reductions. Disabling POR matrices.
[2020-05-22 10:02:14] [INFO ] Flatten gal took : 1646 ms
[2020-05-22 10:02:15] [INFO ] Input system was already deterministic with 2341 transitions.
[2020-05-22 10:02:15] [INFO ] Flatten gal took : 1105 ms
[2020-05-22 10:02:15] [INFO ] Built C files in 2103ms conformant to PINS in folder :/home/mcc/execution
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit//lts_install_dir//include, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/home/mcc/execution]
[2020-05-22 10:02:16] [INFO ] Ran tautology test, simplified 0 / 14 in 1945 ms.
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=0 took 148 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=0 took 51 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=0 took 12 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=0 took 1 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=0 took 1 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=0 took 4 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=0 took 0 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=0 took 1 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=0 took 0 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=0 took 1 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=0 took 0 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=0 took 0 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=0 took 1 ms
[2020-05-22 10:02:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=0 took 0 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/convert-linux64, -i, /tmp/graph10426535454071374348.txt, -o, /tmp/graph10426535454071374348.bin, -w, /tmp/graph10426535454071374348.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202005100927/bin/louvain-linux64, /tmp/graph10426535454071374348.bin, -l, -1, -v, -w, /tmp/graph10426535454071374348.weights, -q, 0, -e, 0.001], workingDir=null]
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=1 took 41 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=1 took 0 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=1 took 1 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=1 took 1 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=1 took 1 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=1 took 0 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=1 took 1 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=1 took 11 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=1 took 34 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=1 took 22 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=1 took 18 ms
[2020-05-22 10:02:17] [INFO ] Decomposing Gal with order
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=1 took 33 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=1 took 18 ms
[2020-05-22 10:02:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=1 took 26 ms
[2020-05-22 10:02:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=2 took 1178 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=2 took 2 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=2 took 1 ms
[2020-05-22 10:02:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=2 took 1 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 2341 rows 2450 cols
[2020-05-22 10:02:18] [INFO ] Invariants computation overflowed in 80 ms
Total of 0 invariants.
[2020-05-22 10:02:18] [INFO ] Computed 0 place invariants in 91 ms
[2020-05-22 10:02:19] [INFO ] Removed a total of 28810 redundant transitions.
[2020-05-22 10:02:19] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=3 took 1171 ms
[2020-05-22 10:02:19] [INFO ] Flatten gal took : 2017 ms
[2020-05-22 10:02:20] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=3 took 739 ms
[2020-05-22 10:02:21] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=3 took 798 ms
[2020-05-22 10:02:22] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=3 took 685 ms
[2020-05-22 10:02:22] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=3 took 638 ms
[2020-05-22 10:02:23] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=3 took 558 ms
[2020-05-22 10:02:24] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=3 took 954 ms
[2020-05-22 10:02:24] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=3 took 333 ms
[2020-05-22 10:02:25] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=3 took 608 ms
[2020-05-22 10:02:26] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=3 took 1090 ms
[2020-05-22 10:02:26] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=3 took 684 ms
[2020-05-22 10:02:27] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=3 took 799 ms
[2020-05-22 10:02:30] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=3 took 2698 ms
[2020-05-22 10:02:31] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=3 took 802 ms
[2020-05-22 10:02:38] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=4 took 6941 ms
[2020-05-22 10:02:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1018 labels/synchronizations in 30153 ms.
[2020-05-22 10:02:52] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 197 ms
[2020-05-22 10:02:52] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /home/mcc/execution/ReachabilityCardinality.pnml.gal, -t, CGAL, -reachable-file, ReachabilityCardinality.prop, --nowitness, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202005100927/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /home/mcc/execution/ReachabilityCardinality.pnml.gal -t CGAL -reachable-file ReachabilityCardinality.prop --nowitness --gen-order FOLLOW
Loading property file ReachabilityCardinality.prop.
Read [invariant] property : DoubleExponent-PT-100-ReachabilityCardinality-01 with value :((gi16.gu440.p5160<=gi16.gu440.p2806)&&((gu435.p5110>gu435.p4454)||(gi12.gi1.gi0.gi0.gi0.gu322.p4065<3)))
Read [reachable] property : DoubleExponent-PT-100-ReachabilityCardinality-02 with value :(gi12.gi0.gi3.gi9.gi0.gu165.p2550>=2)
Read [invariant] property : DoubleExponent-PT-100-ReachabilityCardinality-03 with value :(gi14.gu442.p460<=gi14.gu442.p517)
Read [reachable] property : DoubleExponent-PT-100-ReachabilityCardinality-04 with value :(((gi11.gu254.p4578<=gi11.gu254.p3399)&&(gu85.p4590>gu85.p1715))&&(((gu195.p2804<=gu195.p3556)||(gu218.p4081<=gu218.p3036))||(gu160.p2507<=gu160.p1493)))
Read [invariant] property : DoubleExponent-PT-100-ReachabilityCardinality-05 with value :(((gi0.gu194.p1424>gi0.gu194.p277)||(gi12.gi1.gi0.gi4.gu396.p4783<3))||((gi12.gi0.gi3.gi12.gi1.gu219.p3048<2)&&(gi12.gi0.gi3.gi23.gi1.gu472.p660<2)))
Read [invariant] property : DoubleExponent-PT-100-ReachabilityCardinality-06 with value :(gu195.p3556<=gu195.p4905)
Read [invariant] property : DoubleExponent-PT-100-ReachabilityCardinality-07 with value :(gi4.gu3.p2750<=gi4.gu3.p1017)
Read [reachable] property : DoubleExponent-PT-100-ReachabilityCardinality-08 with value :(gi12.gi1.gi1.gu421.p4972>=1)
Read [invariant] property : DoubleExponent-PT-100-ReachabilityCardinality-09 with value :(gu349.p4320<=gu349.p4237)
Read [invariant] property : DoubleExponent-PT-100-ReachabilityCardinality-10 with value :((gi12.gi0.gi3.gi21.gu40.p136>=3)||(gi7.gu267.p3527<=gi7.gu267.p702))
Read [reachable] property : DoubleExponent-PT-100-ReachabilityCardinality-11 with value :(gu353.p4346>gu353.p2896)
Read [reachable] property : DoubleExponent-PT-100-ReachabilityCardinality-12 with value :((gu367.p411>gu367.p4479)&&((gu404.p4854<=gu404.p5265)||(gi12.gi0.gi3.gi17.gi1.gu280.p3675>=1)))
Read [invariant] property : DoubleExponent-PT-100-ReachabilityCardinality-13 with value :(((gi12.gi0.gi3.gi12.gi2.gu223.p3115>=3)||(gu83.p2764>gu83.p1703))||(gi12.gi1.gi0.gi2.gu357.p4363<1))
Read [reachable] property : DoubleExponent-PT-100-ReachabilityCardinality-14 with value :((gi12.gi0.gi3.gi1.gi5.gu32.p1268>=3)&&(gi12.gi1.gi0.gi1.gi1.gu358.p4367>=3))
SDD proceeding with computation, new max is 4
SDD proceeding with computation, new max is 8
SDD proceeding with computation, new max is 16
SDD proceeding with computation, new max is 32
SDD proceeding with computation, new max is 64
SDD proceeding with computation, new max is 128
SDD proceeding with computation, new max is 256
SDD proceeding with computation, new max is 512
SDD proceeding with computation, new max is 1024
SDD proceeding with computation, new max is 2048
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
Compilation finished in 67394 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 88 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT100ReachabilityCardinality01==true], workingDir=/home/mcc/execution]
/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc: error while loading shared libraries: libltdl.so.7: cannot open shared object file: No such file or directory
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT100ReachabilityCardinality01==true], workingDir=/home/mcc/execution]
127
java.lang.RuntimeException: Unexpected exception when executing ltsmin :CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT100ReachabilityCardinality01==true], workingDir=/home/mcc/execution]
127
at fr.lip6.move.gal.application.LTSminRunner.checkProperty(LTSminRunner.java:170)
at fr.lip6.move.gal.application.LTSminRunner.access$10(LTSminRunner.java:124)
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:834)
[2020-05-22 10:03:23] [INFO ] Proved 2450 variables to be positive in 64567 ms
[2020-05-22 10:03:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-01
[2020-05-22 10:03:23] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(SAT) depth K=0 took 216 ms
SDD proceeding with computation, new max is 32768
[2020-05-22 10:03:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-02
[2020-05-22 10:03:23] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(SAT) depth K=0 took 188 ms
[2020-05-22 10:03:23] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-03
[2020-05-22 10:03:23] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(SAT) depth K=0 took 162 ms
[2020-05-22 10:03:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-04
[2020-05-22 10:03:24] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(SAT) depth K=0 took 146 ms
[2020-05-22 10:03:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-05
[2020-05-22 10:03:24] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(SAT) depth K=0 took 153 ms
[2020-05-22 10:03:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-06
[2020-05-22 10:03:24] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(SAT) depth K=0 took 150 ms
[2020-05-22 10:03:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-07
[2020-05-22 10:03:24] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(SAT) depth K=0 took 133 ms
[2020-05-22 10:03:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-08
[2020-05-22 10:03:24] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(SAT) depth K=0 took 133 ms
[2020-05-22 10:03:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-09
[2020-05-22 10:03:24] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(SAT) depth K=0 took 133 ms
[2020-05-22 10:03:24] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-10
[2020-05-22 10:03:24] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(SAT) depth K=0 took 131 ms
[2020-05-22 10:03:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-11
[2020-05-22 10:03:25] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(SAT) depth K=0 took 146 ms
[2020-05-22 10:03:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-12
[2020-05-22 10:03:25] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(SAT) depth K=0 took 118 ms
[2020-05-22 10:03:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-13
[2020-05-22 10:03:25] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(SAT) depth K=0 took 130 ms
[2020-05-22 10:03:25] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-14
[2020-05-22 10:03:25] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(SAT) depth K=0 took 132 ms
[2020-05-22 10:03:27] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-01
[2020-05-22 10:03:27] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(SAT) depth K=1 took 1909 ms
SDD proceeding with computation, new max is 65536
[2020-05-22 10:03:32] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-02
[2020-05-22 10:03:32] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(SAT) depth K=1 took 4445 ms
[2020-05-22 10:03:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-03
[2020-05-22 10:03:35] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(SAT) depth K=1 took 3419 ms
[2020-05-22 10:03:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-04
[2020-05-22 10:03:44] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(SAT) depth K=1 took 9148 ms
SDD proceeding with computation, new max is 131072
[2020-05-22 10:03:57] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=4 took 79150 ms
[2020-05-22 10:03:59] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=4 took 1900 ms
[2020-05-22 10:04:01] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=4 took 1693 ms
[2020-05-22 10:04:04] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=4 took 3146 ms
[2020-05-22 10:04:07] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=4 took 3625 ms
[2020-05-22 10:04:11] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=4 took 3515 ms
[2020-05-22 10:04:14] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=4 took 3004 ms
SDD proceeding with computation, new max is 262144
[2020-05-22 10:06:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-05
[2020-05-22 10:06:05] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(SAT) depth K=1 took 141054 ms
[2020-05-22 10:06:05] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(UNSAT) depth K=4 took 111410 ms
[2020-05-22 10:06:13] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(UNSAT) depth K=4 took 7768 ms
[2020-05-22 10:06:17] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-11(UNSAT) depth K=4 took 3397 ms
[2020-05-22 10:06:18] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-12(UNSAT) depth K=4 took 1921 ms
[2020-05-22 10:06:22] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-13(UNSAT) depth K=4 took 3165 ms
[2020-05-22 10:06:24] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-14(UNSAT) depth K=4 took 2773 ms
[2020-05-22 10:06:32] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-01(UNSAT) depth K=5 took 7342 ms
[2020-05-22 10:06:54] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-02(UNSAT) depth K=5 took 21960 ms
[2020-05-22 10:07:02] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-06
[2020-05-22 10:07:02] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(SAT) depth K=1 took 56472 ms
[2020-05-22 10:07:05] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-03(UNSAT) depth K=5 took 11415 ms
[2020-05-22 10:07:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-07
[2020-05-22 10:07:14] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(SAT) depth K=1 took 12424 ms
[2020-05-22 10:07:20] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-04(UNSAT) depth K=5 took 15173 ms
[2020-05-22 10:07:45] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-08
[2020-05-22 10:07:45] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(SAT) depth K=1 took 30684 ms
[2020-05-22 10:09:12] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-05(UNSAT) depth K=5 took 111225 ms
SDD proceeding with computation, new max is 524288
[2020-05-22 10:09:20] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-06(UNSAT) depth K=5 took 8018 ms
[2020-05-22 10:09:20] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-09
[2020-05-22 10:09:20] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-09(SAT) depth K=1 took 95553 ms
[2020-05-22 10:09:29] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-07(UNSAT) depth K=5 took 9205 ms
[2020-05-22 10:09:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-100-ReachabilityCardinality-10
[2020-05-22 10:09:48] [INFO ] KInduction solution for property DoubleExponent-PT-100-ReachabilityCardinality-10(SAT) depth K=1 took 27433 ms
[2020-05-22 10:14:16] [INFO ] BMC solution for property DoubleExponent-PT-100-ReachabilityCardinality-08(UNSAT) depth K=5 took 286580 ms

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/
+ BINDIR=/home/mcc/BenchKit/
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ /home/mcc/BenchKit//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination ReachabilityCardinality -z3path /home/mcc/BenchKit//z3/bin/z3 -yices2path /home/mcc/BenchKit//yices/bin/yices -its -ltsminpath /home/mcc/BenchKit//lts_install_dir/ -greatspnpath /home/mcc/BenchKit//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m -Dfile.encoding=UTF-8 -Dosgi.requiredJavaVersion=1.6

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="ReachabilityCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is DoubleExponent-PT-100, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r066-tajo-158922814800798"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;