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-158922814800782.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-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tajo-158922814800782
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 344K
-rw-r--r-- 1 mcc users 3.3K Mar 31 07:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Mar 31 07:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 30 00:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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.1K Apr 8 14:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 8 14:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 28 14:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 27 07:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K 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 169K 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-010-ReachabilityCardinality-00
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-01
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-02
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-03
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-04
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-05
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-06
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-07
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-08
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-09
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-10
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-11
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-12
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-13
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-14
FORMULA_NAME DoubleExponent-PT-010-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1590135906234

[2020-05-22 08:25:07] [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 08:25:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-05-22 08:25:08] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2020-05-22 08:25:08] [INFO ] Transformed 534 places.
[2020-05-22 08:25:08] [INFO ] Transformed 498 transitions.
[2020-05-22 08:25:08] [INFO ] Parsed PT model containing 534 places and 498 transitions in 108 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 338 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 10001 steps, including 280 resets, run finished after 25 ms. (steps per millisecond=400 ) 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 26 ms. (steps per millisecond=384 ) 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 271 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 276 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 283 resets, run finished after 20 ms. (steps per millisecond=500 ) 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 294 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 17 ms. (steps per millisecond=588 ) 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 285 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 293 resets, run finished after 17 ms. (steps per millisecond=588 ) 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 286 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 273 resets, run finished after 16 ms. (steps per millisecond=625 ) 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 18 ms. (steps per millisecond=555 ) 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 17 ms. (steps per millisecond=588 ) 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 284 resets, run finished after 18 ms. (steps per millisecond=555 ) 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 17 ms. (steps per millisecond=588 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Probably explored full state space saw : 1402705 states, properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
Probabilistic random walk after 2805612 steps, saw 1402705 distinct states, run finished after 13363 ms. (steps per millisecond=209 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Interrupted probabilistic random walk after 5513583 steps, run timeout after 30001 ms. (steps per millisecond=183 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
Exhaustive walk after 5513583 steps, saw 2756487 distinct states, run finished after 30001 ms. (steps per millisecond=183 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
// Phase 1: matrix 498 rows 534 cols
[2020-05-22 08:25:51] [INFO ] Computed 54 place invariants in 57 ms
[2020-05-22 08:25:52] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2020-05-22 08:25:52] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 38 ms returned unsat
[2020-05-22 08:25:52] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-05-22 08:25:52] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 62 ms returned unsat
[2020-05-22 08:25:52] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2020-05-22 08:25:52] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 44 ms returned sat
[2020-05-22 08:25:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:25:53] [INFO ] [Real]Absence check using state equation in 1137 ms returned sat
[2020-05-22 08:25:53] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:25:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-22 08:25:53] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 31 ms returned sat
[2020-05-22 08:25:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:25:54] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2020-05-22 08:25:54] [INFO ] Deduced a trap composed of 173 places in 317 ms
[2020-05-22 08:25:55] [INFO ] Deduced a trap composed of 84 places in 262 ms
[2020-05-22 08:25:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 739 ms
[2020-05-22 08:25:55] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 40 ms.
[2020-05-22 08:25:58] [INFO ] Added : 305 causal constraints over 61 iterations in 3477 ms. Result :unknown
[2020-05-22 08:25:58] [INFO ] [Real]Absence check using 2 positive place invariants in 17 ms returned sat
[2020-05-22 08:25:58] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 18 ms returned unsat
[2020-05-22 08:25:58] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 08:25:58] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 39 ms returned sat
[2020-05-22 08:25:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:25:59] [INFO ] [Real]Absence check using state equation in 758 ms returned sat
[2020-05-22 08:25:59] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:25:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:25:59] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 23 ms returned unsat
[2020-05-22 08:25:59] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:25:59] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 38 ms returned sat
[2020-05-22 08:25:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:00] [INFO ] [Real]Absence check using state equation in 907 ms returned sat
[2020-05-22 08:26:00] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:26:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:26:00] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 57 ms returned sat
[2020-05-22 08:26:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:01] [INFO ] [Nat]Absence check using state equation in 923 ms returned sat
[2020-05-22 08:26:02] [INFO ] Deduced a trap composed of 18 places in 277 ms
[2020-05-22 08:26:02] [INFO ] Deduced a trap composed of 41 places in 223 ms
[2020-05-22 08:26:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 572 ms
[2020-05-22 08:26:02] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 34 ms.
[2020-05-22 08:26:05] [INFO ] Added : 285 causal constraints over 57 iterations in 3375 ms. Result :(error "Failed to check-sat")
[2020-05-22 08:26:05] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 08:26:05] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 35 ms returned sat
[2020-05-22 08:26:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:06] [INFO ] [Real]Absence check using state equation in 781 ms returned sat
[2020-05-22 08:26:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:26:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-22 08:26:06] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 50 ms returned sat
[2020-05-22 08:26:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:07] [INFO ] [Nat]Absence check using state equation in 767 ms returned sat
[2020-05-22 08:26:07] [INFO ] Deduced a trap composed of 60 places in 227 ms
[2020-05-22 08:26:08] [INFO ] Deduced a trap composed of 171 places in 193 ms
[2020-05-22 08:26:08] [INFO ] Deduced a trap composed of 53 places in 224 ms
[2020-05-22 08:26:08] [INFO ] Deduced a trap composed of 55 places in 192 ms
[2020-05-22 08:26:08] [INFO ] Deduced a trap composed of 61 places in 174 ms
[2020-05-22 08:26:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1215 ms
[2020-05-22 08:26:08] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 36 ms.
[2020-05-22 08:26:11] [INFO ] Added : 278 causal constraints over 57 iterations in 2580 ms. Result :sat
[2020-05-22 08:26:11] [INFO ] Deduced a trap composed of 41 places in 243 ms
[2020-05-22 08:26:12] [INFO ] Deduced a trap composed of 43 places in 239 ms
[2020-05-22 08:26:12] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s13 s36 s37 s38 s39 s40 s45 s49 s50 s51 s52 s53 s56 s57 s58 s59 s60 s61 s62 s67 s78 s89 s100 s111 s112 s123 s134 s145 s156 s167 s222 s333 s444 s490 s492 s493 s494 s495 s496 s497 s498 s501) 0)") while checking expression at index 6
[2020-05-22 08:26:12] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2020-05-22 08:26:12] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 27 ms returned unsat
[2020-05-22 08:26:12] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2020-05-22 08:26:12] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 57 ms returned unsat
[2020-05-22 08:26:12] [INFO ] [Real]Absence check using 2 positive place invariants in 22 ms returned sat
[2020-05-22 08:26:12] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 33 ms returned unsat
[2020-05-22 08:26:12] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:26:12] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 46 ms returned sat
[2020-05-22 08:26:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:13] [INFO ] [Real]Absence check using state equation in 916 ms returned sat
[2020-05-22 08:26:13] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:26:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:26:13] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 33 ms returned sat
[2020-05-22 08:26:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:14] [INFO ] [Nat]Absence check using state equation in 758 ms returned sat
[2020-05-22 08:26:14] [INFO ] Deduced a trap composed of 192 places in 315 ms
[2020-05-22 08:26:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 418 ms
[2020-05-22 08:26:14] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 51 ms.
[2020-05-22 08:26:18] [INFO ] Added : 320 causal constraints over 64 iterations in 3733 ms. Result :unknown
[2020-05-22 08:26:18] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:26:18] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 21 ms returned unsat
[2020-05-22 08:26:18] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:26:18] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 33 ms returned sat
[2020-05-22 08:26:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:19] [INFO ] [Real]Absence check using state equation in 745 ms returned sat
[2020-05-22 08:26:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:26:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 11 ms returned sat
[2020-05-22 08:26:19] [INFO ] [Nat]Absence check using 2 positive and 52 generalized place invariants in 50 ms returned sat
[2020-05-22 08:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:26:20] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2020-05-22 08:26:20] [INFO ] Deduced a trap composed of 179 places in 284 ms
[2020-05-22 08:26:21] [INFO ] Deduced a trap composed of 185 places in 250 ms
[2020-05-22 08:26:21] [INFO ] Deduced a trap composed of 191 places in 278 ms
[2020-05-22 08:26:21] [INFO ] Deduced a trap composed of 41 places in 270 ms
[2020-05-22 08:26:21] [INFO ] Deduced a trap composed of 203 places in 264 ms
[2020-05-22 08:26:22] [INFO ] Deduced a trap composed of 236 places in 239 ms
[2020-05-22 08:26:22] [INFO ] Deduced a trap composed of 208 places in 240 ms
[2020-05-22 08:26:22] [INFO ] Deduced a trap composed of 221 places in 253 ms
[2020-05-22 08:26:23] [INFO ] Deduced a trap composed of 166 places in 227 ms
[2020-05-22 08:26:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2588 ms
[2020-05-22 08:26:23] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints in 46 ms.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2020-05-22 08:26:24] [INFO ] Added : 95 causal constraints over 19 iterations in 1359 ms. Result :(error "Failed to check-sat")
[2020-05-22 08:26:24] [INFO ] [Real]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:26:24] [INFO ] [Real]Absence check using 2 positive and 52 generalized place invariants in 31 ms returned unsat
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 464200 steps, including 16731 resets, run finished after 982 ms. (steps per millisecond=472 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 245600 steps, including 8752 resets, run finished after 436 ms. (steps per millisecond=563 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 19 out of 534 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 534/534 places, 498/498 transitions.
Discarding 6 places :
Also discarding 0 output transitions
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.8 ms
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Iterating post reduction 0 with 111 rules applied. Total rules applied 112 place count 527 transition count 388
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 220 place count 419 transition count 388
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 220 place count 419 transition count 370
Deduced a syphon composed of 18 places in 6 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 256 place count 401 transition count 370
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 2 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 430 place count 314 transition count 283
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 456 place count 301 transition count 283
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 458 place count 301 transition count 281
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 460 place count 299 transition count 281
Free-agglomeration rule (complex) applied 44 times.
Iterating global reduction 3 with 44 rules applied. Total rules applied 504 place count 299 transition count 237
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 3 with 44 rules applied. Total rules applied 548 place count 255 transition count 237
Partial Free-agglomeration rule applied 41 times.
Drop transitions removed 41 transitions
Iterating global reduction 4 with 41 rules applied. Total rules applied 589 place count 255 transition count 237
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 590 place count 254 transition count 236
Applied a total of 590 rules in 143 ms. Remains 254 /534 variables (removed 280) and now considering 236/498 (removed 262) transitions.
Finished structural reductions, in 1 iterations. Remains : 254/534 places, 236/498 transitions.
Incomplete random walk after 1000000 steps, including 128217 resets, run finished after 1717 ms. (steps per millisecond=582 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84299 resets, run finished after 1162 ms. (steps per millisecond=860 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84640 resets, run finished after 1003 ms. (steps per millisecond=997 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84703 resets, run finished after 1018 ms. (steps per millisecond=982 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 84747 resets, run finished after 1333 ms. (steps per millisecond=750 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 84644 resets, run finished after 1020 ms. (steps per millisecond=980 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 8148581 steps, run timeout after 30001 ms. (steps per millisecond=271 ) properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 8148581 steps, saw 4073118 distinct states, run finished after 30001 ms. (steps per millisecond=271 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 236 rows 254 cols
[2020-05-22 08:27:03] [INFO ] Computed 50 place invariants in 36 ms
[2020-05-22 08:27:03] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 08:27:03] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 37 ms returned sat
[2020-05-22 08:27:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:03] [INFO ] [Real]Absence check using state equation in 287 ms returned sat
[2020-05-22 08:27:03] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:27:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 08:27:03] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2020-05-22 08:27:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:04] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2020-05-22 08:27:04] [INFO ] State equation strengthened by 37 read => feed constraints.
[2020-05-22 08:27:04] [INFO ] [Nat]Added 37 Read/Feed constraints in 38 ms returned sat
[2020-05-22 08:27:04] [INFO ] Deduced a trap composed of 73 places in 140 ms
[2020-05-22 08:27:04] [INFO ] Deduced a trap composed of 33 places in 38 ms
[2020-05-22 08:27:04] [INFO ] Deduced a trap composed of 77 places in 94 ms
[2020-05-22 08:27:04] [INFO ] Deduced a trap composed of 25 places in 95 ms
[2020-05-22 08:27:04] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 430 ms
[2020-05-22 08:27:04] [INFO ] Computed and/alt/rep : 235/1366/235 causal constraints in 15 ms.
[2020-05-22 08:27:06] [INFO ] Added : 195 causal constraints over 39 iterations in 1587 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-22 08:27:06] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 08:27:06] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 35 ms returned sat
[2020-05-22 08:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:06] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2020-05-22 08:27:06] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:27:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:27:06] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 36 ms returned sat
[2020-05-22 08:27:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:07] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-05-22 08:27:07] [INFO ] [Nat]Added 37 Read/Feed constraints in 76 ms returned sat
[2020-05-22 08:27:07] [INFO ] Deduced a trap composed of 12 places in 106 ms
[2020-05-22 08:27:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 143 ms
[2020-05-22 08:27:07] [INFO ] Computed and/alt/rep : 235/1366/235 causal constraints in 18 ms.
[2020-05-22 08:27:10] [INFO ] Added : 235 causal constraints over 47 iterations in 3018 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-05-22 08:27:10] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2020-05-22 08:27:10] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 18 ms returned sat
[2020-05-22 08:27:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:10] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2020-05-22 08:27:10] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:27:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 6 ms returned sat
[2020-05-22 08:27:10] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2020-05-22 08:27:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:11] [INFO ] [Nat]Absence check using state equation in 356 ms returned sat
[2020-05-22 08:27:11] [INFO ] [Nat]Added 37 Read/Feed constraints in 48 ms returned sat
[2020-05-22 08:27:11] [INFO ] Deduced a trap composed of 47 places in 94 ms
[2020-05-22 08:27:11] [INFO ] Deduced a trap composed of 45 places in 76 ms
[2020-05-22 08:27:11] [INFO ] Deduced a trap composed of 34 places in 75 ms
[2020-05-22 08:27:11] [INFO ] Deduced a trap composed of 25 places in 75 ms
[2020-05-22 08:27:11] [INFO ] Deduced a trap composed of 51 places in 61 ms
[2020-05-22 08:27:11] [INFO ] Deduced a trap composed of 39 places in 59 ms
[2020-05-22 08:27:11] [INFO ] Deduced a trap composed of 37 places in 64 ms
[2020-05-22 08:27:11] [INFO ] Deduced a trap composed of 56 places in 66 ms
[2020-05-22 08:27:11] [INFO ] Deduced a trap composed of 54 places in 58 ms
[2020-05-22 08:27:12] [INFO ] Deduced a trap composed of 59 places in 60 ms
[2020-05-22 08:27:12] [INFO ] Deduced a trap composed of 63 places in 54 ms
[2020-05-22 08:27:12] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 948 ms
[2020-05-22 08:27:12] [INFO ] Computed and/alt/rep : 235/1366/235 causal constraints in 13 ms.
[2020-05-22 08:27:13] [INFO ] Added : 219 causal constraints over 44 iterations in 1830 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
[2020-05-22 08:27:14] [INFO ] [Real]Absence check using 2 positive place invariants in 7 ms returned sat
[2020-05-22 08:27:14] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 30 ms returned sat
[2020-05-22 08:27:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:14] [INFO ] [Real]Absence check using state equation in 327 ms returned sat
[2020-05-22 08:27:14] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:27:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:27:14] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 23 ms returned sat
[2020-05-22 08:27:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:14] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2020-05-22 08:27:14] [INFO ] [Nat]Added 37 Read/Feed constraints in 30 ms returned sat
[2020-05-22 08:27:14] [INFO ] Deduced a trap composed of 25 places in 110 ms
[2020-05-22 08:27:15] [INFO ] Deduced a trap composed of 33 places in 52 ms
[2020-05-22 08:27:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 204 ms
[2020-05-22 08:27:15] [INFO ] Computed and/alt/rep : 235/1366/235 causal constraints in 16 ms.
[2020-05-22 08:27:17] [INFO ] Added : 225 causal constraints over 45 iterations in 2254 ms. Result :sat
[2020-05-22 08:27:17] [INFO ] Deduced a trap composed of 8 places in 107 ms
[2020-05-22 08:27:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2020-05-22 08:27:17] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2020-05-22 08:27:17] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 24 ms returned sat
[2020-05-22 08:27:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:17] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2020-05-22 08:27:17] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:27:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 8 ms returned sat
[2020-05-22 08:27:18] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2020-05-22 08:27:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:27:18] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2020-05-22 08:27:18] [INFO ] [Nat]Added 37 Read/Feed constraints in 11 ms returned sat
[2020-05-22 08:27:18] [INFO ] Computed and/alt/rep : 235/1366/235 causal constraints in 21 ms.
[2020-05-22 08:27:20] [INFO ] Added : 225 causal constraints over 45 iterations in 2179 ms. Result :sat
[2020-05-22 08:27:20] [INFO ] Deduced a trap composed of 28 places in 76 ms
[2020-05-22 08:27:20] [INFO ] Deduced a trap composed of 16 places in 76 ms
[2020-05-22 08:27:20] [INFO ] Deduced a trap composed of 24 places in 54 ms
[2020-05-22 08:27:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 339 ms
Attempting to minimize the solution found.
Minimization took 26 ms.
Incomplete Parikh walk after 2063200 steps, including 312311 resets, run finished after 4380 ms. (steps per millisecond=471 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 322700 steps, including 48831 resets, run finished after 569 ms. (steps per millisecond=567 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 50800 steps, including 7663 resets, run finished after 85 ms. (steps per millisecond=597 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Interrupted Parikh walk after 16096443 steps, including 2438480 resets, run timeout after 30001 ms. (steps per millisecond=536 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Parikh walk after 127000 steps, including 19200 resets, run finished after 203 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 19 out of 254 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 254/254 places, 236/236 transitions.
Applied a total of 0 rules in 8 ms. Remains 254 /254 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 254/254 places, 236/236 transitions.
Starting structural reductions, iteration 0 : 254/254 places, 236/236 transitions.
Applied a total of 0 rules in 7 ms. Remains 254 /254 variables (removed 0) and now considering 236/236 (removed 0) transitions.
// Phase 1: matrix 236 rows 254 cols
[2020-05-22 08:27:56] [INFO ] Computed 50 place invariants in 10 ms
[2020-05-22 08:27:56] [INFO ] Implicit Places using invariants in 473 ms returned [22, 28, 52, 59, 83, 109, 115, 136, 141, 142, 165, 170, 191, 197, 204, 212, 218]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 480 ms to find 17 implicit places.
[2020-05-22 08:27:56] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 236 rows 237 cols
[2020-05-22 08:27:56] [INFO ] Computed 34 place invariants in 23 ms
[2020-05-22 08:27:56] [INFO ] Dead Transitions using invariants and state equation in 363 ms returned []
Starting structural reductions, iteration 1 : 237/254 places, 236/236 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 236 transition count 235
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 236 transition count 228
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 229 transition count 228
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 229 transition count 228
Applied a total of 17 rules in 24 ms. Remains 229 /237 variables (removed 8) and now considering 228/236 (removed 8) transitions.
// Phase 1: matrix 228 rows 229 cols
[2020-05-22 08:27:57] [INFO ] Computed 34 place invariants in 9 ms
[2020-05-22 08:27:57] [INFO ] Implicit Places using invariants in 313 ms returned []
// Phase 1: matrix 228 rows 229 cols
[2020-05-22 08:27:57] [INFO ] Computed 34 place invariants in 17 ms
[2020-05-22 08:27:57] [INFO ] State equation strengthened by 37 read => feed constraints.
[2020-05-22 08:27:58] [INFO ] Implicit Places using invariants and state equation in 1453 ms returned []
Implicit Place search using SMT with State Equation took 1769 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 229/254 places, 228/236 transitions.
Incomplete random walk after 1000000 steps, including 144086 resets, run finished after 1690 ms. (steps per millisecond=591 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 91596 resets, run finished after 1070 ms. (steps per millisecond=934 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 91264 resets, run finished after 1247 ms. (steps per millisecond=801 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 91247 resets, run finished after 1189 ms. (steps per millisecond=841 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 91119 resets, run finished after 1208 ms. (steps per millisecond=827 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 91226 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties seen :[0, 0, 0, 0, 0]
Probably explored full state space saw : 355172 states, properties seen :[0, 0, 0, 0, 0]
Probabilistic random walk after 710357 steps, saw 355172 distinct states, run finished after 2738 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0, 0, 0]
Interrupted probabilistic random walk after 7772222 steps, run timeout after 30001 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0, 0, 0]
Exhaustive walk after 7772222 steps, saw 3885975 distinct states, run finished after 30001 ms. (steps per millisecond=259 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 228 rows 229 cols
[2020-05-22 08:28:39] [INFO ] Computed 34 place invariants in 9 ms
[2020-05-22 08:28:39] [INFO ] [Real]Absence check using 5 positive place invariants in 18 ms returned sat
[2020-05-22 08:28:39] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 21 ms returned sat
[2020-05-22 08:28:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:39] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2020-05-22 08:28:39] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:39] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-05-22 08:28:39] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 14 ms returned sat
[2020-05-22 08:28:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:39] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2020-05-22 08:28:39] [INFO ] State equation strengthened by 37 read => feed constraints.
[2020-05-22 08:28:39] [INFO ] [Nat]Added 37 Read/Feed constraints in 18 ms returned sat
[2020-05-22 08:28:39] [INFO ] Deduced a trap composed of 74 places in 108 ms
[2020-05-22 08:28:39] [INFO ] Deduced a trap composed of 26 places in 57 ms
[2020-05-22 08:28:40] [INFO ] Deduced a trap composed of 32 places in 51 ms
[2020-05-22 08:28:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 268 ms
[2020-05-22 08:28:40] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 18 ms.
[2020-05-22 08:28:41] [INFO ] Added : 166 causal constraints over 34 iterations in 1089 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-05-22 08:28:41] [INFO ] [Real]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 08:28:41] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 23 ms returned sat
[2020-05-22 08:28:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:41] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2020-05-22 08:28:41] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:41] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2020-05-22 08:28:41] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 19 ms returned sat
[2020-05-22 08:28:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:41] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2020-05-22 08:28:41] [INFO ] [Nat]Added 37 Read/Feed constraints in 58 ms returned sat
[2020-05-22 08:28:42] [INFO ] Deduced a trap composed of 4 places in 126 ms
[2020-05-22 08:28:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 152 ms
[2020-05-22 08:28:42] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 19 ms.
[2020-05-22 08:28:45] [INFO ] Added : 225 causal constraints over 46 iterations in 3043 ms. Result :sat
[2020-05-22 08:28:45] [INFO ] Deduced a trap composed of 76 places in 131 ms
[2020-05-22 08:28:45] [INFO ] Deduced a trap composed of 76 places in 120 ms
[2020-05-22 08:28:45] [INFO ] Deduced a trap composed of 73 places in 96 ms
[2020-05-22 08:28:45] [INFO ] Deduced a trap composed of 74 places in 106 ms
[2020-05-22 08:28:45] [INFO ] Deduced a trap composed of 70 places in 122 ms
[2020-05-22 08:28:45] [INFO ] Deduced a trap composed of 73 places in 96 ms
[2020-05-22 08:28:46] [INFO ] Deduced a trap composed of 79 places in 96 ms
[2020-05-22 08:28:46] [INFO ] Deduced a trap composed of 84 places in 123 ms
[2020-05-22 08:28:46] [INFO ] Deduced a trap composed of 75 places in 105 ms
[2020-05-22 08:28:46] [INFO ] Deduced a trap composed of 87 places in 96 ms
[2020-05-22 08:28:46] [INFO ] Deduced a trap composed of 87 places in 96 ms
[2020-05-22 08:28:46] [INFO ] Deduced a trap composed of 90 places in 94 ms
[2020-05-22 08:28:46] [INFO ] Deduced a trap composed of 79 places in 93 ms
[2020-05-22 08:28:46] [INFO ] Deduced a trap composed of 82 places in 113 ms
[2020-05-22 08:28:47] [INFO ] Deduced a trap composed of 85 places in 118 ms
[2020-05-22 08:28:47] [INFO ] Deduced a trap composed of 91 places in 102 ms
[2020-05-22 08:28:47] [INFO ] Deduced a trap composed of 82 places in 91 ms
[2020-05-22 08:28:47] [INFO ] Deduced a trap composed of 84 places in 94 ms
[2020-05-22 08:28:47] [INFO ] Deduced a trap composed of 87 places in 121 ms
[2020-05-22 08:28:47] [INFO ] Deduced a trap composed of 77 places in 125 ms
[2020-05-22 08:28:48] [INFO ] Deduced a trap composed of 77 places in 117 ms
[2020-05-22 08:28:48] [INFO ] Deduced a trap composed of 79 places in 123 ms
[2020-05-22 08:28:48] [INFO ] Deduced a trap composed of 20 places in 116 ms
[2020-05-22 08:28:48] [INFO ] Deduced a trap composed of 84 places in 113 ms
[2020-05-22 08:28:48] [INFO ] Deduced a trap composed of 76 places in 105 ms
[2020-05-22 08:28:48] [INFO ] Deduced a trap composed of 33 places in 103 ms
[2020-05-22 08:28:49] [INFO ] Deduced a trap composed of 82 places in 106 ms
[2020-05-22 08:28:49] [INFO ] Deduced a trap composed of 76 places in 93 ms
[2020-05-22 08:28:49] [INFO ] Deduced a trap composed of 76 places in 118 ms
[2020-05-22 08:28:49] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4326 ms
Attempting to minimize the solution found.
Minimization took 37 ms.
[2020-05-22 08:28:49] [INFO ] [Real]Absence check using 5 positive place invariants in 14 ms returned sat
[2020-05-22 08:28:49] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 19 ms returned sat
[2020-05-22 08:28:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:49] [INFO ] [Real]Absence check using state equation in 234 ms returned sat
[2020-05-22 08:28:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:49] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 08:28:49] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 13 ms returned sat
[2020-05-22 08:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:50] [INFO ] [Nat]Absence check using state equation in 287 ms returned sat
[2020-05-22 08:28:50] [INFO ] [Nat]Added 37 Read/Feed constraints in 28 ms returned sat
[2020-05-22 08:28:50] [INFO ] Deduced a trap composed of 67 places in 140 ms
[2020-05-22 08:28:50] [INFO ] Deduced a trap composed of 57 places in 124 ms
[2020-05-22 08:28:50] [INFO ] Deduced a trap composed of 70 places in 123 ms
[2020-05-22 08:28:50] [INFO ] Deduced a trap composed of 72 places in 109 ms
[2020-05-22 08:28:50] [INFO ] Deduced a trap composed of 62 places in 108 ms
[2020-05-22 08:28:50] [INFO ] Deduced a trap composed of 75 places in 96 ms
[2020-05-22 08:28:51] [INFO ] Deduced a trap composed of 62 places in 96 ms
[2020-05-22 08:28:51] [INFO ] Deduced a trap composed of 75 places in 94 ms
[2020-05-22 08:28:51] [INFO ] Deduced a trap composed of 46 places in 98 ms
[2020-05-22 08:28:51] [INFO ] Deduced a trap composed of 75 places in 119 ms
[2020-05-22 08:28:51] [INFO ] Deduced a trap composed of 73 places in 119 ms
[2020-05-22 08:28:51] [INFO ] Deduced a trap composed of 61 places in 93 ms
[2020-05-22 08:28:51] [INFO ] Deduced a trap composed of 73 places in 88 ms
[2020-05-22 08:28:51] [INFO ] Deduced a trap composed of 78 places in 87 ms
[2020-05-22 08:28:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1759 ms
[2020-05-22 08:28:51] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 15 ms.
[2020-05-22 08:28:53] [INFO ] Added : 192 causal constraints over 39 iterations in 1615 ms. Result :sat
[2020-05-22 08:28:53] [INFO ] Deduced a trap composed of 3 places in 100 ms
[2020-05-22 08:28:53] [INFO ] Deduced a trap composed of 8 places in 107 ms
[2020-05-22 08:28:54] [INFO ] Deduced a trap composed of 4 places in 159 ms
[2020-05-22 08:28:54] [INFO ] Deduced a trap composed of 10 places in 87 ms
[2020-05-22 08:28:54] [INFO ] Deduced a trap composed of 24 places in 78 ms
[2020-05-22 08:28:54] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 756 ms
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-05-22 08:28:54] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 08:28:54] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 14 ms returned sat
[2020-05-22 08:28:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:54] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2020-05-22 08:28:54] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:28:54] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 08:28:54] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 14 ms returned sat
[2020-05-22 08:28:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:28:55] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2020-05-22 08:28:55] [INFO ] [Nat]Added 37 Read/Feed constraints in 43 ms returned sat
[2020-05-22 08:28:55] [INFO ] Deduced a trap composed of 72 places in 124 ms
[2020-05-22 08:28:55] [INFO ] Deduced a trap composed of 73 places in 99 ms
[2020-05-22 08:28:55] [INFO ] Deduced a trap composed of 81 places in 98 ms
[2020-05-22 08:28:55] [INFO ] Deduced a trap composed of 86 places in 94 ms
[2020-05-22 08:28:55] [INFO ] Deduced a trap composed of 60 places in 92 ms
[2020-05-22 08:28:55] [INFO ] Deduced a trap composed of 79 places in 101 ms
[2020-05-22 08:28:55] [INFO ] Deduced a trap composed of 73 places in 94 ms
[2020-05-22 08:28:55] [INFO ] Deduced a trap composed of 84 places in 95 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 88 places in 95 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 67 places in 87 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 66 places in 84 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 68 places in 74 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 84 places in 71 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 89 places in 71 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 66 places in 69 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 71 places in 69 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 83 places in 71 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 66 places in 69 ms
[2020-05-22 08:28:56] [INFO ] Deduced a trap composed of 77 places in 70 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 72 places in 69 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 71 places in 70 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 70 places in 85 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 73 places in 69 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 69 places in 71 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 75 places in 107 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 72 places in 92 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 71 places in 106 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 76 places in 84 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 75 places in 75 ms
[2020-05-22 08:28:57] [INFO ] Deduced a trap composed of 80 places in 74 ms
[2020-05-22 08:28:58] [INFO ] Deduced a trap composed of 72 places in 78 ms
[2020-05-22 08:28:58] [INFO ] Deduced a trap composed of 71 places in 72 ms
[2020-05-22 08:28:58] [INFO ] Deduced a trap composed of 73 places in 88 ms
[2020-05-22 08:28:58] [INFO ] Deduced a trap composed of 79 places in 83 ms
[2020-05-22 08:28:58] [INFO ] Deduced a trap composed of 74 places in 89 ms
[2020-05-22 08:28:58] [INFO ] Deduced a trap composed of 75 places in 79 ms
[2020-05-22 08:28:58] [INFO ] Deduced a trap composed of 78 places in 113 ms
[2020-05-22 08:28:58] [INFO ] Deduced a trap composed of 80 places in 98 ms
[2020-05-22 08:28:58] [INFO ] Deduced a trap composed of 86 places in 92 ms
[2020-05-22 08:28:59] [INFO ] Deduced a trap composed of 92 places in 102 ms
[2020-05-22 08:28:59] [INFO ] Deduced a trap composed of 87 places in 90 ms
[2020-05-22 08:28:59] [INFO ] Deduced a trap composed of 90 places in 95 ms
[2020-05-22 08:28:59] [INFO ] Deduced a trap composed of 93 places in 116 ms
[2020-05-22 08:28:59] [INFO ] Deduced a trap composed of 91 places in 91 ms
[2020-05-22 08:28:59] [INFO ] Deduced a trap composed of 90 places in 135 ms
[2020-05-22 08:28:59] [INFO ] Deduced a trap composed of 83 places in 107 ms
[2020-05-22 08:28:59] [INFO ] Deduced a trap composed of 69 places in 83 ms
[2020-05-22 08:28:59] [INFO ] Deduced a trap composed of 89 places in 110 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 79 places in 92 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 87 places in 107 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 89 places in 81 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 82 places in 73 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 83 places in 71 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 84 places in 70 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 83 places in 89 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 86 places in 77 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 82 places in 75 ms
[2020-05-22 08:29:00] [INFO ] Deduced a trap composed of 77 places in 76 ms
[2020-05-22 08:29:01] [INFO ] Deduced a trap composed of 92 places in 80 ms
[2020-05-22 08:29:01] [INFO ] Deduced a trap composed of 90 places in 81 ms
[2020-05-22 08:29:01] [INFO ] Deduced a trap composed of 84 places in 77 ms
[2020-05-22 08:29:01] [INFO ] Deduced a trap composed of 89 places in 99 ms
[2020-05-22 08:29:01] [INFO ] Trap strengthening (SAT) tested/added 63/62 trap constraints in 6259 ms
[2020-05-22 08:29:01] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 19 ms.
[2020-05-22 08:29:04] [INFO ] Added : 217 causal constraints over 44 iterations in 2800 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 22 ms.
[2020-05-22 08:29:04] [INFO ] [Real]Absence check using 5 positive place invariants in 8 ms returned sat
[2020-05-22 08:29:04] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 12 ms returned sat
[2020-05-22 08:29:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:04] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2020-05-22 08:29:04] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 23 ms returned sat
[2020-05-22 08:29:04] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 17 ms returned sat
[2020-05-22 08:29:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:04] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2020-05-22 08:29:04] [INFO ] [Nat]Added 37 Read/Feed constraints in 16 ms returned sat
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 68 places in 124 ms
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 67 places in 93 ms
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 61 places in 95 ms
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 32 places in 86 ms
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 33 places in 87 ms
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 70 places in 86 ms
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 56 places in 88 ms
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 83 places in 85 ms
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 26 places in 85 ms
[2020-05-22 08:29:05] [INFO ] Deduced a trap composed of 79 places in 72 ms
[2020-05-22 08:29:06] [INFO ] Deduced a trap composed of 77 places in 62 ms
[2020-05-22 08:29:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1103 ms
[2020-05-22 08:29:06] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 11 ms.
[2020-05-22 08:29:08] [INFO ] Added : 220 causal constraints over 44 iterations in 2603 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
Incomplete Parikh walk after 840100 steps, including 140260 resets, run finished after 1718 ms. (steps per millisecond=488 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 563100 steps, including 94206 resets, run finished after 942 ms. (steps per millisecond=597 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 462300 steps, including 77373 resets, run finished after 765 ms. (steps per millisecond=604 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 2213100 steps, including 370051 resets, run finished after 4488 ms. (steps per millisecond=493 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Incomplete Parikh walk after 153500 steps, including 25723 resets, run finished after 385 ms. (steps per millisecond=398 ) properties seen :[0, 0, 0, 0, 0] could not realise parikh vector
Support contains 19 out of 229 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 229/229 places, 228/228 transitions.
Applied a total of 0 rules in 10 ms. Remains 229 /229 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 228/228 transitions.
Starting structural reductions, iteration 0 : 229/229 places, 228/228 transitions.
Applied a total of 0 rules in 9 ms. Remains 229 /229 variables (removed 0) and now considering 228/228 (removed 0) transitions.
// Phase 1: matrix 228 rows 229 cols
[2020-05-22 08:29:17] [INFO ] Computed 34 place invariants in 8 ms
[2020-05-22 08:29:17] [INFO ] Implicit Places using invariants in 370 ms returned []
// Phase 1: matrix 228 rows 229 cols
[2020-05-22 08:29:17] [INFO ] Computed 34 place invariants in 7 ms
[2020-05-22 08:29:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2020-05-22 08:29:19] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2026 ms to find 0 implicit places.
[2020-05-22 08:29:19] [INFO ] Redundant transitions in 9 ms returned []
// Phase 1: matrix 228 rows 229 cols
[2020-05-22 08:29:19] [INFO ] Computed 34 place invariants in 8 ms
[2020-05-22 08:29:19] [INFO ] Dead Transitions using invariants and state equation in 348 ms returned []
Finished structural reductions, in 1 iterations. Remains : 229/229 places, 228/228 transitions.
Incomplete random walk after 100000 steps, including 14428 resets, run finished after 174 ms. (steps per millisecond=574 ) properties seen :[0, 0, 0, 0, 0]
// Phase 1: matrix 228 rows 229 cols
[2020-05-22 08:29:19] [INFO ] Computed 34 place invariants in 7 ms
[2020-05-22 08:29:19] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 08:29:19] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 27 ms returned sat
[2020-05-22 08:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:19] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2020-05-22 08:29:19] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:20] [INFO ] [Nat]Absence check using 5 positive place invariants in 24 ms returned sat
[2020-05-22 08:29:20] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 18 ms returned sat
[2020-05-22 08:29:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:20] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2020-05-22 08:29:20] [INFO ] State equation strengthened by 37 read => feed constraints.
[2020-05-22 08:29:20] [INFO ] [Nat]Added 37 Read/Feed constraints in 20 ms returned sat
[2020-05-22 08:29:20] [INFO ] Deduced a trap composed of 74 places in 113 ms
[2020-05-22 08:29:20] [INFO ] Deduced a trap composed of 26 places in 50 ms
[2020-05-22 08:29:20] [INFO ] Deduced a trap composed of 32 places in 48 ms
[2020-05-22 08:29:20] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2020-05-22 08:29:20] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 21 ms.
[2020-05-22 08:29:21] [INFO ] Added : 166 causal constraints over 34 iterations in 1321 ms. Result :sat
[2020-05-22 08:29:22] [INFO ] [Real]Absence check using 5 positive place invariants in 11 ms returned sat
[2020-05-22 08:29:22] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 18 ms returned sat
[2020-05-22 08:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:22] [INFO ] [Real]Absence check using state equation in 290 ms returned sat
[2020-05-22 08:29:22] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:22] [INFO ] [Nat]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 08:29:22] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 14 ms returned sat
[2020-05-22 08:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:22] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2020-05-22 08:29:22] [INFO ] [Nat]Added 37 Read/Feed constraints in 41 ms returned sat
[2020-05-22 08:29:22] [INFO ] Deduced a trap composed of 4 places in 110 ms
[2020-05-22 08:29:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2020-05-22 08:29:22] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 19 ms.
[2020-05-22 08:29:25] [INFO ] Added : 225 causal constraints over 46 iterations in 2997 ms. Result :sat
[2020-05-22 08:29:25] [INFO ] Deduced a trap composed of 76 places in 133 ms
[2020-05-22 08:29:26] [INFO ] Deduced a trap composed of 76 places in 132 ms
[2020-05-22 08:29:26] [INFO ] Deduced a trap composed of 73 places in 102 ms
[2020-05-22 08:29:26] [INFO ] Deduced a trap composed of 74 places in 115 ms
[2020-05-22 08:29:26] [INFO ] Deduced a trap composed of 70 places in 124 ms
[2020-05-22 08:29:26] [INFO ] Deduced a trap composed of 73 places in 110 ms
[2020-05-22 08:29:26] [INFO ] Deduced a trap composed of 79 places in 125 ms
[2020-05-22 08:29:27] [INFO ] Deduced a trap composed of 84 places in 123 ms
[2020-05-22 08:29:27] [INFO ] Deduced a trap composed of 75 places in 98 ms
[2020-05-22 08:29:27] [INFO ] Deduced a trap composed of 87 places in 116 ms
[2020-05-22 08:29:27] [INFO ] Deduced a trap composed of 87 places in 115 ms
[2020-05-22 08:29:27] [INFO ] Deduced a trap composed of 90 places in 115 ms
[2020-05-22 08:29:27] [INFO ] Deduced a trap composed of 79 places in 108 ms
[2020-05-22 08:29:27] [INFO ] Deduced a trap composed of 82 places in 113 ms
[2020-05-22 08:29:28] [INFO ] Deduced a trap composed of 85 places in 120 ms
[2020-05-22 08:29:28] [INFO ] Deduced a trap composed of 91 places in 122 ms
[2020-05-22 08:29:28] [INFO ] Deduced a trap composed of 82 places in 120 ms
[2020-05-22 08:29:28] [INFO ] Deduced a trap composed of 84 places in 121 ms
[2020-05-22 08:29:28] [INFO ] Deduced a trap composed of 87 places in 123 ms
[2020-05-22 08:29:28] [INFO ] Deduced a trap composed of 77 places in 121 ms
[2020-05-22 08:29:29] [INFO ] Deduced a trap composed of 77 places in 119 ms
[2020-05-22 08:29:29] [INFO ] Deduced a trap composed of 79 places in 132 ms
[2020-05-22 08:29:29] [INFO ] Deduced a trap composed of 20 places in 116 ms
[2020-05-22 08:29:29] [INFO ] Deduced a trap composed of 84 places in 99 ms
[2020-05-22 08:29:29] [INFO ] Deduced a trap composed of 76 places in 125 ms
[2020-05-22 08:29:30] [INFO ] Deduced a trap composed of 33 places in 178 ms
[2020-05-22 08:29:30] [INFO ] Deduced a trap composed of 82 places in 96 ms
[2020-05-22 08:29:30] [INFO ] Deduced a trap composed of 76 places in 115 ms
[2020-05-22 08:29:30] [INFO ] Deduced a trap composed of 76 places in 98 ms
[2020-05-22 08:29:30] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4734 ms
[2020-05-22 08:29:30] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 08:29:30] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 21 ms returned sat
[2020-05-22 08:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:30] [INFO ] [Real]Absence check using state equation in 231 ms returned sat
[2020-05-22 08:29:30] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:30] [INFO ] [Nat]Absence check using 5 positive place invariants in 16 ms returned sat
[2020-05-22 08:29:30] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 13 ms returned sat
[2020-05-22 08:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:31] [INFO ] [Nat]Absence check using state equation in 261 ms returned sat
[2020-05-22 08:29:31] [INFO ] [Nat]Added 37 Read/Feed constraints in 20 ms returned sat
[2020-05-22 08:29:31] [INFO ] Deduced a trap composed of 67 places in 120 ms
[2020-05-22 08:29:31] [INFO ] Deduced a trap composed of 57 places in 135 ms
[2020-05-22 08:29:31] [INFO ] Deduced a trap composed of 70 places in 92 ms
[2020-05-22 08:29:31] [INFO ] Deduced a trap composed of 72 places in 103 ms
[2020-05-22 08:29:31] [INFO ] Deduced a trap composed of 62 places in 111 ms
[2020-05-22 08:29:31] [INFO ] Deduced a trap composed of 75 places in 106 ms
[2020-05-22 08:29:32] [INFO ] Deduced a trap composed of 62 places in 98 ms
[2020-05-22 08:29:32] [INFO ] Deduced a trap composed of 75 places in 108 ms
[2020-05-22 08:29:32] [INFO ] Deduced a trap composed of 46 places in 95 ms
[2020-05-22 08:29:32] [INFO ] Deduced a trap composed of 75 places in 115 ms
[2020-05-22 08:29:32] [INFO ] Deduced a trap composed of 73 places in 113 ms
[2020-05-22 08:29:32] [INFO ] Deduced a trap composed of 61 places in 93 ms
[2020-05-22 08:29:32] [INFO ] Deduced a trap composed of 73 places in 135 ms
[2020-05-22 08:29:32] [INFO ] Deduced a trap composed of 78 places in 92 ms
[2020-05-22 08:29:32] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1706 ms
[2020-05-22 08:29:32] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 20 ms.
[2020-05-22 08:29:34] [INFO ] Added : 192 causal constraints over 39 iterations in 1290 ms. Result :sat
[2020-05-22 08:29:34] [INFO ] Deduced a trap composed of 3 places in 124 ms
[2020-05-22 08:29:34] [INFO ] Deduced a trap composed of 8 places in 106 ms
[2020-05-22 08:29:34] [INFO ] Deduced a trap composed of 4 places in 123 ms
[2020-05-22 08:29:34] [INFO ] Deduced a trap composed of 10 places in 101 ms
[2020-05-22 08:29:34] [INFO ] Deduced a trap composed of 24 places in 60 ms
[2020-05-22 08:29:34] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 670 ms
[2020-05-22 08:29:34] [INFO ] [Real]Absence check using 5 positive place invariants in 10 ms returned sat
[2020-05-22 08:29:34] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 15 ms returned sat
[2020-05-22 08:29:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:35] [INFO ] [Real]Absence check using state equation in 336 ms returned sat
[2020-05-22 08:29:35] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:35] [INFO ] [Nat]Absence check using 5 positive place invariants in 22 ms returned sat
[2020-05-22 08:29:35] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 17 ms returned sat
[2020-05-22 08:29:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:35] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2020-05-22 08:29:35] [INFO ] [Nat]Added 37 Read/Feed constraints in 42 ms returned sat
[2020-05-22 08:29:35] [INFO ] Deduced a trap composed of 72 places in 130 ms
[2020-05-22 08:29:35] [INFO ] Deduced a trap composed of 73 places in 97 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 81 places in 104 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 86 places in 92 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 60 places in 95 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 79 places in 96 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 73 places in 110 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 84 places in 94 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 88 places in 96 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 67 places in 90 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 66 places in 85 ms
[2020-05-22 08:29:36] [INFO ] Deduced a trap composed of 68 places in 85 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 84 places in 86 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 89 places in 84 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 66 places in 96 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 71 places in 99 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 83 places in 89 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 66 places in 86 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 77 places in 87 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 72 places in 86 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 71 places in 86 ms
[2020-05-22 08:29:37] [INFO ] Deduced a trap composed of 70 places in 104 ms
[2020-05-22 08:29:38] [INFO ] Deduced a trap composed of 73 places in 112 ms
[2020-05-22 08:29:38] [INFO ] Deduced a trap composed of 69 places in 113 ms
[2020-05-22 08:29:38] [INFO ] Deduced a trap composed of 75 places in 113 ms
[2020-05-22 08:29:38] [INFO ] Deduced a trap composed of 72 places in 92 ms
[2020-05-22 08:29:38] [INFO ] Deduced a trap composed of 71 places in 90 ms
[2020-05-22 08:29:38] [INFO ] Deduced a trap composed of 76 places in 97 ms
[2020-05-22 08:29:38] [INFO ] Deduced a trap composed of 75 places in 128 ms
[2020-05-22 08:29:38] [INFO ] Deduced a trap composed of 80 places in 113 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 72 places in 108 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 71 places in 78 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 73 places in 90 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 79 places in 90 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 74 places in 86 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 75 places in 86 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 78 places in 78 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 80 places in 70 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 86 places in 69 ms
[2020-05-22 08:29:39] [INFO ] Deduced a trap composed of 92 places in 72 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 87 places in 73 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 90 places in 73 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 93 places in 65 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 91 places in 63 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 90 places in 63 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 83 places in 64 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 69 places in 97 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 89 places in 63 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 79 places in 105 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 87 places in 85 ms
[2020-05-22 08:29:40] [INFO ] Deduced a trap composed of 89 places in 106 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 82 places in 66 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 83 places in 63 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 84 places in 59 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 83 places in 59 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 86 places in 61 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 82 places in 60 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 77 places in 59 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 92 places in 58 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 90 places in 59 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 84 places in 59 ms
[2020-05-22 08:29:41] [INFO ] Deduced a trap composed of 89 places in 60 ms
[2020-05-22 08:29:41] [INFO ] Trap strengthening (SAT) tested/added 63/62 trap constraints in 6107 ms
[2020-05-22 08:29:41] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 11 ms.
[2020-05-22 08:29:44] [INFO ] Added : 217 causal constraints over 44 iterations in 2439 ms. Result :sat
[2020-05-22 08:29:44] [INFO ] [Real]Absence check using 5 positive place invariants in 15 ms returned sat
[2020-05-22 08:29:44] [INFO ] [Real]Absence check using 5 positive and 29 generalized place invariants in 22 ms returned sat
[2020-05-22 08:29:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:44] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2020-05-22 08:29:44] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:44] [INFO ] [Nat]Absence check using 5 positive place invariants in 25 ms returned sat
[2020-05-22 08:29:44] [INFO ] [Nat]Absence check using 5 positive and 29 generalized place invariants in 15 ms returned sat
[2020-05-22 08:29:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:44] [INFO ] [Nat]Absence check using state equation in 322 ms returned sat
[2020-05-22 08:29:44] [INFO ] [Nat]Added 37 Read/Feed constraints in 15 ms returned sat
[2020-05-22 08:29:45] [INFO ] Deduced a trap composed of 68 places in 131 ms
[2020-05-22 08:29:45] [INFO ] Deduced a trap composed of 67 places in 97 ms
[2020-05-22 08:29:45] [INFO ] Deduced a trap composed of 61 places in 99 ms
[2020-05-22 08:29:45] [INFO ] Deduced a trap composed of 32 places in 103 ms
[2020-05-22 08:29:45] [INFO ] Deduced a trap composed of 33 places in 90 ms
[2020-05-22 08:29:45] [INFO ] Deduced a trap composed of 70 places in 93 ms
[2020-05-22 08:29:45] [INFO ] Deduced a trap composed of 56 places in 129 ms
[2020-05-22 08:29:45] [INFO ] Deduced a trap composed of 83 places in 102 ms
[2020-05-22 08:29:46] [INFO ] Deduced a trap composed of 26 places in 111 ms
[2020-05-22 08:29:46] [INFO ] Deduced a trap composed of 79 places in 91 ms
[2020-05-22 08:29:46] [INFO ] Deduced a trap composed of 77 places in 88 ms
[2020-05-22 08:29:46] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1299 ms
[2020-05-22 08:29:46] [INFO ] Computed and/alt/rep : 227/1305/227 causal constraints in 10 ms.
[2020-05-22 08:29:48] [INFO ] Added : 220 causal constraints over 44 iterations in 2637 ms. Result :sat
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 229 transition count 225
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 226 transition count 225
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 6 place count 226 transition count 213
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 30 place count 214 transition count 213
Symmetric choice reduction at 2 with 6 rule applications. Total rules 36 place count 214 transition count 213
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 6 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 48 place count 208 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 50 place count 207 transition count 206
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 52 place count 207 transition count 204
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 205 transition count 204
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 205 transition count 202
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 58 place count 203 transition count 202
Applied a total of 58 rules in 64 ms. Remains 203 /229 variables (removed 26) and now considering 202/228 (removed 26) transitions.
// Phase 1: matrix 202 rows 203 cols
[2020-05-22 08:29:49] [INFO ] Computed 34 place invariants in 8 ms
[2020-05-22 08:29:49] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-05-22 08:29:49] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 15 ms returned sat
[2020-05-22 08:29:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:49] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2020-05-22 08:29:49] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:49] [INFO ] [Nat]Absence check using 4 positive place invariants in 14 ms returned sat
[2020-05-22 08:29:49] [INFO ] [Nat]Absence check using 4 positive and 30 generalized place invariants in 19 ms returned sat
[2020-05-22 08:29:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:49] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2020-05-22 08:29:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-05-22 08:29:49] [INFO ] [Nat]Added 2 Read/Feed constraints in 68 ms returned sat
[2020-05-22 08:29:49] [INFO ] Deduced a trap composed of 17 places in 113 ms
[2020-05-22 08:29:49] [INFO ] Deduced a trap composed of 16 places in 119 ms
[2020-05-22 08:29:49] [INFO ] Deduced a trap composed of 15 places in 64 ms
[2020-05-22 08:29:50] [INFO ] Deduced a trap composed of 19 places in 68 ms
[2020-05-22 08:29:50] [INFO ] Deduced a trap composed of 25 places in 41 ms
[2020-05-22 08:29:50] [INFO ] Deduced a trap composed of 27 places in 32 ms
[2020-05-22 08:29:50] [INFO ] Deduced a trap composed of 34 places in 23 ms
[2020-05-22 08:29:50] [INFO ] Deduced a trap composed of 33 places in 23 ms
[2020-05-22 08:29:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 574 ms
[2020-05-22 08:29:50] [INFO ] Computed and/alt/rep : 201/1147/201 causal constraints in 35 ms.
[2020-05-22 08:29:51] [INFO ] Added : 184 causal constraints over 37 iterations in 1500 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-05-22 08:29:51] [INFO ] [Real]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-05-22 08:29:51] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 19 ms returned sat
[2020-05-22 08:29:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:52] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2020-05-22 08:29:52] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:52] [INFO ] [Nat]Absence check using 4 positive place invariants in 9 ms returned sat
[2020-05-22 08:29:52] [INFO ] [Nat]Absence check using 4 positive and 30 generalized place invariants in 15 ms returned sat
[2020-05-22 08:29:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:52] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2020-05-22 08:29:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 55 ms returned sat
[2020-05-22 08:29:52] [INFO ] Deduced a trap composed of 12 places in 116 ms
[2020-05-22 08:29:52] [INFO ] Deduced a trap composed of 7 places in 94 ms
[2020-05-22 08:29:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 245 ms
[2020-05-22 08:29:52] [INFO ] Computed and/alt/rep : 201/1147/201 causal constraints in 12 ms.
[2020-05-22 08:29:54] [INFO ] Added : 199 causal constraints over 40 iterations in 2113 ms. Result :sat
[2020-05-22 08:29:54] [INFO ] Deduced a trap composed of 16 places in 63 ms
[2020-05-22 08:29:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
Attempting to minimize the solution found.
Minimization took 24 ms.
[2020-05-22 08:29:54] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-05-22 08:29:54] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 15 ms returned sat
[2020-05-22 08:29:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:55] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2020-05-22 08:29:55] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:55] [INFO ] [Nat]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-05-22 08:29:55] [INFO ] [Nat]Absence check using 4 positive and 30 generalized place invariants in 13 ms returned sat
[2020-05-22 08:29:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:55] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2020-05-22 08:29:55] [INFO ] [Nat]Added 2 Read/Feed constraints in 28 ms returned sat
[2020-05-22 08:29:55] [INFO ] Deduced a trap composed of 17 places in 96 ms
[2020-05-22 08:29:55] [INFO ] Deduced a trap composed of 12 places in 79 ms
[2020-05-22 08:29:55] [INFO ] Deduced a trap composed of 81 places in 75 ms
[2020-05-22 08:29:55] [INFO ] Deduced a trap composed of 80 places in 98 ms
[2020-05-22 08:29:55] [INFO ] Deduced a trap composed of 79 places in 93 ms
[2020-05-22 08:29:55] [INFO ] Deduced a trap composed of 16 places in 70 ms
[2020-05-22 08:29:55] [INFO ] Deduced a trap composed of 27 places in 99 ms
[2020-05-22 08:29:56] [INFO ] Deduced a trap composed of 36 places in 74 ms
[2020-05-22 08:29:56] [INFO ] Deduced a trap composed of 33 places in 72 ms
[2020-05-22 08:29:56] [INFO ] Deduced a trap composed of 67 places in 73 ms
[2020-05-22 08:29:56] [INFO ] Deduced a trap composed of 86 places in 73 ms
[2020-05-22 08:29:56] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1028 ms
[2020-05-22 08:29:56] [INFO ] Computed and/alt/rep : 201/1147/201 causal constraints in 11 ms.
[2020-05-22 08:29:57] [INFO ] Added : 186 causal constraints over 38 iterations in 1229 ms. Result :sat
[2020-05-22 08:29:57] [INFO ] Deduced a trap composed of 77 places in 129 ms
[2020-05-22 08:29:57] [INFO ] Deduced a trap composed of 67 places in 104 ms
[2020-05-22 08:29:58] [INFO ] Deduced a trap composed of 8 places in 111 ms
[2020-05-22 08:29:58] [INFO ] Deduced a trap composed of 7 places in 91 ms
[2020-05-22 08:29:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 600 ms
Attempting to minimize the solution found.
Minimization took 14 ms.
[2020-05-22 08:29:58] [INFO ] [Real]Absence check using 4 positive place invariants in 6 ms returned sat
[2020-05-22 08:29:58] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 16 ms returned sat
[2020-05-22 08:29:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:58] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2020-05-22 08:29:58] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:29:58] [INFO ] [Nat]Absence check using 4 positive place invariants in 13 ms returned sat
[2020-05-22 08:29:58] [INFO ] [Nat]Absence check using 4 positive and 30 generalized place invariants in 19 ms returned sat
[2020-05-22 08:29:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:29:58] [INFO ] [Nat]Absence check using state equation in 253 ms returned sat
[2020-05-22 08:29:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 40 ms returned sat
[2020-05-22 08:29:58] [INFO ] Deduced a trap composed of 74 places in 108 ms
[2020-05-22 08:29:59] [INFO ] Deduced a trap composed of 16 places in 64 ms
[2020-05-22 08:29:59] [INFO ] Deduced a trap composed of 15 places in 59 ms
[2020-05-22 08:29:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 279 ms
[2020-05-22 08:29:59] [INFO ] Computed and/alt/rep : 201/1147/201 causal constraints in 15 ms.
[2020-05-22 08:30:01] [INFO ] Added : 190 causal constraints over 38 iterations in 1907 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 13 ms.
[2020-05-22 08:30:01] [INFO ] [Real]Absence check using 4 positive place invariants in 8 ms returned sat
[2020-05-22 08:30:01] [INFO ] [Real]Absence check using 4 positive and 30 generalized place invariants in 18 ms returned sat
[2020-05-22 08:30:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:01] [INFO ] [Real]Absence check using state equation in 246 ms returned sat
[2020-05-22 08:30:01] [INFO ] Solution in real domain found non-integer solution.
[2020-05-22 08:30:01] [INFO ] [Nat]Absence check using 4 positive place invariants in 7 ms returned sat
[2020-05-22 08:30:01] [INFO ] [Nat]Absence check using 4 positive and 30 generalized place invariants in 11 ms returned sat
[2020-05-22 08:30:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-05-22 08:30:01] [INFO ] [Nat]Absence check using state equation in 172 ms returned sat
[2020-05-22 08:30:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2020-05-22 08:30:01] [INFO ] Deduced a trap composed of 73 places in 122 ms
[2020-05-22 08:30:01] [INFO ] Deduced a trap composed of 76 places in 82 ms
[2020-05-22 08:30:01] [INFO ] Deduced a trap composed of 16 places in 37 ms
[2020-05-22 08:30:01] [INFO ] Deduced a trap composed of 80 places in 83 ms
[2020-05-22 08:30:02] [INFO ] Deduced a trap composed of 78 places in 85 ms
[2020-05-22 08:30:02] [INFO ] Deduced a trap composed of 78 places in 82 ms
[2020-05-22 08:30:02] [INFO ] Deduced a trap composed of 72 places in 82 ms
[2020-05-22 08:30:02] [INFO ] Deduced a trap composed of 15 places in 41 ms
[2020-05-22 08:30:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 694 ms
[2020-05-22 08:30:02] [INFO ] Computed and/alt/rep : 201/1147/201 causal constraints in 13 ms.
[2020-05-22 08:30:03] [INFO ] Added : 196 causal constraints over 40 iterations in 1590 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 15 ms.
[2020-05-22 08:30:04] [INFO ] Flatten gal took : 77 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/home/mcc/execution
[2020-05-22 08:30:04] [INFO ] Applying decomposition
[2020-05-22 08:30:04] [INFO ] Flatten gal took : 33 ms
[2020-05-22 08:30:04] [INFO ] Input system was already deterministic with 228 transitions.
[2020-05-22 08:30:04] [INFO ] Flatten gal took : 111 ms
[2020-05-22 08:30:04] [INFO ] Input system was already deterministic with 228 transitions.
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/graph16957397986273583442.txt, -o, /tmp/graph16957397986273583442.bin, -w, /tmp/graph16957397986273583442.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/graph16957397986273583442.bin, -l, -1, -v, -w, /tmp/graph16957397986273583442.weights, -q, 0, -e, 0.001], workingDir=null]
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 228 rows 229 cols
[2020-05-22 08:30:04] [INFO ] Decomposing Gal with order
[2020-05-22 08:30:04] [INFO ] Computed 34 place invariants in 9 ms
inv : p373 - p375 + p376 - p378 + p399 + p411 = 0
inv : p101 + p107 + p115 + p116 + p128 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p173 + p174 + p178 + p181 + p183 + p184 + p186 + p187 + p191 + p193 + p195 + p196 + p198 + p199 + p205 + p207 + p208 + p209 + p220 + p222 + p232 + p236 + p237 + p240 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p260 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p30 + p301 + p302 + p305 + p31 + p311 + p313 + p328 + p34 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p365 + p366 + p381 + p391 + p392 + p393 + p395 + p396 + p399 + p40 + p403 + p407 + p408 + p411 + p415 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p46 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p505 + p517 + p52 + p523 + p525 + p54 + p63 + p73 + p74 + p75 + p77 + p78 + p81 + p84 + p87 + p89 + p90 + p93 + p96 + p97 + p99 = 1
inv : p440 + p442 - p446 - p448 - p449 - p452 - p458 - p460 - p461 - p464 - p470 - p472 - p475 - p477 + p528 + p530 = 0
inv : p320 - p322 + p323 - p325 + p346 + p358 = 0
inv : p480 - p481 + p483 - p484 + p505 + p517 = 0
inv : p267 - p268 + p270 - p271 - p365 = 0
inv : p159 + p71 - p87 - p89 - p90 - p93 - p95 - p96 = 0
inv : p8 + p9 = 2
inv : p108 - p110 + p111 - p113 + p115 + p134 + p146 = 0
inv : p162 - p163 + p165 - p166 + p187 + p199 - p208 = 0
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p321 - p322 + p324 - p325 + p346 + p358 = 0
inv : p10 + p11 = 2
inv : p115 + p116 + p122 + p124 + p14 + p16 + p169 + p173 + p174 + p175 + p177 + p178 + p22 + p220 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p334 + p336 + p381 + p387 + p389 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p475 + p477 + p485 + p487 + p499 + p502 + p505 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p427 - p428 + p430 - p431 + p452 + p464 = 0
inv : p161 - p163 + p164 - p166 + p187 + p199 - p208 = 0
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : -p101 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p181 - p183 - p184 - p186 - p187 - p191 - p193 - p195 - p196 - p198 - p199 - p205 - p207 - p208 - p209 + p22 + p228 + p230 - p232 - p236 - p237 + p24 - p240 - p246 - p248 - p249 - p252 - p255 - p256 - p258 - p260 - p28 - p30 - p31 + p316 + p318 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 + p71 - p73 - p74 - p75 - p77 - p78 - p81 - p84 - p87 - p89 - p90 - p93 - p96 - p97 - p99 = 0
inv : -p173 + p215 - p216 + p218 - p219 + p240 + p252 = 0
inv : -p101 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p181 - p183 - p184 - p186 - p187 - p191 - p193 - p195 - p196 - p198 - p199 - p205 - p207 - p208 - p209 + p22 + p24 + p263 + p265 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 + p71 - p73 - p74 - p75 - p77 - p78 - p81 - p84 - p87 - p89 - p90 - p93 - p96 - p97 - p99 = 0
inv : p426 - p428 + p429 - p431 + p452 + p464 = 0
inv : p104 + p106 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 = 0
inv : p109 - p110 + p112 - p113 + p134 + p146 = 0
inv : p115 + p116 + p122 + p124 + p14 + p16 + p169 + p173 + p174 + p175 + p177 + p178 + p22 + p220 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p365 + p366 + p369 + p371 + p381 + p391 + p392 + p393 + p395 + p396 + p399 + p403 + p407 + p408 + p411 + p415 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p505 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : -p173 + p214 - p216 + p217 - p219 + p240 + p252 = 0
inv : -p387 - p389 + p391 + p392 + p393 + p395 + p396 + p399 + p403 + p407 + p408 + p411 + p415 + p417 + p419 + p422 + p424 - p475 - p477 = 0
inv : p101 + p107 + p115 + p116 + p128 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p173 + p174 + p178 + p181 + p183 + p184 + p186 + p187 + p191 + p193 + p195 + p196 + p198 + p199 + p205 + p207 + p208 + p209 + p220 + p222 + p232 + p236 + p237 + p240 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p260 - p268 + p269 - p271 + p272 + p275 + p28 + p287 + p289 + p290 + p299 + p30 + p301 + p302 + p31 + p311 + p313 + p328 + p34 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p391 + p392 + p393 + p395 + p396 + p399 + p40 + p403 + p407 + p408 + p411 + p415 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p46 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p505 + p517 + p52 + p523 + p525 + p54 + p63 + p73 + p74 + p75 + p77 + p78 + p81 + p84 + p87 + p89 + p90 + p93 + p96 + p97 + p99 = 1
inv : -p101 - p107 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p83 + p95 - p97 - p99 = 0
inv : -p101 - p107 + p157 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 - p73 - p74 - p75 - p77 - p78 - p81 - p84 + p95 - p97 - p99 = 0
inv : p12 + p13 - p34 - p46 = 2
inv : p479 - p481 + p482 - p484 + p505 + p517 = 0
inv : -p230 + p246 + p248 + p249 + p252 + p254 + p255 - p318 = 0
inv : p374 - p375 + p377 - p378 + p399 + p411 = 0
inv : -p101 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p210 + p212 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 + p71 - p73 - p74 - p75 - p77 - p78 - p81 - p84 - p87 - p89 - p90 - p93 - p96 - p97 - p99 = 0
Total of 34 invariants.
[2020-05-22 08:30:04] [INFO ] Computed 34 place invariants in 13 ms
[2020-05-22 08:30:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2020-05-22 08:30:04] [INFO ] Ran tautology test, simplified 0 / 5 in 217 ms.
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=0 took 15 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=0 took 2 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=0 took 9 ms
[2020-05-22 08:30:04] [INFO ] Removed a total of 137 redundant transitions.
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=0 took 2 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=0 took 13 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=1 took 2 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=1 took 2 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=1 took 2 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=1 took 2 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=1 took 1 ms
[2020-05-22 08:30:04] [INFO ] Flatten gal took : 95 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=2 took 69 ms
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
// Phase 1: matrix 228 rows 229 cols
[2020-05-22 08:30:04] [INFO ] Computed 34 place invariants in 7 ms
inv : p373 - p375 + p376 - p378 + p399 + p411 = 0
inv : p101 + p107 + p115 + p116 + p128 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p173 + p174 + p178 + p181 + p183 + p184 + p186 + p187 + p191 + p193 + p195 + p196 + p198 + p199 + p205 + p207 + p208 + p209 + p220 + p222 + p232 + p236 + p237 + p240 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p260 + p275 + p28 + p287 + p289 + p290 + p293 + p299 + p30 + p301 + p302 + p305 + p31 + p311 + p313 + p328 + p34 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p365 + p366 + p381 + p391 + p392 + p393 + p395 + p396 + p399 + p40 + p403 + p407 + p408 + p411 + p415 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p46 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p505 + p517 + p52 + p523 + p525 + p54 + p63 + p73 + p74 + p75 + p77 + p78 + p81 + p84 + p87 + p89 + p90 + p93 + p96 + p97 + p99 = 1
inv : p440 + p442 - p446 - p448 - p449 - p452 - p458 - p460 - p461 - p464 - p470 - p472 - p475 - p477 + p528 + p530 = 0
inv : p320 - p322 + p323 - p325 + p346 + p358 = 0
inv : p480 - p481 + p483 - p484 + p505 + p517 = 0
inv : p267 - p268 + p270 - p271 - p365 = 0
inv : p159 + p71 - p87 - p89 - p90 - p93 - p95 - p96 = 0
inv : p8 + p9 = 2
inv : p108 - p110 + p111 - p113 + p115 + p134 + p146 = 0
inv : p162 - p163 + p165 - p166 + p187 + p199 - p208 = 0
inv : p55 - p57 + p58 - p60 + p81 + p93 = 0
inv : p321 - p322 + p324 - p325 + p346 + p358 = 0
inv : p10 + p11 = 2
inv : p115 + p116 + p122 + p124 + p14 + p16 + p169 + p173 + p174 + p175 + p177 + p178 + p22 + p220 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p334 + p336 + p381 + p387 + p389 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p475 + p477 + p485 + p487 + p499 + p502 + p505 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : p427 - p428 + p430 - p431 + p452 + p464 = 0
inv : p161 - p163 + p164 - p166 + p187 + p199 - p208 = 0
inv : p56 - p57 + p59 - p60 + p81 + p93 = 0
inv : -p101 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p181 - p183 - p184 - p186 - p187 - p191 - p193 - p195 - p196 - p198 - p199 - p205 - p207 - p208 - p209 + p22 + p228 + p230 - p232 - p236 - p237 + p24 - p240 - p246 - p248 - p249 - p252 - p255 - p256 - p258 - p260 - p28 - p30 - p31 + p316 + p318 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 + p71 - p73 - p74 - p75 - p77 - p78 - p81 - p84 - p87 - p89 - p90 - p93 - p96 - p97 - p99 = 0
inv : -p173 + p215 - p216 + p218 - p219 + p240 + p252 = 0
inv : -p101 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p175 + p177 - p181 - p183 - p184 - p186 - p187 - p191 - p193 - p195 - p196 - p198 - p199 - p205 - p207 - p208 - p209 + p22 + p24 + p263 + p265 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 + p71 - p73 - p74 - p75 - p77 - p78 - p81 - p84 - p87 - p89 - p90 - p93 - p96 - p97 - p99 = 0
inv : p426 - p428 + p429 - p431 + p452 + p464 = 0
inv : p104 + p106 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 = 0
inv : p109 - p110 + p112 - p113 + p134 + p146 = 0
inv : p115 + p116 + p122 + p124 + p14 + p16 + p169 + p173 + p174 + p175 + p177 + p178 + p22 + p220 + p222 + p228 + p230 + p24 + p275 + p281 + p283 + p328 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p365 + p366 + p369 + p371 + p381 + p391 + p392 + p393 + p395 + p396 + p399 + p403 + p407 + p408 + p411 + p415 + p417 + p419 + p434 + p446 + p448 + p449 + p452 + p458 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p505 + p517 + p523 + p525 + p63 + p69 + p71 = 1
inv : -p173 + p214 - p216 + p217 - p219 + p240 + p252 = 0
inv : -p387 - p389 + p391 + p392 + p393 + p395 + p396 + p399 + p403 + p407 + p408 + p411 + p415 + p417 + p419 + p422 + p424 - p475 - p477 = 0
inv : p101 + p107 + p115 + p116 + p128 + p130 + p131 + p134 + p14 + p140 + p142 + p143 + p146 + p152 + p154 + p16 + p169 + p173 + p174 + p178 + p181 + p183 + p184 + p186 + p187 + p191 + p193 + p195 + p196 + p198 + p199 + p205 + p207 + p208 + p209 + p220 + p222 + p232 + p236 + p237 + p240 + p246 + p248 + p249 + p252 + p255 + p256 + p258 + p260 - p268 + p269 - p271 + p272 + p275 + p28 + p287 + p289 + p290 + p299 + p30 + p301 + p302 + p31 + p311 + p313 + p328 + p34 + p340 + p342 + p343 + p346 + p352 + p354 + p355 + p358 + p364 + p366 + p381 + p391 + p392 + p393 + p395 + p396 + p399 + p40 + p403 + p407 + p408 + p411 + p415 + p417 + p419 + p42 + p43 + p434 + p446 + p448 + p449 + p452 + p458 + p46 + p460 + p461 + p464 + p470 + p472 + p485 + p487 + p499 + p502 + p505 + p517 + p52 + p523 + p525 + p54 + p63 + p73 + p74 + p75 + p77 + p78 + p81 + p84 + p87 + p89 + p90 + p93 + p96 + p97 + p99 = 1
inv : -p101 - p107 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p83 + p95 - p97 - p99 = 0
inv : -p101 - p107 + p157 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 - p73 - p74 - p75 - p77 - p78 - p81 - p84 + p95 - p97 - p99 = 0
inv : p12 + p13 - p34 - p46 = 2
inv : p479 - p481 + p482 - p484 + p505 + p517 = 0
inv : -p230 + p246 + p248 + p249 + p252 + p254 + p255 - p318 = 0
inv : p374 - p375 + p377 - p378 + p399 + p411 = 0
inv : -p101 - p107 + p122 + p124 - p128 - p130 - p131 - p134 - p140 - p142 - p143 - p146 - p152 - p154 + p210 + p212 + p22 + p24 - p28 - p30 - p31 - p34 - p40 - p42 - p43 - p46 - p52 - p54 + p69 + p71 - p73 - p74 - p75 - p77 - p78 - p81 - p84 - p87 - p89 - p90 - p93 - p96 - p97 - p99 = 0
Total of 34 invariants.
[2020-05-22 08:30:04] [INFO ] Computed 34 place invariants in 7 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=2 took 11 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=2 took 1 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=2 took 2 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=2 took 1 ms
[2020-05-22 08:30:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 36 ms.
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=3 took 37 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=3 took 24 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=3 took 17 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=3 took 39 ms
[2020-05-22 08:30:04] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 18 ms
[2020-05-22 08:30:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=3 took 25 ms
[2020-05-22 08:30:04] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 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 [reachable] property : DoubleExponent-PT-010-ReachabilityCardinality-02 with value :((gu30.p107<=gu30.p415)&&(gu4.p237>gu4.p111))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityCardinality-05 with value :(((gi6.gi0.gi2.gu27.p365<1)&&(gu11.p408<=gu11.p178))&&((((gi6.gi0.gi3.gu44.p74>=2)||(gu9.p166<=gu9.p30))||(gu16.p115<=gu16.p209))||(gi6.gi0.gi0.gu10.p174>=3)))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityCardinality-06 with value :(gu13.p191<=gu13.p270)
Read [reachable] property : DoubleExponent-PT-010-ReachabilityCardinality-12 with value :(gu14.p254>gu14.p198)
Read [invariant] property : DoubleExponent-PT-010-ReachabilityCardinality-14 with value :(gu42.p392<=gu42.p59)
[2020-05-22 08:30:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=4 took 101 ms
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
[2020-05-22 08:30:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=4 took 97 ms
SDD proceeding with computation, new max is 4096
[2020-05-22 08:30:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=4 took 102 ms
SDD proceeding with computation, new max is 8192
[2020-05-22 08:30:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=4 took 78 ms
[2020-05-22 08:30:05] [INFO ] Proved 229 variables to be positive in 808 ms
[2020-05-22 08:30:05] [INFO ] Computing symmetric may disable matrix : 228 transitions.
[2020-05-22 08:30:05] [INFO ] Computation of disable matrix completed :0/228 took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:30:05] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:30:05] [INFO ] Computing symmetric may enable matrix : 228 transitions.
[2020-05-22 08:30:05] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:30:05] [INFO ] Proved 229 variables to be positive in 629 ms
[2020-05-22 08:30:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=4 took 83 ms
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-02
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(SAT) depth K=0 took 15 ms
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-05
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(SAT) depth K=0 took 17 ms
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=0 took 8 ms
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-12
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(SAT) depth K=0 took 7 ms
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-14
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(SAT) depth K=0 took 5 ms
SDD proceeding with computation, new max is 16384
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-02
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(SAT) depth K=1 took 104 ms
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-05
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(SAT) depth K=1 took 35 ms
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=1 took 22 ms
[2020-05-22 08:30:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=5 took 217 ms
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-12
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(SAT) depth K=1 took 23 ms
[2020-05-22 08:30:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-14
[2020-05-22 08:30:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(SAT) depth K=1 took 21 ms
[2020-05-22 08:30:05] [INFO ] Computing symmetric co enabling matrix : 228 transitions.
SDD proceeding with computation, new max is 32768
[2020-05-22 08:30:06] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=5 took 1099 ms
[2020-05-22 08:30:07] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=5 took 388 ms
[2020-05-22 08:30:07] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=5 took 72 ms
SDD proceeding with computation, new max is 65536
[2020-05-22 08:30:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-02
[2020-05-22 08:30:07] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(SAT) depth K=2 took 1955 ms
[2020-05-22 08:30:07] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=5 took 642 ms
[2020-05-22 08:30:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=6 took 340 ms
[2020-05-22 08:30:08] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=6 took 463 ms
[2020-05-22 08:30:08] [INFO ] Computation of co-enabling matrix(16/228) took 3141 ms. Total solver calls (SAT/UNSAT): 3723(3/3720)
SDD proceeding with computation, new max is 131072
[2020-05-22 08:30:11] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=6 took 2423 ms
[2020-05-22 08:30:11] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=6 took 795 ms
[2020-05-22 08:30:11] [INFO ] Computation of co-enabling matrix(53/228) took 6174 ms. Total solver calls (SAT/UNSAT): 10827(4/10823)
[2020-05-22 08:30:14] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-05
[2020-05-22 08:30:14] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(SAT) depth K=2 took 7040 ms
[2020-05-22 08:30:14] [INFO ] Computation of co-enabling matrix(77/228) took 9208 ms. Total solver calls (SAT/UNSAT): 14703(7/14696)
[2020-05-22 08:30:15] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2020-05-22 08:30:15] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=2 took 1226 ms
[2020-05-22 08:30:16] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=6 took 5062 ms
SDD proceeding with computation, new max is 262144
[2020-05-22 08:30:18] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-12
[2020-05-22 08:30:18] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(SAT) depth K=2 took 2296 ms
[2020-05-22 08:30:18] [INFO ] Computation of co-enabling matrix(88/228) took 12671 ms. Total solver calls (SAT/UNSAT): 16287(12/16275)
[2020-05-22 08:30:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-14
[2020-05-22 08:30:21] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(SAT) depth K=2 took 3464 ms
[2020-05-22 08:30:21] [INFO ] Computation of co-enabling matrix(100/228) took 16083 ms. Total solver calls (SAT/UNSAT): 17877(18/17859)
[2020-05-22 08:30:25] [INFO ] Computation of co-enabling matrix(110/228) took 19381 ms. Total solver calls (SAT/UNSAT): 19092(23/19069)
[2020-05-22 08:30:26] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-02
[2020-05-22 08:30:26] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(SAT) depth K=3 took 4897 ms
[2020-05-22 08:30:27] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=7 took 10293 ms
[2020-05-22 08:30:27] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=7 took 806 ms
[2020-05-22 08:30:28] [INFO ] Computation of co-enabling matrix(128/228) took 22546 ms. Total solver calls (SAT/UNSAT): 21027(28/20999)
[2020-05-22 08:30:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=7 took 771 ms
[2020-05-22 08:30:31] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=7 took 2689 ms
[2020-05-22 08:30:32] [INFO ] Computation of co-enabling matrix(144/228) took 26389 ms. Total solver calls (SAT/UNSAT): 22475(33/22442)
[2020-05-22 08:30:35] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=7 took 4057 ms
[2020-05-22 08:30:35] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-05
[2020-05-22 08:30:35] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(SAT) depth K=3 took 9028 ms
SDD proceeding with computation, new max is 524288
[2020-05-22 08:30:37] [INFO ] Computation of co-enabling matrix(150/228) took 32052 ms. Total solver calls (SAT/UNSAT): 22952(51/22901)
[2020-05-22 08:30:38] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=8 took 3348 ms
[2020-05-22 08:30:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=8 took 1289 ms
[2020-05-22 08:30:41] [INFO ] Computation of co-enabling matrix(151/228) took 35282 ms. Total solver calls (SAT/UNSAT): 23028(62/22966)
[2020-05-22 08:30:41] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=8 took 1240 ms
[2020-05-22 08:30:43] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=8 took 2367 ms
[2020-05-22 08:30:44] [INFO ] Computation of co-enabling matrix(166/228) took 38576 ms. Total solver calls (SAT/UNSAT): 24048(67/23981)
[2020-05-22 08:30:47] [INFO ] Computation of co-enabling matrix(178/228) took 41896 ms. Total solver calls (SAT/UNSAT): 24702(72/24630)
[2020-05-22 08:30:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-06
[2020-05-22 08:30:47] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(SAT) depth K=3 took 12225 ms
[2020-05-22 08:30:48] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=8 took 4672 ms
[2020-05-22 08:30:51] [INFO ] Computation of co-enabling matrix(201/228) took 45318 ms. Total solver calls (SAT/UNSAT): 25553(77/25476)
[2020-05-22 08:30:53] [INFO ] Computation of Finished co-enabling matrix. took 47607 ms. Total solver calls (SAT/UNSAT): 25878(82/25796)
[2020-05-22 08:30:53] [INFO ] Computing Do-Not-Accords matrix : 228 transitions.
[2020-05-22 08:30:53] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2020-05-22 08:30:53] [INFO ] Built C files in 49112ms 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]
Compilation finished in 3160 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/home/mcc/execution]
Link finished in 853 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit//lts_install_dir//bin/pins2lts-mc, ./gal.so, --threads=8, -p, --pins-guards, --when, -i, DoubleExponentPT010ReachabilityCardinality02==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, DoubleExponentPT010ReachabilityCardinality02==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, DoubleExponentPT010ReachabilityCardinality02==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 08:30:58] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=9 took 10122 ms
[2020-05-22 08:30:59] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-12
[2020-05-22 08:30:59] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(SAT) depth K=3 took 11940 ms
[2020-05-22 08:31:00] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=9 took 2415 ms
[2020-05-22 08:31:03] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-06(UNSAT) depth K=9 took 2959 ms
[2020-05-22 08:31:09] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-14
[2020-05-22 08:31:09] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(SAT) depth K=3 took 10237 ms
[2020-05-22 08:31:23] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=9 took 19264 ms
[2020-05-22 08:31:27] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=9 took 4269 ms
[2020-05-22 08:31:34] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=10 took 7322 ms
[2020-05-22 08:31:44] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-02
[2020-05-22 08:31:44] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(SAT) depth K=4 took 34171 ms
Invariant property DoubleExponent-PT-010-ReachabilityCardinality-06 does not hold.
FORMULA DoubleExponent-PT-010-ReachabilityCardinality-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation, new max is 1048576
[2020-05-22 08:31:55] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=10 took 20349 ms
[2020-05-22 08:32:03] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-05
[2020-05-22 08:32:03] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(SAT) depth K=4 took 19301 ms
[2020-05-22 08:32:17] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=10 took 22815 ms
[2020-05-22 08:32:21] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-12
[2020-05-22 08:32:21] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(SAT) depth K=4 took 18444 ms
[2020-05-22 08:32:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=10 took 8449 ms
[2020-05-22 08:32:36] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=11 took 9973 ms
[2020-05-22 08:32:47] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-14
[2020-05-22 08:32:47] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(SAT) depth K=4 took 25258 ms
[2020-05-22 08:33:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=11 took 29243 ms
[2020-05-22 08:33:36] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=11 took 30711 ms
[2020-05-22 08:33:48] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=11 took 12430 ms
[2020-05-22 08:34:05] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-02
[2020-05-22 08:34:05] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(SAT) depth K=5 took 78513 ms
[2020-05-22 08:34:09] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=12 took 21059 ms
[2020-05-22 08:34:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=12 took 30429 ms
SDD proceeding with computation, new max is 2097152
[2020-05-22 08:35:07] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-05
[2020-05-22 08:35:07] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(SAT) depth K=5 took 61830 ms
[2020-05-22 08:35:19] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=12 took 39148 ms
[2020-05-22 08:36:12] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-12
[2020-05-22 08:36:12] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(SAT) depth K=5 took 64618 ms
[2020-05-22 08:36:26] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=12 took 67497 ms
[2020-05-22 08:36:32] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=13 took 5720 ms
[2020-05-22 08:37:37] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=13 took 64752 ms
[2020-05-22 08:38:40] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-14
[2020-05-22 08:38:40] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(SAT) depth K=5 took 148462 ms
[2020-05-22 08:39:40] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=13 took 122726 ms
[2020-05-22 08:40:49] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=13 took 68871 ms
[2020-05-22 08:41:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-02
[2020-05-22 08:41:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(SAT) depth K=6 took 155651 ms
[2020-05-22 08:41:22] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=14 took 33655 ms
[2020-05-22 08:41:28] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=14 took 5899 ms
[2020-05-22 08:42:05] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=14 took 37346 ms
SDD proceeding with computation, new max is 4194304
[2020-05-22 08:44:13] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-05
[2020-05-22 08:44:13] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(SAT) depth K=6 took 177358 ms
[2020-05-22 08:45:14] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=14 took 188566 ms
[2020-05-22 08:46:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-12
[2020-05-22 08:46:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(SAT) depth K=6 took 122742 ms
[2020-05-22 08:48:16] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-14
[2020-05-22 08:48:16] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(SAT) depth K=6 took 120364 ms
[2020-05-22 08:49:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-02
[2020-05-22 08:49:33] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(SAT) depth K=7 took 76323 ms
Detected timeout of ITS tools.
[2020-05-22 08:51:43] [INFO ] Flatten gal took : 55 ms
[2020-05-22 08:51:43] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 13 ms
[2020-05-22 08:51:43] [INFO ] Time to serialize properties into /home/mcc/execution/ReachabilityCardinality.prop : 0 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 [reachable] property : DoubleExponent-PT-010-ReachabilityCardinality-02 with value :((p107<=p415)&&(p237>p111))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityCardinality-05 with value :(((p365<1)&&(p408<=p178))&&((((p74>=2)||(p166<=p30))||(p115<=p209))||(p174>=3)))
Read [reachable] property : DoubleExponent-PT-010-ReachabilityCardinality-12 with value :(p254>p198)
Read [invariant] property : DoubleExponent-PT-010-ReachabilityCardinality-14 with value :(p392<=p59)
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
[2020-05-22 08:51:43] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=15 took 388852 ms
SDD proceeding with computation, new max is 4096
SDD proceeding with computation, new max is 8192
SDD proceeding with computation, new max is 16384
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
[2020-05-22 08:52:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-05
[2020-05-22 08:52:33] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(SAT) depth K=7 took 180325 ms
SDD proceeding with computation, new max is 1048576
[2020-05-22 08:52:48] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=15 took 65222 ms
[2020-05-22 08:52:58] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(UNSAT) depth K=15 took 10134 ms
SDD proceeding with computation, new max is 2097152
[2020-05-22 08:53:53] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-12
[2020-05-22 08:53:53] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(SAT) depth K=7 took 80290 ms
SDD proceeding with computation, new max is 4194304
[2020-05-22 08:57:01] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(UNSAT) depth K=15 took 242703 ms
SDD proceeding with computation, new max is 8388608
[2020-05-22 08:58:48] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-14
[2020-05-22 08:58:48] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(SAT) depth K=7 took 294562 ms
[2020-05-22 09:04:01] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-02
[2020-05-22 09:04:01] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(SAT) depth K=8 took 313638 ms
[2020-05-22 09:04:11] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-02(UNSAT) depth K=16 took 430028 ms
SDD proceeding with computation, new max is 16777216
[2020-05-22 09:12:56] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-05
[2020-05-22 09:12:56] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(SAT) depth K=8 took 534936 ms
Detected timeout of ITS tools.
[2020-05-22 09:13:21] [INFO ] Flatten gal took : 112 ms
[2020-05-22 09:13:21] [INFO ] Input system was already deterministic with 228 transitions.
[2020-05-22 09:13:22] [INFO ] Transformed 229 places.
[2020-05-22 09:13:22] [INFO ] Transformed 228 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2020-05-22 09:13:22] [INFO ] Time to serialize gal into /home/mcc/execution/ReachabilityCardinality.pnml.gal : 12 ms
[2020-05-22 09:13:22] [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, --load-order, /home/mcc/execution/model.ord, --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 --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file ReachabilityCardinality.prop.
Read [reachable] property : DoubleExponent-PT-010-ReachabilityCardinality-02 with value :((p107<=p415)&&(p237>p111))
Read [invariant] property : DoubleExponent-PT-010-ReachabilityCardinality-05 with value :(((p365<1)&&(p408<=p178))&&((((p74>=2)||(p166<=p30))||(p115<=p209))||(p174>=3)))
Read [reachable] property : DoubleExponent-PT-010-ReachabilityCardinality-12 with value :(p254>p198)
Read [invariant] property : DoubleExponent-PT-010-ReachabilityCardinality-14 with value :(p392<=p59)
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
SDD proceeding with computation, new max is 32768
SDD proceeding with computation, new max is 65536
SDD proceeding with computation, new max is 131072
SDD proceeding with computation, new max is 262144
SDD proceeding with computation, new max is 524288
SDD proceeding with computation, new max is 1048576
SDD proceeding with computation, new max is 2097152
[2020-05-22 09:18:22] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-12
[2020-05-22 09:18:22] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-12(SAT) depth K=8 took 326090 ms
[2020-05-22 09:20:04] [INFO ] BMC solution for property DoubleExponent-PT-010-ReachabilityCardinality-05(UNSAT) depth K=16 took 952631 ms
[2020-05-22 09:22:58] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesDoubleExponent-PT-010-ReachabilityCardinality-14
[2020-05-22 09:22:58] [INFO ] KInduction solution for property DoubleExponent-PT-010-ReachabilityCardinality-14(SAT) depth K=8 took 275128 ms
SDD proceeding with computation, new max is 4194304

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-010"
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-010, 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-158922814800782"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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