fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r211-tajo-159033477600567
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for ShieldPPPs-PT-100B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15744.340 3600000.00 798604.00 193.70 TTTTTFTFTTFFTTTT normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 4.1K May 14 01:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 14 01:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 19:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 13 19:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 14 10:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 14 10:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 14 10:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 14 10:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 12 20:42 NewModel
-rw-r--r-- 1 mcc users 3.8K May 13 14:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K May 13 14:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 13 08:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 13 08:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 13 16:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 13 16:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 12 20:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 12 20:42 instance
-rw-r--r-- 1 mcc users 6 May 12 20:42 iscolored
-rw-r--r-- 1 mcc users 1.8M May 12 20:42 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 ShieldPPPs-PT-100B-ReachabilityFireability-00
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-01
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-02
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-03
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-04
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-05
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-06
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-07
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-08
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-09
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-10
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-11
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-12
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-13
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-14
FORMULA_NAME ShieldPPPs-PT-100B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591315990132

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 00:13:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-05 00:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 00:13:11] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2020-06-05 00:13:12] [INFO ] Transformed 6803 places.
[2020-06-05 00:13:12] [INFO ] Transformed 6303 transitions.
[2020-06-05 00:13:12] [INFO ] Found NUPN structural information;
[2020-06-05 00:13:12] [INFO ] Parsed PT model containing 6803 places and 6303 transitions in 536 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 191 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 187 ms. (steps per millisecond=53 ) properties seen :[0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1, 0]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 31 ms. (steps per millisecond=322 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 16 ms. (steps per millisecond=625 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 6303 rows 6803 cols
[2020-06-05 00:13:13] [INFO ] Computed 1101 place invariants in 164 ms
[2020-06-05 00:13:17] [INFO ] [Real]Absence check using 1101 positive place invariants in 3455 ms returned sat
[2020-06-05 00:13:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:13:18] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed") while checking expression at index 0
[2020-06-05 00:13:22] [INFO ] [Real]Absence check using 1101 positive place invariants in 3875 ms returned sat
[2020-06-05 00:13:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:13:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 00:13:23] [INFO ] [Real]Absence check using state equation in 621 ms returned (error "Failed to check-sat")
[2020-06-05 00:13:27] [INFO ] [Real]Absence check using 1101 positive place invariants in 3549 ms returned sat
[2020-06-05 00:13:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:13:28] [INFO ] [Real]Absence check using state equation in 563 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 00:13:32] [INFO ] [Real]Absence check using 1101 positive place invariants in 3222 ms returned sat
[2020-06-05 00:13:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:13:33] [INFO ] [Real]Absence check using state equation in 1106 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 00:13:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 3323 ms returned sat
[2020-06-05 00:13:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:13:38] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 4
[2020-06-05 00:13:42] [INFO ] [Real]Absence check using 1101 positive place invariants in 3487 ms returned sat
[2020-06-05 00:13:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:13:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 5
[2020-06-05 00:13:47] [INFO ] [Real]Absence check using 1101 positive place invariants in 3711 ms returned sat
[2020-06-05 00:13:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:13:48] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 00:13:48] [INFO ] [Real]Absence check using state equation in 585 ms returned (error "Failed to check-sat")
[2020-06-05 00:13:52] [INFO ] [Real]Absence check using 1101 positive place invariants in 3415 ms returned sat
[2020-06-05 00:13:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:13:53] [INFO ] [Real]Absence check using state equation in 815 ms returned (error "Solver has unexpectedly terminated")
[2020-06-05 00:13:57] [INFO ] [Real]Absence check using 1101 positive place invariants in 3230 ms returned sat
[2020-06-05 00:13:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:13:58] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 00:13:58] [INFO ] [Real]Absence check using state equation in 887 ms returned (error "Failed to check-sat")
[2020-06-05 00:14:02] [INFO ] [Real]Absence check using 1101 positive place invariants in 3666 ms returned sat
[2020-06-05 00:14:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:14:03] [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 (>= t4362 0)") while checking expression at index 9
Support contains 74 out of 6803 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Performed 690 Post agglomeration using F-continuation condition.Transition count delta: 690
Iterating post reduction 0 with 690 rules applied. Total rules applied 690 place count 6803 transition count 5613
Reduce places removed 690 places and 0 transitions.
Iterating post reduction 1 with 690 rules applied. Total rules applied 1380 place count 6113 transition count 5613
Performed 502 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 502 Pre rules applied. Total rules applied 1380 place count 6113 transition count 5111
Deduced a syphon composed of 502 places in 34 ms
Reduce places removed 502 places and 0 transitions.
Iterating global reduction 2 with 1004 rules applied. Total rules applied 2384 place count 5611 transition count 5111
Symmetric choice reduction at 2 with 691 rule applications. Total rules 3075 place count 5611 transition count 5111
Deduced a syphon composed of 691 places in 72 ms
Reduce places removed 691 places and 691 transitions.
Iterating global reduction 2 with 1382 rules applied. Total rules applied 4457 place count 4920 transition count 4420
Performed 287 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 287 Pre rules applied. Total rules applied 4457 place count 4920 transition count 4133
Deduced a syphon composed of 287 places in 21 ms
Reduce places removed 287 places and 0 transitions.
Iterating global reduction 2 with 574 rules applied. Total rules applied 5031 place count 4633 transition count 4133
Performed 1463 Post agglomeration using F-continuation condition.Transition count delta: 1463
Deduced a syphon composed of 1463 places in 7 ms
Reduce places removed 1463 places and 0 transitions.
Iterating global reduction 2 with 2926 rules applied. Total rules applied 7957 place count 3170 transition count 2670
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 868 times.
Drop transitions removed 868 transitions
Iterating global reduction 2 with 868 rules applied. Total rules applied 8825 place count 3170 transition count 2670
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 8827 place count 3170 transition count 2670
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 8828 place count 3169 transition count 2669
Applied a total of 8828 rules in 3153 ms. Remains 3169 /6803 variables (removed 3634) and now considering 2669/6303 (removed 3634) transitions.
Finished structural reductions, in 1 iterations. Remains : 3169/6803 places, 2669/6303 transitions.
Incomplete random walk after 1000000 steps, including 58 resets, run finished after 19075 ms. (steps per millisecond=52 ) properties seen :[1, 0, 0, 0, 1, 0, 1, 0, 1, 1]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 413602 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :[1, 0, 0, 0, 0]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 380841 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :[1, 0, 0, 0]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Interrupted Best-First random walk after 402313 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=80 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 407627 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen :[0, 0, 0]
Interrupted Best-First random walk after 414696 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=82 ) properties seen :[0, 0, 1]
FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 2669 rows 3169 cols
[2020-06-05 00:14:50] [INFO ] Computed 1101 place invariants in 348 ms
[2020-06-05 00:14:52] [INFO ] [Real]Absence check using 1040 positive place invariants in 1277 ms returned sat
[2020-06-05 00:14:52] [INFO ] [Real]Absence check using 1040 positive and 61 generalized place invariants in 95 ms returned sat
[2020-06-05 00:14:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:15:09] [INFO ] [Real]Absence check using state equation in 17045 ms returned sat
[2020-06-05 00:15:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:15:11] [INFO ] [Nat]Absence check using 1040 positive place invariants in 1288 ms returned sat
[2020-06-05 00:15:11] [INFO ] [Nat]Absence check using 1040 positive and 61 generalized place invariants in 88 ms returned sat
[2020-06-05 00:15:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:15:28] [INFO ] [Nat]Absence check using state equation in 16751 ms returned sat
[2020-06-05 00:15:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-05 00:15:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 61 ms returned sat
[2020-06-05 00:15:29] [INFO ] Deduced a trap composed of 5 places in 1197 ms
[2020-06-05 00:15:31] [INFO ] Deduced a trap composed of 12 places in 1163 ms
[2020-06-05 00:15:32] [INFO ] Deduced a trap composed of 6 places in 1034 ms
[2020-06-05 00:15:33] [INFO ] Deduced a trap composed of 6 places in 1065 ms
[2020-06-05 00:15:34] [INFO ] Deduced a trap composed of 8 places in 1131 ms
[2020-06-05 00:15:35] [INFO ] Deduced a trap composed of 5 places in 1025 ms
[2020-06-05 00:15:36] [INFO ] Deduced a trap composed of 5 places in 879 ms
[2020-06-05 00:15:37] [INFO ] Deduced a trap composed of 6 places in 827 ms
[2020-06-05 00:15:38] [INFO ] Deduced a trap composed of 6 places in 831 ms
[2020-06-05 00:15:39] [INFO ] Deduced a trap composed of 4 places in 904 ms
[2020-06-05 00:15:41] [INFO ] Deduced a trap composed of 7 places in 965 ms
[2020-06-05 00:15:42] [INFO ] Deduced a trap composed of 7 places in 937 ms
[2020-06-05 00:15:43] [INFO ] Deduced a trap composed of 7 places in 923 ms
[2020-06-05 00:15:44] [INFO ] Deduced a trap composed of 14 places in 918 ms
[2020-06-05 00:15:45] [INFO ] Deduced a trap composed of 9 places in 922 ms
[2020-06-05 00:15:46] [INFO ] Deduced a trap composed of 7 places in 1062 ms
[2020-06-05 00:15:47] [INFO ] Deduced a trap composed of 8 places in 810 ms
[2020-06-05 00:15:48] [INFO ] Deduced a trap composed of 8 places in 923 ms
[2020-06-05 00:15:49] [INFO ] Deduced a trap composed of 7 places in 1062 ms
[2020-06-05 00:15:50] [INFO ] Deduced a trap composed of 5 places in 1065 ms
[2020-06-05 00:15:52] [INFO ] Deduced a trap composed of 9 places in 1072 ms
[2020-06-05 00:15:53] [INFO ] Deduced a trap composed of 10 places in 903 ms
[2020-06-05 00:15:54] [INFO ] Deduced a trap composed of 10 places in 1028 ms
[2020-06-05 00:15:55] [INFO ] Deduced a trap composed of 10 places in 1080 ms
[2020-06-05 00:15:55] [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 s1 s2 s3 s1563 s1564 s1579 s1580 s1600 s1601) 0)") while checking expression at index 0
[2020-06-05 00:15:57] [INFO ] [Real]Absence check using 1040 positive place invariants in 1286 ms returned sat
[2020-06-05 00:15:57] [INFO ] [Real]Absence check using 1040 positive and 61 generalized place invariants in 99 ms returned sat
[2020-06-05 00:15:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:16:15] [INFO ] [Real]Absence check using state equation in 17789 ms returned sat
[2020-06-05 00:16:15] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:16:16] [INFO ] [Nat]Absence check using 1040 positive place invariants in 1364 ms returned sat
[2020-06-05 00:16:16] [INFO ] [Nat]Absence check using 1040 positive and 61 generalized place invariants in 100 ms returned sat
[2020-06-05 00:16:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:16:34] [INFO ] [Nat]Absence check using state equation in 17588 ms returned sat
[2020-06-05 00:16:34] [INFO ] [Nat]Added 2 Read/Feed constraints in 24 ms returned sat
[2020-06-05 00:16:35] [INFO ] Deduced a trap composed of 5 places in 1018 ms
[2020-06-05 00:16:36] [INFO ] Deduced a trap composed of 11 places in 1008 ms
[2020-06-05 00:16:37] [INFO ] Deduced a trap composed of 8 places in 966 ms
[2020-06-05 00:16:38] [INFO ] Deduced a trap composed of 6 places in 849 ms
[2020-06-05 00:16:39] [INFO ] Deduced a trap composed of 4 places in 802 ms
[2020-06-05 00:16:40] [INFO ] Deduced a trap composed of 10 places in 825 ms
[2020-06-05 00:16:41] [INFO ] Deduced a trap composed of 5 places in 911 ms
[2020-06-05 00:16:42] [INFO ] Deduced a trap composed of 7 places in 900 ms
[2020-06-05 00:16:44] [INFO ] Deduced a trap composed of 5 places in 1017 ms
[2020-06-05 00:16:45] [INFO ] Deduced a trap composed of 6 places in 1111 ms
[2020-06-05 00:16:46] [INFO ] Deduced a trap composed of 4 places in 898 ms
[2020-06-05 00:16:47] [INFO ] Deduced a trap composed of 7 places in 1066 ms
[2020-06-05 00:16:48] [INFO ] Deduced a trap composed of 8 places in 884 ms
[2020-06-05 00:16:49] [INFO ] Deduced a trap composed of 5 places in 1104 ms
[2020-06-05 00:16:50] [INFO ] Deduced a trap composed of 7 places in 1070 ms
[2020-06-05 00:16:51] [INFO ] Deduced a trap composed of 9 places in 922 ms
[2020-06-05 00:16:52] [INFO ] Deduced a trap composed of 6 places in 909 ms
[2020-06-05 00:16:54] [INFO ] Deduced a trap composed of 7 places in 972 ms
[2020-06-05 00:16:55] [INFO ] Deduced a trap composed of 7 places in 983 ms
[2020-06-05 00:16:56] [INFO ] Deduced a trap composed of 7 places in 1102 ms
[2020-06-05 00:16:57] [INFO ] Deduced a trap composed of 9 places in 897 ms
[2020-06-05 00:16:58] [INFO ] Deduced a trap composed of 9 places in 1069 ms
[2020-06-05 00:16:59] [INFO ] Deduced a trap composed of 12 places in 875 ms
[2020-06-05 00:17:00] [INFO ] Deduced a trap composed of 7 places in 1056 ms
[2020-06-05 00:17:00] [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 s2428 s2429 s2456 s2459 s2468 s2470) 0)") while checking expression at index 1
Support contains 16 out of 3169 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3169/3169 places, 2669/2669 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 3169 transition count 2662
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 3162 transition count 2662
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 14 place count 3162 transition count 2653
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 32 place count 3153 transition count 2653
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 8 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 110 place count 3114 transition count 2614
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 125 place count 3114 transition count 2614
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 129 place count 3114 transition count 2614
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 130 place count 3113 transition count 2613
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 131 place count 3112 transition count 2612
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 132 place count 3111 transition count 2611
Applied a total of 132 rules in 973 ms. Remains 3111 /3169 variables (removed 58) and now considering 2611/2669 (removed 58) transitions.
Finished structural reductions, in 1 iterations. Remains : 3111/3169 places, 2611/2669 transitions.
Incomplete random walk after 1000000 steps, including 28 resets, run finished after 19863 ms. (steps per millisecond=50 ) properties seen :[0, 0]
Interrupted Best-First random walk after 443998 steps, including 0 resets, run timeout after 5001 ms. (steps per millisecond=88 ) properties seen :[0, 0]
Interrupted Best-First random walk after 380650 steps, including 1 resets, run timeout after 5001 ms. (steps per millisecond=76 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 827204 steps, run timeout after 30001 ms. (steps per millisecond=27 ) properties seen :[0, 0]
Probabilistic random walk after 827204 steps, saw 53373 distinct states, run finished after 30001 ms. (steps per millisecond=27 ) properties seen :[0, 0]
// Phase 1: matrix 2611 rows 3111 cols
[2020-06-05 00:18:01] [INFO ] Computed 1101 place invariants in 112 ms
[2020-06-05 00:18:03] [INFO ] [Real]Absence check using 1046 positive place invariants in 1316 ms returned sat
[2020-06-05 00:18:03] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 77 ms returned sat
[2020-06-05 00:18:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:18:20] [INFO ] [Real]Absence check using state equation in 16723 ms returned sat
[2020-06-05 00:18:20] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:18:22] [INFO ] [Nat]Absence check using 1046 positive place invariants in 1343 ms returned sat
[2020-06-05 00:18:22] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 83 ms returned sat
[2020-06-05 00:18:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:18:39] [INFO ] [Nat]Absence check using state equation in 17614 ms returned sat
[2020-06-05 00:18:40] [INFO ] Deduced a trap composed of 6 places in 537 ms
[2020-06-05 00:18:41] [INFO ] Deduced a trap composed of 5 places in 531 ms
[2020-06-05 00:18:41] [INFO ] Deduced a trap composed of 9 places in 558 ms
[2020-06-05 00:18:42] [INFO ] Deduced a trap composed of 12 places in 529 ms
[2020-06-05 00:18:43] [INFO ] Deduced a trap composed of 5 places in 531 ms
[2020-06-05 00:18:43] [INFO ] Deduced a trap composed of 6 places in 499 ms
[2020-06-05 00:18:44] [INFO ] Deduced a trap composed of 5 places in 498 ms
[2020-06-05 00:18:45] [INFO ] Deduced a trap composed of 9 places in 500 ms
[2020-06-05 00:18:45] [INFO ] Deduced a trap composed of 6 places in 694 ms
[2020-06-05 00:18:46] [INFO ] Deduced a trap composed of 7 places in 437 ms
[2020-06-05 00:18:47] [INFO ] Deduced a trap composed of 5 places in 424 ms
[2020-06-05 00:18:47] [INFO ] Deduced a trap composed of 6 places in 430 ms
[2020-06-05 00:18:48] [INFO ] Deduced a trap composed of 8 places in 427 ms
[2020-06-05 00:18:48] [INFO ] Deduced a trap composed of 6 places in 451 ms
[2020-06-05 00:18:49] [INFO ] Deduced a trap composed of 7 places in 456 ms
[2020-06-05 00:18:50] [INFO ] Deduced a trap composed of 7 places in 402 ms
[2020-06-05 00:18:50] [INFO ] Deduced a trap composed of 7 places in 402 ms
[2020-06-05 00:18:51] [INFO ] Deduced a trap composed of 7 places in 406 ms
[2020-06-05 00:18:51] [INFO ] Deduced a trap composed of 6 places in 428 ms
[2020-06-05 00:18:52] [INFO ] Deduced a trap composed of 8 places in 392 ms
[2020-06-05 00:18:52] [INFO ] Deduced a trap composed of 5 places in 384 ms
[2020-06-05 00:18:53] [INFO ] Deduced a trap composed of 7 places in 378 ms
[2020-06-05 00:18:53] [INFO ] Deduced a trap composed of 6 places in 359 ms
[2020-06-05 00:18:54] [INFO ] Deduced a trap composed of 7 places in 367 ms
[2020-06-05 00:18:55] [INFO ] Deduced a trap composed of 10 places in 359 ms
[2020-06-05 00:18:55] [INFO ] Deduced a trap composed of 6 places in 362 ms
[2020-06-05 00:18:56] [INFO ] Deduced a trap composed of 7 places in 356 ms
[2020-06-05 00:18:56] [INFO ] Deduced a trap composed of 7 places in 355 ms
[2020-06-05 00:18:56] [INFO ] Deduced a trap composed of 5 places in 338 ms
[2020-06-05 00:18:57] [INFO ] Deduced a trap composed of 5 places in 335 ms
[2020-06-05 00:18:57] [INFO ] Deduced a trap composed of 7 places in 322 ms
[2020-06-05 00:18:58] [INFO ] Deduced a trap composed of 5 places in 321 ms
[2020-06-05 00:18:58] [INFO ] Deduced a trap composed of 9 places in 305 ms
[2020-06-05 00:18:59] [INFO ] Deduced a trap composed of 7 places in 338 ms
[2020-06-05 00:18:59] [INFO ] Deduced a trap composed of 7 places in 314 ms
[2020-06-05 00:19:00] [INFO ] Deduced a trap composed of 34 places in 316 ms
[2020-06-05 00:19:00] [INFO ] Deduced a trap composed of 5 places in 339 ms
[2020-06-05 00:19:01] [INFO ] Deduced a trap composed of 15 places in 345 ms
[2020-06-05 00:19:01] [INFO ] Deduced a trap composed of 5 places in 302 ms
[2020-06-05 00:19:01] [INFO ] Deduced a trap composed of 7 places in 336 ms
[2020-06-05 00:19:02] [INFO ] Deduced a trap composed of 6 places in 344 ms
[2020-06-05 00:19:02] [INFO ] Deduced a trap composed of 7 places in 317 ms
[2020-06-05 00:19:03] [INFO ] Deduced a trap composed of 7 places in 304 ms
[2020-06-05 00:19:03] [INFO ] Deduced a trap composed of 6 places in 256 ms
[2020-06-05 00:19:04] [INFO ] Deduced a trap composed of 5 places in 238 ms
[2020-06-05 00:19:04] [INFO ] Trap strengthening (SAT) tested/added 46/45 trap constraints in 24460 ms
[2020-06-05 00:19:04] [INFO ] Computed and/alt/rep : 2608/11033/2608 causal constraints in 209 ms.
[2020-06-05 00:19:05] [INFO ] Added : 20 causal constraints over 4 iterations in 1038 ms. Result :unknown
[2020-06-05 00:19:07] [INFO ] [Real]Absence check using 1046 positive place invariants in 1534 ms returned sat
[2020-06-05 00:19:07] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 77 ms returned sat
[2020-06-05 00:19:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:19:23] [INFO ] [Real]Absence check using state equation in 16078 ms returned sat
[2020-06-05 00:19:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:19:25] [INFO ] [Nat]Absence check using 1046 positive place invariants in 1371 ms returned sat
[2020-06-05 00:19:25] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 104 ms returned sat
[2020-06-05 00:19:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:19:41] [INFO ] [Nat]Absence check using state equation in 16499 ms returned sat
[2020-06-05 00:19:42] [INFO ] Deduced a trap composed of 6 places in 633 ms
[2020-06-05 00:19:43] [INFO ] Deduced a trap composed of 6 places in 450 ms
[2020-06-05 00:19:43] [INFO ] Deduced a trap composed of 4 places in 600 ms
[2020-06-05 00:19:44] [INFO ] Deduced a trap composed of 6 places in 521 ms
[2020-06-05 00:19:45] [INFO ] Deduced a trap composed of 4 places in 705 ms
[2020-06-05 00:19:46] [INFO ] Deduced a trap composed of 6 places in 594 ms
[2020-06-05 00:19:46] [INFO ] Deduced a trap composed of 6 places in 563 ms
[2020-06-05 00:19:47] [INFO ] Deduced a trap composed of 5 places in 550 ms
[2020-06-05 00:19:48] [INFO ] Deduced a trap composed of 8 places in 537 ms
[2020-06-05 00:19:48] [INFO ] Deduced a trap composed of 6 places in 573 ms
[2020-06-05 00:19:49] [INFO ] Deduced a trap composed of 4 places in 546 ms
[2020-06-05 00:19:50] [INFO ] Deduced a trap composed of 6 places in 535 ms
[2020-06-05 00:19:50] [INFO ] Deduced a trap composed of 8 places in 527 ms
[2020-06-05 00:19:51] [INFO ] Deduced a trap composed of 5 places in 514 ms
[2020-06-05 00:19:52] [INFO ] Deduced a trap composed of 5 places in 487 ms
[2020-06-05 00:19:52] [INFO ] Deduced a trap composed of 5 places in 506 ms
[2020-06-05 00:19:53] [INFO ] Deduced a trap composed of 5 places in 509 ms
[2020-06-05 00:19:53] [INFO ] Deduced a trap composed of 5 places in 473 ms
[2020-06-05 00:19:54] [INFO ] Deduced a trap composed of 7 places in 506 ms
[2020-06-05 00:19:55] [INFO ] Deduced a trap composed of 6 places in 467 ms
[2020-06-05 00:19:55] [INFO ] Deduced a trap composed of 7 places in 464 ms
[2020-06-05 00:19:56] [INFO ] Deduced a trap composed of 5 places in 463 ms
[2020-06-05 00:19:56] [INFO ] Deduced a trap composed of 6 places in 454 ms
[2020-06-05 00:19:57] [INFO ] Deduced a trap composed of 8 places in 435 ms
[2020-06-05 00:19:57] [INFO ] Deduced a trap composed of 5 places in 429 ms
[2020-06-05 00:19:58] [INFO ] Deduced a trap composed of 7 places in 461 ms
[2020-06-05 00:19:59] [INFO ] Deduced a trap composed of 5 places in 466 ms
[2020-06-05 00:19:59] [INFO ] Deduced a trap composed of 7 places in 443 ms
[2020-06-05 00:20:00] [INFO ] Deduced a trap composed of 5 places in 446 ms
[2020-06-05 00:20:00] [INFO ] Deduced a trap composed of 7 places in 449 ms
[2020-06-05 00:20:01] [INFO ] Deduced a trap composed of 7 places in 444 ms
[2020-06-05 00:20:01] [INFO ] Deduced a trap composed of 5 places in 416 ms
[2020-06-05 00:20:02] [INFO ] Deduced a trap composed of 7 places in 419 ms
[2020-06-05 00:20:03] [INFO ] Deduced a trap composed of 6 places in 439 ms
[2020-06-05 00:20:03] [INFO ] Deduced a trap composed of 7 places in 402 ms
[2020-06-05 00:20:04] [INFO ] Deduced a trap composed of 5 places in 413 ms
[2020-06-05 00:20:04] [INFO ] Deduced a trap composed of 7 places in 408 ms
[2020-06-05 00:20:05] [INFO ] Deduced a trap composed of 9 places in 412 ms
[2020-06-05 00:20:05] [INFO ] Deduced a trap composed of 7 places in 421 ms
[2020-06-05 00:20:06] [INFO ] Deduced a trap composed of 7 places in 409 ms
[2020-06-05 00:20:06] [INFO ] Deduced a trap composed of 7 places in 380 ms
[2020-06-05 00:20:07] [INFO ] Deduced a trap composed of 7 places in 397 ms
[2020-06-05 00:20:07] [INFO ] Deduced a trap composed of 5 places in 400 ms
[2020-06-05 00:20:08] [INFO ] Deduced a trap composed of 7 places in 366 ms
[2020-06-05 00:20:08] [INFO ] Deduced a trap composed of 7 places in 361 ms
[2020-06-05 00:20:08] [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 s2068 s2069 s2088 s2091 s2110 s2111) 0)") while checking expression at index 1
Incomplete Parikh walk after 195600 steps, including 1000 resets, run finished after 3468 ms. (steps per millisecond=56 ) properties seen :[0, 0] could not realise parikh vector
Support contains 16 out of 3111 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 3111/3111 places, 2611/2611 transitions.
Applied a total of 0 rules in 129 ms. Remains 3111 /3111 variables (removed 0) and now considering 2611/2611 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 3111/3111 places, 2611/2611 transitions.
Starting structural reductions, iteration 0 : 3111/3111 places, 2611/2611 transitions.
Applied a total of 0 rules in 211 ms. Remains 3111 /3111 variables (removed 0) and now considering 2611/2611 (removed 0) transitions.
// Phase 1: matrix 2611 rows 3111 cols
[2020-06-05 00:20:12] [INFO ] Computed 1101 place invariants in 91 ms
[2020-06-05 00:20:13] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 00:20:24] [INFO ] Implicit Places using invariants in 12370 ms returned []
// Phase 1: matrix 2611 rows 3111 cols
[2020-06-05 00:20:25] [INFO ] Computed 1101 place invariants in 62 ms
[2020-06-05 00:20:25] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 00:20:37] [INFO ] Implicit Places using invariants and state equation in 12721 ms returned []
Implicit Place search using SMT with State Equation took 25092 ms to find 0 implicit places.
[2020-06-05 00:20:38] [INFO ] Redundant transitions in 342 ms returned []
// Phase 1: matrix 2611 rows 3111 cols
[2020-06-05 00:20:38] [INFO ] Computed 1101 place invariants in 64 ms
[2020-06-05 00:20:38] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 00:20:48] [INFO ] Dead Transitions using invariants and state equation in 10419 ms returned []
Finished structural reductions, in 1 iterations. Remains : 3111/3111 places, 2611/2611 transitions.
Incomplete random walk after 100000 steps, including 3 resets, run finished after 2122 ms. (steps per millisecond=47 ) properties seen :[0, 0]
// Phase 1: matrix 2611 rows 3111 cols
[2020-06-05 00:20:50] [INFO ] Computed 1101 place invariants in 70 ms
[2020-06-05 00:20:52] [INFO ] [Real]Absence check using 1046 positive place invariants in 1330 ms returned sat
[2020-06-05 00:20:52] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 82 ms returned sat
[2020-06-05 00:20:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:21:09] [INFO ] [Real]Absence check using state equation in 17391 ms returned sat
[2020-06-05 00:21:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:21:11] [INFO ] [Nat]Absence check using 1046 positive place invariants in 1201 ms returned sat
[2020-06-05 00:21:11] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 72 ms returned sat
[2020-06-05 00:21:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:21:29] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-05 00:21:29] [INFO ] [Nat]Absence check using state equation in 18284 ms returned (error "Failed to check-sat")
[2020-06-05 00:21:31] [INFO ] [Real]Absence check using 1046 positive place invariants in 1260 ms returned sat
[2020-06-05 00:21:31] [INFO ] [Real]Absence check using 1046 positive and 55 generalized place invariants in 77 ms returned sat
[2020-06-05 00:21:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:21:48] [INFO ] [Real]Absence check using state equation in 17219 ms returned sat
[2020-06-05 00:21:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:21:50] [INFO ] [Nat]Absence check using 1046 positive place invariants in 1310 ms returned sat
[2020-06-05 00:21:50] [INFO ] [Nat]Absence check using 1046 positive and 55 generalized place invariants in 83 ms returned sat
[2020-06-05 00:21:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:22:08] [INFO ] [Nat]Absence check using state equation in 17382 ms returned sat
[2020-06-05 00:22:08] [INFO ] Deduced a trap composed of 6 places in 651 ms
[2020-06-05 00:22:09] [INFO ] Deduced a trap composed of 6 places in 621 ms
[2020-06-05 00:22:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s2994 s2995 s3005 s3007 s3026 s3027) 0)") while checking expression at index 1
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 3111 transition count 2611
Applied a total of 2 rules in 305 ms. Remains 3111 /3111 variables (removed 0) and now considering 2611/2611 (removed 0) transitions.
// Phase 1: matrix 2611 rows 3111 cols
[2020-06-05 00:22:10] [INFO ] Computed 1101 place invariants in 63 ms
[2020-06-05 00:22:11] [INFO ] [Real]Absence check using 1047 positive place invariants in 1313 ms returned sat
[2020-06-05 00:22:11] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 81 ms returned sat
[2020-06-05 00:22:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:22:29] [INFO ] [Real]Absence check using state equation in 17321 ms returned sat
[2020-06-05 00:22:29] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:22:31] [INFO ] [Nat]Absence check using 1047 positive place invariants in 1279 ms returned sat
[2020-06-05 00:22:31] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 81 ms returned sat
[2020-06-05 00:22:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:22:48] [INFO ] [Nat]Absence check using state equation in 17660 ms returned sat
[2020-06-05 00:22:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2020-06-05 00:22:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 52 ms returned sat
[2020-06-05 00:22:49] [INFO ] Deduced a trap composed of 5 places in 793 ms
[2020-06-05 00:22:50] [INFO ] Deduced a trap composed of 6 places in 699 ms
[2020-06-05 00:22:51] [INFO ] Deduced a trap composed of 8 places in 722 ms
[2020-06-05 00:22:52] [INFO ] Deduced a trap composed of 4 places in 632 ms
[2020-06-05 00:22:53] [INFO ] Deduced a trap composed of 4 places in 765 ms
[2020-06-05 00:22:53] [INFO ] Deduced a trap composed of 6 places in 582 ms
[2020-06-05 00:22:54] [INFO ] Deduced a trap composed of 9 places in 810 ms
[2020-06-05 00:22:55] [INFO ] Deduced a trap composed of 6 places in 772 ms
[2020-06-05 00:22:56] [INFO ] Deduced a trap composed of 4 places in 735 ms
[2020-06-05 00:22:57] [INFO ] Deduced a trap composed of 4 places in 758 ms
[2020-06-05 00:22:58] [INFO ] Deduced a trap composed of 11 places in 748 ms
[2020-06-05 00:22:59] [INFO ] Deduced a trap composed of 11 places in 651 ms
[2020-06-05 00:22:59] [INFO ] Deduced a trap composed of 5 places in 671 ms
[2020-06-05 00:23:00] [INFO ] Deduced a trap composed of 4 places in 633 ms
[2020-06-05 00:23:01] [INFO ] Deduced a trap composed of 6 places in 729 ms
[2020-06-05 00:23:02] [INFO ] Deduced a trap composed of 6 places in 751 ms
[2020-06-05 00:23:03] [INFO ] Deduced a trap composed of 5 places in 781 ms
[2020-06-05 00:23:03] [INFO ] Deduced a trap composed of 4 places in 640 ms
[2020-06-05 00:23:04] [INFO ] Deduced a trap composed of 6 places in 683 ms
[2020-06-05 00:23:05] [INFO ] Deduced a trap composed of 6 places in 708 ms
[2020-06-05 00:23:06] [INFO ] Deduced a trap composed of 6 places in 693 ms
[2020-06-05 00:23:07] [INFO ] Deduced a trap composed of 14 places in 687 ms
[2020-06-05 00:23:07] [INFO ] Deduced a trap composed of 5 places in 708 ms
[2020-06-05 00:23:08] [INFO ] Deduced a trap composed of 9 places in 644 ms
[2020-06-05 00:23:09] [INFO ] Deduced a trap composed of 6 places in 718 ms
[2020-06-05 00:23:10] [INFO ] Deduced a trap composed of 4 places in 714 ms
[2020-06-05 00:23:11] [INFO ] Deduced a trap composed of 4 places in 699 ms
[2020-06-05 00:23:12] [INFO ] Deduced a trap composed of 6 places in 710 ms
[2020-06-05 00:23:12] [INFO ] Deduced a trap composed of 6 places in 731 ms
[2020-06-05 00:23:13] [INFO ] Deduced a trap composed of 8 places in 698 ms
[2020-06-05 00:23:14] [INFO ] Deduced a trap composed of 6 places in 737 ms
[2020-06-05 00:23:14] [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 (> (+ s2754 s2755 s2772 s2775 s2794 s2795) 0)") while checking expression at index 0
[2020-06-05 00:23:16] [INFO ] [Real]Absence check using 1047 positive place invariants in 1180 ms returned sat
[2020-06-05 00:23:16] [INFO ] [Real]Absence check using 1047 positive and 54 generalized place invariants in 74 ms returned sat
[2020-06-05 00:23:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 00:23:33] [INFO ] [Real]Absence check using state equation in 17175 ms returned sat
[2020-06-05 00:23:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 00:23:35] [INFO ] [Nat]Absence check using 1047 positive place invariants in 1333 ms returned sat
[2020-06-05 00:23:35] [INFO ] [Nat]Absence check using 1047 positive and 54 generalized place invariants in 85 ms returned sat
[2020-06-05 00:23:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 00:23:53] [INFO ] [Nat]Absence check using state equation in 18116 ms returned sat
[2020-06-05 00:23:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 90 ms returned sat
[2020-06-05 00:23:54] [INFO ] Deduced a trap composed of 6 places in 556 ms
[2020-06-05 00:23:55] [INFO ] Deduced a trap composed of 5 places in 588 ms
[2020-06-05 00:23:55] [INFO ] Deduced a trap composed of 6 places in 478 ms
[2020-06-05 00:23:56] [INFO ] Deduced a trap composed of 6 places in 476 ms
[2020-06-05 00:23:56] [INFO ] Deduced a trap composed of 14 places in 481 ms
[2020-06-05 00:23:57] [INFO ] Deduced a trap composed of 6 places in 456 ms
[2020-06-05 00:23:58] [INFO ] Deduced a trap composed of 5 places in 432 ms
[2020-06-05 00:23:58] [INFO ] Deduced a trap composed of 8 places in 355 ms
[2020-06-05 00:23:59] [INFO ] Deduced a trap composed of 17 places in 409 ms
[2020-06-05 00:23:59] [INFO ] Deduced a trap composed of 5 places in 412 ms
[2020-06-05 00:24:00] [INFO ] Deduced a trap composed of 8 places in 408 ms
[2020-06-05 00:24:00] [INFO ] Deduced a trap composed of 10 places in 400 ms
[2020-06-05 00:24:01] [INFO ] Deduced a trap composed of 11 places in 407 ms
[2020-06-05 00:24:01] [INFO ] Deduced a trap composed of 6 places in 419 ms
[2020-06-05 00:24:02] [INFO ] Deduced a trap composed of 11 places in 417 ms
[2020-06-05 00:24:02] [INFO ] Deduced a trap composed of 9 places in 417 ms
[2020-06-05 00:24:03] [INFO ] Deduced a trap composed of 4 places in 410 ms
[2020-06-05 00:24:04] [INFO ] Deduced a trap composed of 6 places in 400 ms
[2020-06-05 00:24:04] [INFO ] Deduced a trap composed of 6 places in 392 ms
[2020-06-05 00:24:05] [INFO ] Deduced a trap composed of 6 places in 394 ms
[2020-06-05 00:24:05] [INFO ] Deduced a trap composed of 6 places in 383 ms
[2020-06-05 00:24:06] [INFO ] Deduced a trap composed of 6 places in 370 ms
[2020-06-05 00:24:06] [INFO ] Deduced a trap composed of 7 places in 362 ms
[2020-06-05 00:24:07] [INFO ] Deduced a trap composed of 7 places in 283 ms
[2020-06-05 00:24:07] [INFO ] Deduced a trap composed of 6 places in 281 ms
[2020-06-05 00:24:07] [INFO ] Deduced a trap composed of 6 places in 277 ms
[2020-06-05 00:24:08] [INFO ] Deduced a trap composed of 7 places in 271 ms
[2020-06-05 00:24:08] [INFO ] Deduced a trap composed of 7 places in 254 ms
[2020-06-05 00:24:09] [INFO ] Deduced a trap composed of 7 places in 241 ms
[2020-06-05 00:24:09] [INFO ] Deduced a trap composed of 10 places in 241 ms
[2020-06-05 00:24:09] [INFO ] Deduced a trap composed of 15 places in 239 ms
[2020-06-05 00:24:10] [INFO ] Deduced a trap composed of 9 places in 230 ms
[2020-06-05 00:24:10] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 16555 ms
[2020-06-05 00:24:10] [INFO ] Computed and/alt/rep : 2608/11042/2608 causal constraints in 212 ms.
[2020-06-05 00:24:18] [INFO ] Added : 145 causal constraints over 29 iterations in 8378 ms. Result :unknown
[2020-06-05 00:24:18] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 6 ms.
[2020-06-05 00:24:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 61 ms.
[2020-06-05 00:24:19] [INFO ] Flatten gal took : 397 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ ShieldPPPs-PT-100B @ 3570 seconds

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-100B-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3497
rslt: Output for ReachabilityFireability @ ShieldPPPs-PT-100B

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Fri Jun 5 00:24:19 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1748
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "E (F (((1 <= p1880) AND (1 <= p1675) AND (1 <= p2242) AND (1 <= p1525))))",
"processed_size": 73,
"rewrites": 1
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"type": "reachability",
"workflow": "stateequation||search"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3497
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 4,
"aneg": 0,
"comp": 14,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 14,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "A (G (((p872 <= 0) OR (2 <= p2214) OR (p2214 <= 0) OR (2 <= p2231) OR (p2231 <= 0) OR (p1098 <= 0) OR (p1138 <= 0) OR (p1148 <= 0) OR (((p3106 <= 0)) AND ((p2029 <= 0) OR (p2050 <= 0)) AND ((p1804 <= 0) OR (p2407 <= 0) OR (p2409 <= 0))))))",
"processed_size": 250,
"rewrites": 2
},
"result":
{
"edges": 279,
"markings": 280,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 30,
"problems": 3
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 60632,
"runtime": 73.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : A(G(**))"
},
"net":
{
"arcs": 12256,
"conflict_clusters": 517,
"places": 3111,
"places_significant": 2010,
"singleton_clusters": 0,
"transitions": 2611
},
"result":
{
"preliminary_value": "no no ",
"value": "no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 5722/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 99552
lola: finding significant places
lola: 3111 places, 2611 transitions, 2010 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityFireability.xml
lola: LP says that atomic proposition is always true: (p1880 <= 1)
lola: LP says that atomic proposition is always true: (p1675 <= 1)
lola: LP says that atomic proposition is always true: (p2242 <= 1)
lola: LP says that atomic proposition is always true: (p1525 <= 1)
lola: LP says that atomic proposition is always true: (p872 <= 1)
lola: LP says that atomic proposition is always true: (p1098 <= 1)
lola: LP says that atomic proposition is always true: (p1138 <= 1)
lola: LP says that atomic proposition is always true: (p1148 <= 1)
lola: LP says that atomic proposition is always true: (p3106 <= 1)
lola: LP says that atomic proposition is always true: (p2029 <= 1)
lola: LP says that atomic proposition is always true: (p2050 <= 1)
lola: LP says that atomic proposition is always true: (p1804 <= 1)
lola: LP says that atomic proposition is always true: (p2407 <= 1)
lola: LP says that atomic proposition is always true: (p2409 <= 1)
lola: E (F (((1 <= p1880) AND (1 <= p1675) AND (1 <= p2242) AND (1 <= p1525)))) : A (G (((p872 <= 0) OR (2 <= p2214) OR (p2214 <= 0) OR (2 <= p2231) OR (p2231 <= 0) OR (p1098 <= 0) OR (p1138 <= 0) OR (p1148 <= 0) OR (((p3106 <= 0)) AND ((p2029 <= 0) OR (p2050 <= 0)) AND ((p1804 <= 0) OR (p2407 <= 0) OR (p2409 <= 0))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1748 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1880) AND (1 <= p1675) AND (1 <= p2242) AND (1 <= p1525))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((1 <= p1880) AND (1 <= p1675) AND (1 <= p2242) AND (1 <= p1525))))
lola: processed formula length: 73
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p1880) AND (1 <= p1675) AND (1 <= p2242) AND (1 <= p1525))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: 7 markings, 6 edges
lola: ========================================
lola: subprocess 1 will run for 3497 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p872 <= 0) OR (2 <= p2214) OR (p2214 <= 0) OR (2 <= p2231) OR (p2231 <= 0) OR (p1098 <= 0) OR (p1138 <= 0) OR (p1148 <= 0) OR (((p3106 <= 0)) AND ((p2029 <= 0) OR (p2050 <= 0)) AND ((p1804 <= 0) OR (p2407 <= 0) OR (p2409 <= 0))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((p872 <= 0) OR (2 <= p2214) OR (p2214 <= 0) OR (2 <= p2231) OR (p2231 <= 0) OR (p1098 <= 0) OR (p1138 <= 0) OR (p1148 <= 0) OR (((p3106 <= 0)) AND ((p2029 <= 0) OR (p2050 <= 0)) AND ((p1804 <= 0) OR (p2407 <= 0) OR (p2409 <= 0))))))
lola: processed formula length: 250
lola: 2 rewrites
lola: closed formula file ReachabilityFireability.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((1 <= p872) AND (p2214 <= 1) AND (1 <= p2214) AND (p2231 <= 1) AND (1 <= p2231) AND (1 <= p1098) AND (1 <= p1138) AND (1 <= p1148) AND (((1 <= p3106)) OR ((1 <= p2029) AND (1 <= p2050)) OR ((1 <= p1804) AND (1 <= p2407) AND (1 <= p2409))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 30 literals and 3 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 280 markings, 279 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no
lola:
preliminary result: no no
lola: memory consumption: 60632 KB
lola: time consumption: 73 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.json
rslt: finished

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-100B"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is ShieldPPPs-PT-100B, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r211-tajo-159033477600567"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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