fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r007-tall-162037989500077
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for ASLink-PT-05a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16247.388 3600000.00 3305011.00 220990.10 1 ? 1 1 1 1 1 ? 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r007-tall-162037989500077.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is ASLink-PT-05a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-tall-162037989500077
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 880K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.2K Mar 28 15:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 15:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 01:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 23 01:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 22 09:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 09:36 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 516K May 5 16:51 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-05a-UpperBounds-00
FORMULA_NAME ASLink-PT-05a-UpperBounds-01
FORMULA_NAME ASLink-PT-05a-UpperBounds-02
FORMULA_NAME ASLink-PT-05a-UpperBounds-03
FORMULA_NAME ASLink-PT-05a-UpperBounds-04
FORMULA_NAME ASLink-PT-05a-UpperBounds-05
FORMULA_NAME ASLink-PT-05a-UpperBounds-06
FORMULA_NAME ASLink-PT-05a-UpperBounds-07
FORMULA_NAME ASLink-PT-05a-UpperBounds-08
FORMULA_NAME ASLink-PT-05a-UpperBounds-09
FORMULA_NAME ASLink-PT-05a-UpperBounds-10
FORMULA_NAME ASLink-PT-05a-UpperBounds-11
FORMULA_NAME ASLink-PT-05a-UpperBounds-12
FORMULA_NAME ASLink-PT-05a-UpperBounds-13
FORMULA_NAME ASLink-PT-05a-UpperBounds-14
FORMULA_NAME ASLink-PT-05a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620410834099

