About the Execution of ITS-LoLa for PolyORBLF-PT-S02J04T10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15742.500 | 3600000.00 | 1061132.00 | 165.70 | FFFFFFTTFTTTFTFF | 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.r176-tajo-158987871900430.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 PolyORBLF-PT-S02J04T10, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987871900430
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.9M
-rw-r--r-- 1 mcc users 8.3K Apr 12 05:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 12 05:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 11 04:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 04:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 8.0K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 14 12:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 47K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 10 12:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 36K Apr 10 12:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Apr 9 17:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 9 17:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.0K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.2K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.5M 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 PolyORBLF-PT-S02J04T10-ReachabilityCardinality-00
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-01
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-02
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-03
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-04
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-05
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-06
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-07
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-08
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-09
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-10
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-11
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-12
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-13
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-14
FORMULA_NAME PolyORBLF-PT-S02J04T10-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1591152870371
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 02:54:32] [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, -timeout, 3600, -rebuildPNML]
[2020-06-03 02:54:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 02:54:32] [INFO ] Load time of PNML (sax parser for PT used): 168 ms
[2020-06-03 02:54:32] [INFO ] Transformed 752 places.
[2020-06-03 02:54:32] [INFO ] Transformed 1572 transitions.
[2020-06-03 02:54:32] [INFO ] Parsed PT model containing 752 places and 1572 transitions in 226 ms.
Ensure Unique test removed 160 transitions
Reduce redundant transitions removed 160 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 54 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 0 resets, run finished after 162 ms. (steps per millisecond=61 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1]
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 71 ms. (steps per millisecond=140 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 1 resets, run finished after 72 ms. (steps per millisecond=138 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 65 ms. (steps per millisecond=153 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=232 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 50 ms. (steps per millisecond=200 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 28 ms. (steps per millisecond=357 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0]
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 33 ms. (steps per millisecond=303 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 02:54:33] [INFO ] Flow matrix only has 1392 transitions (discarded 20 similar events)
// Phase 1: matrix 1392 rows 752 cols
[2020-06-03 02:54:33] [INFO ] Computed 54 place invariants in 77 ms
[2020-06-03 02:54:33] [INFO ] [Real]Absence check using 15 positive place invariants in 40 ms returned sat
[2020-06-03 02:54:33] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 45 ms returned sat
[2020-06-03 02:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:37] [INFO ] [Real]Absence check using state equation in 3726 ms returned sat
[2020-06-03 02:54:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:54:37] [INFO ] [Nat]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-03 02:54:37] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 61 ms returned unsat
[2020-06-03 02:54:37] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-06-03 02:54:37] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 42 ms returned unsat
[2020-06-03 02:54:37] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned unsat
[2020-06-03 02:54:37] [INFO ] [Real]Absence check using 15 positive place invariants in 20 ms returned unsat
[2020-06-03 02:54:37] [INFO ] [Real]Absence check using 15 positive place invariants in 24 ms returned sat
[2020-06-03 02:54:38] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 56 ms returned sat
[2020-06-03 02:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:40] [INFO ] [Real]Absence check using state equation in 2869 ms returned sat
[2020-06-03 02:54:40] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:54:40] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-06-03 02:54:41] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 37 ms returned sat
[2020-06-03 02:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:45] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:54:45] [INFO ] [Nat]Absence check using state equation in 4905 ms returned (error "Failed to check-sat")
[2020-06-03 02:54:46] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2020-06-03 02:54:46] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 39 ms returned sat
[2020-06-03 02:54:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:48] [INFO ] [Real]Absence check using state equation in 2370 ms returned sat
[2020-06-03 02:54:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:54:48] [INFO ] [Nat]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-06-03 02:54:48] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 38 ms returned sat
[2020-06-03 02:54:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:53] [INFO ] [Nat]Absence check using state equation in 4779 ms returned sat
[2020-06-03 02:54:53] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-03 02:54:53] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:54:53] [INFO ] [Nat]Added 130 Read/Feed constraints in 104 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 02:54:53] [INFO ] [Real]Absence check using 15 positive place invariants in 19 ms returned sat
[2020-06-03 02:54:53] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 41 ms returned sat
[2020-06-03 02:54:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:54:56] [INFO ] [Real]Absence check using state equation in 2785 ms returned sat
[2020-06-03 02:54:56] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:54:56] [INFO ] [Nat]Absence check using 15 positive place invariants in 30 ms returned sat
[2020-06-03 02:54:56] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 57 ms returned sat
[2020-06-03 02:54:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:55:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:55:01] [INFO ] [Nat]Absence check using state equation in 4820 ms returned (error "Failed to check-sat")
[2020-06-03 02:55:01] [INFO ] [Real]Absence check using 15 positive place invariants in 28 ms returned sat
[2020-06-03 02:55:01] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 85 ms returned sat
[2020-06-03 02:55:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:55:05] [INFO ] [Real]Absence check using state equation in 3825 ms returned sat
[2020-06-03 02:55:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:55:05] [INFO ] [Nat]Absence check using 15 positive place invariants in 32 ms returned sat
[2020-06-03 02:55:05] [INFO ] [Nat]Absence check using 15 positive and 39 generalized place invariants in 56 ms returned sat
[2020-06-03 02:55:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:55:10] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:55:10] [INFO ] [Nat]Absence check using state equation in 4804 ms returned (error "Failed to check-sat")
[2020-06-03 02:55:10] [INFO ] [Real]Absence check using 15 positive place invariants in 18 ms returned sat
[2020-06-03 02:55:10] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 34 ms returned unsat
[2020-06-03 02:55:10] [INFO ] [Real]Absence check using 15 positive place invariants in 31 ms returned sat
[2020-06-03 02:55:10] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 28 ms returned unsat
[2020-06-03 02:55:10] [INFO ] [Real]Absence check using 15 positive place invariants in 26 ms returned sat
[2020-06-03 02:55:11] [INFO ] [Real]Absence check using 15 positive and 39 generalized place invariants in 36 ms returned unsat
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-10 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 174 out of 752 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 752/752 places, 1412/1412 transitions.
Ensure Unique test removed 2 places
Performed 60 Post agglomeration using F-continuation condition.Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 62 place count 750 transition count 1352
Reduce places removed 60 places and 0 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 122 place count 690 transition count 1352
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 60 Pre rules applied. Total rules applied 122 place count 690 transition count 1292
Deduced a syphon composed of 60 places in 4 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 2 with 120 rules applied. Total rules applied 242 place count 630 transition count 1292
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 3 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 302 place count 600 transition count 1262
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 2 with 20 rules applied. Total rules applied 322 place count 600 transition count 1242
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 342 place count 580 transition count 1242
Applied a total of 342 rules in 266 ms. Remains 580 /752 variables (removed 172) and now considering 1242/1412 (removed 170) transitions.
[2020-06-03 02:55:11] [INFO ] Flow matrix only has 1222 transitions (discarded 20 similar events)
// Phase 1: matrix 1222 rows 580 cols
[2020-06-03 02:55:11] [INFO ] Computed 52 place invariants in 44 ms
[2020-06-03 02:55:15] [INFO ] Dead Transitions using invariants and state equation in 4154 ms returned [2, 41, 65, 69, 74, 91, 103, 112, 145, 153, 166, 187, 196, 210, 227, 238, 245, 269, 297, 329, 342, 348, 353, 358, 375, 384, 389, 397, 400, 412, 424, 427, 428, 430, 431, 458, 473, 485, 504, 531, 541, 547, 553, 562, 567, 571, 572, 578, 587, 588, 599, 608, 616, 618, 623, 641, 642, 646, 658, 659, 661, 663, 674, 678, 689, 691, 692, 698, 703, 708, 730, 732, 748, 761, 762, 763, 765, 766, 768, 771, 772, 773, 774, 783, 792, 795, 797, 798, 809, 823, 842, 843, 844, 848, 850, 851, 857, 858, 863, 870, 871, 873, 880, 882, 883, 885, 892, 894, 900, 901]
Found 110 dead transitions using SMT.
Drop transitions removed 110 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 110 transitions :[901, 900, 894, 892, 885, 883, 882, 880, 873, 871, 870, 863, 858, 857, 851, 850, 848, 844, 843, 842, 823, 809, 798, 797, 795, 792, 783, 774, 773, 772, 771, 768, 766, 765, 763, 762, 761, 748, 732, 730, 708, 703, 698, 692, 691, 689, 678, 674, 663, 661, 659, 658, 646, 642, 641, 623, 618, 616, 608, 599, 588, 587, 578, 572, 571, 567, 562, 553, 547, 541, 531, 504, 485, 473, 458, 431, 430, 428, 427, 424, 412, 400, 397, 389, 384, 375, 358, 353, 348, 342, 329, 297, 269, 245, 238, 227, 210, 196, 187, 166, 153, 145, 112, 103, 91, 74, 69, 65, 41, 2]
Starting structural reductions, iteration 1 : 580/752 places, 1132/1412 transitions.
Reduce places removed 0 places and 20 transitions.
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 0 places and 20 transitions.
Applied a total of 0 rules in 68 ms. Remains 580 /580 variables (removed 0) and now considering 1092/1132 (removed 40) transitions.
Finished structural reductions, in 2 iterations. Remains : 580/752 places, 1092/1412 transitions.
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Incomplete random walk after 1000000 steps, including 257 resets, run finished after 6037 ms. (steps per millisecond=165 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 99 resets, run finished after 2995 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 126 resets, run finished after 3323 ms. (steps per millisecond=300 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 229 resets, run finished after 3617 ms. (steps per millisecond=276 ) properties seen :[0, 0, 0, 0]
Incomplete Best-First random walk after 1000000 steps, including 286 resets, run finished after 3215 ms. (steps per millisecond=311 ) properties seen :[0, 0, 0, 0]
Interrupted probabilistic random walk after 1629577 steps, run timeout after 30001 ms. (steps per millisecond=54 ) properties seen :[0, 0, 0, 0]
Probabilistic random walk after 1629577 steps, saw 611859 distinct states, run finished after 30001 ms. (steps per millisecond=54 ) properties seen :[0, 0, 0, 0]
[2020-06-03 02:56:04] [INFO ] Flow matrix only has 1072 transitions (discarded 20 similar events)
// Phase 1: matrix 1072 rows 558 cols
[2020-06-03 02:56:04] [INFO ] Computed 52 place invariants in 26 ms
[2020-06-03 02:56:04] [INFO ] [Real]Absence check using 19 positive place invariants in 35 ms returned unsat
[2020-06-03 02:56:04] [INFO ] [Real]Absence check using 19 positive place invariants in 33 ms returned sat
[2020-06-03 02:56:04] [INFO ] [Real]Absence check using 19 positive and 33 generalized place invariants in 36 ms returned unsat
[2020-06-03 02:56:05] [INFO ] [Real]Absence check using 19 positive place invariants in 46 ms returned sat
[2020-06-03 02:56:05] [INFO ] [Real]Absence check using 19 positive and 33 generalized place invariants in 51 ms returned sat
[2020-06-03 02:56:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:06] [INFO ] [Real]Absence check using state equation in 1752 ms returned sat
[2020-06-03 02:56:06] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:56:07] [INFO ] [Nat]Absence check using 19 positive place invariants in 45 ms returned sat
[2020-06-03 02:56:07] [INFO ] [Nat]Absence check using 19 positive and 33 generalized place invariants in 46 ms returned sat
[2020-06-03 02:56:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:09] [INFO ] [Nat]Absence check using state equation in 2333 ms returned sat
[2020-06-03 02:56:09] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-03 02:56:10] [INFO ] [Nat]Added 130 Read/Feed constraints in 658 ms returned sat
[2020-06-03 02:56:10] [INFO ] Deduced a trap composed of 46 places in 409 ms
[2020-06-03 02:56:11] [INFO ] Deduced a trap composed of 269 places in 448 ms
[2020-06-03 02:56:11] [INFO ] Deduced a trap composed of 46 places in 437 ms
[2020-06-03 02:56:12] [INFO ] Deduced a trap composed of 46 places in 422 ms
[2020-06-03 02:56:12] [INFO ] Deduced a trap composed of 46 places in 434 ms
[2020-06-03 02:56:13] [INFO ] Deduced a trap composed of 246 places in 393 ms
[2020-06-03 02:56:13] [INFO ] Deduced a trap composed of 275 places in 441 ms
[2020-06-03 02:56:14] [INFO ] Deduced a trap composed of 221 places in 446 ms
[2020-06-03 02:56:14] [INFO ] Deduced a trap composed of 46 places in 421 ms
[2020-06-03 02:56:15] [INFO ] Deduced a trap composed of 46 places in 334 ms
[2020-06-03 02:56:15] [INFO ] Deduced a trap composed of 46 places in 348 ms
[2020-06-03 02:56:15] [INFO ] Deduced a trap composed of 307 places in 329 ms
[2020-06-03 02:56:16] [INFO ] Deduced a trap composed of 46 places in 304 ms
[2020-06-03 02:56:16] [INFO ] Deduced a trap composed of 46 places in 314 ms
[2020-06-03 02:56:16] [INFO ] Deduced a trap composed of 258 places in 380 ms
[2020-06-03 02:56:17] [INFO ] Deduced a trap composed of 301 places in 313 ms
[2020-06-03 02:56:17] [INFO ] Deduced a trap composed of 274 places in 356 ms
[2020-06-03 02:56:18] [INFO ] Deduced a trap composed of 261 places in 308 ms
[2020-06-03 02:56:18] [INFO ] Deduced a trap composed of 252 places in 376 ms
[2020-06-03 02:56:18] [INFO ] Deduced a trap composed of 252 places in 317 ms
[2020-06-03 02:56:19] [INFO ] Deduced a trap composed of 253 places in 351 ms
[2020-06-03 02:56:19] [INFO ] Deduced a trap composed of 301 places in 374 ms
[2020-06-03 02:56:20] [INFO ] Deduced a trap composed of 278 places in 420 ms
[2020-06-03 02:56:20] [INFO ] Trap strengthening (SAT) tested/added 24/23 trap constraints in 10452 ms
[2020-06-03 02:56:20] [INFO ] Computed and/alt/rep : 1090/20478/1070 causal constraints in 122 ms.
[2020-06-03 02:56:40] [INFO ] Added : 560 causal constraints over 112 iterations in 20259 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 155 ms.
[2020-06-03 02:56:41] [INFO ] [Real]Absence check using 19 positive place invariants in 41 ms returned sat
[2020-06-03 02:56:41] [INFO ] [Real]Absence check using 19 positive and 33 generalized place invariants in 43 ms returned sat
[2020-06-03 02:56:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:43] [INFO ] [Real]Absence check using state equation in 2069 ms returned sat
[2020-06-03 02:56:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:56:43] [INFO ] [Nat]Absence check using 19 positive place invariants in 45 ms returned sat
[2020-06-03 02:56:43] [INFO ] [Nat]Absence check using 19 positive and 33 generalized place invariants in 45 ms returned sat
[2020-06-03 02:56:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:56:45] [INFO ] [Nat]Absence check using state equation in 2378 ms returned sat
[2020-06-03 02:56:46] [INFO ] [Nat]Added 130 Read/Feed constraints in 253 ms returned sat
[2020-06-03 02:56:46] [INFO ] Deduced a trap composed of 46 places in 256 ms
[2020-06-03 02:56:46] [INFO ] Deduced a trap composed of 46 places in 206 ms
[2020-06-03 02:56:47] [INFO ] Deduced a trap composed of 20 places in 359 ms
[2020-06-03 02:56:47] [INFO ] Deduced a trap composed of 46 places in 162 ms
[2020-06-03 02:56:47] [INFO ] Deduced a trap composed of 46 places in 134 ms
[2020-06-03 02:56:48] [INFO ] Deduced a trap composed of 46 places in 413 ms
[2020-06-03 02:56:48] [INFO ] Deduced a trap composed of 155 places in 392 ms
[2020-06-03 02:56:49] [INFO ] Deduced a trap composed of 87 places in 401 ms
[2020-06-03 02:56:49] [INFO ] Deduced a trap composed of 47 places in 429 ms
[2020-06-03 02:56:50] [INFO ] Deduced a trap composed of 47 places in 435 ms
[2020-06-03 02:56:50] [INFO ] Deduced a trap composed of 161 places in 446 ms
[2020-06-03 02:56:51] [INFO ] Deduced a trap composed of 329 places in 432 ms
[2020-06-03 02:56:51] [INFO ] Deduced a trap composed of 47 places in 426 ms
[2020-06-03 02:56:51] [INFO ] Deduced a trap composed of 46 places in 58 ms
[2020-06-03 02:56:51] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 5727 ms
[2020-06-03 02:56:52] [INFO ] Computed and/alt/rep : 1090/20478/1070 causal constraints in 128 ms.
[2020-06-03 02:57:12] [INFO ] Added : 635 causal constraints over 127 iterations in 20529 ms.(timeout) Result :sat
[2020-06-03 02:57:12] [INFO ] Deduced a trap composed of 251 places in 405 ms
[2020-06-03 02:57:13] [INFO ] Deduced a trap composed of 46 places in 53 ms
[2020-06-03 02:57:13] [INFO ] Deduced a trap composed of 261 places in 437 ms
[2020-06-03 02:57:14] [INFO ] Deduced a trap composed of 23 places in 433 ms
[2020-06-03 02:57:17] [INFO ] Deduced a trap composed of 241 places in 422 ms
[2020-06-03 02:57:17] [INFO ] Deduced a trap composed of 278 places in 410 ms
[2020-06-03 02:57:18] [INFO ] Deduced a trap composed of 303 places in 417 ms
[2020-06-03 02:57:19] [INFO ] Deduced a trap composed of 291 places in 417 ms
[2020-06-03 02:57:19] [INFO ] Deduced a trap composed of 282 places in 405 ms
[2020-06-03 02:57:20] [INFO ] Deduced a trap composed of 278 places in 419 ms
[2020-06-03 02:57:21] [INFO ] Deduced a trap composed of 270 places in 420 ms
[2020-06-03 02:57:22] [INFO ] Deduced a trap composed of 282 places in 428 ms
[2020-06-03 02:57:23] [INFO ] Deduced a trap composed of 285 places in 428 ms
[2020-06-03 02:57:23] [INFO ] Deduced a trap composed of 251 places in 417 ms
[2020-06-03 02:57:24] [INFO ] Deduced a trap composed of 236 places in 422 ms
[2020-06-03 02:57:24] [INFO ] Deduced a trap composed of 255 places in 419 ms
[2020-06-03 02:57:25] [INFO ] Deduced a trap composed of 224 places in 418 ms
[2020-06-03 02:57:26] [INFO ] Deduced a trap composed of 303 places in 420 ms
[2020-06-03 02:57:27] [INFO ] Deduced a trap composed of 269 places in 395 ms
[2020-06-03 02:57:27] [INFO ] Deduced a trap composed of 252 places in 400 ms
[2020-06-03 02:57:28] [INFO ] Deduced a trap composed of 249 places in 414 ms
[2020-06-03 02:57:28] [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 (> (+ s7 s8 s9 s14 s17 s18 s19 s20 s22 s25 s26 s27 s29 s30 s33 s38 s42 s44 s45 s47 s49 s52 s53 s54 s55 s57 s59 s60 s66 s67 s68 s69 s71 s74 s75 s80 s86 s88 s93 s94 s97 s98 s100 s103 s105 s106 s107 s108 s109 s110 s117 s122 s127 s129 s134 s136 s138 s139 s142 s145 s148 s149 s153 s156 s157 s158 s159 s162 s164 s165 s166 s170 s174 s178 s180 s186 s188 s189 s193 s195 s197 s199 s201 s204 s206 s208 s209 s214 s215 s217 s218 s219 s222 s223 s225 s226 s227 s228 s230 s234 s236 s237 s239 s243 s246 s247 s250 s251 s253 s257 s258 s266 s267 s271 s273 s276 s277 s280 s284 s285 s286 s288 s289 s290 s292 s293 s294 s296 s297 s298 s299 s300 s302 s305 s306 s308 s309 s310 s311 s312 s315 s316 s317 s319 s320 s322 s323 s330 s331 s336 s344 s351 s352 s354 s355 s359 s360 s365 s368 s369 s375 s376 s378 s380 s381 s383 s385 s387 s389 s394 s396 s397 s399 s400 s401 s409 s413 s415 s417 s419 s421 s423 s424 s427 s432 s434 s436 s439 s444 s445 s446 s447 s450 s451 s453 s455 s456 s461 s462 s467 s468 s469 s470 s472 s474 s475 s476 s480 s482 s488 s489 s490 s491 s494 s495 s501 s502 s503 s505 s507 s508 s509 s511 s514 s518 s521 s523 s524 s527 s528 s529 s532 s533 s534 s537 s538 s540 s541 s542 s543 s544 s547 s549 s550 s551 s554 s555 s556 s557) 0)") while checking expression at index 3
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-05 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 632500 steps, including 1000 resets, run finished after 3824 ms. (steps per millisecond=165 ) properties seen :[0, 0] could not realise parikh vector
Support contains 92 out of 558 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 558/558 places, 1092/1092 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 558 transition count 1082
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 548 transition count 1082
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 60 place count 528 transition count 1062
Applied a total of 60 rules in 50 ms. Remains 528 /558 variables (removed 30) and now considering 1062/1092 (removed 30) transitions.
Finished structural reductions, in 1 iterations. Remains : 528/558 places, 1062/1092 transitions.
Incomplete random walk after 1000000 steps, including 304 resets, run finished after 4715 ms. (steps per millisecond=212 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 245 resets, run finished after 3270 ms. (steps per millisecond=305 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 314 resets, run finished after 2637 ms. (steps per millisecond=379 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 2128658 steps, run timeout after 30001 ms. (steps per millisecond=70 ) properties seen :[0, 0]
Probabilistic random walk after 2128658 steps, saw 626281 distinct states, run finished after 30001 ms. (steps per millisecond=70 ) properties seen :[0, 0]
[2020-06-03 02:58:13] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-03 02:58:13] [INFO ] Computed 52 place invariants in 33 ms
[2020-06-03 02:58:13] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-06-03 02:58:13] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 49 ms returned sat
[2020-06-03 02:58:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:58:17] [INFO ] [Real]Absence check using state equation in 4127 ms returned sat
[2020-06-03 02:58:17] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-03 02:58:17] [INFO ] [Real]Added 130 Read/Feed constraints in 21 ms returned sat
[2020-06-03 02:58:17] [INFO ] Deduced a trap composed of 43 places in 68 ms
[2020-06-03 02:58:17] [INFO ] Deduced a trap composed of 43 places in 34 ms
[2020-06-03 02:58:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 172 ms
[2020-06-03 02:58:17] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:58:17] [INFO ] [Nat]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-06-03 02:58:17] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 50 ms returned sat
[2020-06-03 02:58:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:58:21] [INFO ] [Nat]Absence check using state equation in 3413 ms returned sat
[2020-06-03 02:58:21] [INFO ] [Nat]Added 130 Read/Feed constraints in 365 ms returned sat
[2020-06-03 02:58:21] [INFO ] Deduced a trap composed of 265 places in 294 ms
[2020-06-03 02:58:22] [INFO ] Deduced a trap composed of 43 places in 278 ms
[2020-06-03 02:58:22] [INFO ] Deduced a trap composed of 43 places in 377 ms
[2020-06-03 02:58:22] [INFO ] Deduced a trap composed of 240 places in 284 ms
[2020-06-03 02:58:23] [INFO ] Deduced a trap composed of 237 places in 405 ms
[2020-06-03 02:58:23] [INFO ] Deduced a trap composed of 210 places in 290 ms
[2020-06-03 02:58:24] [INFO ] Deduced a trap composed of 44 places in 328 ms
[2020-06-03 02:58:24] [INFO ] Deduced a trap composed of 233 places in 367 ms
[2020-06-03 02:58:24] [INFO ] Deduced a trap composed of 44 places in 29 ms
[2020-06-03 02:58:24] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3011 ms
[2020-06-03 02:58:24] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 126 ms.
[2020-06-03 02:58:45] [INFO ] Added : 545 causal constraints over 109 iterations in 20519 ms.(timeout) Result :sat
[2020-06-03 02:58:45] [INFO ] Deduced a trap composed of 43 places in 368 ms
[2020-06-03 02:58:45] [INFO ] Deduced a trap composed of 163 places in 287 ms
[2020-06-03 02:58:46] [INFO ] Deduced a trap composed of 43 places in 369 ms
[2020-06-03 02:58:47] [INFO ] Deduced a trap composed of 104 places in 407 ms
[2020-06-03 02:58:50] [INFO ] Deduced a trap composed of 130 places in 314 ms
[2020-06-03 02:58:50] [INFO ] Deduced a trap composed of 43 places in 312 ms
[2020-06-03 02:58:51] [INFO ] Deduced a trap composed of 153 places in 295 ms
[2020-06-03 02:58:51] [INFO ] Deduced a trap composed of 44 places in 281 ms
[2020-06-03 02:58:52] [INFO ] Deduced a trap composed of 151 places in 308 ms
[2020-06-03 02:58:54] [INFO ] Deduced a trap composed of 257 places in 340 ms
[2020-06-03 02:58:54] [INFO ] Deduced a trap composed of 40 places in 397 ms
[2020-06-03 02:58:55] [INFO ] Deduced a trap composed of 241 places in 377 ms
[2020-06-03 02:58:56] [INFO ] Deduced a trap composed of 134 places in 313 ms
[2020-06-03 02:58:56] [INFO ] Deduced a trap composed of 134 places in 388 ms
[2020-06-03 02:58:57] [INFO ] Deduced a trap composed of 243 places in 385 ms
[2020-06-03 02:58:58] [INFO ] Deduced a trap composed of 209 places in 398 ms
[2020-06-03 02:59:01] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 02:59:03] [INFO ] Deduced a trap composed of 2 places in 401 ms
[2020-06-03 02:59: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 (> (+ s82 s175) 0)") while checking expression at index 0
[2020-06-03 02:59:03] [INFO ] [Real]Absence check using 14 positive place invariants in 13 ms returned sat
[2020-06-03 02:59:03] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 34 ms returned sat
[2020-06-03 02:59:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 02:59:05] [INFO ] [Real]Absence check using state equation in 2532 ms returned sat
[2020-06-03 02:59:05] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 02:59:05] [INFO ] [Nat]Absence check using 14 positive place invariants in 26 ms returned sat
[2020-06-03 02:59:05] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 51 ms returned sat
[2020-06-03 02:59:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 02:59:08] [INFO ] [Nat]Absence check using state equation in 2345 ms returned sat
[2020-06-03 02:59:08] [INFO ] [Nat]Added 130 Read/Feed constraints in 167 ms returned sat
[2020-06-03 02:59:08] [INFO ] Deduced a trap composed of 44 places in 136 ms
[2020-06-03 02:59:09] [INFO ] Deduced a trap composed of 43 places in 409 ms
[2020-06-03 02:59:09] [INFO ] Deduced a trap composed of 244 places in 429 ms
[2020-06-03 02:59:09] [INFO ] Deduced a trap composed of 55 places in 377 ms
[2020-06-03 02:59:10] [INFO ] Deduced a trap composed of 209 places in 406 ms
[2020-06-03 02:59:10] [INFO ] Deduced a trap composed of 64 places in 296 ms
[2020-06-03 02:59:11] [INFO ] Deduced a trap composed of 43 places in 401 ms
[2020-06-03 02:59:11] [INFO ] Deduced a trap composed of 281 places in 408 ms
[2020-06-03 02:59:12] [INFO ] Deduced a trap composed of 159 places in 410 ms
[2020-06-03 02:59:12] [INFO ] Deduced a trap composed of 43 places in 369 ms
[2020-06-03 02:59:13] [INFO ] Deduced a trap composed of 77 places in 393 ms
[2020-06-03 02:59:13] [INFO ] Deduced a trap composed of 44 places in 378 ms
[2020-06-03 02:59:14] [INFO ] Deduced a trap composed of 172 places in 352 ms
[2020-06-03 02:59:14] [INFO ] Deduced a trap composed of 251 places in 402 ms
[2020-06-03 02:59:15] [INFO ] Deduced a trap composed of 120 places in 417 ms
[2020-06-03 02:59:15] [INFO ] Deduced a trap composed of 249 places in 414 ms
[2020-06-03 02:59:16] [INFO ] Deduced a trap composed of 140 places in 385 ms
[2020-06-03 02:59:16] [INFO ] Deduced a trap composed of 293 places in 409 ms
[2020-06-03 02:59:17] [INFO ] Deduced a trap composed of 248 places in 402 ms
[2020-06-03 02:59:17] [INFO ] Deduced a trap composed of 269 places in 377 ms
[2020-06-03 02:59:18] [INFO ] Deduced a trap composed of 43 places in 398 ms
[2020-06-03 02:59:18] [INFO ] Deduced a trap composed of 128 places in 400 ms
[2020-06-03 02:59:19] [INFO ] Deduced a trap composed of 152 places in 381 ms
[2020-06-03 02:59:19] [INFO ] Deduced a trap composed of 256 places in 398 ms
[2020-06-03 02:59:20] [INFO ] Deduced a trap composed of 163 places in 374 ms
[2020-06-03 02:59:20] [INFO ] Deduced a trap composed of 64 places in 381 ms
[2020-06-03 02:59:21] [INFO ] Deduced a trap composed of 129 places in 409 ms
[2020-06-03 02:59:21] [INFO ] Deduced a trap composed of 162 places in 399 ms
[2020-06-03 02:59:22] [INFO ] Deduced a trap composed of 64 places in 441 ms
[2020-06-03 02:59:22] [INFO ] Deduced a trap composed of 149 places in 402 ms
[2020-06-03 02:59:22] [INFO ] Deduced a trap composed of 133 places in 367 ms
[2020-06-03 02:59:23] [INFO ] Deduced a trap composed of 77 places in 302 ms
[2020-06-03 02:59:23] [INFO ] Deduced a trap composed of 113 places in 303 ms
[2020-06-03 02:59:24] [INFO ] Deduced a trap composed of 110 places in 385 ms
[2020-06-03 02:59:24] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 15792 ms
[2020-06-03 02:59:24] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 81 ms.
[2020-06-03 02:59:44] [INFO ] Added : 600 causal constraints over 120 iterations in 20263 ms.(timeout) Result :sat
[2020-06-03 02:59:44] [INFO ] Deduced a trap composed of 43 places in 102 ms
[2020-06-03 02:59:44] [INFO ] Deduced a trap composed of 44 places in 78 ms
[2020-06-03 02:59:45] [INFO ] Deduced a trap composed of 43 places in 50 ms
[2020-06-03 02:59:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 854 ms
Attempting to minimize the solution found.
Minimization took 152 ms.
Incomplete Parikh walk after 923900 steps, including 1000 resets, run finished after 5589 ms. (steps per millisecond=165 ) properties seen :[0, 0] could not realise parikh vector
Support contains 92 out of 528 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 528/528 places, 1062/1062 transitions.
Applied a total of 0 rules in 22 ms. Remains 528 /528 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 528/528 places, 1062/1062 transitions.
Starting structural reductions, iteration 0 : 528/528 places, 1062/1062 transitions.
Applied a total of 0 rules in 21 ms. Remains 528 /528 variables (removed 0) and now considering 1062/1062 (removed 0) transitions.
[2020-06-03 02:59:51] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-03 02:59:51] [INFO ] Computed 52 place invariants in 14 ms
[2020-06-03 02:59:52] [INFO ] Implicit Places using invariants in 1168 ms returned []
[2020-06-03 02:59:52] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-03 02:59:52] [INFO ] Computed 52 place invariants in 13 ms
[2020-06-03 02:59:53] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-03 03:00:01] [INFO ] Implicit Places using invariants and state equation in 9385 ms returned []
Implicit Place search using SMT with State Equation took 10554 ms to find 0 implicit places.
[2020-06-03 03:00:01] [INFO ] Redundant transitions in 69 ms returned []
[2020-06-03 03:00:01] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-03 03:00:01] [INFO ] Computed 52 place invariants in 14 ms
[2020-06-03 03:00:04] [INFO ] Dead Transitions using invariants and state equation in 2445 ms returned []
Finished structural reductions, in 1 iterations. Remains : 528/528 places, 1062/1062 transitions.
Incomplete random walk after 100000 steps, including 27 resets, run finished after 619 ms. (steps per millisecond=161 ) properties seen :[0, 0]
[2020-06-03 03:00:04] [INFO ] Flow matrix only has 1042 transitions (discarded 20 similar events)
// Phase 1: matrix 1042 rows 528 cols
[2020-06-03 03:00:04] [INFO ] Computed 52 place invariants in 12 ms
[2020-06-03 03:00:05] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-06-03 03:00:05] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 55 ms returned sat
[2020-06-03 03:00:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:00:08] [INFO ] [Real]Absence check using state equation in 3891 ms returned sat
[2020-06-03 03:00:09] [INFO ] State equation strengthened by 130 read => feed constraints.
[2020-06-03 03:00:09] [INFO ] [Real]Added 130 Read/Feed constraints in 25 ms returned sat
[2020-06-03 03:00:09] [INFO ] Deduced a trap composed of 43 places in 78 ms
[2020-06-03 03:00:09] [INFO ] Deduced a trap composed of 43 places in 50 ms
[2020-06-03 03:00:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 240 ms
[2020-06-03 03:00:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:00:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-06-03 03:00:09] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 48 ms returned sat
[2020-06-03 03:00:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:00:12] [INFO ] [Nat]Absence check using state equation in 3382 ms returned sat
[2020-06-03 03:00:13] [INFO ] [Nat]Added 130 Read/Feed constraints in 397 ms returned sat
[2020-06-03 03:00:13] [INFO ] Deduced a trap composed of 265 places in 292 ms
[2020-06-03 03:00:13] [INFO ] Deduced a trap composed of 43 places in 394 ms
[2020-06-03 03:00:14] [INFO ] Deduced a trap composed of 43 places in 411 ms
[2020-06-03 03:00:14] [INFO ] Deduced a trap composed of 240 places in 405 ms
[2020-06-03 03:00:15] [INFO ] Deduced a trap composed of 237 places in 408 ms
[2020-06-03 03:00:15] [INFO ] Deduced a trap composed of 210 places in 397 ms
[2020-06-03 03:00:16] [INFO ] Deduced a trap composed of 44 places in 483 ms
[2020-06-03 03:00:16] [INFO ] Deduced a trap composed of 233 places in 384 ms
[2020-06-03 03:00:16] [INFO ] Deduced a trap composed of 44 places in 60 ms
[2020-06-03 03:00:16] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 3679 ms
[2020-06-03 03:00:17] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 104 ms.
[2020-06-03 03:00:29] [INFO ] Added : 330 causal constraints over 66 iterations in 12423 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 03:00:29] [INFO ] [Real]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-06-03 03:00:29] [INFO ] [Real]Absence check using 14 positive and 38 generalized place invariants in 48 ms returned sat
[2020-06-03 03:00:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:00:32] [INFO ] [Real]Absence check using state equation in 2641 ms returned sat
[2020-06-03 03:00:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:00:32] [INFO ] [Nat]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-06-03 03:00:32] [INFO ] [Nat]Absence check using 14 positive and 38 generalized place invariants in 47 ms returned sat
[2020-06-03 03:00:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:00:34] [INFO ] [Nat]Absence check using state equation in 2290 ms returned sat
[2020-06-03 03:00:34] [INFO ] [Nat]Added 130 Read/Feed constraints in 164 ms returned sat
[2020-06-03 03:00:34] [INFO ] Deduced a trap composed of 44 places in 141 ms
[2020-06-03 03:00:35] [INFO ] Deduced a trap composed of 43 places in 384 ms
[2020-06-03 03:00:35] [INFO ] Deduced a trap composed of 244 places in 368 ms
[2020-06-03 03:00:36] [INFO ] Deduced a trap composed of 55 places in 348 ms
[2020-06-03 03:00:36] [INFO ] Deduced a trap composed of 209 places in 427 ms
[2020-06-03 03:00:37] [INFO ] Deduced a trap composed of 64 places in 382 ms
[2020-06-03 03:00:37] [INFO ] Deduced a trap composed of 43 places in 408 ms
[2020-06-03 03:00:38] [INFO ] Deduced a trap composed of 281 places in 463 ms
[2020-06-03 03:00:38] [INFO ] Deduced a trap composed of 159 places in 412 ms
[2020-06-03 03:00:38] [INFO ] Deduced a trap composed of 43 places in 371 ms
[2020-06-03 03:00:39] [INFO ] Deduced a trap composed of 77 places in 407 ms
[2020-06-03 03:00:39] [INFO ] Deduced a trap composed of 44 places in 371 ms
[2020-06-03 03:00:40] [INFO ] Deduced a trap composed of 172 places in 384 ms
[2020-06-03 03:00:40] [INFO ] Deduced a trap composed of 251 places in 367 ms
[2020-06-03 03:00:41] [INFO ] Deduced a trap composed of 120 places in 394 ms
[2020-06-03 03:00:41] [INFO ] Deduced a trap composed of 249 places in 399 ms
[2020-06-03 03:00:42] [INFO ] Deduced a trap composed of 140 places in 376 ms
[2020-06-03 03:00:42] [INFO ] Deduced a trap composed of 293 places in 417 ms
[2020-06-03 03:00:43] [INFO ] Deduced a trap composed of 248 places in 410 ms
[2020-06-03 03:00:43] [INFO ] Deduced a trap composed of 269 places in 399 ms
[2020-06-03 03:00:44] [INFO ] Deduced a trap composed of 43 places in 398 ms
[2020-06-03 03:00:44] [INFO ] Deduced a trap composed of 128 places in 372 ms
[2020-06-03 03:00:44] [INFO ] Deduced a trap composed of 152 places in 350 ms
[2020-06-03 03:00:45] [INFO ] Deduced a trap composed of 256 places in 397 ms
[2020-06-03 03:00:45] [INFO ] Deduced a trap composed of 163 places in 400 ms
[2020-06-03 03:00:46] [INFO ] Deduced a trap composed of 64 places in 409 ms
[2020-06-03 03:00:46] [INFO ] Deduced a trap composed of 129 places in 390 ms
[2020-06-03 03:00:47] [INFO ] Deduced a trap composed of 162 places in 421 ms
[2020-06-03 03:00:48] [INFO ] Deduced a trap composed of 64 places in 423 ms
[2020-06-03 03:00:48] [INFO ] Deduced a trap composed of 149 places in 404 ms
[2020-06-03 03:00:49] [INFO ] Deduced a trap composed of 133 places in 346 ms
[2020-06-03 03:00:49] [INFO ] Deduced a trap composed of 77 places in 393 ms
[2020-06-03 03:00:49] [INFO ] Deduced a trap composed of 113 places in 413 ms
[2020-06-03 03:00:50] [INFO ] Deduced a trap composed of 110 places in 300 ms
[2020-06-03 03:00:50] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 15639 ms
[2020-06-03 03:00:50] [INFO ] Computed and/alt/rep : 1060/20488/1040 causal constraints in 189 ms.
[2020-06-03 03:00:52] [INFO ] Added : 65 causal constraints over 13 iterations in 1785 ms. Result :(error "Failed to check-sat")
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 528 transition count 1042
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 518 transition count 1082
Free-agglomeration rule applied 10 times.
Iterating global reduction 1 with 10 rules applied. Total rules applied 50 place count 518 transition count 1072
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 60 place count 508 transition count 1072
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 508 transition count 1060
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 84 place count 496 transition count 1060
Drop transitions removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 3 with 40 rules applied. Total rules applied 124 place count 496 transition count 1020
Applied a total of 124 rules in 129 ms. Remains 496 /528 variables (removed 32) and now considering 1020/1062 (removed 42) transitions.
// Phase 1: matrix 1020 rows 496 cols
[2020-06-03 03:00:52] [INFO ] Computed 52 place invariants in 17 ms
[2020-06-03 03:00:52] [INFO ] [Real]Absence check using 17 positive place invariants in 32 ms returned sat
[2020-06-03 03:00:52] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 35 ms returned sat
[2020-06-03 03:00:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:00:53] [INFO ] [Real]Absence check using state equation in 1234 ms returned sat
[2020-06-03 03:00:53] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:00:54] [INFO ] [Nat]Absence check using 17 positive place invariants in 63 ms returned sat
[2020-06-03 03:00:54] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 66 ms returned sat
[2020-06-03 03:00:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:00:56] [INFO ] [Nat]Absence check using state equation in 2875 ms returned sat
[2020-06-03 03:00:57] [INFO ] Deduced a trap composed of 232 places in 394 ms
[2020-06-03 03:00:57] [INFO ] Deduced a trap composed of 40 places in 317 ms
[2020-06-03 03:00:58] [INFO ] Deduced a trap composed of 41 places in 338 ms
[2020-06-03 03:00:58] [INFO ] Deduced a trap composed of 40 places in 388 ms
[2020-06-03 03:00:59] [INFO ] Deduced a trap composed of 198 places in 383 ms
[2020-06-03 03:00:59] [INFO ] Deduced a trap composed of 195 places in 373 ms
[2020-06-03 03:01:00] [INFO ] Deduced a trap composed of 205 places in 396 ms
[2020-06-03 03:01:00] [INFO ] Deduced a trap composed of 217 places in 374 ms
[2020-06-03 03:01:01] [INFO ] Deduced a trap composed of 205 places in 382 ms
[2020-06-03 03:01:01] [INFO ] Deduced a trap composed of 199 places in 437 ms
[2020-06-03 03:01:02] [INFO ] Deduced a trap composed of 272 places in 392 ms
[2020-06-03 03:01:02] [INFO ] Deduced a trap composed of 190 places in 377 ms
[2020-06-03 03:01:02] [INFO ] Deduced a trap composed of 207 places in 395 ms
[2020-06-03 03:01:03] [INFO ] Deduced a trap composed of 198 places in 383 ms
[2020-06-03 03:01:03] [INFO ] Deduced a trap composed of 252 places in 355 ms
[2020-06-03 03:01:04] [INFO ] Deduced a trap composed of 40 places in 356 ms
[2020-06-03 03:01:04] [INFO ] Deduced a trap composed of 40 places in 360 ms
[2020-06-03 03:01:05] [INFO ] Deduced a trap composed of 251 places in 391 ms
[2020-06-03 03:01:05] [INFO ] Deduced a trap composed of 206 places in 405 ms
[2020-06-03 03:01:06] [INFO ] Deduced a trap composed of 188 places in 388 ms
[2020-06-03 03:01:06] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 9182 ms
[2020-06-03 03:01:06] [INFO ] Computed and/alt/rep : 1019/18799/1019 causal constraints in 108 ms.
[2020-06-03 03:01:26] [INFO ] Added : 600 causal constraints over 120 iterations in 20394 ms.(timeout) Result :sat
[2020-06-03 03:01:26] [INFO ] Deduced a trap composed of 42 places in 379 ms
[2020-06-03 03:01:27] [INFO ] Deduced a trap composed of 169 places in 390 ms
[2020-06-03 03:01:27] [INFO ] Deduced a trap composed of 41 places in 109 ms
[2020-06-03 03:01:28] [INFO ] Deduced a trap composed of 41 places in 106 ms
[2020-06-03 03:01:28] [INFO ] Deduced a trap composed of 40 places in 88 ms
[2020-06-03 03:01:28] [INFO ] Deduced a trap composed of 41 places in 54 ms
[2020-06-03 03:01:28] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2373 ms
Attempting to minimize the solution found.
Minimization took 164 ms.
[2020-06-03 03:01:29] [INFO ] [Real]Absence check using 17 positive place invariants in 37 ms returned sat
[2020-06-03 03:01:29] [INFO ] [Real]Absence check using 17 positive and 35 generalized place invariants in 36 ms returned sat
[2020-06-03 03:01:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 03:01:32] [INFO ] [Real]Absence check using state equation in 3278 ms returned sat
[2020-06-03 03:01:32] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 03:01:32] [INFO ] [Nat]Absence check using 17 positive place invariants in 38 ms returned sat
[2020-06-03 03:01:32] [INFO ] [Nat]Absence check using 17 positive and 35 generalized place invariants in 51 ms returned sat
[2020-06-03 03:01:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 03:01:34] [INFO ] [Nat]Absence check using state equation in 2156 ms returned sat
[2020-06-03 03:01:35] [INFO ] Computed and/alt/rep : 1019/18799/1019 causal constraints in 74 ms.
[2020-06-03 03:01:55] [INFO ] Added : 630 causal constraints over 126 iterations in 20275 ms.(timeout) Result :sat
[2020-06-03 03:01:55] [INFO ] Deduced a trap composed of 40 places in 391 ms
[2020-06-03 03:01:56] [INFO ] Deduced a trap composed of 41 places in 382 ms
[2020-06-03 03:01:56] [INFO ] Deduced a trap composed of 41 places in 376 ms
[2020-06-03 03:01:57] [INFO ] Deduced a trap composed of 40 places in 376 ms
[2020-06-03 03:01:58] [INFO ] Deduced a trap composed of 40 places in 376 ms
[2020-06-03 03:01:58] [INFO ] Deduced a trap composed of 40 places in 424 ms
[2020-06-03 03:01:59] [INFO ] Deduced a trap composed of 40 places in 384 ms
[2020-06-03 03:01:59] [INFO ] Deduced a trap composed of 246 places in 366 ms
[2020-06-03 03:02:00] [INFO ] Deduced a trap composed of 247 places in 383 ms
[2020-06-03 03:02:00] [INFO ] Deduced a trap composed of 234 places in 374 ms
[2020-06-03 03:02:01] [INFO ] Deduced a trap composed of 267 places in 381 ms
[2020-06-03 03:02:02] [INFO ] Deduced a trap composed of 199 places in 377 ms
[2020-06-03 03:02:03] [INFO ] Deduced a trap composed of 198 places in 371 ms
[2020-06-03 03:02:03] [INFO ] Deduced a trap composed of 128 places in 372 ms
[2020-06-03 03:02:04] [INFO ] Deduced a trap composed of 125 places in 367 ms
[2020-06-03 03:02:05] [INFO ] Deduced a trap composed of 227 places in 357 ms
[2020-06-03 03:02:06] [INFO ] Deduced a trap composed of 218 places in 398 ms
[2020-06-03 03:02:06] [INFO ] Deduced a trap composed of 209 places in 369 ms
[2020-06-03 03:02:07] [INFO ] Deduced a trap composed of 235 places in 361 ms
[2020-06-03 03:02:07] [INFO ] Deduced a trap composed of 250 places in 405 ms
[2020-06-03 03:02:08] [INFO ] Deduced a trap composed of 133 places in 431 ms
[2020-06-03 03:02:09] [INFO ] Deduced a trap composed of 152 places in 357 ms
[2020-06-03 03:02:09] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 14619 ms
Attempting to minimize the solution found.
Minimization took 111 ms.
[2020-06-03 03:02:10] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2020-06-03 03:02:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 21 ms.
[2020-06-03 03:02:10] [INFO ] Flatten gal took : 114 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ PolyORBLF-PT-S02J04T10 @ 3570 seconds
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J04T10-ReachabilityCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3285
rslt: Output for ReachabilityCardinality @ PolyORBLF-PT-S02J04T10
{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 03:02:10 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1779
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 10,
"visible_transitions": 0
},
"processed": "E (F (((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= 1))))",
"processed_size": 81,
"rewrites": 1
},
"result":
{
"edges": 11565012,
"markings": 8835195,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "reachability",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3285
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 2,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 81,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 81,
"visible_transitions": 0
},
"processed": "E (F ((((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= p116 + p118 + p157 + p168 + p173 + p187 + p257 + p280 + p284 + p315 + p367 + p396 + p421 + p71 + p456 + p467 + p482 + p492 + p57 + p503) AND (p124 + p136 + p139 + p170 + p185 + p233 + p277 + p303 + p334 + p352 + p376 + p378 + p413 + p425 + p479 + p55 + p525 + p32 + p47 + p70 <= p174 + p235 + p263 + p306 + p83 + p345 + p372 + p462 + p470 + p513)) OR ((p502 + 1 <= p109 + p149 + p179 + p202 + p278 + p361 + p61 + p468 + p36 + p49) AND (1 <= p119 + p147 + p200 + p236 + p267 + p354 + p401 + p412 + p489 + p48)))))",
"processed_size": 590,
"rewrites": 1
},
"result":
{
"edges": 314,
"markings": 315,
"produced_by": "state space",
"value": true
},
"task":
{
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"error": null,
"memory": 28800,
"runtime": 285.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "E(F(**)) : E(F(**))"
},
"net":
{
"arcs": 5150,
"conflict_clusters": 81,
"places": 528,
"places_significant": 476,
"singleton_clusters": 0,
"transitions": 1062
},
"result":
{
"preliminary_value": "yes yes ",
"value": "yes yes "
},
"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: 1590/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 16896
lola: finding significant places
lola: 528 places, 1062 transitions, 476 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (3 <= p457)
lola: E (F ((((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= p116 + p118 + p157 + p168 + p173 + p187 + p257 + p280 + p284 + p315 + p367 + p396 + p421 + p71 + p456 + p467 + p482 + p492 + p57 + p503) AND (p124 + p136 + p139 + p170 + p185 + p233 + p277 + p303 + p334 + p352 + p376 + p378 + p413 + p425 + p479 + p55 + p525 + p32 + p47 + p70 <= p174 + p235 + p263 + p306 + p83 + p345 + p372 + p462 + p470 + p513)) OR ((p502 + 1 <= p109 + p149 + p179 + p202 + p278 + p361 + p61 + p468 + p36 + p49) AND (1 <= p119 + p147 + p200 + p236 + p267 + p354 + p401 + p412 + p489 + p48))))) : E (F (((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= 1))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= 1))))
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 (((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= 1))))
lola: processed formula length: 81
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: ((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= 1))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityCardinality-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 162572 markings, 176543 edges, 32514 markings/sec, 0 secs
lola: sara is running 5 secs || 332715 markings, 374102 edges, 34029 markings/sec, 5 secs
lola: sara is running 10 secs || 502141 markings, 575712 edges, 33885 markings/sec, 10 secs
lola: sara is running 15 secs || 660728 markings, 769108 edges, 31717 markings/sec, 15 secs
lola: sara is running 20 secs || 817535 markings, 964697 edges, 31361 markings/sec, 20 secs
lola: sara is running 25 secs || 984648 markings, 1173669 edges, 33423 markings/sec, 25 secs
lola: sara is running 30 secs || 1151366 markings, 1382681 edges, 33344 markings/sec, 30 secs
lola: sara is running 35 secs || 1318334 markings, 1590751 edges, 33394 markings/sec, 35 secs
lola: sara is running 40 secs || 1484803 markings, 1801029 edges, 33294 markings/sec, 40 secs
lola: sara is running 45 secs || 1650965 markings, 2011349 edges, 33232 markings/sec, 45 secs
lola: sara is running 50 secs || 1806397 markings, 2211256 edges, 31086 markings/sec, 50 secs
lola: sara is running 55 secs || 1971075 markings, 2424220 edges, 32936 markings/sec, 55 secs
lola: sara is running 60 secs || 2135688 markings, 2636294 edges, 32923 markings/sec, 60 secs
lola: sara is running 65 secs || 2299560 markings, 2849455 edges, 32774 markings/sec, 65 secs
lola: sara is running 70 secs || 2463225 markings, 3061881 edges, 32733 markings/sec, 70 secs
lola: sara is running 75 secs || 2627151 markings, 3276014 edges, 32785 markings/sec, 75 secs
lola: sara is running 80 secs || 2791448 markings, 3490797 edges, 32859 markings/sec, 80 secs
lola: sara is running 85 secs || 2955918 markings, 3704289 edges, 32894 markings/sec, 85 secs
lola: sara is running 90 secs || 3118077 markings, 3915772 edges, 32432 markings/sec, 90 secs
lola: sara is running 95 secs || 3263856 markings, 4108316 edges, 29156 markings/sec, 95 secs
lola: sara is running 100 secs || 3426563 markings, 4321772 edges, 32541 markings/sec, 100 secs
lola: sara is running 105 secs || 3589166 markings, 4536239 edges, 32521 markings/sec, 105 secs
lola: sara is running 110 secs || 3751247 markings, 4750004 edges, 32416 markings/sec, 110 secs
lola: sara is running 115 secs || 3913531 markings, 4964217 edges, 32457 markings/sec, 115 secs
lola: sara is running 120 secs || 4060289 markings, 5158726 edges, 29352 markings/sec, 120 secs
lola: sara is running 125 secs || 4210539 markings, 5356226 edges, 30050 markings/sec, 125 secs
lola: sara is running 130 secs || 4366386 markings, 5562753 edges, 31169 markings/sec, 130 secs
lola: sara is running 135 secs || 4528378 markings, 5778296 edges, 32398 markings/sec, 135 secs
lola: sara is running 140 secs || 4689905 markings, 5994234 edges, 32305 markings/sec, 140 secs
lola: sara is running 145 secs || 4851704 markings, 6211066 edges, 32360 markings/sec, 145 secs
lola: sara is running 150 secs || 5013281 markings, 6426894 edges, 32315 markings/sec, 150 secs
lola: sara is running 155 secs || 5175157 markings, 6642095 edges, 32375 markings/sec, 155 secs
lola: sara is running 160 secs || 5336783 markings, 6857194 edges, 32325 markings/sec, 160 secs
lola: sara is running 165 secs || 5498328 markings, 7074061 edges, 32309 markings/sec, 165 secs
lola: sara is running 170 secs || 5659966 markings, 7288927 edges, 32328 markings/sec, 170 secs
lola: sara is running 175 secs || 5821893 markings, 7504437 edges, 32385 markings/sec, 175 secs
lola: sara is running 180 secs || 5984798 markings, 7720261 edges, 32581 markings/sec, 180 secs
lola: sara is running 185 secs || 6147103 markings, 7938125 edges, 32461 markings/sec, 185 secs
lola: sara is running 190 secs || 6309261 markings, 8154405 edges, 32432 markings/sec, 190 secs
lola: sara is running 195 secs || 6471185 markings, 8372968 edges, 32385 markings/sec, 195 secs
lola: sara is running 200 secs || 6633138 markings, 8591328 edges, 32391 markings/sec, 200 secs
lola: sara is running 205 secs || 6795488 markings, 8810317 edges, 32470 markings/sec, 205 secs
lola: sara is running 210 secs || 6957453 markings, 9030175 edges, 32393 markings/sec, 210 secs
lola: sara is running 215 secs || 7120455 markings, 9247439 edges, 32600 markings/sec, 215 secs
lola: sara is running 220 secs || 7281825 markings, 9464658 edges, 32274 markings/sec, 220 secs
lola: sara is running 225 secs || 7445498 markings, 9685090 edges, 32735 markings/sec, 225 secs
lola: sara is running 230 secs || 7609381 markings, 9906055 edges, 32777 markings/sec, 230 secs
lola: sara is running 235 secs || 7773274 markings, 10127769 edges, 32779 markings/sec, 235 secs
lola: sara is running 240 secs || 7937022 markings, 10349627 edges, 32750 markings/sec, 240 secs
lola: sara is running 245 secs || 8089217 markings, 10554755 edges, 30439 markings/sec, 245 secs
lola: sara is running 250 secs || 8250098 markings, 10773350 edges, 32176 markings/sec, 250 secs
lola: sara is running 255 secs || 8411199 markings, 10990669 edges, 32220 markings/sec, 255 secs
lola: sara is running 260 secs || 8572021 markings, 11209900 edges, 32164 markings/sec, 260 secs
lola: sara is running 265 secs || 8733147 markings, 11427042 edges, 32225 markings/sec, 265 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 8835195 markings, 11565012 edges
lola: ========================================
lola: subprocess 1 will run for 3285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= p116 + p118 + p157 + p168 + p173 + p187 + p257 + p280 + p284 + p315 + p367 + p396 + p421 + p71 + p456 + p467 + p482 + p492 + p57 + p503) AND (p124 + p136 + p139 + p170 + p185 + p233 + p277 + p303 + p334 + p352 + p376 + p378 + p413 + p425 + p479 + p55 + p525 + p32 + p47 + p70 <= p174 + p235 + p263 + p306 + p83 + p345 + p37... (shortened)
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 ((((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= p116 + p118 + p157 + p168 + p173 + p187 + p257 + p280 + p284 + p315 + p367 + p396 + p421 + p71 + p456 + p467 + p482 + p492 + p57 + p503) AND (p124 + p136 + p139 + p170 + p185 + p233 + p277 + p303 + p334 + p352 + p376 + p378 + p413 + p425 + p479 + p55 + p525 + p32 + p47 + p70 <= p174 + p235 + p263 + p306 + p83 + p345 + p37... (shortened)
lola: processed formula length: 590
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.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: (((p3 + p134 + p193 + p304 + p368 + p403 + p473 + p69 + p410 + p274 <= p116 + p118 + p157 + p168 + p173 + p187 + p257 + p280 + p284 + p315 + p367 + p396 + p421 + p71 + p456 + p467 + p482 + p492 + p57 + p503) AND (p124 + p136 + p139 + p170 + p185 + p233 + p277 + p303 + p334 + p352 + p376 + p378 + p413 + p425 + p479 + p55 + p525 + p32 + p47 + p70 <= p174 + p235 + p263 + p306 + p83 + p345 + p372 + p462 + p470 + p513)) OR ((p502 + 1 <= p109 + p149 + p179 + p202 + p278 + p361 + p61 + p468 + p36 + p49) AND (1 <= p119 + p147 + p200 + p236 + p267 + p354 + p401 + p412 + p489 + p48)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 315 markings, 314 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes
lola:
preliminary result: yes yes
lola: memory consumption: 28800 KB
lola: time consumption: 285 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.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="PolyORBLF-PT-S02J04T10"
export BK_EXAMINATION="ReachabilityCardinality"
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 PolyORBLF-PT-S02J04T10, 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 r176-tajo-158987871900430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J04T10.tgz
mv PolyORBLF-PT-S02J04T10 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 '
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 ;