About the Execution of LoLa+red for ASLink-PT-06a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1342.287 | 182130.00 | 225168.00 | 61.20 | 1 1 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/mcc2023-input.r007-oct2-167813595000093.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ASLink-PT-06a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r007-oct2-167813595000093
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.0M
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 13:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Feb 26 13:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 597K Mar 5 18:22 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-06a-UpperBounds-00
FORMULA_NAME ASLink-PT-06a-UpperBounds-01
FORMULA_NAME ASLink-PT-06a-UpperBounds-02
FORMULA_NAME ASLink-PT-06a-UpperBounds-03
FORMULA_NAME ASLink-PT-06a-UpperBounds-04
FORMULA_NAME ASLink-PT-06a-UpperBounds-05
FORMULA_NAME ASLink-PT-06a-UpperBounds-06
FORMULA_NAME ASLink-PT-06a-UpperBounds-07
FORMULA_NAME ASLink-PT-06a-UpperBounds-08
FORMULA_NAME ASLink-PT-06a-UpperBounds-09
FORMULA_NAME ASLink-PT-06a-UpperBounds-10
FORMULA_NAME ASLink-PT-06a-UpperBounds-11
FORMULA_NAME ASLink-PT-06a-UpperBounds-12
FORMULA_NAME ASLink-PT-06a-UpperBounds-13
FORMULA_NAME ASLink-PT-06a-UpperBounds-14
FORMULA_NAME ASLink-PT-06a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678338567666
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-06a
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-09 05:09:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 05:09:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 05:09:30] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2023-03-09 05:09:30] [INFO ] Transformed 1406 places.
[2023-03-09 05:09:30] [INFO ] Transformed 2100 transitions.
[2023-03-09 05:09:30] [INFO ] Found NUPN structural information;
[2023-03-09 05:09:30] [INFO ] Parsed PT model containing 1406 places and 2100 transitions and 7896 arcs in 237 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Ensure Unique test removed 22 transitions
Reduce redundant transitions removed 22 transitions.
// Phase 1: matrix 2078 rows 1406 cols
[2023-03-09 05:09:30] [INFO ] Computed 270 place invariants in 106 ms
Incomplete random walk after 10000 steps, including 56 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 16) seen :8
FORMULA ASLink-PT-06a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-06a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :1
FORMULA ASLink-PT-06a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
[2023-03-09 05:09:30] [INFO ] Invariant cache hit.
[2023-03-09 05:09:31] [INFO ] [Real]Absence check using 66 positive place invariants in 59 ms returned sat
[2023-03-09 05:09:31] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 190 ms returned sat
[2023-03-09 05:09:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:09:32] [INFO ] [Real]Absence check using state equation in 1036 ms returned sat
[2023-03-09 05:09:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:09:32] [INFO ] [Nat]Absence check using 66 positive place invariants in 44 ms returned sat
[2023-03-09 05:09:32] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 50 ms returned sat
[2023-03-09 05:09:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:09:37] [INFO ] [Nat]Absence check using state equation in 4705 ms returned unknown
[2023-03-09 05:09:38] [INFO ] [Real]Absence check using 66 positive place invariants in 137 ms returned sat
[2023-03-09 05:09:38] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 75 ms returned sat
[2023-03-09 05:09:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:09:39] [INFO ] [Real]Absence check using state equation in 1339 ms returned sat
[2023-03-09 05:09:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:09:40] [INFO ] [Nat]Absence check using 66 positive place invariants in 26 ms returned sat
[2023-03-09 05:09:40] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 123 ms returned sat
[2023-03-09 05:09:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:09:44] [INFO ] [Nat]Absence check using state equation in 4621 ms returned unknown
[2023-03-09 05:09:45] [INFO ] [Real]Absence check using 66 positive place invariants in 27 ms returned sat
[2023-03-09 05:09:45] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 58 ms returned sat
[2023-03-09 05:09:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:09:46] [INFO ] [Real]Absence check using state equation in 949 ms returned sat
[2023-03-09 05:09:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:09:46] [INFO ] [Nat]Absence check using 66 positive place invariants in 26 ms returned sat
[2023-03-09 05:09:46] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 58 ms returned sat
[2023-03-09 05:09:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:09:51] [INFO ] [Nat]Absence check using state equation in 4760 ms returned unknown
[2023-03-09 05:09:51] [INFO ] [Real]Absence check using 66 positive place invariants in 25 ms returned sat
[2023-03-09 05:09:51] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 175 ms returned sat
[2023-03-09 05:09:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:09:52] [INFO ] [Real]Absence check using state equation in 937 ms returned sat
[2023-03-09 05:09:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:09:53] [INFO ] [Nat]Absence check using 66 positive place invariants in 69 ms returned sat
[2023-03-09 05:09:53] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 103 ms returned sat
[2023-03-09 05:09:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:09:54] [INFO ] [Nat]Absence check using state equation in 1220 ms returned sat
[2023-03-09 05:09:54] [INFO ] Computed and/alt/rep : 858/3058/858 causal constraints (skipped 1219 transitions) in 129 ms.
[2023-03-09 05:09:57] [INFO ] Added : 20 causal constraints over 4 iterations in 3195 ms. Result :unknown
[2023-03-09 05:09:58] [INFO ] [Real]Absence check using 66 positive place invariants in 61 ms returned sat
[2023-03-09 05:09:58] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 121 ms returned sat
[2023-03-09 05:09:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:09:59] [INFO ] [Real]Absence check using state equation in 1195 ms returned sat
[2023-03-09 05:09:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:09:59] [INFO ] [Nat]Absence check using 66 positive place invariants in 27 ms returned sat
[2023-03-09 05:10:00] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 107 ms returned sat
[2023-03-09 05:10:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:04] [INFO ] [Nat]Absence check using state equation in 4649 ms returned unknown
[2023-03-09 05:10:05] [INFO ] [Real]Absence check using 66 positive place invariants in 28 ms returned sat
[2023-03-09 05:10:05] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 60 ms returned sat
[2023-03-09 05:10:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:06] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2023-03-09 05:10:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:10:06] [INFO ] [Nat]Absence check using 66 positive place invariants in 26 ms returned sat
[2023-03-09 05:10:06] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 52 ms returned sat
[2023-03-09 05:10:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:07] [INFO ] [Nat]Absence check using state equation in 954 ms returned sat
[2023-03-09 05:10:07] [INFO ] Deduced a trap composed of 51 places in 281 ms of which 4 ms to minimize.
[2023-03-09 05:10:10] [INFO ] Trap strengthening (SAT) tested/added 1/1 trap constraints in 3330 ms
[2023-03-09 05:10:11] [INFO ] [Real]Absence check using 66 positive place invariants in 31 ms returned sat
[2023-03-09 05:10:11] [INFO ] [Real]Absence check using 66 positive and 204 generalized place invariants in 101 ms returned sat
[2023-03-09 05:10:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:12] [INFO ] [Real]Absence check using state equation in 958 ms returned sat
[2023-03-09 05:10:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:10:12] [INFO ] [Nat]Absence check using 66 positive place invariants in 56 ms returned sat
[2023-03-09 05:10:12] [INFO ] [Nat]Absence check using 66 positive and 204 generalized place invariants in 80 ms returned sat
[2023-03-09 05:10:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:17] [INFO ] [Nat]Absence check using state equation in 4613 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0]
FORMULA ASLink-PT-06a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 5 out of 1406 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1406/1406 places, 2078/2078 transitions.
Ensure Unique test removed 24 places
Discarding 12 places :
Implicit places reduction removed 12 places
Drop transitions removed 125 transitions
Trivial Post-agglo rules discarded 125 transitions
Performed 125 trivial Post agglomeration. Transition count delta: 125
Iterating post reduction 0 with 161 rules applied. Total rules applied 161 place count 1370 transition count 1953
Reduce places removed 125 places and 0 transitions.
Iterating post reduction 1 with 125 rules applied. Total rules applied 286 place count 1245 transition count 1953
Performed 128 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 128 Pre rules applied. Total rules applied 286 place count 1245 transition count 1825
Deduced a syphon composed of 128 places in 3 ms
Ensure Unique test removed 50 places
Reduce places removed 178 places and 0 transitions.
Iterating global reduction 2 with 306 rules applied. Total rules applied 592 place count 1067 transition count 1825
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 593 place count 1067 transition count 1824
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 594 place count 1066 transition count 1824
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 602 place count 1058 transition count 1783
Ensure Unique test removed 1 places
Iterating global reduction 4 with 9 rules applied. Total rules applied 611 place count 1057 transition count 1783
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 617 place count 1056 transition count 1778
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 620 place count 1053 transition count 1778
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 621 place count 1052 transition count 1770
Iterating global reduction 6 with 1 rules applied. Total rules applied 622 place count 1052 transition count 1770
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 623 place count 1051 transition count 1762
Iterating global reduction 6 with 1 rules applied. Total rules applied 624 place count 1051 transition count 1762
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 625 place count 1050 transition count 1754
Iterating global reduction 6 with 1 rules applied. Total rules applied 626 place count 1050 transition count 1754
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 627 place count 1049 transition count 1746
Iterating global reduction 6 with 1 rules applied. Total rules applied 628 place count 1049 transition count 1746
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 629 place count 1048 transition count 1738
Iterating global reduction 6 with 1 rules applied. Total rules applied 630 place count 1048 transition count 1738
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 631 place count 1047 transition count 1730
Iterating global reduction 6 with 1 rules applied. Total rules applied 632 place count 1047 transition count 1730
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 633 place count 1046 transition count 1722
Iterating global reduction 6 with 1 rules applied. Total rules applied 634 place count 1046 transition count 1722
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 635 place count 1045 transition count 1714
Iterating global reduction 6 with 1 rules applied. Total rules applied 636 place count 1045 transition count 1714
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 637 place count 1044 transition count 1706
Iterating global reduction 6 with 1 rules applied. Total rules applied 638 place count 1044 transition count 1706
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 639 place count 1043 transition count 1698
Iterating global reduction 6 with 1 rules applied. Total rules applied 640 place count 1043 transition count 1698
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 641 place count 1042 transition count 1690
Iterating global reduction 6 with 1 rules applied. Total rules applied 642 place count 1042 transition count 1690
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 643 place count 1041 transition count 1682
Iterating global reduction 6 with 1 rules applied. Total rules applied 644 place count 1041 transition count 1682
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 645 place count 1040 transition count 1674
Iterating global reduction 6 with 1 rules applied. Total rules applied 646 place count 1040 transition count 1674
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 647 place count 1039 transition count 1666
Iterating global reduction 6 with 1 rules applied. Total rules applied 648 place count 1039 transition count 1666
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 649 place count 1038 transition count 1658
Iterating global reduction 6 with 1 rules applied. Total rules applied 650 place count 1038 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 651 place count 1037 transition count 1650
Iterating global reduction 6 with 1 rules applied. Total rules applied 652 place count 1037 transition count 1650
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 5 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 6 with 84 rules applied. Total rules applied 736 place count 995 transition count 1608
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 6 with 5 rules applied. Total rules applied 741 place count 995 transition count 1603
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 6 with 5 rules applied. Total rules applied 746 place count 990 transition count 1603
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 752 place count 990 transition count 1603
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 753 place count 989 transition count 1602
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 764 place count 978 transition count 1602
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 21 Pre rules applied. Total rules applied 764 place count 978 transition count 1581
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 8 with 42 rules applied. Total rules applied 806 place count 957 transition count 1581
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 8 with 6 rules applied. Total rules applied 812 place count 951 transition count 1581
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 9 with 12 rules applied. Total rules applied 824 place count 945 transition count 1575
Discarding 6 places :
Symmetric choice reduction at 9 with 6 rule applications. Total rules 830 place count 939 transition count 1569
Iterating global reduction 9 with 6 rules applied. Total rules applied 836 place count 939 transition count 1569
Free-agglomeration rule applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 842 place count 939 transition count 1563
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 849 place count 933 transition count 1562
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 10 with 5 rules applied. Total rules applied 854 place count 933 transition count 1562
Applied a total of 854 rules in 1942 ms. Remains 933 /1406 variables (removed 473) and now considering 1562/2078 (removed 516) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1942 ms. Remains : 933/1406 places, 1562/2078 transitions.
// Phase 1: matrix 1562 rows 933 cols
[2023-03-09 05:10:21] [INFO ] Computed 165 place invariants in 51 ms
Incomplete random walk after 1000000 steps, including 11343 resets, run finished after 3180 ms. (steps per millisecond=314 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1927 resets, run finished after 1239 ms. (steps per millisecond=807 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1890 resets, run finished after 1302 ms. (steps per millisecond=768 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1888 resets, run finished after 1386 ms. (steps per millisecond=721 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1892 resets, run finished after 1387 ms. (steps per millisecond=720 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 1887 resets, run finished after 1393 ms. (steps per millisecond=717 ) properties (out of 5) seen :0
[2023-03-09 05:10:31] [INFO ] Invariant cache hit.
[2023-03-09 05:10:31] [INFO ] [Real]Absence check using 42 positive place invariants in 71 ms returned sat
[2023-03-09 05:10:31] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 34 ms returned sat
[2023-03-09 05:10:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:31] [INFO ] [Real]Absence check using state equation in 521 ms returned sat
[2023-03-09 05:10:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:10:32] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2023-03-09 05:10:32] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 59 ms returned sat
[2023-03-09 05:10:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:32] [INFO ] [Nat]Absence check using state equation in 548 ms returned sat
[2023-03-09 05:10:32] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 138 ms.
[2023-03-09 05:10:45] [INFO ] Deduced a trap composed of 94 places in 464 ms of which 2 ms to minimize.
[2023-03-09 05:10:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 626 ms
[2023-03-09 05:10:45] [INFO ] Added : 459 causal constraints over 92 iterations in 12837 ms. Result :sat
Minimization took 493 ms.
[2023-03-09 05:10:46] [INFO ] [Real]Absence check using 42 positive place invariants in 29 ms returned sat
[2023-03-09 05:10:46] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 58 ms returned sat
[2023-03-09 05:10:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:46] [INFO ] [Real]Absence check using state equation in 540 ms returned sat
[2023-03-09 05:10:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:10:47] [INFO ] [Nat]Absence check using 42 positive place invariants in 31 ms returned sat
[2023-03-09 05:10:47] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 97 ms returned sat
[2023-03-09 05:10:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:54] [INFO ] [Nat]Absence check using state equation in 7066 ms returned unknown
[2023-03-09 05:10:54] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2023-03-09 05:10:54] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 29 ms returned sat
[2023-03-09 05:10:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:55] [INFO ] [Real]Absence check using state equation in 485 ms returned sat
[2023-03-09 05:10:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:10:55] [INFO ] [Nat]Absence check using 42 positive place invariants in 13 ms returned sat
[2023-03-09 05:10:55] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 43 ms returned sat
[2023-03-09 05:10:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:10:55] [INFO ] [Nat]Absence check using state equation in 535 ms returned sat
[2023-03-09 05:10:56] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 109 ms.
[2023-03-09 05:11:07] [INFO ] Deduced a trap composed of 26 places in 181 ms of which 11 ms to minimize.
[2023-03-09 05:11:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 383 ms
[2023-03-09 05:11:07] [INFO ] Added : 470 causal constraints over 94 iterations in 11838 ms. Result :sat
Minimization took 582 ms.
[2023-03-09 05:11:08] [INFO ] [Real]Absence check using 42 positive place invariants in 11 ms returned sat
[2023-03-09 05:11:08] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 61 ms returned sat
[2023-03-09 05:11:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:09] [INFO ] [Real]Absence check using state equation in 445 ms returned sat
[2023-03-09 05:11:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:11:09] [INFO ] [Nat]Absence check using 42 positive place invariants in 30 ms returned sat
[2023-03-09 05:11:09] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 47 ms returned sat
[2023-03-09 05:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:09] [INFO ] [Nat]Absence check using state equation in 463 ms returned sat
[2023-03-09 05:11:10] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 122 ms.
[2023-03-09 05:11:24] [INFO ] Added : 496 causal constraints over 100 iterations in 14349 ms. Result :sat
Minimization took 405 ms.
[2023-03-09 05:11:24] [INFO ] [Real]Absence check using 42 positive place invariants in 13 ms returned sat
[2023-03-09 05:11:25] [INFO ] [Real]Absence check using 42 positive and 123 generalized place invariants in 68 ms returned sat
[2023-03-09 05:11:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:25] [INFO ] [Real]Absence check using state equation in 519 ms returned sat
[2023-03-09 05:11:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:11:25] [INFO ] [Nat]Absence check using 42 positive place invariants in 14 ms returned sat
[2023-03-09 05:11:25] [INFO ] [Nat]Absence check using 42 positive and 123 generalized place invariants in 53 ms returned sat
[2023-03-09 05:11:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:26] [INFO ] [Nat]Absence check using state equation in 957 ms returned sat
[2023-03-09 05:11:27] [INFO ] Computed and/alt/rep : 625/2366/625 causal constraints (skipped 903 transitions) in 142 ms.
[2023-03-09 05:11:39] [INFO ] Added : 486 causal constraints over 98 iterations in 12366 ms. Result :sat
Minimization took 483 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
Support contains 5 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1562/1562 transitions.
Applied a total of 0 rules in 32 ms. Remains 933 /933 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 933/933 places, 1562/1562 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 1562/1562 transitions.
Applied a total of 0 rules in 29 ms. Remains 933 /933 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2023-03-09 05:11:42] [INFO ] Invariant cache hit.
[2023-03-09 05:11:43] [INFO ] Implicit Places using invariants in 888 ms returned [0, 18, 19, 21, 31, 49, 67, 143, 157, 158, 178, 196, 215, 264, 269, 270, 281, 282, 283, 301, 319, 388, 392, 393, 404, 405, 406, 424, 442, 511, 515, 516, 527, 528, 529, 547, 565, 600, 637, 641, 642, 653, 654, 655, 673, 691, 760, 764, 765, 768, 779, 780, 781, 799, 801, 804, 822, 823, 824, 825, 837, 843, 849, 855, 861, 867, 873, 879, 885, 891, 897]
Discarding 71 places :
Implicit Place search using SMT only with invariants took 893 ms to find 71 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 862/933 places, 1562/1562 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 862 transition count 1452
Reduce places removed 110 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 112 rules applied. Total rules applied 222 place count 752 transition count 1450
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 224 place count 750 transition count 1450
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 224 place count 750 transition count 1418
Deduced a syphon composed of 32 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 65 rules applied. Total rules applied 289 place count 717 transition count 1418
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 3 with 12 rules applied. Total rules applied 301 place count 713 transition count 1410
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 309 place count 705 transition count 1410
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 324 place count 690 transition count 1395
Iterating global reduction 5 with 15 rules applied. Total rules applied 339 place count 690 transition count 1395
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 342 place count 690 transition count 1392
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 342 place count 690 transition count 1391
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 344 place count 689 transition count 1391
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 347 place count 686 transition count 1388
Iterating global reduction 6 with 3 rules applied. Total rules applied 350 place count 686 transition count 1388
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 351 place count 685 transition count 1387
Iterating global reduction 6 with 1 rules applied. Total rules applied 352 place count 685 transition count 1387
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 353 place count 684 transition count 1386
Iterating global reduction 6 with 1 rules applied. Total rules applied 354 place count 684 transition count 1386
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 1 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 6 with 112 rules applied. Total rules applied 466 place count 628 transition count 1330
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 470 place count 628 transition count 1326
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 474 place count 624 transition count 1321
Iterating global reduction 7 with 4 rules applied. Total rules applied 478 place count 624 transition count 1321
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 481 place count 624 transition count 1318
Free-agglomeration rule applied 1 times.
Iterating global reduction 8 with 1 rules applied. Total rules applied 482 place count 624 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 483 place count 623 transition count 1317
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 9 with 15 rules applied. Total rules applied 498 place count 623 transition count 1302
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 9 with 16 rules applied. Total rules applied 514 place count 607 transition count 1302
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 515 place count 607 transition count 1301
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 10 with 18 rules applied. Total rules applied 533 place count 607 transition count 1301
Applied a total of 533 rules in 272 ms. Remains 607 /862 variables (removed 255) and now considering 1301/1562 (removed 261) transitions.
// Phase 1: matrix 1301 rows 607 cols
[2023-03-09 05:11:43] [INFO ] Computed 88 place invariants in 9 ms
[2023-03-09 05:11:44] [INFO ] Implicit Places using invariants in 450 ms returned [88, 94, 97, 99, 103, 110, 111, 186, 192, 195, 197, 202, 203, 272, 278, 281, 283, 289, 290, 342, 359, 365, 368, 370, 375, 376, 428, 447, 453, 456, 458, 463, 464, 516, 533, 539, 542, 544]
Discarding 38 places :
Implicit Place search using SMT only with invariants took 451 ms to find 38 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 569/933 places, 1301/1562 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 550 transition count 1282
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 550 transition count 1282
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 44 place count 544 transition count 1276
Iterating global reduction 0 with 6 rules applied. Total rules applied 50 place count 544 transition count 1276
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 68 place count 535 transition count 1267
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 86 place count 535 transition count 1249
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 104 place count 517 transition count 1249
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 107 place count 517 transition count 1246
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 110 place count 514 transition count 1246
Applied a total of 110 rules in 93 ms. Remains 514 /569 variables (removed 55) and now considering 1246/1301 (removed 55) transitions.
// Phase 1: matrix 1246 rows 514 cols
[2023-03-09 05:11:44] [INFO ] Computed 50 place invariants in 26 ms
[2023-03-09 05:11:44] [INFO ] Implicit Places using invariants in 411 ms returned []
[2023-03-09 05:11:44] [INFO ] Invariant cache hit.
[2023-03-09 05:11:45] [INFO ] Implicit Places using invariants and state equation in 1239 ms returned []
Implicit Place search using SMT with State Equation took 1673 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 514/933 places, 1246/1562 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3412 ms. Remains : 514/933 places, 1246/1562 transitions.
Successfully produced net in file /tmp/petri1000_15775939965316725506.dot
Successfully produced net in file /tmp/petri1001_13586006678990744301.dot
Successfully produced net in file /tmp/petri1002_7552096991539703966.dot
Successfully produced net in file /tmp/petri1003_6119389697336734007.dot
Successfully produced net in file /tmp/petri1004_14615588533598477509.dot
Successfully produced net in file /tmp/petri1005_7333350828559157054.dot
Drop transitions removed 6 transitions
Dominated transitions for bounds rules discarded 6 transitions
// Phase 1: matrix 1240 rows 514 cols
[2023-03-09 05:11:46] [INFO ] Computed 50 place invariants in 36 ms
Incomplete random walk after 1000000 steps, including 17790 resets, run finished after 2144 ms. (steps per millisecond=466 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4009 resets, run finished after 888 ms. (steps per millisecond=1126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3972 resets, run finished after 726 ms. (steps per millisecond=1377 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3978 resets, run finished after 738 ms. (steps per millisecond=1355 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000001 steps, including 4019 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3994 resets, run finished after 863 ms. (steps per millisecond=1158 ) properties (out of 5) seen :0
[2023-03-09 05:11:52] [INFO ] Invariant cache hit.
[2023-03-09 05:11:52] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-03-09 05:11:52] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 11 ms returned sat
[2023-03-09 05:11:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:52] [INFO ] [Real]Absence check using state equation in 419 ms returned sat
[2023-03-09 05:11:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:11:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-03-09 05:11:52] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 16 ms returned sat
[2023-03-09 05:11:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:53] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-09 05:11:53] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 89 ms.
[2023-03-09 05:11:54] [INFO ] Added : 23 causal constraints over 5 iterations in 811 ms. Result :sat
Minimization took 318 ms.
[2023-03-09 05:11:54] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-09 05:11:54] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 40 ms returned sat
[2023-03-09 05:11:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:54] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2023-03-09 05:11:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:11:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 39 ms returned sat
[2023-03-09 05:11:55] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 46 ms returned sat
[2023-03-09 05:11:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:55] [INFO ] [Nat]Absence check using state equation in 255 ms returned sat
[2023-03-09 05:11:55] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 68 ms.
[2023-03-09 05:11:56] [INFO ] Added : 60 causal constraints over 12 iterations in 1016 ms. Result :sat
Minimization took 224 ms.
[2023-03-09 05:11:56] [INFO ] [Real]Absence check using 13 positive place invariants in 38 ms returned sat
[2023-03-09 05:11:56] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 40 ms returned sat
[2023-03-09 05:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:57] [INFO ] [Real]Absence check using state equation in 233 ms returned sat
[2023-03-09 05:11:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:11:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 18 ms returned sat
[2023-03-09 05:11:57] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 42 ms returned sat
[2023-03-09 05:11:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:11:57] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2023-03-09 05:11:57] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 68 ms.
[2023-03-09 05:11:59] [INFO ] Deduced a trap composed of 33 places in 323 ms of which 14 ms to minimize.
[2023-03-09 05:11:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 610 ms
[2023-03-09 05:12:00] [INFO ] Added : 75 causal constraints over 15 iterations in 2232 ms. Result :sat
Minimization took 270 ms.
[2023-03-09 05:12:00] [INFO ] [Real]Absence check using 13 positive place invariants in 21 ms returned sat
[2023-03-09 05:12:00] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 11 ms returned sat
[2023-03-09 05:12:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:00] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2023-03-09 05:12:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:12:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-09 05:12:00] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 76 ms returned sat
[2023-03-09 05:12:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:01] [INFO ] [Nat]Absence check using state equation in 238 ms returned sat
[2023-03-09 05:12:01] [INFO ] Deduced a trap composed of 13 places in 135 ms of which 33 ms to minimize.
[2023-03-09 05:12:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2023-03-09 05:12:01] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 61 ms.
[2023-03-09 05:12:02] [INFO ] Added : 31 causal constraints over 7 iterations in 943 ms. Result :sat
Minimization took 158 ms.
[2023-03-09 05:12:02] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-09 05:12:02] [INFO ] [Real]Absence check using 13 positive and 37 generalized place invariants in 8 ms returned sat
[2023-03-09 05:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:03] [INFO ] [Real]Absence check using state equation in 377 ms returned sat
[2023-03-09 05:12:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:12:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-09 05:12:03] [INFO ] [Nat]Absence check using 13 positive and 37 generalized place invariants in 25 ms returned sat
[2023-03-09 05:12:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:03] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2023-03-09 05:12:03] [INFO ] Computed and/alt/rep : 288/1296/288 causal constraints (skipped 922 transitions) in 105 ms.
[2023-03-09 05:12:05] [INFO ] Added : 57 causal constraints over 12 iterations in 1610 ms. Result :sat
Minimization took 266 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0]
FORMULA ASLink-PT-06a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA ASLink-PT-06a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 1240/1240 transitions.
Graph (complete) has 3034 edges and 514 vertex of which 508 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 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 508 transition count 1239
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 506 transition count 1239
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 506 transition count 1238
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 505 transition count 1238
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 503 transition count 1232
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 503 transition count 1232
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 503 transition count 1230
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 502 transition count 1229
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 15 place count 502 transition count 1228
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 21 place count 502 transition count 1228
Applied a total of 21 rules in 69 ms. Remains 502 /514 variables (removed 12) and now considering 1228/1240 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 502/514 places, 1228/1240 transitions.
// Phase 1: matrix 1228 rows 502 cols
[2023-03-09 05:12:06] [INFO ] Computed 49 place invariants in 22 ms
Incomplete random walk after 1000000 steps, including 17883 resets, run finished after 2161 ms. (steps per millisecond=462 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 4023 resets, run finished after 786 ms. (steps per millisecond=1272 ) properties (out of 1) seen :0
[2023-03-09 05:12:09] [INFO ] Invariant cache hit.
[2023-03-09 05:12:09] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-09 05:12:09] [INFO ] [Real]Absence check using 14 positive and 35 generalized place invariants in 18 ms returned sat
[2023-03-09 05:12:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:10] [INFO ] [Real]Absence check using state equation in 294 ms returned sat
[2023-03-09 05:12:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:12:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-09 05:12:10] [INFO ] [Nat]Absence check using 14 positive and 35 generalized place invariants in 11 ms returned sat
[2023-03-09 05:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:10] [INFO ] [Nat]Absence check using state equation in 276 ms returned sat
[2023-03-09 05:12:10] [INFO ] Computed and/alt/rep : 295/1409/295 causal constraints (skipped 903 transitions) in 57 ms.
[2023-03-09 05:12:11] [INFO ] Added : 63 causal constraints over 13 iterations in 1192 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 502 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1228/1228 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 502/502 places, 1228/1228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 502/502 places, 1228/1228 transitions.
Applied a total of 0 rules in 15 ms. Remains 502 /502 variables (removed 0) and now considering 1228/1228 (removed 0) transitions.
[2023-03-09 05:12:12] [INFO ] Invariant cache hit.
[2023-03-09 05:12:12] [INFO ] Implicit Places using invariants in 385 ms returned [71, 87, 92, 218]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 386 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 498/502 places, 1228/1228 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 498 transition count 1224
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 494 transition count 1224
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 16 place count 490 transition count 1220
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 19 place count 490 transition count 1217
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 22 place count 487 transition count 1217
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 23 place count 487 transition count 1217
Applied a total of 23 rules in 58 ms. Remains 487 /498 variables (removed 11) and now considering 1217/1228 (removed 11) transitions.
// Phase 1: matrix 1217 rows 487 cols
[2023-03-09 05:12:12] [INFO ] Computed 45 place invariants in 10 ms
[2023-03-09 05:12:13] [INFO ] Implicit Places using invariants in 298 ms returned []
[2023-03-09 05:12:13] [INFO ] Invariant cache hit.
[2023-03-09 05:12:14] [INFO ] Implicit Places using invariants and state equation in 1043 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 487/502 places, 1217/1228 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1813 ms. Remains : 487/502 places, 1217/1228 transitions.
[2023-03-09 05:12:14] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17745 resets, run finished after 2032 ms. (steps per millisecond=492 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 3976 resets, run finished after 709 ms. (steps per millisecond=1410 ) properties (out of 1) seen :0
[2023-03-09 05:12:16] [INFO ] Invariant cache hit.
[2023-03-09 05:12:17] [INFO ] [Real]Absence check using 11 positive place invariants in 52 ms returned sat
[2023-03-09 05:12:17] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 13 ms returned sat
[2023-03-09 05:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:17] [INFO ] [Real]Absence check using state equation in 253 ms returned sat
[2023-03-09 05:12:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:12:17] [INFO ] [Nat]Absence check using 11 positive place invariants in 61 ms returned sat
[2023-03-09 05:12:17] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 25 ms returned sat
[2023-03-09 05:12:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:17] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2023-03-09 05:12:17] [INFO ] Computed and/alt/rep : 264/1168/264 causal constraints (skipped 923 transitions) in 65 ms.
[2023-03-09 05:12:18] [INFO ] Added : 21 causal constraints over 5 iterations in 627 ms. Result :sat
Minimization took 110 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 15 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 487/487 places, 1217/1217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 14 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
[2023-03-09 05:12:18] [INFO ] Invariant cache hit.
[2023-03-09 05:12:19] [INFO ] Implicit Places using invariants in 335 ms returned []
[2023-03-09 05:12:19] [INFO ] Invariant cache hit.
[2023-03-09 05:12:20] [INFO ] Implicit Places using invariants and state equation in 1258 ms returned []
Implicit Place search using SMT with State Equation took 1596 ms to find 0 implicit places.
[2023-03-09 05:12:20] [INFO ] Redundant transitions in 114 ms returned []
[2023-03-09 05:12:20] [INFO ] Invariant cache hit.
[2023-03-09 05:12:21] [INFO ] Dead Transitions using invariants and state equation in 502 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2260 ms. Remains : 487/487 places, 1217/1217 transitions.
Starting property specific reduction for ASLink-PT-06a-UpperBounds-13
[2023-03-09 05:12:21] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 192 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-09 05:12:21] [INFO ] Invariant cache hit.
[2023-03-09 05:12:21] [INFO ] [Real]Absence check using 11 positive place invariants in 28 ms returned sat
[2023-03-09 05:12:21] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 54 ms returned sat
[2023-03-09 05:12:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:21] [INFO ] [Real]Absence check using state equation in 375 ms returned sat
[2023-03-09 05:12:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:12:21] [INFO ] [Nat]Absence check using 11 positive place invariants in 35 ms returned sat
[2023-03-09 05:12:21] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 10 ms returned sat
[2023-03-09 05:12:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:22] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2023-03-09 05:12:22] [INFO ] Computed and/alt/rep : 264/1168/264 causal constraints (skipped 923 transitions) in 58 ms.
[2023-03-09 05:12:22] [INFO ] Added : 21 causal constraints over 5 iterations in 562 ms. Result :sat
Minimization took 94 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 16 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 487/487 places, 1217/1217 transitions.
[2023-03-09 05:12:22] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 17888 resets, run finished after 1921 ms. (steps per millisecond=520 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 3976 resets, run finished after 688 ms. (steps per millisecond=1453 ) properties (out of 1) seen :0
[2023-03-09 05:12:25] [INFO ] Invariant cache hit.
[2023-03-09 05:12:25] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-09 05:12:25] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 29 ms returned sat
[2023-03-09 05:12:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:26] [INFO ] [Real]Absence check using state equation in 333 ms returned sat
[2023-03-09 05:12:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 05:12:26] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-09 05:12:26] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 13 ms returned sat
[2023-03-09 05:12:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 05:12:26] [INFO ] [Nat]Absence check using state equation in 289 ms returned sat
[2023-03-09 05:12:26] [INFO ] Computed and/alt/rep : 264/1168/264 causal constraints (skipped 923 transitions) in 54 ms.
[2023-03-09 05:12:26] [INFO ] Added : 21 causal constraints over 5 iterations in 446 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [3] Max seen :[0]
Support contains 1 out of 487 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 20 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 487/487 places, 1217/1217 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 487/487 places, 1217/1217 transitions.
Applied a total of 0 rules in 18 ms. Remains 487 /487 variables (removed 0) and now considering 1217/1217 (removed 0) transitions.
[2023-03-09 05:12:27] [INFO ] Invariant cache hit.
[2023-03-09 05:12:27] [INFO ] Implicit Places using invariants in 273 ms returned []
[2023-03-09 05:12:27] [INFO ] Invariant cache hit.
[2023-03-09 05:12:28] [INFO ] Implicit Places using invariants and state equation in 968 ms returned []
Implicit Place search using SMT with State Equation took 1251 ms to find 0 implicit places.
[2023-03-09 05:12:28] [INFO ] Redundant transitions in 44 ms returned []
[2023-03-09 05:12:28] [INFO ] Invariant cache hit.
[2023-03-09 05:12:28] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1807 ms. Remains : 487/487 places, 1217/1217 transitions.
Ending property specific reduction for ASLink-PT-06a-UpperBounds-13 in 7867 ms.
[2023-03-09 05:12:29] [INFO ] Flatten gal took : 113 ms
[2023-03-09 05:12:29] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 1 ms.
[2023-03-09 05:12:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 487 places, 1217 transitions and 4973 arcs took 5 ms.
Total runtime 179320 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ASLink-PT-06a
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/380
Upper Bounds
FORMULA ASLink-PT-06a-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678338749796
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/380/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/380/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/380/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 5 (type EXCL) for 0 ASLink-PT-06a-UpperBounds-13
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ASLink-PT-06a-UpperBounds-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ASLink-PT-06a-UpperBounds-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 5 (type EXCL) for ASLink-PT-06a-UpperBounds-13
lola: markings : 139
lola: fired transitions : 138
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ASLink-PT-06a-UpperBounds-13 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ASLink-PT-06a-UpperBounds-13 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ASLink-PT-06a-UpperBounds-13: BOUND 1 state space
Time elapsed: 0 secs. Pages in use: 1
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-06a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is ASLink-PT-06a, 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-oct2-167813595000093"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06a.tgz
mv ASLink-PT-06a 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 '
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 ;