Running Version 0
[2021-05-07 18:07:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2021-05-07 18:07:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-07 18:07:15] [INFO ] Load time of PNML (sax parser for PT used): 119 ms
[2021-05-07 18:07:15] [INFO ] Transformed 1211 places.
[2021-05-07 18:07:15] [INFO ] Transformed 1827 transitions.
[2021-05-07 18:07:15] [INFO ] Found NUPN structural information;
[2021-05-07 18:07:15] [INFO ] Parsed PT model containing 1211 places and 1827 transitions in 173 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Ensure Unique test removed 19 transitions
Reduce redundant transitions removed 19 transitions.
// Phase 1: matrix 1808 rows 1211 cols
[2021-05-07 18:07:16] [INFO ] Computed 232 place invariants in 153 ms
Incomplete random walk after 10000 steps, including 55 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 16) seen :12
FORMULA ASLink-PT-05a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-05a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
// Phase 1: matrix 1808 rows 1211 cols
[2021-05-07 18:07:16] [INFO ] Computed 232 place invariants in 102 ms
[2021-05-07 18:07:16] [INFO ] [Real]Absence check using 56 positive place invariants in 35 ms returned sat
[2021-05-07 18:07:16] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 44 ms returned sat
[2021-05-07 18:07:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:17] [INFO ] [Real]Absence check using state equation in 661 ms returned sat
[2021-05-07 18:07:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:07:17] [INFO ] [Nat]Absence check using 56 positive place invariants in 25 ms returned sat
[2021-05-07 18:07:17] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 39 ms returned sat
[2021-05-07 18:07:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:22] [INFO ] [Nat]Absence check using state equation in 4773 ms returned unknown
[2021-05-07 18:07:22] [INFO ] [Real]Absence check using 56 positive place invariants in 24 ms returned sat
[2021-05-07 18:07:22] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 40 ms returned sat
[2021-05-07 18:07:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:23] [INFO ] [Real]Absence check using state equation in 581 ms returned sat
[2021-05-07 18:07:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:07:23] [INFO ] [Nat]Absence check using 56 positive place invariants in 25 ms returned sat
[2021-05-07 18:07:23] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 42 ms returned sat
[2021-05-07 18:07:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:28] [INFO ] [Nat]Absence check using state equation in 4755 ms returned unknown
[2021-05-07 18:07:28] [INFO ] [Real]Absence check using 56 positive place invariants in 25 ms returned sat
[2021-05-07 18:07:28] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 42 ms returned sat
[2021-05-07 18:07:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:29] [INFO ] [Real]Absence check using state equation in 557 ms returned sat
[2021-05-07 18:07:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:07:29] [INFO ] [Nat]Absence check using 56 positive place invariants in 26 ms returned sat
[2021-05-07 18:07:29] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 41 ms returned sat
[2021-05-07 18:07:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:31] [INFO ] [Nat]Absence check using state equation in 2009 ms returned sat
[2021-05-07 18:07:31] [INFO ] Deduced a trap composed of 26 places in 176 ms of which 3 ms to minimize.
[2021-05-07 18:07:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 384 ms
[2021-05-07 18:07:32] [INFO ] Computed and/alt/rep : 734/2638/734 causal constraints (skipped 1073 transitions) in 134 ms.
[2021-05-07 18:07:34] [INFO ] Added : 35 causal constraints over 7 iterations in 2331 ms. Result :unknown
[2021-05-07 18:07:34] [INFO ] [Real]Absence check using 56 positive place invariants in 27 ms returned sat
[2021-05-07 18:07:34] [INFO ] [Real]Absence check using 56 positive and 176 generalized place invariants in 43 ms returned sat
[2021-05-07 18:07:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:35] [INFO ] [Real]Absence check using state equation in 653 ms returned sat
[2021-05-07 18:07:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:07:35] [INFO ] [Nat]Absence check using 56 positive place invariants in 24 ms returned sat
[2021-05-07 18:07:35] [INFO ] [Nat]Absence check using 56 positive and 176 generalized place invariants in 39 ms returned sat
[2021-05-07 18:07:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:40] [INFO ] [Nat]Absence check using state equation in 4783 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 218200 steps, including 2416 resets, run finished after 1038 ms. (steps per millisecond=210 ) properties (out of 4) seen :0 could not realise parikh vector
Support contains 4 out of 1211 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1211/1211 places, 1808/1808 transitions.
Ensure Unique test removed 20 places
Discarding 10 places :
Implicit places reduction removed 10 places
Drop transitions removed 108 transitions
Trivial Post-agglo rules discarded 108 transitions
Performed 108 trivial Post agglomeration. Transition count delta: 108
Iterating post reduction 0 with 138 rules applied. Total rules applied 138 place count 1181 transition count 1700
Reduce places removed 108 places and 0 transitions.
Iterating post reduction 1 with 108 rules applied. Total rules applied 246 place count 1073 transition count 1700
Performed 109 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 109 Pre rules applied. Total rules applied 246 place count 1073 transition count 1591
Deduced a syphon composed of 109 places in 2 ms
Ensure Unique test removed 43 places
Reduce places removed 152 places and 0 transitions.
Iterating global reduction 2 with 261 rules applied. Total rules applied 507 place count 921 transition count 1591
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 508 place count 921 transition count 1590
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 509 place count 920 transition count 1590
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 517 place count 912 transition count 1549
Ensure Unique test removed 1 places
Iterating global reduction 4 with 9 rules applied. Total rules applied 526 place count 911 transition count 1549
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 4 with 6 rules applied. Total rules applied 532 place count 910 transition count 1544
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 535 place count 907 transition count 1544
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 536 place count 906 transition count 1536
Iterating global reduction 6 with 1 rules applied. Total rules applied 537 place count 906 transition count 1536
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 538 place count 905 transition count 1528
Iterating global reduction 6 with 1 rules applied. Total rules applied 539 place count 905 transition count 1528
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 540 place count 904 transition count 1520
Iterating global reduction 6 with 1 rules applied. Total rules applied 541 place count 904 transition count 1520
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 542 place count 903 transition count 1512
Iterating global reduction 6 with 1 rules applied. Total rules applied 543 place count 903 transition count 1512
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 544 place count 902 transition count 1504
Iterating global reduction 6 with 1 rules applied. Total rules applied 545 place count 902 transition count 1504
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 546 place count 901 transition count 1496
Iterating global reduction 6 with 1 rules applied. Total rules applied 547 place count 901 transition count 1496
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 548 place count 900 transition count 1488
Iterating global reduction 6 with 1 rules applied. Total rules applied 549 place count 900 transition count 1488
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 550 place count 899 transition count 1480
Iterating global reduction 6 with 1 rules applied. Total rules applied 551 place count 899 transition count 1480
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 552 place count 898 transition count 1472
Iterating global reduction 6 with 1 rules applied. Total rules applied 553 place count 898 transition count 1472
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 554 place count 897 transition count 1464
Iterating global reduction 6 with 1 rules applied. Total rules applied 555 place count 897 transition count 1464
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 556 place count 896 transition count 1456
Iterating global reduction 6 with 1 rules applied. Total rules applied 557 place count 896 transition count 1456
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 558 place count 895 transition count 1448
Iterating global reduction 6 with 1 rules applied. Total rules applied 559 place count 895 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 560 place count 894 transition count 1440
Iterating global reduction 6 with 1 rules applied. Total rules applied 561 place count 894 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 562 place count 893 transition count 1432
Iterating global reduction 6 with 1 rules applied. Total rules applied 563 place count 893 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 564 place count 892 transition count 1424
Iterating global reduction 6 with 1 rules applied. Total rules applied 565 place count 892 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 566 place count 891 transition count 1416
Iterating global reduction 6 with 1 rules applied. Total rules applied 567 place count 891 transition count 1416
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 6 with 70 rules applied. Total rules applied 637 place count 856 transition count 1381
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 6 with 4 rules applied. Total rules applied 641 place count 856 transition count 1377
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 645 place count 852 transition count 1377
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 651 place count 852 transition count 1377
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 652 place count 851 transition count 1376
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 7 with 10 rules applied. Total rules applied 662 place count 841 transition count 1376
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 20 Pre rules applied. Total rules applied 662 place count 841 transition count 1356
Deduced a syphon composed of 20 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 41 rules applied. Total rules applied 703 place count 820 transition count 1356
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 8 with 6 rules applied. Total rules applied 709 place count 814 transition count 1356
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 709 place count 814 transition count 1355
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 711 place count 813 transition count 1355
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 723 place count 807 transition count 1349
Discarding 5 places :
Symmetric choice reduction at 9 with 5 rule applications. Total rules 728 place count 802 transition count 1344
Iterating global reduction 9 with 5 rules applied. Total rules applied 733 place count 802 transition count 1344
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 738 place count 802 transition count 1339
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 743 place count 797 transition count 1339
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 748 place count 797 transition count 1339
Applied a total of 748 rules in 1276 ms. Remains 797 /1211 variables (removed 414) and now considering 1339/1808 (removed 469) transitions.
Finished structural reductions, in 1 iterations. Remains : 797/1211 places, 1339/1808 transitions.
// Phase 1: matrix 1339 rows 797 cols
[2021-05-07 18:07:42] [INFO ] Computed 140 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 12002 resets, run finished after 3315 ms. (steps per millisecond=301 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2308 resets, run finished after 1313 ms. (steps per millisecond=761 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2305 resets, run finished after 1394 ms. (steps per millisecond=717 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2306 resets, run finished after 1371 ms. (steps per millisecond=729 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2274 resets, run finished after 1320 ms. (steps per millisecond=757 ) properties (out of 4) seen :0
// Phase 1: matrix 1339 rows 797 cols
[2021-05-07 18:07:51] [INFO ] Computed 140 place invariants in 18 ms
[2021-05-07 18:07:51] [INFO ] [Real]Absence check using 34 positive place invariants in 11 ms returned sat
[2021-05-07 18:07:51] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 20 ms returned sat
[2021-05-07 18:07:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:51] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2021-05-07 18:07:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:07:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2021-05-07 18:07:51] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 21 ms returned sat
[2021-05-07 18:07:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:07:52] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2021-05-07 18:07:52] [INFO ] Computed and/alt/rep : 523/2009/523 causal constraints (skipped 787 transitions) in 111 ms.
[2021-05-07 18:08:00] [INFO ] Added : 105 causal constraints over 21 iterations in 7727 ms. Result :unknown
[2021-05-07 18:08:00] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-07 18:08:00] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 20 ms returned sat
[2021-05-07 18:08:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:00] [INFO ] [Real]Absence check using state equation in 389 ms returned sat
[2021-05-07 18:08:00] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:08:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2021-05-07 18:08:00] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 20 ms returned sat
[2021-05-07 18:08:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:01] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2021-05-07 18:08:01] [INFO ] Computed and/alt/rep : 523/2009/523 causal constraints (skipped 787 transitions) in 118 ms.
[2021-05-07 18:08:03] [INFO ] Added : 136 causal constraints over 28 iterations in 2567 ms. Result :sat
Minimization took 403 ms.
[2021-05-07 18:08:04] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-07 18:08:04] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 20 ms returned sat
[2021-05-07 18:08:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:04] [INFO ] [Real]Absence check using state equation in 408 ms returned sat
[2021-05-07 18:08:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:08:05] [INFO ] [Nat]Absence check using 34 positive place invariants in 18 ms returned sat
[2021-05-07 18:08:05] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 36 ms returned sat
[2021-05-07 18:08:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:05] [INFO ] [Nat]Absence check using state equation in 478 ms returned sat
[2021-05-07 18:08:05] [INFO ] Computed and/alt/rep : 523/2009/523 causal constraints (skipped 787 transitions) in 69 ms.
[2021-05-07 18:08:11] [INFO ] Added : 420 causal constraints over 84 iterations in 5766 ms. Result :sat
Minimization took 530 ms.
[2021-05-07 18:08:12] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-07 18:08:12] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 20 ms returned sat
[2021-05-07 18:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:12] [INFO ] [Real]Absence check using state equation in 337 ms returned sat
[2021-05-07 18:08:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:08:12] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-07 18:08:12] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 19 ms returned sat
[2021-05-07 18:08:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:13] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2021-05-07 18:08:13] [INFO ] Computed and/alt/rep : 523/2009/523 causal constraints (skipped 787 transitions) in 68 ms.
[2021-05-07 18:08:18] [INFO ] Added : 372 causal constraints over 75 iterations in 5821 ms. Result :sat
Minimization took 604 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1] Max seen :[0, 0, 0, 0]
Incomplete Parikh walk after 137300 steps, including 2527 resets, run finished after 452 ms. (steps per millisecond=303 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 157700 steps, including 2560 resets, run finished after 546 ms. (steps per millisecond=288 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 90000 steps, including 1941 resets, run finished after 295 ms. (steps per millisecond=305 ) properties (out of 4) seen :0 could not realise parikh vector
Incomplete Parikh walk after 158700 steps, including 2425 resets, run finished after 515 ms. (steps per millisecond=308 ) properties (out of 4) seen :1 could not realise parikh vector
FORMULA ASLink-PT-05a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 797 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 797/797 places, 1339/1339 transitions.
Applied a total of 0 rules in 25 ms. Remains 797 /797 variables (removed 0) and now considering 1339/1339 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 797/797 places, 1339/1339 transitions.
// Phase 1: matrix 1339 rows 797 cols
[2021-05-07 18:08:21] [INFO ] Computed 140 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 11966 resets, run finished after 3453 ms. (steps per millisecond=289 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2328 resets, run finished after 1274 ms. (steps per millisecond=784 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2347 resets, run finished after 1227 ms. (steps per millisecond=814 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2325 resets, run finished after 1217 ms. (steps per millisecond=821 ) properties (out of 3) seen :0
// Phase 1: matrix 1339 rows 797 cols
[2021-05-07 18:08:28] [INFO ] Computed 140 place invariants in 28 ms
[2021-05-07 18:08:28] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-07 18:08:28] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 21 ms returned sat
[2021-05-07 18:08:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:29] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2021-05-07 18:08:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:08:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2021-05-07 18:08:29] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 20 ms returned sat
[2021-05-07 18:08:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:29] [INFO ] [Nat]Absence check using state equation in 421 ms returned sat
[2021-05-07 18:08:29] [INFO ] Computed and/alt/rep : 523/2009/523 causal constraints (skipped 787 transitions) in 83 ms.
[2021-05-07 18:08:32] [INFO ] Added : 136 causal constraints over 28 iterations in 2453 ms. Result :sat
Minimization took 396 ms.
[2021-05-07 18:08:32] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-07 18:08:32] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 19 ms returned sat
[2021-05-07 18:08:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:33] [INFO ] [Real]Absence check using state equation in 359 ms returned sat
[2021-05-07 18:08:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:08:33] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2021-05-07 18:08:33] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 21 ms returned sat
[2021-05-07 18:08:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:33] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2021-05-07 18:08:33] [INFO ] Computed and/alt/rep : 523/2009/523 causal constraints (skipped 787 transitions) in 113 ms.
[2021-05-07 18:08:39] [INFO ] Added : 420 causal constraints over 84 iterations in 5760 ms. Result :sat
Minimization took 524 ms.
[2021-05-07 18:08:40] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-07 18:08:40] [INFO ] [Real]Absence check using 34 positive and 106 generalized place invariants in 19 ms returned sat
[2021-05-07 18:08:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:40] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2021-05-07 18:08:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:08:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 10 ms returned sat
[2021-05-07 18:08:40] [INFO ] [Nat]Absence check using 34 positive and 106 generalized place invariants in 19 ms returned sat
[2021-05-07 18:08:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:41] [INFO ] [Nat]Absence check using state equation in 465 ms returned sat
[2021-05-07 18:08:41] [INFO ] Computed and/alt/rep : 523/2009/523 causal constraints (skipped 787 transitions) in 83 ms.
[2021-05-07 18:08:46] [INFO ] Added : 372 causal constraints over 75 iterations in 5733 ms. Result :sat
Minimization took 600 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1] Max seen :[0, 0, 0]
Incomplete Parikh walk after 137300 steps, including 2513 resets, run finished after 450 ms. (steps per millisecond=305 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 157700 steps, including 2589 resets, run finished after 565 ms. (steps per millisecond=279 ) properties (out of 3) seen :0 could not realise parikh vector
Incomplete Parikh walk after 90000 steps, including 1950 resets, run finished after 323 ms. (steps per millisecond=278 ) properties (out of 3) seen :0 could not realise parikh vector
Support contains 3 out of 797 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 797/797 places, 1339/1339 transitions.
Applied a total of 0 rules in 25 ms. Remains 797 /797 variables (removed 0) and now considering 1339/1339 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 797/797 places, 1339/1339 transitions.
Starting structural reductions, iteration 0 : 797/797 places, 1339/1339 transitions.
Applied a total of 0 rules in 25 ms. Remains 797 /797 variables (removed 0) and now considering 1339/1339 (removed 0) transitions.
// Phase 1: matrix 1339 rows 797 cols
[2021-05-07 18:08:48] [INFO ] Computed 140 place invariants in 19 ms
[2021-05-07 18:08:49] [INFO ] Implicit Places using invariants in 584 ms returned [0, 18, 19, 30, 48, 66, 135, 139, 148, 149, 150, 168, 186, 255, 259, 260, 271, 272, 273, 291, 309, 378, 382, 383, 394, 395, 396, 414, 432, 501, 505, 506, 517, 518, 519, 537, 555, 624, 628, 629, 632, 643, 644, 645, 663, 665, 668, 686, 687, 688, 689, 701, 707, 713, 719, 725, 731, 737, 743, 749, 755, 761]
Discarding 62 places :
Implicit Place search using SMT only with invariants took 587 ms to find 62 implicit places.
[2021-05-07 18:08:49] [INFO ] Redundant transitions in 158 ms returned []
// Phase 1: matrix 1339 rows 735 cols
[2021-05-07 18:08:49] [INFO ] Computed 78 place invariants in 15 ms
[2021-05-07 18:08:50] [INFO ] Dead Transitions using invariants and state equation in 602 ms returned []
Starting structural reductions, iteration 1 : 735/797 places, 1339/1339 transitions.
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 106 rules applied. Total rules applied 106 place count 735 transition count 1233
Reduce places removed 106 places and 0 transitions.
Iterating post reduction 1 with 106 rules applied. Total rules applied 212 place count 629 transition count 1233
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 212 place count 629 transition count 1206
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 55 rules applied. Total rules applied 267 place count 601 transition count 1206
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 279 place count 597 transition count 1198
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 287 place count 589 transition count 1198
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 302 place count 574 transition count 1183
Iterating global reduction 4 with 15 rules applied. Total rules applied 317 place count 574 transition count 1183
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 320 place count 574 transition count 1180
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 320 place count 574 transition count 1179
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 322 place count 573 transition count 1179
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 325 place count 570 transition count 1176
Iterating global reduction 5 with 3 rules applied. Total rules applied 328 place count 570 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 329 place count 569 transition count 1175
Iterating global reduction 5 with 1 rules applied. Total rules applied 330 place count 569 transition count 1175
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 331 place count 568 transition count 1174
Iterating global reduction 5 with 1 rules applied. Total rules applied 332 place count 568 transition count 1174
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 424 place count 522 transition count 1128
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 429 place count 522 transition count 1123
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 434 place count 517 transition count 1118
Iterating global reduction 6 with 5 rules applied. Total rules applied 439 place count 517 transition count 1118
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 444 place count 517 transition count 1113
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 7 with 10 rules applied. Total rules applied 454 place count 517 transition count 1103
Ensure Unique test removed 1 places
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 465 place count 506 transition count 1103
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 481 place count 506 transition count 1103
Applied a total of 481 rules in 197 ms. Remains 506 /735 variables (removed 229) and now considering 1103/1339 (removed 236) transitions.
// Phase 1: matrix 1103 rows 506 cols
[2021-05-07 18:08:50] [INFO ] Computed 72 place invariants in 10 ms
[2021-05-07 18:08:50] [INFO ] Implicit Places using invariants in 351 ms returned [72, 89, 95, 98, 100, 103, 104, 156, 173, 179, 182, 184, 189, 190, 242, 260, 266, 269, 271, 276, 277, 329, 346, 352, 355, 357, 362, 363, 415, 432, 438, 441, 443]
Discarding 33 places :
Implicit Place search using SMT only with invariants took 353 ms to find 33 implicit places.
Starting structural reductions, iteration 2 : 473/797 places, 1103/1339 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 458 transition count 1088
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 458 transition count 1088
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 35 place count 453 transition count 1083
Iterating global reduction 0 with 5 rules applied. Total rules applied 40 place count 453 transition count 1083
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 60 place count 443 transition count 1073
Free-agglomeration rule applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 75 place count 443 transition count 1058
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 90 place count 428 transition count 1058
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 95 place count 428 transition count 1053
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 100 place count 423 transition count 1053
Applied a total of 100 rules in 120 ms. Remains 423 /473 variables (removed 50) and now considering 1053/1103 (removed 50) transitions.
// Phase 1: matrix 1053 rows 423 cols
[2021-05-07 18:08:50] [INFO ] Computed 39 place invariants in 9 ms
[2021-05-07 18:08:51] [INFO ] Implicit Places using invariants in 249 ms returned []
// Phase 1: matrix 1053 rows 423 cols
[2021-05-07 18:08:51] [INFO ] Computed 39 place invariants in 10 ms
[2021-05-07 18:08:51] [INFO ] Implicit Places using invariants and state equation in 697 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
Finished structural reductions, in 3 iterations. Remains : 423/797 places, 1053/1339 transitions.
Successfully produced net in file /tmp/petri1000_14240743483005543556.dot
Successfully produced net in file /tmp/petri1001_12393912494029712455.dot
Successfully produced net in file /tmp/petri1002_7193265498315316574.dot
Successfully produced net in file /tmp/petri1003_2223344115282650400.dot
Successfully produced net in file /tmp/petri1004_1977023866391920576.dot
Drop transitions removed 5 transitions
Dominated transitions for bounds rules discarded 5 transitions
// Phase 1: matrix 1048 rows 423 cols
[2021-05-07 18:08:51] [INFO ] Computed 39 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 18671 resets, run finished after 2661 ms. (steps per millisecond=375 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4790 resets, run finished after 946 ms. (steps per millisecond=1057 ) properties (out of 3) seen :1
FORMULA ASLink-PT-05a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 1000001 steps, including 4745 resets, run finished after 949 ms. (steps per millisecond=1053 ) properties (out of 2) seen :0
// Phase 1: matrix 1048 rows 423 cols
[2021-05-07 18:08:56] [INFO ] Computed 39 place invariants in 9 ms
[2021-05-07 18:08:56] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:08:56] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-07 18:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:56] [INFO ] [Real]Absence check using state equation in 252 ms returned sat
[2021-05-07 18:08:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:08:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:08:56] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-07 18:08:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:57] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2021-05-07 18:08:57] [INFO ] Computed and/alt/rep : 220/1005/220 causal constraints (skipped 802 transitions) in 56 ms.
[2021-05-07 18:08:58] [INFO ] Added : 34 causal constraints over 8 iterations in 667 ms. Result :sat
Minimization took 301 ms.
[2021-05-07 18:08:58] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:08:58] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 9 ms returned sat
[2021-05-07 18:08:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:58] [INFO ] [Real]Absence check using state equation in 237 ms returned sat
[2021-05-07 18:08:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:08:58] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:08:58] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-07 18:08:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:08:59] [INFO ] [Nat]Absence check using state equation in 291 ms returned sat
[2021-05-07 18:08:59] [INFO ] Computed and/alt/rep : 220/1005/220 causal constraints (skipped 802 transitions) in 55 ms.
[2021-05-07 18:08:59] [INFO ] Added : 12 causal constraints over 3 iterations in 349 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 66200 steps, including 3139 resets, run finished after 196 ms. (steps per millisecond=337 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 83400 steps, including 2173 resets, run finished after 243 ms. (steps per millisecond=343 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 423 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 423/423 places, 1048/1048 transitions.
Graph (complete) has 2607 edges and 423 vertex of which 418 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 418 transition count 1047
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 417 transition count 1047
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 2 with 5 rules applied. Total rules applied 8 place count 417 transition count 1047
Applied a total of 8 rules in 34 ms. Remains 417 /423 variables (removed 6) and now considering 1047/1048 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/423 places, 1047/1048 transitions.
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:00] [INFO ] Computed 39 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 18468 resets, run finished after 2820 ms. (steps per millisecond=354 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4699 resets, run finished after 939 ms. (steps per millisecond=1064 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4736 resets, run finished after 942 ms. (steps per millisecond=1061 ) properties (out of 2) seen :0
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:04] [INFO ] Computed 39 place invariants in 11 ms
[2021-05-07 18:09:04] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:09:04] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-07 18:09:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:05] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2021-05-07 18:09:05] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:09:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-07 18:09:05] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-07 18:09:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:05] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2021-05-07 18:09:05] [INFO ] Computed and/alt/rep : 219/1002/219 causal constraints (skipped 802 transitions) in 62 ms.
[2021-05-07 18:09:05] [INFO ] Added : 16 causal constraints over 4 iterations in 398 ms. Result :sat
Minimization took 161 ms.
[2021-05-07 18:09:06] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:09:06] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-07 18:09:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:06] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-07 18:09:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:09:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:09:06] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-07 18:09:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:06] [INFO ] [Nat]Absence check using state equation in 307 ms returned sat
[2021-05-07 18:09:06] [INFO ] Computed and/alt/rep : 219/1002/219 causal constraints (skipped 802 transitions) in 61 ms.
[2021-05-07 18:09:07] [INFO ] Added : 36 causal constraints over 8 iterations in 529 ms. Result :sat
Minimization took 141 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 69500 steps, including 1947 resets, run finished after 289 ms. (steps per millisecond=240 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 85300 steps, including 3581 resets, run finished after 289 ms. (steps per millisecond=295 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 1047/1047 transitions.
Applied a total of 0 rules in 13 ms. Remains 417 /417 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 1047/1047 transitions.
Starting structural reductions, iteration 0 : 417/417 places, 1047/1047 transitions.
Applied a total of 0 rules in 13 ms. Remains 417 /417 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:08] [INFO ] Computed 39 place invariants in 9 ms
[2021-05-07 18:09:08] [INFO ] Implicit Places using invariants in 231 ms returned []
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:08] [INFO ] Computed 39 place invariants in 9 ms
[2021-05-07 18:09:09] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 943 ms to find 0 implicit places.
[2021-05-07 18:09:09] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:09] [INFO ] Computed 39 place invariants in 11 ms
[2021-05-07 18:09:09] [INFO ] Dead Transitions using invariants and state equation in 409 ms returned []
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 1047/1047 transitions.
Starting property specific reduction for ASLink-PT-05a-UpperBounds-01
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:09] [INFO ] Computed 39 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 184 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 40 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:09] [INFO ] Computed 39 place invariants in 18 ms
[2021-05-07 18:09:09] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:09:09] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-07 18:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:09] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2021-05-07 18:09:09] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:09:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-07 18:09:09] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-07 18:09:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:10] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2021-05-07 18:09:10] [INFO ] Computed and/alt/rep : 219/1002/219 causal constraints (skipped 802 transitions) in 55 ms.
[2021-05-07 18:09:10] [INFO ] Added : 16 causal constraints over 4 iterations in 398 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 85300 steps, including 3586 resets, run finished after 247 ms. (steps per millisecond=345 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 1047/1047 transitions.
Applied a total of 0 rules in 13 ms. Remains 417 /417 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 1047/1047 transitions.
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:11] [INFO ] Computed 39 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 18616 resets, run finished after 2611 ms. (steps per millisecond=382 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4778 resets, run finished after 926 ms. (steps per millisecond=1079 ) properties (out of 1) seen :0
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:14] [INFO ] Computed 39 place invariants in 12 ms
[2021-05-07 18:09:14] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-07 18:09:14] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-07 18:09:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:14] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2021-05-07 18:09:14] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:09:14] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-07 18:09:15] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-07 18:09:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:15] [INFO ] [Nat]Absence check using state equation in 317 ms returned sat
[2021-05-07 18:09:15] [INFO ] Computed and/alt/rep : 219/1002/219 causal constraints (skipped 802 transitions) in 55 ms.
[2021-05-07 18:09:15] [INFO ] Added : 16 causal constraints over 4 iterations in 399 ms. Result :sat
Minimization took 160 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 85300 steps, including 3647 resets, run finished after 226 ms. (steps per millisecond=377 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 1047/1047 transitions.
Applied a total of 0 rules in 12 ms. Remains 417 /417 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 1047/1047 transitions.
Starting structural reductions, iteration 0 : 417/417 places, 1047/1047 transitions.
Applied a total of 0 rules in 11 ms. Remains 417 /417 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:16] [INFO ] Computed 39 place invariants in 9 ms
[2021-05-07 18:09:16] [INFO ] Implicit Places using invariants in 279 ms returned []
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:16] [INFO ] Computed 39 place invariants in 9 ms
[2021-05-07 18:09:17] [INFO ] Implicit Places using invariants and state equation in 686 ms returned []
Implicit Place search using SMT with State Equation took 966 ms to find 0 implicit places.
[2021-05-07 18:09:17] [INFO ] Redundant transitions in 13 ms returned []
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:17] [INFO ] Computed 39 place invariants in 8 ms
[2021-05-07 18:09:17] [INFO ] Dead Transitions using invariants and state equation in 375 ms returned []
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 1047/1047 transitions.
Ending property specific reduction for ASLink-PT-05a-UpperBounds-01 in 8073 ms.
Starting property specific reduction for ASLink-PT-05a-UpperBounds-07
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:17] [INFO ] Computed 39 place invariants in 9 ms
Incomplete random walk after 10000 steps, including 191 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 46 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:17] [INFO ] Computed 39 place invariants in 9 ms
[2021-05-07 18:09:17] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:09:17] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-07 18:09:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:17] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2021-05-07 18:09:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:09:17] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2021-05-07 18:09:17] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 7 ms returned sat
[2021-05-07 18:09:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:18] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2021-05-07 18:09:18] [INFO ] Computed and/alt/rep : 219/1002/219 causal constraints (skipped 802 transitions) in 65 ms.
[2021-05-07 18:09:18] [INFO ] Added : 36 causal constraints over 8 iterations in 545 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 69500 steps, including 1945 resets, run finished after 193 ms. (steps per millisecond=360 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 1047/1047 transitions.
Applied a total of 0 rules in 11 ms. Remains 417 /417 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 1047/1047 transitions.
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:19] [INFO ] Computed 39 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 18479 resets, run finished after 2587 ms. (steps per millisecond=386 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4752 resets, run finished after 961 ms. (steps per millisecond=1040 ) properties (out of 1) seen :0
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:22] [INFO ] Computed 39 place invariants in 8 ms
[2021-05-07 18:09:22] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:09:22] [INFO ] [Real]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-07 18:09:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:23] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2021-05-07 18:09:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-07 18:09:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2021-05-07 18:09:23] [INFO ] [Nat]Absence check using 10 positive and 29 generalized place invariants in 8 ms returned sat
[2021-05-07 18:09:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-07 18:09:23] [INFO ] [Nat]Absence check using state equation in 312 ms returned sat
[2021-05-07 18:09:23] [INFO ] Computed and/alt/rep : 219/1002/219 causal constraints (skipped 802 transitions) in 52 ms.
[2021-05-07 18:09:24] [INFO ] Added : 36 causal constraints over 8 iterations in 519 ms. Result :sat
Minimization took 140 ms.
Current structural bounds on expressions (after SMT) : [5] Max seen :[0]
Incomplete Parikh walk after 69500 steps, including 1936 resets, run finished after 204 ms. (steps per millisecond=340 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 417 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 417/417 places, 1047/1047 transitions.
Applied a total of 0 rules in 11 ms. Remains 417 /417 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 1047/1047 transitions.
Starting structural reductions, iteration 0 : 417/417 places, 1047/1047 transitions.
Applied a total of 0 rules in 11 ms. Remains 417 /417 variables (removed 0) and now considering 1047/1047 (removed 0) transitions.
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:24] [INFO ] Computed 39 place invariants in 9 ms
[2021-05-07 18:09:24] [INFO ] Implicit Places using invariants in 265 ms returned []
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:24] [INFO ] Computed 39 place invariants in 8 ms
[2021-05-07 18:09:25] [INFO ] Implicit Places using invariants and state equation in 715 ms returned []
Implicit Place search using SMT with State Equation took 981 ms to find 0 implicit places.
[2021-05-07 18:09:25] [INFO ] Redundant transitions in 39 ms returned []
// Phase 1: matrix 1047 rows 417 cols
[2021-05-07 18:09:25] [INFO ] Computed 39 place invariants in 9 ms
[2021-05-07 18:09:25] [INFO ] Dead Transitions using invariants and state equation in 389 ms returned []
Finished structural reductions, in 1 iterations. Remains : 417/417 places, 1047/1047 transitions.
Ending property specific reduction for ASLink-PT-05a-UpperBounds-07 in 8321 ms.
[2021-05-07 18:09:26] [INFO ] Flatten gal took : 140 ms
[2021-05-07 18:09:26] [INFO ] Applying decomposition
[2021-05-07 18:09:26] [INFO ] Flatten gal took : 73 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8282851838210369345.txt, -o, /tmp/graph8282851838210369345.bin, -w, /tmp/graph8282851838210369345.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8282851838210369345.bin, -l, -1, -v, -w, /tmp/graph8282851838210369345.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-07 18:09:26] [INFO ] Decomposing Gal with order
[2021-05-07 18:09:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 18:09:26] [INFO ] Removed a total of 2182 redundant transitions.
[2021-05-07 18:09:26] [INFO ] Flatten gal took : 150 ms
[2021-05-07 18:09:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 89 labels/synchronizations in 24 ms.
[2021-05-07 18:09:26] [INFO ] Time to serialize gal into /tmp/UpperBounds11552515849018273898.gal : 12 ms
[2021-05-07 18:09:26] [INFO ] Time to serialize properties into /tmp/UpperBounds8092442191247293712.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds11552515849018273898.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds8092442191247293712.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds11552515849018273898.gal -t CGAL -reachable-file /tmp/UpperBounds8092442191247293712.prop --nowitness
Loading property file /tmp/UpperBounds8092442191247293712.prop.
Detected timeout of ITS tools.
[2021-05-07 18:30:12] [INFO ] Applying decomposition
[2021-05-07 18:30:12] [INFO ] Flatten gal took : 523 ms
[2021-05-07 18:30:13] [INFO ] Decomposing Gal with order
[2021-05-07 18:30:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-07 18:30:13] [INFO ] Removed a total of 1960 redundant transitions.
[2021-05-07 18:30:13] [INFO ] Flatten gal took : 324 ms
[2021-05-07 18:30:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 377 labels/synchronizations in 64 ms.
[2021-05-07 18:30:13] [INFO ] Time to serialize gal into /tmp/UpperBounds3965873576238170642.gal : 13 ms
[2021-05-07 18:30:13] [INFO ] Time to serialize properties into /tmp/UpperBounds7299130538781167060.prop : 2 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds3965873576238170642.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds7299130538781167060.prop, --nowitness], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds3965873576238170642.gal -t CGAL -reachable-file /tmp/UpperBounds7299130538781167060.prop --nowitness
Loading property file /tmp/UpperBounds7299130538781167060.prop.
Detected timeout of ITS tools.
[2021-05-07 18:50:57] [INFO ] Flatten gal took : 1123 ms
[2021-05-07 18:50:58] [INFO ] Input system was already deterministic with 1047 transitions.
[2021-05-07 18:50:58] [INFO ] Transformed 417 places.
[2021-05-07 18:50:58] [INFO ] Transformed 1047 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-07 18:51:11] [INFO ] Time to serialize gal into /tmp/UpperBounds10572375671899475164.gal : 33 ms
[2021-05-07 18:51:11] [INFO ] Time to serialize properties into /tmp/UpperBounds18234594273648134930.prop : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds10572375671899475164.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds18234594273648134930.prop, --nowitness, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds10572375671899475164.gal -t CGAL -reachable-file /tmp/UpperBounds18234594273648134930.prop --nowitness --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Successfully loaded order from file /home/mcc/execution/model.ord
Loading property file /tmp/UpperBounds18234594273648134930.prop.

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="ASLink-PT-05a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ASLink-PT-05a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r007-tall-162037989500077"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-05a.tgz
mv ASLink-PT-05a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;